| Optimal clock synchronization in networks C Lenzen, P Sommer, R Wattenhofer Proceedings of the 7th ACM conference on embedded networked sensor systems …, 2009 | 231 | 2009 |
| Optimal deterministic routing and sorting on the congested clique C Lenzen Proceedings of the 2013 ACM symposium on Principles of distributed computing …, 2013 | 110 | 2013 |
| PulseSync: An efficient and scalable clock synchronization protocol C Lenzen, P Sommer, R Wattenhofer IEEE/ACM Transactions on Networking 23 (3), 717-727, 2014 | 109 | 2014 |
| Algebraic methods in the congested clique K Censor-Hillel, P Kaski, JH Korhonen, C Lenzen, A Paz, J Suomela Distributed Computing 32 (6), 461-478, 2019 | 95 | 2019 |
| Leveraging Linial’s locality limit C Lenzen, R Wattenhofer International Symposium on Distributed Computing, 394-407, 2008 | 82 | 2008 |
| Tight bounds for clock synchronization C Lenzen, T Locher, R Wattenhofer Journal of the ACM (JACM) 57 (2), 1-42, 2010 | 79 | 2010 |
| “Tri, Tri again”: Finding Triangles and Small Subgraphs in a Distributed Setting D Dolev, C Lenzen, S Peled International Symposium on Distributed Computing, 195-209, 2012 | 76 | 2012 |
| Efficient distributed source detection with limited bandwidth C Lenzen, D Peleg Proceedings of the 2013 ACM symposium on Principles of distributed computing …, 2013 | 74 | 2013 |
| Minimum dominating set approximation in graphs of bounded arboricity C Lenzen, R Wattenhofer International symposium on distributed computing, 510-524, 2010 | 59 | 2010 |
| Near-optimal approximate shortest paths and transshipment in distributed and streaming models R Becker, S Forster, A Karrenbauer, C Lenzen arXiv preprint arXiv:1607.05127, 2016 | 58* | 2016 |
| What can be approximated locally? Case study: Dominating sets in planar graphs C Lenzen, YA Oswald, R Wattenhofer Proceedings of the twentieth annual symposium on Parallelism in algorithms …, 2008 | 58 | 2008 |
| Fast routing table construction using small messages C Lenzen, B Patt-Shamir Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013 | 57 | 2013 |
| Tight bounds for parallel randomized load balancing C Lenzen, R Wattenhofer Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011 | 52 | 2011 |
| Fast partial distance estimation and applications C Lenzen, B Patt-Shamir Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing …, 2015 | 51 | 2015 |
| Local algorithms: Self-stabilization on speed C Lenzen, J Suomela, R Wattenhofer Symposium on Self-Stabilizing Systems, 17-34, 2009 | 49 | 2009 |
| Clock synchronization with bounded global and local skew C Lenzen, T Locher, R Wattenhofer 2008 49th Annual IEEE Symposium on Foundations of Computer Science, 509-518, 2008 | 42 | 2008 |
| Clock synchronization: Open problems in theory and practice C Lenzen, T Locher, P Sommer, R Wattenhofer International Conference on Current Trends in Theory and Practice of …, 2010 | 40 | 2010 |
| Trade-offs between selection complexity and performance when searching the plane without communication C Lenzen, N Lynch, C Newport, T Radeva Proceedings of the 2014 ACM symposium on Principles of distributed computing …, 2014 | 39 | 2014 |
| Near-optimal distributed maximum flow M Ghaffari, A Karrenbauer, F Kuhn, C Lenzen, B Patt-Shamir Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing …, 2015 | 36 | 2015 |
| Distributed minimum dominating set approximations in restricted families of graphs C Lenzen, YA Pignolet, R Wattenhofer Distributed computing 26 (2), 119-137, 2013 | 36 | 2013 |
