Christoph Lenzen

155 papers A* 25A 18B 8C 8Misc 1Journal 84Unranked 10

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Byzantine Consensus in the Partially Authenticated Setting. IACR Cryptol. ePrint Arch. Christoph Lenzen, Julian Loss, Kecheng Shi, Benedikt Wagner
2026	J	`jnl`	Codes for Metastability-Containing Addition. CoRR Johannes Bund, Christoph Lenzen, Moti Medina
2026	J	`jnl`	Codes for Metastability-Containing Addition. IEEE Trans. Computers Johannes Bund, Christoph Lenzen, Moti Medina
2025	A*	`conf`	Clock Distribution with Gradient TRIX. PODC Shreyas Srinivas, Christoph Lenzen
2025	J	`jnl`	Latch Based Design for Fast Voltage Droop Response. CoRR Shreyas Srinivas, Ian W. Jones, Goran Panic, Christoph Lenzen
2025	A	`conf`	Model-Agnostic Approximation of Constrained Forest Problems. DISC Corinna Coupette, Alipasha Montaseri, Christoph Lenzen
2025	—	`conf`	Nearly Optimal Parallel Broadcast in the Plain Public Key Model. CRYPTO (2) Ran Gelles, Christoph Lenzen, Julian Loss, Sravya Yandamuri
2025	J	`jnl`	Nearly Optimal Parallel Broadcast in the Plain Public Key Model. IACR Cryptol. ePrint Arch. Ran Gelles, Christoph Lenzen, Julian Loss, Sravya Yandamuri
2025	J	`jnl`	Small Hazard-Free Transducers. IEEE Trans. Computers Johannes Bund, Christoph Lenzen, Moti Medina
2024	A	`conf`	Brief Announcement: Clock Distribution with Gradient TRIX. DISC Christoph Lenzen, Shreyas Srinivas
2024	J	`jnl`	Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions. SIAM J. Comput. Ruben Becker, Yuval Emek, Mohsen Ghaffari, Christoph Lenzen
2024	A*	`conf`	GRandLine: Adaptively Secure DKG and Randomness Beacon with (Log-)Quadratic Communication Complexity. CCS Renas Bacho, Christoph Lenzen, Julian Loss, Simon Ochsenreither, Dimitrios Papachristoudis
2024	J	`jnl`	Model-Agnostic Approximation of Constrained Forest Problems. CoRR Corinna Coupette, Alipasha Montaseri, Christoph Lenzen
2024	J	`jnl`	Robust Routing Made Easy: Reinforcing Networks Against Non-Benign Faults. IEEE/ACM Trans. Netw. Christoph Lenzen, Moti Medina, Mehrdad Saberi, Stefan Schmid
2023	J	`jnl`	Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts. Distributed Comput. Ioannis Anagnostides, Christoph Lenzen, Bernhard Haeupler, Goran Zuzic, Themis Gouleakis
2023	J	`jnl`	GRandLine: Adaptively Secure DKG and Randomness Beacon with (Almost) Quadratic Communication Complexity. IACR Cryptol. ePrint Arch. Renas Bacho, Christoph Lenzen, Julian Loss, Simon Ochsenreither, Dimitrios Papachristoudis
2023	J	`jnl`	Gradient TRIX. CoRR Christoph Lenzen, Shreyas Srinivas
2023	J	`jnl`	Robust Routing Made Easy: Reinforcing Networks Against Non-Benign Faults. CoRR Christoph Lenzen, Moti Medina, Mehrdad Saberi, Stefan Schmid
2022	A*	`conf`	A Recursive Early-Stopping Phase King Protocol. PODC Christoph Lenzen, Sahar Sheikholeslami
2022	A	`conf`	Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts. DISC Ioannis Anagnostides, Christoph Lenzen, Bernhard Haeupler, Goran Zuzic, Themis Gouleakis
2022	A*	`conf`	Brief Announcement: Almost Universally Optimal Distributed Laplacian Solver. PODC Ioannis Anagnostides, Christoph Lenzen, Bernhard Haeupler, Goran Zuzic, Themis Gouleakis
2022	J	`jnl`	Current Challenges in Reliable and Secure Clock Synchronization. Bull. EATCS Swen Jacobs, Christoph Lenzen
2022	J	`jnl`	Fast All-Digital Clock Frequency Adaptation Circuit for Voltage Droop Tolerance. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. Matthias Függer, Attila Kinali, Christoph Lenzen, Ben Wiederhake
2022	B	`conf`	G-SINC: Global Synchronization Infrastructure for Network Clocks. SRDS Marc Frei, Jonghoon Kwon, Seyedali Tabaeiaghdaei, Marc Wyss, Christoph Lenzen, Adrian Perrig
2022	J	`jnl`	G-SINC: Global Synchronization Infrastructure for Network Clocks. CoRR Marc Frei, Jonghoon Kwon, Seyedali Tabaeiaghdaei, Marc Wyss, Christoph Lenzen, Adrian Perrig
2022	—	`conf`	On Specifications and Proofs of Timed Circuits. Principles of Systems Design Matthias Függer, Christoph Lenzen, Ulrich Schmid
2022	J	`jnl`	On Specifications and Proofs of Timed Circuits. CoRR Matthias Függer, Christoph Lenzen, Ulrich Schmid
2022	A*	`conf`	Optimal Clock Synchronization with Signatures. PODC Christoph Lenzen, Julian Loss
2022	J	`jnl`	Optimal Clock Synchronization with Signatures. CoRR Christoph Lenzen, Julian Loss
2022	A	`conf`	Small Hazard-Free Transducers. ITCS Johannes Bund, Christoph Lenzen, Moti Medina
2021	—	`conf`	A Breezing Proof of the KMW Bound. SOSA Corinna Coupette, Christoph Lenzen
2021	J	`jnl`	Accelerated Distributed Laplacian Solvers via Shortcuts. CoRR Ioannis Anagnostides, Themis Gouleakis, Christoph Lenzen
2021	B	`conf`	Approximate Minimum Directed Spanning Trees Under Congestion. SIROCCO Christoph Lenzen, Hossein Vahidi
2021	J	`jnl`	Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models. SIAM J. Comput. Ruben Becker, Sebastian Forster, Andreas Karrenbauer, Christoph Lenzen
2020	J	`jnl`	A Breezing Proof of the KMW Bound. CoRR Corinna Coupette, Christoph Lenzen
2020	C	`conf`	Brief Announcement: TRIX: Low-Skew Pulse Propagation for Fault-Tolerant Hardware. SSS Christoph Lenzen, Ben Wiederhake
2020	J	`jnl`	Fooling views: a new lower bound technique for distributed computations under congestion. Distributed Comput. Amir Abboud, Keren Censor-Hillel, Seri Khoury, Christoph Lenzen
2020	A	`conf`	Low Diameter Graph Decompositions by Approximate Distance Computation. ITCS Ruben Becker, Yuval Emek, Christoph Lenzen
2020	J	`jnl`	Optimal Metastability-Containing Sorting via Parallel Prefix Computation. IEEE Trans. Computers Johannes Bund, Christoph Lenzen, Moti Medina
2020	—	`conf`	PALS: Plesiochronous and Locally Synchronous Systems. ASYNC Johannes Bund, Matthias Függer, Christoph Lenzen, Moti Medina, Will Rosenbaum
2020	J	`jnl`	PALS: Plesiochronous and Locally Synchronous Systems. CoRR Johannes Bund, Matthias Függer, Christoph Lenzen, Moti Medina, Will Rosenbaum
2020	J	`jnl`	Synchronizer-Free Digital Link Controller. CoRR Johannes Bund, Matthias Függer, Christoph Lenzen, Moti Medina
2020	J	`jnl`	Synchronizer-Free Digital Link Controller. IEEE Trans. Circuits Syst. Johannes Bund, Matthias Függer, Christoph Lenzen, Moti Medina
2020	J	`jnl`	TRIX: Low-Skew Pulse Propagation for Fault-Tolerant Hardware. CoRR Christoph Lenzen, Ben Wiederhake
2019	J	`jnl`	Algebraic methods in the congested clique. Distributed Comput. Keren Censor-Hillel, Petteri Kaski, Janne H. Korhonen, Christoph Lenzen, Ami Paz, Jukka Suomela
2019	A	`conf`	Distributed Algorithms for Low Stretch Spanning Trees. DISC Ruben Becker, Yuval Emek, Mohsen Ghaffari, Christoph Lenzen
2019	J	`jnl`	Distributed distance computation and routing with small messages. Distributed Comput. Christoph Lenzen, Boaz Patt-Shamir, David Peleg
2019	A*	`conf`	Fault Tolerant Gradient Clock Synchronization. PODC Johannes Bund, Christoph Lenzen, Will Rosenbaum
2019	J	`jnl`	Fault Tolerant Gradient Clock Synchronization. CoRR Johannes Bund, Christoph Lenzen, Will Rosenbaum
2019	B	`conf`	Locality of Not-so-Weak Coloring. SIROCCO Alkida Balliu, Juho Hirvonen, Christoph Lenzen, Dennis Olivetti, Jukka Suomela
2019	J	`jnl`	Locality of not-so-weak coloring. CoRR Alkida Balliu, Juho Hirvonen, Christoph Lenzen, Dennis Olivetti, Jukka Suomela
2019	J	`jnl`	Low Diameter Graph Decompositions by Approximate Distance Computation. CoRR Ruben Becker, Yuval Emek, Christoph Lenzen
2019	J	`jnl`	Near-optimal self-stabilising counting and firing squads. Distributed Comput. Christoph Lenzen, Joel Rybicki
2019	J	`jnl`	On the Complexity of Hazard-free Circuits. J. ACM Christian Ikenmeyer, Balagopal Komarath, Christoph Lenzen, Vladimir Lysikov, Andrey Mokhov, Karteek Sreenivasaiah
2019	J	`jnl`	Optimal Metastability-Containing Sorting via Parallel Prefix Computation. CoRR Johannes Bund, Christoph Lenzen, Moti Medina
2019	B	`conf`	Parallel Balanced Allocations: The Heavily Loaded Case. SPAA Christoph Lenzen, Merav Parter, Eylon Yogev
2019	J	`jnl`	Parallel Balanced Allocations: The Heavily Loaded Case. CoRR Christoph Lenzen, Merav Parter, Eylon Yogev
2019	J	`jnl`	Self-Stabilising Byzantine Clock Synchronisation Is Almost as Easy as Consensus. J. ACM Christoph Lenzen, Joel Rybicki
2019	J	`jnl`	Self-Stabilizing Byzantine Clock Synchronization with Optimal Precision. Theory Comput. Syst. Pankaj Khanchandani, Christoph Lenzen
2018	A*	`conf`	A Centralized Local Algorithm for the Sparse Spanning Graph Problem. ICALP Christoph Lenzen, Reut Levi
2018	—	`conf`	Fast All-Digital Clock Frequency Adaptation Circuit for Voltage Droop Tolerance. ASYNC Matthias Függer, Attila Kinali, Christoph Lenzen, Ben Wiederhake
2018	J	`jnl`	Metastability-Containing Circuits. IEEE Trans. Computers Stephan Friedrichs, Matthias Függer, Christoph Lenzen
2018	J	`jnl`	Near-Optimal Distributed Maximum Flow. SIAM J. Comput. Mohsen Ghaffari, Andreas Karrenbauer, Fabian Kuhn, Christoph Lenzen, Boaz Patt-Shamir
2018	A*	`conf`	On the complexity of hazard-free circuits. STOC Christian Ikenmeyer, Balagopal Komarath, Christoph Lenzen, Vladimir Lysikov, Andrey Mokhov, Karteek Sreenivasaiah
2018	J	`jnl`	Optimal Metastability-Containing Sorting Networks. CoRR Johannes Bund, Christoph Lenzen, Moti Medina
2018	A	`conf`	Optimal metastability-containing sorting networks. DATE Johannes Bund, Christoph Lenzen, Moti Medina
2018	J	`jnl`	Parallel Metric Tree Embedding Based on an Algebraic View on Moore-Bellman-Ford. J. ACM Stephan Friedrichs, Christoph Lenzen
2018	J	`jnl`	Small Hazard-free Transducers. CoRR Johannes Bund, Christoph Lenzen, Moti Medina
2017	J	`jnl`	A Local Algorithm for the Sparse Spanning Graph Problem. CoRR Christoph Lenzen, Reut Levi
2017	A	`conf`	Brief Announcement: A Centralized Local Algorithm for the Sparse Spanning Graph Problem. DISC Christoph Lenzen, Reut Levi
2017	J	`jnl`	Efficient Counting with Optimal Resilience. SIAM J. Comput. Christoph Lenzen, Joel Rybicki, Jukka Suomela
2017	J	`jnl`	Fooling Views: A New Lower Bound Technique for Distributed Computations under Congestion. CoRR Amir Abboud, Keren Censor-Hillel, Seri Khoury, Christoph Lenzen
2017	—	`conf`	Metastability Tolerant Computing. ASYNC Ghaith Tarawneh, Matthias Függer, Christoph Lenzen
2017	—	`conf`	Metastability-Aware Memory-Efficient Time-to-Digital Converters. ASYNC Matthias Függer, Attila Kinali, Christoph Lenzen, Thomas Polzer
2017	A	`conf`	Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models. DISC Ruben Becker, Andreas Karrenbauer, Sebastian Krinninger, Christoph Lenzen
2017	A	`conf`	Near-optimal metastability-containing sorting networks. DATE Johannes Bund, Christoph Lenzen, Moti Medina
2017	J	`jnl`	On the complexity of hazard-free circuits. CoRR Christian Ikenmeyer, Balagopal Komarath, Christoph Lenzen, Vladimir Lysikov, Andrey Mokhov, Karteek Sreenivasaiah
2017	C	`conf`	Robust Routing Made Easy. SSS Christoph Lenzen, Moti Medina
2017	J	`jnl`	Robust Routing Made Easy. CoRR Christoph Lenzen, Moti Medina
2017	J	`jnl`	Searching without communicating: tradeoffs between performance and selection complexity. Distributed Comput. Christoph Lenzen, Nancy A. Lynch, Calvin Newport, Tsvetomira Radeva
2017	A	`conf`	Self-Stabilising Byzantine Clock Synchronisation is Almost as Easy as Consensus. DISC Christoph Lenzen, Joel Rybicki
2017	J	`jnl`	Self-stabilising Byzantine Clock Synchronisation is Almost as Easy as Consensus. CoRR Christoph Lenzen, Joel Rybicki
2016	J	`jnl`	Approximate Undirected Transshipment and Shortest Paths via Gradient Descent. CoRR Ruben Becker, Andreas Karrenbauer, Sebastian Krinninger, Christoph Lenzen
2016	J	`jnl`	CLEX: Yet Another Supercomputer Architecture? CoRR Christoph Lenzen, Roger Wattenhofer
2016	—	`conf`	Efficient Metastability-Containing Gray Code 2-Sort. ASYNC Christoph Lenzen, Moti Medina
2016	—	`conf`	Fault-Tolerant Clock Synchronization with High Precision. ISVLSI Attila Kinali, Florian Huemer, Christoph Lenzen
2016	J	`jnl`	HEX: Scaling honeycombs is easier than scaling clock trees. J. Comput. Syst. Sci. Danny Dolev, Matthias Függer, Christoph Lenzen, Martin Perner, Ulrich Schmid
2016	J	`jnl`	Metastability-Containing Circuits. CoRR Stephan Friedrichs, Matthias Függer, Christoph Lenzen
2016	J	`jnl`	Near-Optimal Self-Stabilising Counting and Firing Squads. CoRR Christoph Lenzen, Joel Rybicki
2016	C	`conf`	Near-Optimal Self-stabilising Counting and Firing Squads. SSS Christoph Lenzen, Joel Rybicki
2016	B	`conf`	Parallel Metric Tree Embedding based on an Algebraic View on Moore-Bellman-Ford. SPAA Stephan Friedrichs, Christoph Lenzen
2016	C	`conf`	Self-stabilizing Byzantine Clock Synchronization with Optimal Precision. SSS Pankaj Khanchandani, Christoph Lenzen
2016	J	`jnl`	Self-stabilizing Byzantine Clock Synchronization with Optimal Precision. CoRR Pankaj Khanchandani, Christoph Lenzen
2016	J	`jnl`	Synchronous counting and computational algorithm design. J. Comput. Syst. Sci. Danny Dolev, Keijo Heljanko, Matti Järvisalo, Janne H. Korhonen, Christoph Lenzen, Joel Rybicki, Jukka Suomela, Siert Wieringa
2016	J	`jnl`	Tight bounds for parallel randomized load balancing. Distributed Comput. Christoph Lenzen, Roger Wattenhofer
2015	A*	`conf`	Algebraic Methods in the Congested Clique. PODC Keren Censor-Hillel, Petteri Kaski, Janne H. Korhonen, Christoph Lenzen, Ami Paz, Jukka Suomela
2015	J	`jnl`	Algebraic Methods in the Congested Clique. CoRR Keren Censor-Hillel, Petteri Kaski, Janne H. Korhonen, Christoph Lenzen, Ami Paz, Jukka Suomela
2015	A	`conf`	Efficient Counting with Optimal Resilience. DISC Christoph Lenzen, Joel Rybicki
2015	J	`jnl`	Efficient counting with optimal resilience. CoRR Christoph Lenzen, Joel Rybicki
2015	A*	`conf`	Fast Partial Distance Estimation and Applications. PODC Christoph Lenzen, Boaz Patt-Shamir
2015	J	`jnl`	Fault-tolerant Distributed Systems in Hardware. Bull. EATCS Danny Dolev, Matthias Függer, Christoph Lenzen, Ulrich Schmid, Andreas Steininger
2015	J	`jnl`	Near-Optimal Distributed Maximum Flow. CoRR Mohsen Ghaffari, Andreas Karrenbauer, Fabian Kuhn, Christoph Lenzen, Boaz Patt-Shamir
2015	A*	`conf`	Near-Optimal Distributed Maximum Flow: Extended Abstract. PODC Mohsen Ghaffari, Andreas Karrenbauer, Fabian Kuhn, Christoph Lenzen, Boaz Patt-Shamir
2015	J	`jnl`	Parallel Metric Tree Embedding based on an Algebraic View on Moore-Bellman-Ford. CoRR Stephan Friedrichs, Christoph Lenzen
2015	J	`jnl`	PulseSync: An Efficient and Scalable Clock Synchronization Protocol. IEEE/ACM Trans. Netw. Christoph Lenzen, Philipp Sommer, Roger Wattenhofer
2015	A	`conf`	The 1-2-3-Toolkit for Building Your Own Balls-into-Bins Algorithm. ALENEX Pierre Bertrand, Christoph Lenzen
2015	A*	`conf`	Towards Optimal Synchronous Counting. PODC Christoph Lenzen, Joel Rybicki, Jukka Suomela
2015	J	`jnl`	Towards Optimal Synchronous Counting. CoRR Christoph Lenzen, Joel Rybicki, Jukka Suomela
2014	A*	`conf`	Brief announcement: local approximability of minimum dominating set on planar graphs. PODC Miikka Hilke, Christoph Lenzen, Jukka Suomela
2014	J	`jnl`	Fast Partial Distance Estimation and Applications. CoRR Christoph Lenzen, Boaz Patt-Shamir
2014	J	`jnl`	Fault-tolerant algorithms for tick-generation in asynchronous logic: Robust pulse generation. J. ACM Danny Dolev, Matthias Függer, Ulrich Schmid, Christoph Lenzen
2014	J	`jnl`	Improved Distributed Steiner Forest Construction. CoRR Christoph Lenzen, Boaz Patt-Shamir
2014	A*	`conf`	Improved distributed steiner forest construction. PODC Christoph Lenzen, Boaz Patt-Shamir
2014	J	`jnl`	Local Approximability of Minimum Dominating Set on Planar Graphs. CoRR Miikka Hilke, Christoph Lenzen, Jukka Suomela
2014	A	`conf`	Near-Optimal Distributed Tree Embedding. DISC Mohsen Ghaffari, Christoph Lenzen
2014	J	`jnl`	Rigorously modeling self-stabilizing fault-tolerant circuits: An ultra-robust clocking scheme for systems-on-chip. J. Comput. Syst. Sci. Danny Dolev, Matthias Függer, Markus Posch, Ulrich Schmid, Andreas Steininger, Christoph Lenzen
2014	A	`conf`	The 1-2-3-Toolkit for Building Your Own Balls-into-Bins Algorithm. DISC Pierre Bertrand, Christoph Lenzen
2014	J	`jnl`	The 1-2-3-Toolkit for Building Your Own Balls-into-Bins Algorithm. CoRR Pierre Bertrand, Christoph Lenzen
2014	J	`jnl`	Trade-offs between Selection Complexity and Performance when Searching the Plane without Communication. CoRR Christoph Lenzen, Nancy A. Lynch, Calvin C. Newport, Tsvetomira Radeva
2014	A*	`conf`	Trade-offs between selection complexity and performance when searching the plane without communication. PODC Christoph Lenzen, Nancy A. Lynch, Calvin C. Newport, Tsvetomira Radeva
2013	J	`jnl`	Distributed minimum dominating set approximations in restricted families of graphs. Distributed Comput. Christoph Lenzen, Yvonne-Anne Pignolet, Roger Wattenhofer
2013	A*	`conf`	Early-deciding consensus is expensive. PODC Danny Dolev, Christoph Lenzen
2013	C	`conf`	Efficient Construction of Global Time in SoCs Despite Arbitrary Faults. DSD Christoph Lenzen, Matthias Függer, Markus Hofstatter, Ulrich Schmid
2013	A*	`conf`	Efficient distributed source detection with limited bandwidth. PODC Christoph Lenzen, David Peleg
2013	A*	`conf`	Fast routing table construction using small messages: extended abstract. STOC Christoph Lenzen, Boaz Patt-Shamir
2013	B	`conf`	HEX: scaling honeycombs is easier than scaling clock trees. SPAA Danny Dolev, Matthias Függer, Christoph Lenzen, Martin Perner, Ulrich Schmid
2013	J	`jnl`	Node-Initiated Byzantine Consensus Without a Common Clock. CoRR Danny Dolev, Christoph Lenzen
2013	A*	`conf`	Optimal deterministic routing and sorting on the congested clique. PODC Christoph Lenzen
2013	J	`jnl`	Synchronous Counting and Computational Algorithm Design CoRR Danny Dolev, Janne H. Korhonen, Christoph Lenzen, Joel Rybicki, Jukka Suomela
2013	C	`conf`	Synchronous Counting and Computational Algorithm Design. SSS Danny Dolev, Janne H. Korhonen, Christoph Lenzen, Joel Rybicki, Jukka Suomela
2012	A	`conf`	"Tri, Tri Again": Finding Triangles and Small Subgraphs in a Distributed Setting - (Extended Abstract). DISC Danny Dolev, Christoph Lenzen, Shir Peled
2012	J	`jnl`	"Tri, Tri again": Finding Triangles and Small Subgraphs in a Distributed Setting CoRR Danny Dolev, Christoph Lenzen, Shir Peled
2012	J	`jnl`	FATAL+: A Self-Stabilizing Byzantine Fault-tolerant Clocking Scheme for SoCs CoRR Danny Dolev, Matthias Függer, Christoph Lenzen, Markus Posch, Ulrich Schmid, Andreas Steininger
2012	J	`jnl`	Fast Routing Table Construction Using Small Messages CoRR Christoph Lenzen, Boaz Patt-Shamir
2012	J	`jnl`	Optimal Deterministic Routing and Sorting on the Congested Clique CoRR Christoph Lenzen
2011	C	`conf`	Fault-Tolerant Algorithms for Tick-Generation in Asynchronous Logic: Robust Pulse Generation - [Extended Abstract]. SSS Danny Dolev, Matthias Függer, Christoph Lenzen, Ulrich Schmid
2011	J	`jnl`	Fault-tolerant Algorithms for Tick-Generation in Asynchronous Logic: Robust Pulse Generation CoRR Danny Dolev, Matthias Függer, Christoph Lenzen, Ulrich Schmid
2011	A*	`conf`	MIS on trees. PODC Christoph Lenzen, Roger Wattenhofer
2011	—	`—`	Synchronization and symmetry breaking in distributedsystems. Christoph Lenzen
2011	J	`jnl`	Tight Bounds for Parallel Randomized Load Balancing CoRR Christoph Lenzen, Roger Wattenhofer
2011	A*	`conf`	Tight bounds for parallel randomized load balancing: extended abstract. STOC Christoph Lenzen, Roger Wattenhofer
2010	A*	`conf`	Brief announcement: exponential speed-up of local algorithms using non-local communication. PODC Christoph Lenzen, Roger Wattenhofer
2010	B	`conf`	Clock Synchronization: Open Problems in Theory and Practice. SOFSEM Christoph Lenzen, Thomas Locher, Philipp Sommer, Roger Wattenhofer
2010	A	`conf`	Minimum Dominating Set Approximation in Graphs of Bounded Arboricity. DISC Christoph Lenzen, Roger Wattenhofer
2010	J	`jnl`	Optimal Gradient Clock Synchronization in Dynamic Networks CoRR Fabian Kuhn, Christoph Lenzen, Thomas Locher, Rotem Oshman
2010	A*	`conf`	Optimal gradient clock synchronization in dynamic networks. PODC Fabian Kuhn, Christoph Lenzen, Thomas Locher, Rotem Oshman
2010	J	`jnl`	Tight bounds for clock synchronization. J. ACM Christoph Lenzen, Thomas Locher, Roger Wattenhofer
2009	J	`jnl`	A review of PODC 2009. SIGACT News Keren Censor, Christoph Lenzen
2009	—	`conf`	Local Algorithms: Self-Stabilization on Speed. Algorithmic Methods for Distributed Cooperative Systems Christoph Lenzen, Jukka Suomela, Roger Wattenhofer
2009	C	`conf`	Local Algorithms: Self-stabilization on Speed. SSS Christoph Lenzen, Jukka Suomela, Roger Wattenhofer
2009	Misc	`conf`	Optimal clock synchronization in networks. SenSys Christoph Lenzen, Philipp Sommer, Roger Wattenhofer
2009	A*	`conf`	Tight bounds for clock synchronization. PODC Christoph Lenzen, Thomas Locher, Roger Wattenhofer
2008	A*	`conf`	Clock Synchronization with Bounded Global and Local Skew. FOCS Christoph Lenzen, Thomas Locher, Roger Wattenhofer
2008	A	`conf`	Leveraging Linial's Locality Limit. DISC Christoph Lenzen, Roger Wattenhofer
2008	B	`conf`	What can be approximated locally?: case study: dominating sets in planar graphs. SPAA Christoph Lenzen, Yvonne Anne Oswald, Roger Wattenhofer