@misc{16849,
author = {{Müller, Michelle}},
title = {{{Regiert Geld die AirBnb-Welt? Eine ökonometrische Analyse der Preisreaktionen von sozial- und finanziell motivierten AirBnb-Gastgebern auf politische Restriktionen}}},
year = {{2020}},
}
@inproceedings{16852,
author = {{Groth, Stefan and Grünewald, Daniel and Teich, Jürgen and Hannig, Frank}},
booktitle = {{Proceedings of the 17th ACM International Conference on Computing Frontiers (CF '2020)}},
location = {{Catania, Sicily, Italy}},
publisher = {{ACM}},
title = {{{A Runtime System for Finite Element Methods in a Partitioned Global Address Space}}},
doi = {{10.1145/3387902.3392628}},
year = {{2020}},
}
@article{16862,
author = {{Bohn, Nicolai and Kundisch, Dennis}},
journal = {{Information & Management}},
number = {{6}},
title = {{{What Are We Talking About When We Talk About Technology Pivots? – A Delphi Study}}},
volume = {{57}},
year = {{2020}},
}
@article{16873,
author = {{Peitz, Christian and Feng, Yuanhua and Gilroy, Bernard Michael and Stöckmann, Nico}},
journal = {{Asian Economic and Financial Review}},
number = {{4}},
pages = {{427--438}},
publisher = {{Asian Economic and Social Society}},
title = {{{The Shanghai-Hong Kong Stock Connect: An Application of the Semi-CGARCH and Semi-EGARCH}}},
volume = {{10}},
year = {{2020}},
}
@article{16879,
author = {{Gilroy, Bernard Michael and Peitz, Christian}},
journal = {{WISU – Das Wirtschaftsstudium}},
number = {{1}},
pages = {{94}},
title = {{{Die Niedrigzinspolitik der Europäischen Zentralbank}}},
year = {{2020}},
}
@inproceedings{16898,
abstract = {{Electronic structure calculations based on density-functional theory (DFT)
represent a significant part of today's HPC workloads and pose high demands on
high-performance computing resources. To perform these quantum-mechanical DFT
calculations on complex large-scale systems, so-called linear scaling methods
instead of conventional cubic scaling methods are required. In this work, we
take up the idea of the submatrix method and apply it to the DFT computations
in the software package CP2K. For that purpose, we transform the underlying
numeric operations on distributed, large, sparse matrices into computations on
local, much smaller and nearly dense matrices. This allows us to exploit the
full floating-point performance of modern CPUs and to make use of dedicated
accelerator hardware, where performance has been limited by memory bandwidth
before. We demonstrate both functionality and performance of our implementation
and show how it can be accelerated with GPUs and FPGAs.}},
author = {{Lass, Michael and Schade, Robert and Kühne, Thomas and Plessl, Christian}},
booktitle = {{Proc. International Conference for High Performance Computing, Networking, Storage and Analysis (SC)}},
location = {{Atlanta, GA, US}},
pages = {{1127--1140}},
publisher = {{IEEE Computer Society}},
title = {{{A Submatrix-Based Method for Approximate Matrix Function Evaluation in the Quantum Chemistry Code CP2K}}},
doi = {{10.1109/SC41405.2020.00084}},
year = {{2020}},
}
@article{16902,
abstract = {{The maintenance of efficient and robust overlay networks is one
of the most fundamental and reoccurring themes in networking.
This paper presents a survey of state-of-the-art
algorithms to design and repair overlay networks in a distributed
manner. In particular, we discuss basic algorithmic primitives
to preserve connectivity, review algorithms for the fundamental
problem of graph linearization, and then survey self-stabilizing
algorithms for metric and scalable topologies.
We also identify open problems and avenues for future research.
}},
author = {{Feldmann, Michael and Scheideler, Christian and Schmid, Stefan}},
journal = {{ACM Computing Surveys}},
publisher = {{ACM}},
title = {{{Survey on Algorithms for Self-Stabilizing Overlay Networks}}},
doi = {{10.1145/3397190}},
year = {{2020}},
}
@inproceedings{16903,
abstract = {{We consider the clock synchronization problem in the (discrete) beeping model: Given a network of $n$ nodes with each node having a clock value $\delta(v) \in \{0,\ldots T-1\}$, the goal is to synchronize the clock values of all nodes such that they have the same value in any round.
As is standard in clock synchronization, we assume \emph{arbitrary activations} for all nodes, i.e., the nodes start their protocol at an arbitrary round (not limited to $\{0,\ldots,T-1\}$).
We give an asymptotically optimal algorithm that runs in $4D + \Bigl\lfloor \frac{D}{\lfloor T/4 \rfloor} \Bigr \rfloor \cdot (T \mod 4) = O(D)$ rounds, where $D$ is the diameter of the network.
Once all nodes are in sync, they beep at the same round every $T$ rounds.
The algorithm drastically improves on the $O(T D)$-bound of \cite{firefly_sync} (where $T$ is required to be at least $4n$, so the bound is no better than $O(nD)$).
Our algorithm is very simple as nodes only have to maintain $3$ bits in addition to the $\lceil \log T \rceil$ bits needed to maintain the clock.
Furthermore we investigate the complexity of \emph{self-stabilizing} solutions for the clock synchronization problem: We first show lower bounds of $\Omega(\max\{T,n\})$ rounds on the runtime and $\Omega(\log(\max\{T,n\}))$ bits of memory required for any such protocol.
Afterwards we present a protocol that runs in $O(\max\{T,n\})$ rounds using at most $O(\log(\max\{T,n\}))$ bits at each node, which is asymptotically optimal with regards to both, runtime and memory requirements.}},
author = {{Feldmann, Michael and Khazraei, Ardalan and Scheideler, Christian}},
booktitle = {{Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}},
publisher = {{ACM}},
title = {{{Time- and Space-Optimal Discrete Clock Synchronization in the Beeping Model}}},
doi = {{10.1145/3350755.3400246}},
year = {{2020}},
}
@phdthesis{16910,
author = {{Stroh-Maraun, Nadja}},
publisher = {{Universität Paderborn}},
title = {{{Mechanisms, Preferences, and Heterogeneity in Matching Markets}}},
doi = {{10.17619/UNIPB/1-958}},
year = {{2020}},
}
@article{16927,
author = {{Gharibian, Sevag and Aldi, Marco and de Beaudrap, Niel and Saeedi, Seyran}},
journal = {{Communications in Mathematical Physics}},
title = {{{On efficiently solvable cases of Quantum k-SAT}}},
year = {{2020}},
}