Clock Synchronization with Bounded Global and Local Skew. - Christoph Lenzen 001; Thomas Locher; Roger Wattenhofer (FOCS, 2008)

What can be approximated locally?: case study: dominating sets in planar graphs. - Christoph Lenzen 001; Yvonne Anne Oswald; Roger Wattenhofer (SPAA, 2008)

Leveraging Linial's Locality Limit. - Christoph Lenzen 001; Roger Wattenhofer (DISC, 2008)

Local Algorithms: Self-Stabilization on Speed. - Christoph Lenzen 001; Jukka Suomela; Roger Wattenhofer (Algorithmic Methods for Distributed Cooperative Systems, 2009)

Optimal clock synchronization in networks. - Christoph Lenzen 001; Philipp Sommer; Roger Wattenhofer (SenSys, 2009)

A review of PODC 2009. - Keren Censor; Christoph Lenzen 001 (SIGACT News, 2009)

Optimal gradient clock synchronization in dynamic networks. - Fabian Kuhn; Christoph Lenzen 001; Thomas Locher; Rotem Oshman (PODC, 2010)

Brief announcement: exponential speed-up of local algorithms using non-local communication. - Christoph Lenzen 001; Roger Wattenhofer (PODC, 2010)

Clock Synchronization: Open Problems in Theory and Practice. - Christoph Lenzen 001; Thomas Locher; Philipp Sommer; Roger Wattenhofer (SOFSEM, 2010)

Minimum Dominating Set Approximation in Graphs of Bounded Arboricity. - Christoph Lenzen 001; Roger Wattenhofer (DISC, 2010)

Tight bounds for clock synchronization. - Christoph Lenzen 001; Thomas Locher; Roger Wattenhofer (J. ACM, 2010)

MIS on trees. - Christoph Lenzen 001; Roger Wattenhofer (PODC, 2011)

Fault-Tolerant Algorithms for Tick-Generation in Asynchronous Logic: Robust Pulse Generation - [Extended Abstract]. - Danny Dolev; Matthias Függer; Christoph Lenzen 001; Ulrich Schmid 001 (SSS, 2011)

Tight bounds for parallel randomized load balancing: extended abstract. - Christoph Lenzen 001; Roger Wattenhofer (STOC, 2011)

Synchronization and symmetry breaking in distributedsystems. - Christoph Lenzen 001 (2011)

"Tri, Tri Again": Finding Triangles and Small Subgraphs in a Distributed Setting - (Extended Abstract). - Danny Dolev; Christoph Lenzen 001; Shir Peled (DISC, 2012)

"Tri, Tri again": Finding Triangles and Small Subgraphs in a Distributed Setting - Danny Dolev; Christoph Lenzen 001; Shir Peled (CoRR, 2012)

FATAL+: A Self-Stabilizing Byzantine Fault-tolerant Clocking Scheme for SoCs - Danny Dolev; Matthias Függer; Christoph Lenzen 001; Markus Posch; Ulrich Schmid 001; Andreas Steininger (CoRR, 2012)

Fast Routing Table Construction Using Small Messages - Christoph Lenzen 001; Boaz Patt-Shamir (CoRR, 2012)

Efficient Construction of Global Time in SoCs Despite Arbitrary Faults. - Christoph Lenzen 001; Matthias Függer; Markus Hofstatter; Ulrich Schmid 001 (DSD, 2013)

Early-deciding consensus is expensive. - Danny Dolev; Christoph Lenzen 001 (PODC, 2013)

Optimal deterministic routing and sorting on the congested clique. - Christoph Lenzen 001 (PODC, 2013)

Efficient distributed source detection with limited bandwidth. - Christoph Lenzen 001; David Peleg (PODC, 2013)

Synchronous Counting and Computational Algorithm Design. - Danny Dolev; Janne H. Korhonen; Christoph Lenzen 001; Joel Rybicki; Jukka Suomela (SSS, 2013)

Fast routing table construction using small messages: extended abstract. - Christoph Lenzen 001; Boaz Patt-Shamir (STOC, 2013)

Node-Initiated Byzantine Consensus Without a Common Clock. - Danny Dolev; Christoph Lenzen 001 (CoRR, 2013)

Distributed minimum dominating set approximations in restricted families of graphs. - Christoph Lenzen 001; Yvonne-Anne Pignolet; Roger Wattenhofer (Distributed Comput., 2013)

