Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristoph Lenzen 0001
Person information
- affiliation: CISPA Helmholtz Center for Information Security, Saarbrücken, Germany
- affiliation (former): Max Planck Institute for Informatics, Saarbrücken, Germany
- affiliation (former): Massachusetts Institute of Technology (MIT), Computer Sciene and Artificial Intelligence Laboratory (CSAIL), Cambridge, MA, USA
- affiliation (former): Weizmann Institute of Science, Department of Computer Science and Applied Mathematics, Rehovot, Israel
- affiliation (former): Hebrew University of Jerusalem, School of Engineering and Computer Science, Jerusalem, Israel
- affiliation (former, PhD 2011): ETH Zurich, Switzerland
Other persons with the same name
- Christoph Lenzen — disambiguation page
- Christoph Lenzen 0002 — German AeroSpace Center (DLR), Oberpfaffenhofen, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j30]Ruben Becker, Yuval Emek, Mohsen Ghaffari, Christoph Lenzen:
Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions. SIAM J. Comput. 53(2): 247-286 (2024)- [j29]Christoph Lenzen
, Moti Medina, Mehrdad Saberi, Stefan Schmid:
Robust Routing Made Easy: Reinforcing Networks Against Non-Benign Faults. IEEE/ACM Trans. Netw. 32(1): 283-297 (2024) - 2023
- [j28]Ioannis Anagnostides, Christoph Lenzen, Bernhard Haeupler, Goran Zuzic, Themis Gouleakis:
Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts. Distributed Comput. 36(4): 475-499 (2023) - [i48]Christoph Lenzen, Shreyas Srinivas:
Gradient TRIX. CoRR abs/2301.05073 (2023) - [i47]Christoph Lenzen, Moti Medina, Mehrdad Saberi, Stefan Schmid:
Robust Routing Made Easy: Reinforcing Networks Against Non-Benign Faults. CoRR abs/2307.05547 (2023) - [i46]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: 1887 (2023) - 2022
- [j27]Swen Jacobs, Christoph Lenzen:
Current Challenges in Reliable and Secure Clock Synchronization. Bull. EATCS 138 (2022) - [j26]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): 2518-2531 (2022) - [c64]Matthias Függer, Christoph Lenzen, Ulrich Schmid:
On Specifications and Proofs of Timed Circuits. Principles of Systems Design 2022: 107-130 - [c63]Johannes Bund, Christoph Lenzen, Moti Medina:
Small Hazard-Free Transducers. ITCS 2022: 32:1-32:24 - [c62]Christoph Lenzen, Sahar Sheikholeslami:
A Recursive Early-Stopping Phase King Protocol. PODC 2022: 60-69 - [c61]Ioannis Anagnostides, Christoph Lenzen, Bernhard Haeupler, Goran Zuzic, Themis Gouleakis:
Brief Announcement: Almost Universally Optimal Distributed Laplacian Solver. PODC 2022: 372-374 - [c60]Christoph Lenzen, Julian Loss:
Optimal Clock Synchronization with Signatures. PODC 2022: 440-449 - [c59]Marc Frei, Jonghoon Kwon, Seyedali Tabaeiaghdaei, Marc Wyss, Christoph Lenzen, Adrian Perrig:
G-SINC: Global Synchronization Infrastructure for Network Clocks. SRDS 2022: 133-145 - [c58]Ioannis Anagnostides, Christoph Lenzen, Bernhard Haeupler, Goran Zuzic, Themis Gouleakis:
Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts. DISC 2022: 6:1-6:20 - [i45]Christoph Lenzen, Julian Loss:
Optimal Clock Synchronization with Signatures. CoRR abs/2203.02553 (2022) - [i44]Marc Frei, Jonghoon Kwon, Seyedali Tabaeiaghdaei, Marc Wyss, Christoph Lenzen, Adrian Perrig:
G-SINC: Global Synchronization Infrastructure for Network Clocks. CoRR abs/2207.06116 (2022) - [i43]Matthias Függer, Christoph Lenzen, Ulrich Schmid:
On Specifications and Proofs of Timed Circuits. CoRR abs/2208.08147 (2022) - 2021
- [j25]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): 815-856 (2021) - [c57]Christoph Lenzen, Hossein Vahidi:
Approximate Minimum Directed Spanning Trees Under Congestion. SIROCCO 2021: 352-369 - [c56]Corinna Coupette, Christoph Lenzen:
A Breezing Proof of the KMW Bound. SOSA 2021: 184-195 - [i42]Ioannis Anagnostides, Themis Gouleakis, Christoph Lenzen:
Accelerated Distributed Laplacian Solvers via Shortcuts. CoRR abs/2109.05151 (2021) - 2020
- [j24]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): 545-559 (2020) - [j23]Johannes Bund, Christoph Lenzen, Moti Medina:
Optimal Metastability-Containing Sorting via Parallel Prefix Computation. IEEE Trans. Computers 69(2): 198-211 (2020) - [j22]Johannes Bund, Matthias Függer, Christoph Lenzen, Moti Medina:
Synchronizer-Free Digital Link Controller. IEEE Trans. Circuits Syst. 67-I(10): 3562-3573 (2020) - [c55]Johannes Bund, Matthias Függer, Christoph Lenzen, Moti Medina, Will Rosenbaum:
PALS: Plesiochronous and Locally Synchronous Systems. ASYNC 2020: 36-43 - [c54]Ruben Becker, Yuval Emek, Christoph Lenzen:
Low Diameter Graph Decompositions by Approximate Distance Computation. ITCS 2020: 50:1-50:29 - [c53]Christoph Lenzen, Ben Wiederhake:
Brief Announcement: TRIX: Low-Skew Pulse Propagation for Fault-Tolerant Hardware. SSS 2020: 295-300 - [i41]Corinna Coupette, Christoph Lenzen:
A Breezing Proof of the KMW Bound. CoRR abs/2002.06005 (2020) - [i40]Johannes Bund, Matthias Függer, Christoph Lenzen, Moti Medina, Will Rosenbaum:
PALS: Plesiochronous and Locally Synchronous Systems. CoRR abs/2003.05542 (2020) - [i39]Christoph Lenzen, Ben Wiederhake:
TRIX: Low-Skew Pulse Propagation for Fault-Tolerant Hardware. CoRR abs/2010.01415 (2020) - [i38]Johannes Bund, Matthias Függer, Christoph Lenzen, Moti Medina:
Synchronizer-Free Digital Link Controller. CoRR abs/2010.02017 (2020)
2010 – 2019
- 2019
- [j21]Christoph Lenzen, Boaz Patt-Shamir, David Peleg:
Distributed distance computation and routing with small messages. Distributed Comput. 32(2): 133-157 (2019) - [j20]Christoph Lenzen, Joel Rybicki:
Near-optimal self-stabilising counting and firing squads. Distributed Comput. 32(4): 339-360 (2019) - [j19]Keren Censor-Hillel, Petteri Kaski, Janne H. Korhonen, Christoph Lenzen, Ami Paz, Jukka Suomela:
Algebraic methods in the congested clique. Distributed Comput. 32(6): 461-478 (2019) - [j18]Christian Ikenmeyer, Balagopal Komarath, Christoph Lenzen, Vladimir Lysikov, Andrey Mokhov, Karteek Sreenivasaiah:
On the Complexity of Hazard-free Circuits. J. ACM 66(4): 25:1-25:20 (2019) - [j17]Christoph Lenzen, Joel Rybicki:
Self-Stabilising Byzantine Clock Synchronisation Is Almost as Easy as Consensus. J. ACM 66(5): 32:1-32:56 (2019) - [j16]Pankaj Khanchandani, Christoph Lenzen:
Self-Stabilizing Byzantine Clock Synchronization with Optimal Precision. Theory Comput. Syst. 63(2): 261-305 (2019) - [c52]Johannes Bund, Christoph Lenzen, Will Rosenbaum:
Fault Tolerant Gradient Clock Synchronization. PODC 2019: 357-365 - [c51]Alkida Balliu, Juho Hirvonen, Christoph Lenzen, Dennis Olivetti, Jukka Suomela:
Locality of Not-so-Weak Coloring. SIROCCO 2019: 37-51 - [c50]Christoph Lenzen, Merav Parter, Eylon Yogev:
Parallel Balanced Allocations: The Heavily Loaded Case. SPAA 2019: 313-322 - [c49]Ruben Becker, Yuval Emek, Mohsen Ghaffari, Christoph Lenzen:
Distributed Algorithms for Low Stretch Spanning Trees. DISC 2019: 4:1-4:14 - [i37]Johannes Bund, Christoph Lenzen, Will Rosenbaum:
Fault Tolerant Gradient Clock Synchronization. CoRR abs/1902.08042 (2019) - [i36]Alkida Balliu, Juho Hirvonen, Christoph Lenzen, Dennis Olivetti, Jukka Suomela:
Locality of not-so-weak coloring. CoRR abs/1904.05627 (2019) - [i35]Christoph Lenzen, Merav Parter, Eylon Yogev:
Parallel Balanced Allocations: The Heavily Loaded Case. CoRR abs/1904.07532 (2019) - [i34]Ruben Becker, Yuval Emek, Christoph Lenzen:
Low Diameter Graph Decompositions by Approximate Distance Computation. CoRR abs/1909.09002 (2019) - [i33]Johannes Bund, Christoph Lenzen, Moti Medina:
Optimal Metastability-Containing Sorting via Parallel Prefix Computation. CoRR abs/1911.00267 (2019) - 2018
- [j15]Stephan Friedrichs, Christoph Lenzen:
Parallel Metric Tree Embedding Based on an Algebraic View on Moore-Bellman-Ford. J. ACM 65(6): 43:1-43:55 (2018) - [j14]Mohsen Ghaffari, Andreas Karrenbauer, Fabian Kuhn, Christoph Lenzen, Boaz Patt-Shamir:
Near-Optimal Distributed Maximum Flow. SIAM J. Comput. 47(6): 2078-2117 (2018) - [j13]Stephan Friedrichs, Matthias Függer, Christoph Lenzen:
Metastability-Containing Circuits. IEEE Trans. Computers 67(8): 1167-1183 (2018) - [c48]Matthias Függer, Attila Kinali, Christoph Lenzen, Ben Wiederhake:
Fast All-Digital Clock Frequency Adaptation Circuit for Voltage Droop Tolerance. ASYNC 2018: 68-77 - [c47]Johannes Bund, Christoph Lenzen, Moti Medina:
Optimal metastability-containing sorting networks. DATE 2018: 521-526 - [c46]Christoph Lenzen, Reut Levi:
A Centralized Local Algorithm for the Sparse Spanning Graph Problem. ICALP 2018: 87:1-87:14 - [c45]Christian Ikenmeyer, Balagopal Komarath, Christoph Lenzen, Vladimir Lysikov, Andrey Mokhov, Karteek Sreenivasaiah:
On the complexity of hazard-free circuits. STOC 2018: 878-889 - [i32]Johannes Bund, Christoph Lenzen, Moti Medina:
Optimal Metastability-Containing Sorting Networks. CoRR abs/1801.07549 (2018) - [i31]Johannes Bund, Christoph Lenzen, Moti Medina:
Small Hazard-free Transducers. CoRR abs/1811.12369 (2018) - 2017
- [j12]Christoph Lenzen, Nancy A. Lynch, Calvin Newport, Tsvetomira Radeva:
Searching without communicating: tradeoffs between performance and selection complexity. Distributed Comput. 30(3): 169-191 (2017) - [j11]Christoph Lenzen, Joel Rybicki, Jukka Suomela:
Efficient Counting with Optimal Resilience. SIAM J. Comput. 46(4): 1473-1500 (2017) - [c44]Ghaith Tarawneh, Matthias Függer, Christoph Lenzen:
Metastability Tolerant Computing. ASYNC 2017: 25-32 - [c43]Matthias Függer, Attila Kinali, Christoph Lenzen, Thomas Polzer:
Metastability-Aware Memory-Efficient Time-to-Digital Converters. ASYNC 2017: 49-56 - [c42]Johannes Bund, Christoph Lenzen, Moti Medina:
Near-optimal metastability-containing sorting networks. DATE 2017: 226-231 - [c41]Christoph Lenzen, Moti Medina:
Robust Routing Made Easy. SSS 2017: 187-202 - [c40]Ruben Becker, Andreas Karrenbauer, Sebastian Krinninger, Christoph Lenzen:
Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models. DISC 2017: 7:1-7:16 - [c39]Christoph Lenzen, Joel Rybicki:
Self-Stabilising Byzantine Clock Synchronisation is Almost as Easy as Consensus. DISC 2017: 32:1-32:15 - [c38]Christoph Lenzen, Reut Levi:
Brief Announcement: A Centralized Local Algorithm for the Sparse Spanning Graph Problem. DISC 2017: 57:1-57:3 - [i30]Christoph Lenzen, Reut Levi:
A Local Algorithm for the Sparse Spanning Graph Problem. CoRR abs/1703.05418 (2017) - [i29]Christoph Lenzen, Moti Medina:
Robust Routing Made Easy. CoRR abs/1705.04042 (2017) - [i28]Christoph Lenzen, Joel Rybicki:
Self-stabilising Byzantine Clock Synchronisation is Almost as Easy as Consensus. CoRR abs/1705.06173 (2017) - [i27]Amir Abboud, Keren Censor-Hillel, Seri Khoury, Christoph Lenzen:
Fooling Views: A New Lower Bound Technique for Distributed Computations under Congestion. CoRR abs/1711.01623 (2017) - [i26]Christian Ikenmeyer, Balagopal Komarath, Christoph Lenzen, Vladimir Lysikov, Andrey Mokhov, Karteek Sreenivasaiah:
On the complexity of hazard-free circuits. CoRR abs/1711.01904 (2017) - 2016
- [j10]Christoph Lenzen, Roger Wattenhofer:
Tight bounds for parallel randomized load balancing. Distributed Comput. 29(2): 127-142 (2016) - [j9]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): 310-332 (2016) - [j8]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): 929-956 (2016) - [c37]Christoph Lenzen, Moti Medina:
Efficient Metastability-Containing Gray Code 2-Sort. ASYNC 2016: 49-56 - [c36]Attila Kinali, Florian Huemer, Christoph Lenzen:
Fault-Tolerant Clock Synchronization with High Precision. ISVLSI 2016: 490-495 - [c35]Stephan Friedrichs, Christoph Lenzen:
Parallel Metric Tree Embedding based on an Algebraic View on Moore-Bellman-Ford. SPAA 2016: 455-466 - [c34]Pankaj Khanchandani, Christoph Lenzen:
Self-stabilizing Byzantine Clock Synchronization with Optimal Precision. SSS 2016: 213-230 - [c33]Christoph Lenzen, Joel Rybicki:
Near-Optimal Self-stabilising Counting and Firing Squads. SSS 2016: 263-280 - [i25]Stephan Friedrichs, Matthias Függer, Christoph Lenzen:
Metastability-Containing Circuits. CoRR abs/1606.06570 (2016) - [i24]Christoph Lenzen, Roger Wattenhofer:
CLEX: Yet Another Supercomputer Architecture? CoRR abs/1607.00298 (2016) - [i23]Ruben Becker, Andreas Karrenbauer, Sebastian Krinninger, Christoph Lenzen:
Approximate Undirected Transshipment and Shortest Paths via Gradient Descent. CoRR abs/1607.05127 (2016) - [i22]Christoph Lenzen, Joel Rybicki:
Near-Optimal Self-Stabilising Counting and Firing Squads. CoRR abs/1608.00214 (2016) - [i21]Pankaj Khanchandani, Christoph Lenzen:
Self-stabilizing Byzantine Clock Synchronization with Optimal Precision. CoRR abs/1609.09281 (2016) - 2015
- [j7]Danny Dolev, Matthias Függer, Christoph Lenzen, Ulrich Schmid, Andreas Steininger:
Fault-tolerant Distributed Systems in Hardware. Bull. EATCS 116 (2015) - [j6]Christoph Lenzen, Philipp Sommer, Roger Wattenhofer:
PulseSync: An Efficient and Scalable Clock Synchronization Protocol. IEEE/ACM Trans. Netw. 23(3): 717-727 (2015) - [c32]Pierre Bertrand, Christoph Lenzen:
The 1-2-3-Toolkit for Building Your Own Balls-into-Bins Algorithm. ALENEX 2015: 44-54 - [c31]Mohsen Ghaffari, Andreas Karrenbauer, Fabian Kuhn, Christoph Lenzen, Boaz Patt-Shamir:
Near-Optimal Distributed Maximum Flow: Extended Abstract. PODC 2015: 81-90 - [c30]Keren Censor-Hillel, Petteri Kaski, Janne H. Korhonen, Christoph Lenzen, Ami Paz, Jukka Suomela:
Algebraic Methods in the Congested Clique. PODC 2015: 143-152 - [c29]Christoph Lenzen, Boaz Patt-Shamir:
Fast Partial Distance Estimation and Applications. PODC 2015: 153-162 - [c28]Christoph Lenzen, Joel Rybicki, Jukka Suomela:
Towards Optimal Synchronous Counting. PODC 2015: 441-450 - [c27]Christoph Lenzen, Joel Rybicki:
Efficient Counting with Optimal Resilience. DISC 2015: 16-30 - [i20]Keren Censor-Hillel, Petteri Kaski, Janne H. Korhonen, Christoph Lenzen, Ami Paz, Jukka Suomela:
Algebraic Methods in the Congested Clique. CoRR abs/1503.04963 (2015) - [i19]Christoph Lenzen, Joel Rybicki, Jukka Suomela:
Towards Optimal Synchronous Counting. CoRR abs/1503.06702 (2015) - [i18]Christoph Lenzen, Joel Rybicki:
Efficient counting with optimal resilience. CoRR abs/1508.02535 (2015) - [i17]Mohsen Ghaffari, Andreas Karrenbauer, Fabian Kuhn, Christoph Lenzen, Boaz Patt-Shamir:
Near-Optimal Distributed Maximum Flow. CoRR abs/1508.04747 (2015) - [i16]Stephan Friedrichs, Christoph Lenzen:
Parallel Metric Tree Embedding based on an Algebraic View on Moore-Bellman-Ford. CoRR abs/1509.09047 (2015) - 2014
- [j5]Danny Dolev, Matthias Függer, Ulrich Schmid, Christoph Lenzen:
Fault-tolerant algorithms for tick-generation in asynchronous logic: Robust pulse generation. J. ACM 61(5): 30:1-30:74 (2014) - [j4]Danny Dolev, Matthias Függer, Markus Posch, Ulrich Schmid, Andreas Steininger, Christoph Lenzen:
Rigorously modeling self-stabilizing fault-tolerant circuits: An ultra-robust clocking scheme for systems-on-chip. J. Comput. Syst. Sci. 80(4): 860-900 (2014) - [c26]Christoph Lenzen, Nancy A. Lynch, Calvin C. Newport, Tsvetomira Radeva:
Trade-offs between selection complexity and performance when searching the plane without communication. PODC 2014: 252-261 - [c25]Christoph Lenzen, Boaz Patt-Shamir:
Improved distributed steiner forest construction. PODC 2014: 262-271 - [c24]Miikka Hilke, Christoph Lenzen, Jukka Suomela:
Brief announcement: local approximability of minimum dominating set on planar graphs. PODC 2014: 344-346 - [c23]Mohsen Ghaffari, Christoph Lenzen:
Near-Optimal Distributed Tree Embedding. DISC 2014: 197-211 - [c22]Pierre Bertrand, Christoph Lenzen:
The 1-2-3-Toolkit for Building Your Own Balls-into-Bins Algorithm. DISC 2014: 557-558 - [i15]Miikka Hilke, Christoph Lenzen, Jukka Suomela:
Local Approximability of Minimum Dominating Set on Planar Graphs. CoRR abs/1402.2549 (2014) - [i14]Christoph Lenzen, Nancy A. Lynch, Calvin C. Newport, Tsvetomira Radeva:
Trade-offs between Selection Complexity and Performance when Searching the Plane without Communication. CoRR abs/1405.1688 (2014) - [i13]Christoph Lenzen, Boaz Patt-Shamir:
Improved Distributed Steiner Forest Construction. CoRR abs/1405.2011 (2014) - [i12]Pierre Bertrand, Christoph Lenzen:
The 1-2-3-Toolkit for Building Your Own Balls-into-Bins Algorithm. CoRR abs/1407.8433 (2014) - [i11]Christoph Lenzen, Boaz Patt-Shamir:
Fast Partial Distance Estimation and Applications. CoRR abs/1412.7922 (2014) - 2013
- [j3]Christoph Lenzen, Yvonne-Anne Pignolet, Roger Wattenhofer:
Distributed minimum dominating set approximations in restricted families of graphs. Distributed Comput. 26(2): 119-137 (2013) - [c21]Christoph Lenzen, Matthias Függer, Markus Hofstatter, Ulrich Schmid:
Efficient Construction of Global Time in SoCs Despite Arbitrary Faults. DSD 2013: 142-151 - [c20]Christoph Lenzen:
Optimal deterministic routing and sorting on the congested clique. PODC 2013: 42-50 - [c19]Danny Dolev, Christoph Lenzen:
Early-deciding consensus is expensive. PODC 2013: 270-279 - [c18]Christoph Lenzen, David Peleg:
Efficient distributed source detection with limited bandwidth. PODC 2013: 375-382 - [c17]Danny Dolev, Matthias Függer, Christoph Lenzen, Martin Perner, Ulrich Schmid:
HEX: scaling honeycombs is easier than scaling clock trees. SPAA 2013: 164-175 - [c16]Danny Dolev, Janne H. Korhonen, Christoph Lenzen, Joel Rybicki, Jukka Suomela:
Synchronous Counting and Computational Algorithm Design. SSS 2013: 237-250 - [c15]Christoph Lenzen, Boaz Patt-Shamir:
Fast routing table construction using small messages: extended abstract. STOC 2013: 381-390 - [i10]Danny Dolev, Janne H. Korhonen, Christoph Lenzen, Joel Rybicki, Jukka Suomela:
Synchronous Counting and Computational Algorithm Design. CoRR abs/1304.5719 (2013) - [i9]Danny Dolev, Christoph Lenzen:
Node-Initiated Byzantine Consensus Without a Common Clock. CoRR abs/1307.7976 (2013) - 2012
- [c14]Danny Dolev, Christoph Lenzen, Shir Peled:
"Tri, Tri Again": Finding Triangles and Small Subgraphs in a Distributed Setting - (Extended Abstract). DISC 2012: 195-209 - [i8]Danny Dolev, Christoph Lenzen, Shir Peled:
"Tri, Tri again": Finding Triangles and Small Subgraphs in a Distributed Setting. CoRR abs/1201.6652 (2012) - [i7]Danny Dolev, Matthias Függer, Christoph Lenzen, Markus Posch, Ulrich Schmid, Andreas Steininger:
FATAL+: A Self-Stabilizing Byzantine Fault-tolerant Clocking Scheme for SoCs. CoRR abs/1202.1925 (2012) - [i6]Christoph Lenzen:
Optimal Deterministic Routing and Sorting on the Congested Clique. CoRR abs/1207.1852 (2012) - [i5]Christoph Lenzen, Boaz Patt-Shamir:
Fast Routing Table Construction Using Small Messages. CoRR abs/1210.5774 (2012) - 2011
- [b1]Christoph Lenzen:
Synchronization and symmetry breaking in distributedsystems. ETH Zurich, 2011, ISBN 978-3-86628-390-9, pp. 1-179 - [c13]Christoph Lenzen, Roger Wattenhofer:
MIS on trees. PODC 2011: 41-48 - [c12]Danny Dolev, Matthias Függer, Christoph Lenzen, Ulrich Schmid:
Fault-Tolerant Algorithms for Tick-Generation in Asynchronous Logic: Robust Pulse Generation - [Extended Abstract]. SSS 2011: 163-177 - [c11]Christoph Lenzen, Roger Wattenhofer:
Tight bounds for parallel randomized load balancing: extended abstract. STOC 2011: 11-20 - [i4]Christoph Lenzen, Roger Wattenhofer:
Tight Bounds for Parallel Randomized Load Balancing. CoRR abs/1102.5425 (2011) - [i3]Danny Dolev, Matthias Függer, Christoph Lenzen, Ulrich Schmid:
Fault-tolerant Algorithms for Tick-Generation in Asynchronous Logic: Robust Pulse Generation. CoRR abs/1105.4780 (2011) - 2010
- [j2]Christoph Lenzen, Thomas Locher, Roger Wattenhofer:
Tight bounds for clock synchronization. J. ACM 57(2): 8:1-8:42 (2010) - [c10]Christoph Lenzen, Roger Wattenhofer:
Brief announcement: exponential speed-up of local algorithms using non-local communication. PODC 2010: 295-296 - [c9]Fabian Kuhn, Christoph Lenzen, Thomas Locher, Rotem Oshman:
Optimal gradient clock synchronization in dynamic networks. PODC 2010: 430-439 - [c8]Christoph Lenzen, Thomas Locher, Philipp Sommer, Roger Wattenhofer:
Clock Synchronization: Open Problems in Theory and Practice. SOFSEM 2010: 61-70 - [c7]Christoph Lenzen, Roger Wattenhofer:
Minimum Dominating Set Approximation in Graphs of Bounded Arboricity. DISC 2010: 510-524 - [i2]Fabian Kuhn, Christoph Lenzen, Thomas Locher, Rotem Oshman:
Optimal Gradient Clock Synchronization in Dynamic Networks. CoRR abs/1005.2894 (2010)
2000 – 2009
- 2009
- [j1]Keren Censor, Christoph Lenzen:
A review of PODC 2009. SIGACT News 40(4): 71-74 (2009) - [c6]Christoph Lenzen, Thomas Locher, Roger Wattenhofer:
Tight bounds for clock synchronization. PODC 2009: 46-55 - [c5]Christoph Lenzen, Philipp Sommer, Roger Wattenhofer:
Optimal clock synchronization in networks. SenSys 2009: 225-238 - [c4]Christoph Lenzen, Jukka Suomela, Roger Wattenhofer:
Local Algorithms: Self-stabilization on Speed. SSS 2009: 17-34 - [i1]Christoph Lenzen, Jukka Suomela, Roger Wattenhofer:
Local Algorithms: Self-Stabilization on Speed. Algorithmic Methods for Distributed Cooperative Systems 2009 - 2008
- [c3]Christoph Lenzen, Thomas Locher, Roger Wattenhofer:
Clock Synchronization with Bounded Global and Local Skew. FOCS 2008: 509-518 - [c2]Christoph Lenzen, Yvonne Anne Oswald, Roger Wattenhofer:
What can be approximated locally?: case study: dominating sets in planar graphs. SPAA 2008: 46-54 - [c1]Christoph Lenzen, Roger Wattenhofer:
Leveraging Linial's Locality Limit. DISC 2008: 394-407
Coauthor Index
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-09 00:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
