| Optimal clock synchronization in networks C Lenzen, P Sommer, R Wattenhofer Proceedings of the 7th ACM Conference on Embedded Networked Sensor Systems …, 2009 | 258 | 2009 |
| PulseSync: An efficient and scalable clock synchronization protocol C Lenzen, P Sommer, R Wattenhofer IEEE/ACM Transactions on Networking 23 (3), 717-727, 2014 | 147 | 2014 |
| Optimal deterministic routing and sorting on the congested clique C Lenzen Proceedings of the 2013 ACM symposium on Principles of distributed computing …, 2013 | 145 | 2013 |
| Algebraic methods in the congested clique K Censor-Hillel, P Kaski, JH Korhonen, C Lenzen, A Paz, J Suomela Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing …, 2015 | 128 | 2015 |
| “Tri, tri again”: finding triangles and small subgraphs in a distributed setting D Dolev, C Lenzen, S Peled Distributed Computing: 26th International Symposium, DISC 2012, Salvador …, 2012 | 95 | 2012 |
| 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 | 93* | 2016 |
| Efficient distributed source detection with limited bandwidth C Lenzen, D Peleg Proceedings of the 2013 ACM symposium on Principles of distributed computing …, 2013 | 89 | 2013 |
| Leveraging Linial’s locality limit C Lenzen, R Wattenhofer Distributed Computing: 22nd International Symposium, DISC 2008, Arcachon …, 2008 | 88 | 2008 |
| Tight bounds for clock synchronization C Lenzen, T Locher, R Wattenhofer Journal of the ACM (JACM) 57 (2), 1-42, 2010 | 82 | 2010 |
| Minimum dominating set approximation in graphs of bounded arboricity C Lenzen, R Wattenhofer Distributed Computing: 24th International Symposium, DISC 2010, Cambridge …, 2010 | 71 | 2010 |
| 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 | 70 | 2013 |
| 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 | 66 | 2008 |
| Fast partial distance estimation and applications C Lenzen, B Patt-Shamir Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing …, 2015 | 64 | 2015 |
| Tight bounds for parallel randomized load balancing C Lenzen, R Wattenhofer Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011 | 60 | 2011 |
| 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 | 53 | 2015 |
| Local algorithms: Self-stabilization on speed C Lenzen, J Suomela, R Wattenhofer Stabilization, Safety, and Security of Distributed Systems: 11th …, 2009 | 52 | 2009 |
| Distributed minimum dominating set approximations in restricted families of graphs C Lenzen, YA Pignolet, R Wattenhofer Distributed computing 26, 119-137, 2013 | 48 | 2013 |
| Clock synchronization: Open problems in theory and practice C Lenzen, T Locher, P Sommer, R Wattenhofer SOFSEM 2010: Theory and Practice of Computer Science: 36th Conference on …, 2010 | 48 | 2010 |
| 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 | 46 | 2008 |
| MIS on trees C Lenzen, R Wattenhofer Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of …, 2011 | 43 | 2011 |
