TY - GEN
AU - Müller, Michelle
ID - 16849
TI - Regiert Geld die AirBnb-Welt? Eine ökonometrische Analyse der Preisreaktionen von sozial- und finanziell motivierten AirBnb-Gastgebern auf politische Restriktionen
ER -
TY - CONF
AU - Groth, Stefan
AU - Grünewald, Daniel
AU - Teich, Jürgen
AU - Hannig, Frank
ID - 16852
T2 - Proceedings of the 17th ACM International Conference on Computing Frontiers (CF '2020)
TI - A Runtime System for Finite Element Methods in a Partitioned Global Address Space
ER -
TY - JOUR
AU - Bohn, Nicolai
AU - Kundisch, Dennis
ID - 16862
IS - 6
JF - Information & Management
TI - What Are We Talking About When We Talk About Technology Pivots? – A Delphi Study
VL - 57
ER -
TY - JOUR
AU - Peitz, Christian
AU - Feng, Yuanhua
AU - Gilroy, Bernard Michael
AU - Stöckmann, Nico
ID - 16873
IS - 4
JF - Asian Economic and Financial Review
TI - The Shanghai-Hong Kong Stock Connect: An Application of the Semi-CGARCH and Semi-EGARCH
VL - 10
ER -
TY - JOUR
AU - Gilroy, Bernard Michael
AU - Peitz, Christian
ID - 16879
IS - 1
JF - WISU – Das Wirtschaftsstudium
TI - Die Niedrigzinspolitik der Europäischen Zentralbank
ER -
TY - CONF
AB - 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.
AU - Lass, Michael
AU - Schade, Robert
AU - Kühne, Thomas
AU - Plessl, Christian
ID - 16898
T2 - Proc. International Conference for High Performance Computing, Networking, Storage and Analysis (SC)
TI - A Submatrix-Based Method for Approximate Matrix Function Evaluation in the Quantum Chemistry Code CP2K
ER -
TY - JOUR
AB - 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.
AU - Feldmann, Michael
AU - Scheideler, Christian
AU - Schmid, Stefan
ID - 16902
JF - ACM Computing Surveys
TI - Survey on Algorithms for Self-Stabilizing Overlay Networks
ER -
TY - CONF
AB - 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.
AU - Feldmann, Michael
AU - Khazraei, Ardalan
AU - Scheideler, Christian
ID - 16903
T2 - Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)
TI - Time- and Space-Optimal Discrete Clock Synchronization in the Beeping Model
ER -
TY - THES
AU - Stroh-Maraun, Nadja
ID - 16910
TI - Mechanisms, Preferences, and Heterogeneity in Matching Markets
ER -
TY - JOUR
AU - Gharibian, Sevag
AU - Aldi, Marco
AU - de Beaudrap, Niel
AU - Saeedi, Seyran
ID - 16927
JF - Communications in Mathematical Physics
TI - On efficiently solvable cases of Quantum k-SAT
ER -