1 citations · 1 across the 4 of their papers we have counts for
4 papers
Efficient Distributed Workload (Re-)Embedding
Monika Henzinger, Stefan Neumann, Stefan Schmid
Modern networked systems are increasingly reconfigurable, enabling demand-aware infrastructures whose resources can be adjusted according to the workload they currently serve. Such…
New Amortized Cell-Probe Lower Bounds for Dynamic Problems
Sayan Bhattacharya, Monika Henzinger, Stefan Neumann
We build upon the recent papers by Weinstein and Yu (FOCS'16), Larsen (FOCS'12), and Clifford et al. (FOCS'15) to present a general framework that gives amortized lower bounds on t…
Incremental and Fully Dynamic Subgraph Connectivity For Emergency Planning
Monika Henzinger, Stefan Neumann
During the last 10 years it has become popular to study dynamic graph problems in a emergency planning or sensitivity setting: Instead of considering the general fully dynamic prob…
What You Will Gain By Rounding: Theory and Algorithms for Rounding Rank
Stefan Neumann, Rainer Gemulla, Pauli Miettinen
When factorizing binary matrices, we often have to make a choice between using expensive combinatorial methods that retain the discrete nature of the data and using continuous meth…