| The locality of distributed symmetry breaking L Barenboim, M Elkin, S Pettie, J Schneider Journal of the ACM (JACM) 63 (3), 1-45, 2016 | 285 | 2016 |
| Lower-stretch spanning trees M Elkin, Y Emek, DA Spielman, SH Teng Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005 | 250 | 2005 |
| Distributed (δ+ 1)-coloring in linear (in δ) time L Barenboim, M Elkin Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009 | 236 | 2009 |
| Distributed graph coloring: Fundamentals and recent developments L Barenboim, M Elkin Springer Nature, 2022 | 235 | 2022 |
| Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition L Barenboim, M Elkin Proceedings of the twenty-seventh ACM symposium on Principles of distributed …, 2008 | 205 | 2008 |
| Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem M Elkin Proceedings of the thirty-sixth annual ACM symposium on Theory of computing …, 2004 | 204 | 2004 |
| Deterministic distributed vertex coloring in polylogarithmic time L Barenboim, M Elkin Journal of the ACM (JACM) 58 (5), 1-25, 2011 | 146 | 2011 |
| An improved construction of progression-free sets M Elkin Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010 | 134 | 2010 |
| Computing almost shortest paths M Elkin ACM Transactions on Algorithms (TALG) 1 (2), 283-323, 2005 | 129 | 2005 |
| A faster distributed protocol for constructing a minimum spanning tree M Elkin Journal of Computer and System Sciences 72 (8), 1282-1308, 2006 | 124 | 2006 |
| Sparse sourcewise and pairwise distance preservers D Coppersmith, M Elkin SIAM Journal on Discrete Mathematics 20 (2), 463-501, 2006 | 119 | 2006 |
| Efficient algorithms for constructing (1+, ε, β)-spanners in the distributed and streaming models M Elkin, J Zhang Proceedings of the twenty-third annual ACM symposium on Principles of …, 2004 | 118 | 2004 |
| Sparse distance preservers and additive spanners B Bollobás, D Coppersmith, M Elkin SIAM Journal on Discrete Mathematics 19 (4), 1029-1055, 2005 | 101 | 2005 |
| Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem M Elkin, G Kortsarz Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002 | 95 | 2002 |
| Computing almost shortest paths M Elkin Proceedings of the twentieth annual ACM symposium on Principles of …, 2001 | 94 | 2001 |
| Distributed exact shortest paths in sublinear time M Elkin Journal of the ACM (JACM) 67 (3), 1-36, 2020 | 89 | 2020 |
| Hopsets with constant hopbound, and applications to approximate shortest paths M Elkin, O Neiman SIAM Journal on Computing 48 (4), 1436-1480, 2019 | 81 | 2019 |
| Efficient algorithms for constructing very sparse spanners and emulators M Elkin, O Neiman Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017 | 80 | 2017 |
| Sublogarithmic approximation for telephone multicast: path out of jungle. M Elkin, G Kortsarz SODA 3, 76-85, 2003 | 80 | 2003 |
| Distributed approximation: a survey M Elkin ACM SIGACT News 35 (4), 40-57, 2004 | 74 | 2004 |
