| The locality of distributed symmetry breaking L Barenboim, M Elkin, S Pettie, J Schneider Journal of the ACM (JACM) 63 (3), 1-45, 2016 | 246 | 2016 |
| Lower-stretch spanning trees M Elkin, Y Emek, DA Spielman, SH Teng SIAM Journal on Computing 38 (2), 608-628, 2008 | 244 | 2008 |
| Distributed (δ+ 1)-coloring in linear (in δ) time L Barenboim, M Elkin Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009 | 218* | 2009 |
| Distributed graph coloring: Fundamentals and recent developments L Barenboim, M Elkin Synthesis Lectures on Distributed Computing Theory 4 (1), 1-171, 2013 | 204 | 2013 |
| An unconditional lower bound on the time-approximation trade-off for the distributed minimum spanning tree problem M Elkin SIAM Journal on Computing 36 (2), 433-456, 2006 | 195 | 2006 |
| Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition L Barenboim, M Elkin Distributed Computing 22 (5), 363-379, 2010 | 183 | 2010 |
| Deterministic distributed vertex coloring in polylogarithmic time L Barenboim, M Elkin Journal of the ACM (JACM) 58 (5), 1-25, 2011 | 139 | 2011 |
| An improved construction of progression-free sets M Elkin Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010 | 122 | 2010 |
| Computing almost shortest paths M Elkin ACM Transactions on Algorithms (TALG) 1 (2), 283-323, 2005 | 121 | 2005 |
| A faster distributed protocol for constructing a minimum spanning tree M Elkin Journal of Computer and System Sciences 72 (8), 1282-1308, 2006 | 120 | 2006 |
| Efficient algorithms for constructing (1+∊, β)-spanners in the distributed and streaming models M Elkin, J Zhang Distributed Computing 18 (5), 375-385, 2006 | 110 | 2006 |
| Sparse sourcewise and pairwise distance preservers D Coppersmith, M Elkin SIAM Journal on Discrete Mathematics 20 (2), 463-501, 2006 | 104 | 2006 |
| Sparse distance preservers and additive spanners B Bollobás, D Coppersmith, M Elkin SIAM Journal on Discrete Mathematics 19 (4), 1029-1055, 2005 | 98 | 2005 |
| Computing almost shortest paths M Elkin Proceedings of the twentieth annual ACM symposium on Principles of …, 2001 | 90 | 2001 |
| -Spanner Constructions for General Graphs M Elkin, D Peleg SIAM Journal on Computing 33 (3), 608-631, 2004 | 86* | 2004 |
| A combinatorial logarithmic approximation algorithm for the directed telephone broadcast problem M Elkin, G Kortsarz SIAM journal on Computing 35 (3), 672-689, 2005 | 85 | 2005 |
| Distributed exact shortest paths in sublinear time M Elkin Journal of the ACM (JACM) 67 (3), 1-36, 2020 | 80 | 2020 |
| Distributed approximation: a survey M Elkin ACM SIGACT News 35 (4), 40-57, 2004 | 74 | 2004 |
| Sublogarithmic approximation for telephone multicast: path out of jungle. M Elkin, G Kortsarz SODA 3, 76-85, 2003 | 68 | 2003 |
| Hopsets with constant hopbound, and applications to approximate shortest paths M Elkin, O Neiman SIAM Journal on Computing 48 (4), 1436-1480, 2019 | 64 | 2019 |
