Christoph Lenzen

ORCID

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 84

Top Venues

Publications

Corinna Coupette, Alipasha Montaseri, Christoph Lenzen
Model-Agnostic Approximation of Constrained Forest Problems. CoRR (2024)
Christoph Lenzen, Moti Medina, Mehrdad Saberi, Stefan Schmid
Robust Routing Made Easy: Reinforcing Networks Against Non-Benign Faults. IEEE/ACM Trans. Netw. 32 (1) (2024)
Ruben Becker, Yuval Emek, Mohsen Ghaffari, Christoph Lenzen
Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions. SIAM J. Comput. 53 (2) (2024)
Christoph Lenzen, Moti Medina, Mehrdad Saberi, Stefan Schmid
Robust Routing Made Easy: Reinforcing Networks Against Non-Benign Faults. CoRR (2023)
Ioannis Anagnostides, Christoph Lenzen, Bernhard Haeupler, Goran Zuzic, Themis Gouleakis
Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts. Distributed Comput. 36 (4) (2023)
Christoph Lenzen, Shreyas Srinivas
Gradient TRIX. CoRR (2023)
Renas Bacho, Christoph Lenzen, Julian Loss, Simon Ochsenreither, Dimitrios Papachristoudis
GRandLine: Adaptively Secure DKG and Randomness Beacon with (Almost) Quadratic Communication Complexity. IACR Cryptol. ePrint Arch. 2023 (2023)
Christoph Lenzen, Julian Loss
Optimal Clock Synchronization with Signatures. PODC (2022)
Matthias Függer, Christoph Lenzen, Ulrich Schmid
On Specifications and Proofs of Timed Circuits. CoRR (2022)
Marc Frei, Jonghoon Kwon, Seyedali Tabaeiaghdaei, Marc Wyss, Christoph Lenzen, Adrian Perrig
G-SINC: Global Synchronization Infrastructure for Network Clocks. CoRR (2022)
Ioannis Anagnostides, Christoph Lenzen, Bernhard Haeupler, Goran Zuzic, Themis Gouleakis
Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts. DISC (2022)
Johannes Bund, Christoph Lenzen, Moti Medina
Small Hazard-Free Transducers. ITCS (2022)
Christoph Lenzen, Julian Loss
Optimal Clock Synchronization with Signatures. CoRR (2022)
Ioannis Anagnostides, Christoph Lenzen, Bernhard Haeupler, Goran Zuzic, Themis Gouleakis
Brief Announcement: Almost Universally Optimal Distributed Laplacian Solver. PODC (2022)
Swen Jacobs, Christoph Lenzen
Current Challenges in Reliable and Secure Clock Synchronization. Bull. EATCS 138 (2022)
Marc Frei, Jonghoon Kwon, Seyedali Tabaeiaghdaei, Marc Wyss, Christoph Lenzen, Adrian Perrig
G-SINC: Global Synchronization Infrastructure for Network Clocks. SRDS (2022)
Matthias Függer, Christoph Lenzen, Ulrich Schmid
On Specifications and Proofs of Timed Circuits. Principles of Systems Design (2022)
Matthias Függer, Attila Kinali, Christoph Lenzen, Ben Wiederhake
Fast All-Digital Clock Frequency Adaptation Circuit for Voltage Droop Tolerance. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 41 (8) (2022)
Christoph Lenzen, Sahar Sheikholeslami
A Recursive Early-Stopping Phase King Protocol. PODC (2022)
Corinna Coupette, Christoph Lenzen
A Breezing Proof of the KMW Bound. SOSA (2021)
Ioannis Anagnostides, Themis Gouleakis, Christoph Lenzen
Accelerated Distributed Laplacian Solvers via Shortcuts. CoRR (2021)
Christoph Lenzen, Hossein Vahidi
Approximate Minimum Directed Spanning Trees Under Congestion. SIROCCO (2021)
Ruben Becker, Sebastian Forster, Andreas Karrenbauer, Christoph Lenzen
Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models. SIAM J. Comput. 50 (3) (2021)
Johannes Bund, Matthias Függer, Christoph Lenzen, Moti Medina, Will Rosenbaum
PALS: Plesiochronous and Locally Synchronous Systems. ASYNC (2020)
Christoph Lenzen, Ben Wiederhake
Brief Announcement: TRIX: Low-Skew Pulse Propagation for Fault-Tolerant Hardware. SSS (2020)
Johannes Bund, Matthias Függer, Christoph Lenzen, Moti Medina
Synchronizer-Free Digital Link Controller. IEEE Trans. Circuits Syst. (10) (2020)
Johannes Bund, Christoph Lenzen, Moti Medina
Optimal Metastability-Containing Sorting via Parallel Prefix Computation. IEEE Trans. Computers 69 (2) (2020)
Johannes Bund, Matthias Függer, Christoph Lenzen, Moti Medina, Will Rosenbaum
PALS: Plesiochronous and Locally Synchronous Systems. CoRR (2020)
Johannes Bund, Matthias Függer, Christoph Lenzen, Moti Medina
Synchronizer-Free Digital Link Controller. CoRR (2020)
Corinna Coupette, Christoph Lenzen
A Breezing Proof of the KMW Bound. CoRR (2020)
Amir Abboud, Keren Censor-Hillel, Seri Khoury, Christoph Lenzen
Fooling views: a new lower bound technique for distributed computations under congestion. Distributed Comput. 33 (6) (2020)
Christoph Lenzen, Ben Wiederhake
TRIX: Low-Skew Pulse Propagation for Fault-Tolerant Hardware. CoRR (2020)
Ruben Becker, Yuval Emek, Christoph Lenzen
Low Diameter Graph Decompositions by Approximate Distance Computation. ITCS (2020)
Alkida Balliu, Juho Hirvonen, Christoph Lenzen, Dennis Olivetti, Jukka Suomela
Locality of not-so-weak coloring. CoRR (2019)
Keren Censor-Hillel, Petteri Kaski, Janne H. Korhonen, Christoph Lenzen, Ami Paz, Jukka Suomela
Algebraic methods in the congested clique. Distributed Comput. 32 (6) (2019)
Christoph Lenzen, Merav Parter, Eylon Yogev
Parallel Balanced Allocations: The Heavily Loaded Case. SPAA (2019)
Johannes Bund, Christoph Lenzen, Will Rosenbaum
Fault Tolerant Gradient Clock Synchronization. PODC (2019)
Ruben Becker, Yuval Emek, Christoph Lenzen
Low Diameter Graph Decompositions by Approximate Distance Computation. CoRR (2019)
Pankaj Khanchandani, Christoph Lenzen
Self-Stabilizing Byzantine Clock Synchronization with Optimal Precision. Theory Comput. Syst. 63 (2) (2019)
Christoph Lenzen, Boaz Patt-Shamir, David Peleg
Distributed distance computation and routing with small messages. Distributed Comput. 32 (2) (2019)
Johannes Bund, Christoph Lenzen, Moti Medina
Optimal Metastability-Containing Sorting via Parallel Prefix Computation. CoRR (2019)
Christian Ikenmeyer, Balagopal Komarath, Christoph Lenzen, Vladimir Lysikov, Andrey Mokhov, Karteek Sreenivasaiah
On the Complexity of Hazard-free Circuits. J. ACM 66 (4) (2019)
Ruben Becker, Yuval Emek, Mohsen Ghaffari, Christoph Lenzen
Distributed Algorithms for Low Stretch Spanning Trees. DISC (2019)
Christoph Lenzen, Joel Rybicki
Near-optimal self-stabilising counting and firing squads. Distributed Comput. 32 (4) (2019)
Christoph Lenzen, Merav Parter, Eylon Yogev
Parallel Balanced Allocations: The Heavily Loaded Case. CoRR (2019)
Johannes Bund, Christoph Lenzen, Will Rosenbaum
Fault Tolerant Gradient Clock Synchronization. CoRR (2019)
Christoph Lenzen, Joel Rybicki
Self-Stabilising Byzantine Clock Synchronisation Is Almost as Easy as Consensus. J. ACM 66 (5) (2019)
Alkida Balliu, Juho Hirvonen, Christoph Lenzen, Dennis Olivetti, Jukka Suomela
Locality of Not-so-Weak Coloring. SIROCCO (2019)
Stephan Friedrichs, Christoph Lenzen
Parallel Metric Tree Embedding Based on an Algebraic View on Moore-Bellman-Ford. J. ACM 65 (6) (2018)
Mohsen Ghaffari, Andreas Karrenbauer, Fabian Kuhn, Christoph Lenzen, Boaz Patt-Shamir
Near-Optimal Distributed Maximum Flow. SIAM J. Comput. 47 (6) (2018)
Johannes Bund, Christoph Lenzen, Moti Medina
Optimal Metastability-Containing Sorting Networks. CoRR (2018)
Johannes Bund, Christoph Lenzen, Moti Medina
Small Hazard-free Transducers. CoRR (2018)
Matthias Függer, Attila Kinali, Christoph Lenzen, Ben Wiederhake
Fast All-Digital Clock Frequency Adaptation Circuit for Voltage Droop Tolerance. ASYNC (2018)
Christian Ikenmeyer, Balagopal Komarath, Christoph Lenzen, Vladimir Lysikov, Andrey Mokhov, Karteek Sreenivasaiah
On the complexity of hazard-free circuits. STOC (2018)
Christoph Lenzen, Reut Levi
A Centralized Local Algorithm for the Sparse Spanning Graph Problem. ICALP (2018)
Johannes Bund, Christoph Lenzen, Moti Medina
Optimal metastability-containing sorting networks. DATE (2018)
Stephan Friedrichs, Matthias Függer, Christoph Lenzen
Metastability-Containing Circuits. IEEE Trans. Computers 67 (8) (2018)
Christian Ikenmeyer, Balagopal Komarath, Christoph Lenzen, Vladimir Lysikov, Andrey Mokhov, Karteek Sreenivasaiah
On the complexity of hazard-free circuits. CoRR (2017)
Christoph Lenzen, Moti Medina
Robust Routing Made Easy. CoRR (2017)
Ghaith Tarawneh, Matthias Függer, Christoph Lenzen
Metastability Tolerant Computing. ASYNC (2017)
Christoph Lenzen, Joel Rybicki, Jukka Suomela
Efficient Counting with Optimal Resilience. SIAM J. Comput. 46 (4) (2017)
Christoph Lenzen, Nancy A. Lynch, Calvin Newport, Tsvetomira Radeva
Searching without communicating: tradeoffs between performance and selection complexity. Distributed Comput. 30 (3) (2017)
Christoph Lenzen, Reut Levi
A Local Algorithm for the Sparse Spanning Graph Problem. CoRR (2017)
Christoph Lenzen, Joel Rybicki
Self-Stabilising Byzantine Clock Synchronisation is Almost as Easy as Consensus. DISC (2017)
Ruben Becker, Andreas Karrenbauer, Sebastian Krinninger, Christoph Lenzen
Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models. DISC (2017)
Johannes Bund, Christoph Lenzen, Moti Medina
Near-optimal metastability-containing sorting networks. DATE (2017)
Christoph Lenzen, Joel Rybicki
Self-stabilising Byzantine Clock Synchronisation is Almost as Easy as Consensus. CoRR (2017)
Christoph Lenzen, Moti Medina
Robust Routing Made Easy. SSS (2017)
Amir Abboud, Keren Censor-Hillel, Seri Khoury, Christoph Lenzen
Fooling Views: A New Lower Bound Technique for Distributed Computations under Congestion. CoRR (2017)
Christoph Lenzen, Reut Levi
Brief Announcement: A Centralized Local Algorithm for the Sparse Spanning Graph Problem. DISC (2017)
Matthias Függer, Attila Kinali, Christoph Lenzen, Thomas Polzer
Metastability-Aware Memory-Efficient Time-to-Digital Converters. ASYNC (2017)
Christoph Lenzen, Joel Rybicki
Near-Optimal Self-Stabilising Counting and Firing Squads. CoRR (2016)
Stephan Friedrichs, Matthias Függer, Christoph Lenzen
Metastability-Containing Circuits. CoRR (2016)
Pankaj Khanchandani, Christoph Lenzen
Self-stabilizing Byzantine Clock Synchronization with Optimal Precision. CoRR (2016)
Danny Dolev, Keijo Heljanko, Matti Järvisalo, Janne H. Korhonen, Christoph Lenzen, Joel Rybicki, Jukka Suomela, Siert Wieringa
Synchronous counting and computational algorithm design. J. Comput. Syst. Sci. 82 (2) (2016)
Christoph Lenzen, Moti Medina
Efficient Metastability-Containing Gray Code 2-Sort. ASYNC (2016)
Pankaj Khanchandani, Christoph Lenzen
Self-stabilizing Byzantine Clock Synchronization with Optimal Precision. SSS (2016)
Christoph Lenzen, Joel Rybicki
Near-Optimal Self-stabilising Counting and Firing Squads. SSS (2016)
Danny Dolev, Matthias Függer, Christoph Lenzen, Martin Perner, Ulrich Schmid
HEX: Scaling honeycombs is easier than scaling clock trees. J. Comput. Syst. Sci. 82 (5) (2016)
Ruben Becker, Andreas Karrenbauer, Sebastian Krinninger, Christoph Lenzen
Approximate Undirected Transshipment and Shortest Paths via Gradient Descent. CoRR (2016)
Attila Kinali, Florian Huemer, Christoph Lenzen
Fault-Tolerant Clock Synchronization with High Precision. ISVLSI (2016)
Christoph Lenzen, Roger Wattenhofer
Tight bounds for parallel randomized load balancing. Distributed Comput. 29 (2) (2016)
Stephan Friedrichs, Christoph Lenzen
Parallel Metric Tree Embedding based on an Algebraic View on Moore-Bellman-Ford. SPAA (2016)
Christoph Lenzen, Roger Wattenhofer
CLEX: Yet Another Supercomputer Architecture? CoRR (2016)
Christoph Lenzen, Philipp Sommer, Roger Wattenhofer
PulseSync: An Efficient and Scalable Clock Synchronization Protocol. IEEE/ACM Trans. Netw. 23 (3) (2015)
Mohsen Ghaffari, Andreas Karrenbauer, Fabian Kuhn, Christoph Lenzen, Boaz Patt-Shamir
Near-Optimal Distributed Maximum Flow: Extended Abstract. PODC (2015)
Christoph Lenzen, Boaz Patt-Shamir
Fast Partial Distance Estimation and Applications. PODC (2015)
Christoph Lenzen, Joel Rybicki
Efficient Counting with Optimal Resilience. DISC (2015)
Pierre Bertrand, Christoph Lenzen
The 1-2-3-Toolkit for Building Your Own Balls-into-Bins Algorithm. ALENEX (2015)
Christoph Lenzen, Joel Rybicki
Efficient counting with optimal resilience. CoRR (2015)
Keren Censor-Hillel, Petteri Kaski, Janne H. Korhonen, Christoph Lenzen, Ami Paz, Jukka Suomela
Algebraic Methods in the Congested Clique. PODC (2015)
Stephan Friedrichs, Christoph Lenzen
Parallel Metric Tree Embedding based on an Algebraic View on Moore-Bellman-Ford. CoRR (2015)
Mohsen Ghaffari, Andreas Karrenbauer, Fabian Kuhn, Christoph Lenzen, Boaz Patt-Shamir
Near-Optimal Distributed Maximum Flow. CoRR (2015)
Christoph Lenzen, Joel Rybicki, Jukka Suomela
Towards Optimal Synchronous Counting. PODC (2015)
Keren Censor-Hillel, Petteri Kaski, Janne H. Korhonen, Christoph Lenzen, Ami Paz, Jukka Suomela
Algebraic Methods in the Congested Clique. CoRR (2015)
Danny Dolev, Matthias Függer, Christoph Lenzen, Ulrich Schmid, Andreas Steininger
Fault-tolerant Distributed Systems in Hardware. Bull. EATCS 116 (2015)
Christoph Lenzen, Joel Rybicki, Jukka Suomela
Towards Optimal Synchronous Counting. CoRR (2015)
Christoph Lenzen, Boaz Patt-Shamir
Improved distributed steiner forest construction. PODC (2014)
Christoph Lenzen, Boaz Patt-Shamir
Fast Partial Distance Estimation and Applications. CoRR (2014)
Miikka Hilke, Christoph Lenzen, Jukka Suomela
Local Approximability of Minimum Dominating Set on Planar Graphs. CoRR (2014)

Christoph Lenzen.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Christoph Lenzen