Brief announcement: local approximability of minimum dominating set on planar graphs. - Miikka Hilke; Christoph Lenzen 001; Jukka Suomela (PODC, 2014)

Trade-offs between selection complexity and performance when searching the plane without communication. - Christoph Lenzen 001; Nancy A. Lynch; Calvin C. Newport; Tsvetomira Radeva (PODC, 2014)

Improved distributed steiner forest construction. - Christoph Lenzen 001; Boaz Patt-Shamir (PODC, 2014)

Near-Optimal Distributed Tree Embedding. - Mohsen Ghaffari 001; Christoph Lenzen 001 (DISC, 2014)

Local Approximability of Minimum Dominating Set on Planar Graphs. - Miikka Hilke; Christoph Lenzen 001; Jukka Suomela (CoRR, 2014)

Fault-tolerant algorithms for tick-generation in asynchronous logic: Robust pulse generation. - Danny Dolev; Matthias Függer; Ulrich Schmid 001; Christoph Lenzen 001 (J. ACM, 2014)

Rigorously modeling self-stabilizing fault-tolerant circuits: An ultra-robust clocking scheme for systems-on-chip. - Danny Dolev; Matthias Függer; Markus Posch; Ulrich Schmid 001; Andreas Steininger; Christoph Lenzen 001 (J. Comput. Syst. Sci., 2014)

The 1-2-3-Toolkit for Building Your Own Balls-into-Bins Algorithm. - Pierre Bertrand; Christoph Lenzen 001 (ALENEX, 2015)

Near-Optimal Distributed Maximum Flow: Extended Abstract. - Mohsen Ghaffari 001; Andreas Karrenbauer; Fabian Kuhn; Christoph Lenzen 001; Boaz Patt-Shamir (PODC, 2015)

Fast Partial Distance Estimation and Applications. - Christoph Lenzen 001; Boaz Patt-Shamir (PODC, 2015)

Towards Optimal Synchronous Counting. - Christoph Lenzen 001; Joel Rybicki; Jukka Suomela (PODC, 2015)

Efficient Counting with Optimal Resilience. - Christoph Lenzen 001; Joel Rybicki (DISC, 2015)

Fault-tolerant Distributed Systems in Hardware. - Danny Dolev; Matthias Függer; Christoph Lenzen 001; Ulrich Schmid 001; Andreas Steininger (Bull. EATCS, 2015)

PulseSync: An Efficient and Scalable Clock Synchronization Protocol. - Christoph Lenzen 001; Philipp Sommer; Roger Wattenhofer (IEEE/ACM Trans. Netw., 2015)

Efficient Metastability-Containing Gray Code 2-Sort. - Christoph Lenzen 001; Moti Medina (ASYNC, 2016)

Fault-Tolerant Clock Synchronization with High Precision. - Attila Kinali; Florian Huemer; Christoph Lenzen 001 (ISVLSI, 2016)

Approximate Undirected Transshipment and Shortest Paths via Gradient Descent. - Ruben Becker; Andreas Karrenbauer; Sebastian Krinninger; Christoph Lenzen 001 (CoRR, 2016)

CLEX: Yet Another Supercomputer Architecture? - Christoph Lenzen 001; Roger Wattenhofer (CoRR, 2016)

Tight bounds for parallel randomized load balancing. - Christoph Lenzen 001; Roger Wattenhofer (Distributed Comput., 2016)

HEX: Scaling honeycombs is easier than scaling clock trees. - Danny Dolev; Matthias Függer; Christoph Lenzen 001; Martin Perner; Ulrich Schmid 001 (J. Comput. Syst. Sci., 2016)

Synchronous counting and computational algorithm design. - Danny Dolev; Keijo Heljanko; Matti Järvisalo; Janne H. Korhonen; Christoph Lenzen 001; Joel Rybicki; Jukka Suomela; Siert Wieringa (J. Comput. Syst. Sci., 2016)

Metastability-Aware Memory-Efficient Time-to-Digital Converters. - Matthias Függer; Attila Kinali; Christoph Lenzen 001; Thomas Polzer (ASYNC, 2017)

Metastability Tolerant Computing. - Ghaith Tarawneh; Matthias Függer; Christoph Lenzen 001 (ASYNC, 2017)

Near-optimal metastability-containing sorting networks. - Johannes Bund; Christoph Lenzen 001; Moti Medina (DATE, 2017)

Robust Routing Made Easy. - Christoph Lenzen 001; Moti Medina (SSS, 2017)

