activity
20112023
most citedAlgebraic Methods in the Congested Clique

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

collaborators
Showing 2016Show all

5 papers · 1 filter

cs.DC2016

Self-stabilizing Byzantine Clock Synchronization with Optimal Precision

Pankaj Khanchandani, Christoph Lenzen

We revisit the approach to Byzantine fault-tolerant clock synchronization based on approximate agreement introduced by Lynch and Welch. Our contribution is threefold: (1) We provid…

cs.DC2016★ 1 cited

Near-Optimal Self-Stabilising Counting and Firing Squads

Christoph Lenzen, Joel Rybicki

Consider a fully-connected synchronous distributed system consisting of nodes, where up to nodes may be faulty and every node starts in an arbitrary initial state. In the s…

cs.DS2016★ 16 cited

Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models

Ruben Becker, Sebastian Forster, Andreas Karrenbauer +1

We present a method for solving the transshipment problem - also known as uncapacitated minimum cost flow - up to a multiplicative error of in undirected graphs w…

cs.DC2016★ 3 cited

CLEX: Yet Another Supercomputer Architecture?

Christoph Lenzen, Roger Wattenhofer

We propose the CLEX supercomputer topology and routing scheme. We prove that CLEX can utilize a constant fraction of the total bandwidth for point-to-point communication, at delays…

cs.DC2016

Metastability-Containing Circuits

Stephan Friedrichs, Matthias Függer, Christoph Lenzen

In digital circuits, metastability can cause deteriorated signals that neither are logical 0 or logical 1, breaking the abstraction of Boolean logic. Unfortunately, any way of read…