92 citations · 220 across the 35 of their papers we have counts for
5 papers · 1 filter
Optimal Metastability-Containing Sorting via Parallel Prefix Computation
Johannes Bund, Christoph Lenzen, Moti Medina
Friedrichs et al. (TC 2018) showed that metastability can be contained when sorting inputs arising from time-to-digital converters, i.e., measurement values can be correctly sorted…
Low Diameter Graph Decompositions by Approximate Distance Computation
Ruben Becker, Yuval Emek, Christoph Lenzen
In many models for large-scale computation, decomposition of the problem is key to efficient algorithms. For distance-related graph problems, it is often crucial that such a decomp…
Parallel Balanced Allocations: The Heavily Loaded Case
Christoph Lenzen, Merav Parter, Eylon Yogev
We study parallel algorithms for the classical balls-into-bins problem, in which balls acting in parallel as separate agents are placed into bins. Algorithms operate in syn…
Locality of not-so-weak coloring
Alkida Balliu, Juho Hirvonen, Christoph Lenzen +2
Many graph problems are locally checkable: a solution is globally feasible if it looks valid in all constant-radius neighborhoods. This idea is formalized in the concept of locally…
Fault Tolerant Gradient Clock Synchronization
Johannes Bund, Christoph Lenzen, Will Rosenbaum
Synchronizing clocks in distributed systems is well-understood, both in terms of fault-tolerance in fully connected systems and the dependence of local and global worst-case skews…