Brief Announcement: A Centralized Local Algorithm for the Sparse Spanning Graph Problem. - Christoph Lenzen 001; Reut Levi (DISC, 2017)

A Local Algorithm for the Sparse Spanning Graph Problem. - Christoph Lenzen 001; Reut Levi (CoRR, 2017)

Searching without communicating: tradeoffs between performance and selection complexity. - Christoph Lenzen 001; Nancy A. Lynch; Calvin Newport; Tsvetomira Radeva (Distributed Comput., 2017)

Efficient Counting with Optimal Resilience. - Christoph Lenzen 001; Joel Rybicki; Jukka Suomela (SIAM J. Comput., 2017)

Optimal metastability-containing sorting networks. - Johannes Bund; Christoph Lenzen 001; Moti Medina (DATE, 2018)

A Centralized Local Algorithm for the Sparse Spanning Graph Problem. - Christoph Lenzen 001; Reut Levi (ICALP, 2018)

Parallel Metric Tree Embedding Based on an Algebraic View on Moore-Bellman-Ford. - Stephan Friedrichs; Christoph Lenzen 001 (J. ACM, 2018)

Near-Optimal Distributed Maximum Flow. - Mohsen Ghaffari 001; Andreas Karrenbauer; Fabian Kuhn; Christoph Lenzen 001; Boaz Patt-Shamir (SIAM J. Comput., 2018)

Metastability-Containing Circuits. - Stephan Friedrichs; Matthias Függer; Christoph Lenzen 001 (IEEE Trans. Computers, 2018)

Fault Tolerant Gradient Clock Synchronization. - Johannes Bund; Christoph Lenzen 001; Will Rosenbaum (PODC, 2019)

Locality of Not-so-Weak Coloring. - Alkida Balliu; Juho Hirvonen; Christoph Lenzen 001; Dennis Olivetti; Jukka Suomela (SIROCCO, 2019)

Parallel Balanced Allocations: The Heavily Loaded Case. - Christoph Lenzen 001; Merav Parter; Eylon Yogev (SPAA, 2019)

Distributed Algorithms for Low Stretch Spanning Trees. - Ruben Becker; Yuval Emek; Mohsen Ghaffari 001; Christoph Lenzen 001 (DISC, 2019)

Algebraic methods in the congested clique. - Keren Censor-Hillel; Petteri Kaski; Janne H. Korhonen; Christoph Lenzen 001; Ami Paz; Jukka Suomela (Distributed Comput., 2019)

Distributed distance computation and routing with small messages. - Christoph Lenzen 001; Boaz Patt-Shamir; David Peleg (Distributed Comput., 2019)

Near-optimal self-stabilising counting and firing squads. - Christoph Lenzen 001; Joel Rybicki (Distributed Comput., 2019)

On the Complexity of Hazard-free Circuits. - Christian Ikenmeyer; Balagopal Komarath; Christoph Lenzen 001; Vladimir Lysikov; Andrey Mokhov; Karteek Sreenivasaiah (J. ACM, 2019)

Self-Stabilising Byzantine Clock Synchronisation Is Almost as Easy as Consensus. - Christoph Lenzen 001; Joel Rybicki (J. ACM, 2019)

Self-Stabilizing Byzantine Clock Synchronization with Optimal Precision. - Pankaj Khanchandani; Christoph Lenzen 001 (Theory Comput. Syst., 2019)

PALS: Plesiochronous and Locally Synchronous Systems. - Johannes Bund; Matthias Függer; Christoph Lenzen 001; Moti Medina; Will Rosenbaum (ASYNC, 2020)

Low Diameter Graph Decompositions by Approximate Distance Computation. - Ruben Becker; Yuval Emek; Christoph Lenzen 001 (ITCS, 2020)

Brief Announcement: TRIX: Low-Skew Pulse Propagation for Fault-Tolerant Hardware. - Christoph Lenzen 001; Ben Wiederhake (SSS, 2020)

TRIX: Low-Skew Pulse Propagation for Fault-Tolerant Hardware. - Christoph Lenzen 001; Ben Wiederhake (CoRR, 2020)

Fooling views: a new lower bound technique for distributed computations under congestion. - Amir Abboud; Keren Censor-Hillel; Seri Khoury; Christoph Lenzen 001 (Distributed Comput., 2020)

Optimal Metastability-Containing Sorting via Parallel Prefix Computation. - Johannes Bund; Christoph Lenzen 001; Moti Medina (IEEE Trans. Computers, 2020)

