activity
20112023
most citedAlgebraic Methods in the Congested Clique

92 citations · 220 across the 35 of their papers we have counts for

collaborators

45 papers

cs.DC2023★ 1 cited

Robust Routing Made Easy: Reinforcing Networks Against Non-Benign Faults

Christoph Lenzen, Moti Medina, Mehrdad Saberi +1

With the increasing scale of communication networks, the likelihood of failures grows as well. Since these networks form a critical backbone of our digital society, it is important…

cs.DC2022

On Specifications and Proofs of Timed Circuits

Matthias Fuegger, Christoph Lenzen, Ulrich Schmid

Given a discrete-state continuous-time reactive system, like a digital circuit, the classical approach is to first model it as a state transition system and then prove its properti…

cs.NI2022★ 3 cited

G-SINC: Global Synchronization Infrastructure for Network Clocks

Marc Frei, Jonghoon Kwon, Seyedali Tabaeiaghdaei +3

Many critical computing applications rely on secure and dependable time which is reliably synchronized across large distributed systems. Today's time synchronization architectures…

cs.DC2022

Optimal Clock Synchronization with Signatures

Christoph Lenzen, Julian Loss

Cryptographic signatures can be used to increase the resilience of distributed systems against adversarial attacks, by increasing the number of faulty parties that can be tolerated…

cs.DC2021

Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts

Ioannis Anagnostides, Christoph Lenzen, Bernhard Haeupler +2

In this paper, we refine the (almost) \emph{existentially optimal} distributed Laplacian solver recently developed by Forster, Goranci, Liu, Peng, Sun, and Ye (FOCS `21) into an (a…

cs.AR2020★ 1 cited

Synchronizer-Free Digital Link Controller

Johannes Bund, Matthias Függer, Christoph Lenzen +1

This work presents a producer-consumer link between two independent clock domains. The link allows for metastability-free, low-latency, high-throughput communication by slight adju…