Synchronizer-Free Digital Link Controller. - Johannes Bund; Matthias Függer; Christoph Lenzen 001; Moti Medina (IEEE Trans. Circuits Syst., 2020)

Approximate Minimum Directed Spanning Trees Under Congestion. - Christoph Lenzen 001; Hossein Vahidi 001 (SIROCCO, 2021)

A Breezing Proof of the KMW Bound. - Corinna Coupette; Christoph Lenzen 001 (SOSA, 2021)

Accelerated Distributed Laplacian Solvers via Shortcuts. - Ioannis Anagnostides; Themis Gouleakis; Christoph Lenzen 001 (CoRR, 2021)

Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models. - Ruben Becker; Sebastian Forster; Andreas Karrenbauer; Christoph Lenzen 001 (SIAM J. Comput., 2021)

On Specifications and Proofs of Timed Circuits. - Matthias Függer; Christoph Lenzen 001; Ulrich Schmid 001 (Principles of Systems Design, 2022)

A Recursive Early-Stopping Phase King Protocol. - Christoph Lenzen 001; Sahar Sheikholeslami (PODC, 2022)

Brief Announcement: Almost Universally Optimal Distributed Laplacian Solver. - Ioannis Anagnostides; Christoph Lenzen 001; Bernhard Haeupler; Goran Zuzic; Themis Gouleakis (PODC, 2022)

Optimal Clock Synchronization with Signatures. - Christoph Lenzen 001; Julian Loss (PODC, 2022)

G-SINC: Global Synchronization Infrastructure for Network Clocks. - Marc Frei; Jonghoon Kwon; Seyedali Tabaeiaghdaei; Marc Wyss; Christoph Lenzen 001; Adrian Perrig (SRDS, 2022)

Current Challenges in Reliable and Secure Clock Synchronization. - Swen Jacobs; Christoph Lenzen 001 (Bull. EATCS, 2022)

Fast All-Digital Clock Frequency Adaptation Circuit for Voltage Droop Tolerance. - Matthias Függer; Attila Kinali; Christoph Lenzen 001; Ben Wiederhake (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2022)

Gradient TRIX. - Christoph Lenzen 001; Shreyas Srinivas (CoRR, 2023)

GRandLine: Adaptively Secure DKG and Randomness Beacon with (Almost) Quadratic Communication Complexity. - Renas Bacho; Christoph Lenzen 001; Julian Loss; Simon Ochsenreither; Dimitrios Papachristoudis (IACR Cryptol. ePrint Arch., 2023)

Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts. - Ioannis Anagnostides; Christoph Lenzen 001; Bernhard Haeupler; Goran Zuzic; Themis Gouleakis (Distributed Comput., 2023)

GRandLine: Adaptively Secure DKG and Randomness Beacon with (Log-)Quadratic Communication Complexity. - Renas Bacho; Christoph Lenzen 001; Julian Loss; Simon Ochsenreither; Dimitrios Papachristoudis (CCS, 2024)

Brief Announcement: Clock Distribution with Gradient TRIX. - Christoph Lenzen 001; Shreyas Srinivas (DISC, 2024)

Model-Agnostic Approximation of Constrained Forest Problems. - Corinna Coupette; Alipasha Montaseri; Christoph Lenzen 001 (CoRR, 2024)

Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions. - Ruben Becker; Yuval Emek; Mohsen Ghaffari 001; Christoph Lenzen 001 (SIAM J. Comput., 2024)

Robust Routing Made Easy: Reinforcing Networks Against Non-Benign Faults. - Christoph Lenzen 001; Moti Medina; Mehrdad Saberi; Stefan Schmid 001 (IEEE/ACM Trans. Netw., 2024)

Clock Distribution with Gradient TRIX. - Shreyas Srinivas; Christoph Lenzen 001 (PODC, 2025)

Nearly Optimal Parallel Broadcast in the Plain Public Key Model. - Ran Gelles; Christoph Lenzen 001; Julian Loss; Sravya Yandamuri (IACR Cryptol. ePrint Arch., 2025)

Latch Based Design for Fast Voltage Droop Response. - Shreyas Srinivas; Ian W. Jones; Goran Panic; Christoph Lenzen 001 (CoRR, 2025)

Small Hazard-Free Transducers. - Johannes Bund; Christoph Lenzen 001; Moti Medina (IEEE Trans. Computers, 2025)