Follow
Michael Elkin
Michael Elkin
Verified email at cs.bgu.ac.il - Homepage
Title
Cited by
Cited by
Year
The locality of distributed symmetry breaking
L Barenboim, M Elkin, S Pettie, J Schneider
Journal of the ACM (JACM) 63 (3), 1-45, 2016
2592016
Lower-stretch spanning trees
M Elkin, Y Emek, DA Spielman, SH Teng
Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005
2462005
Distributed -Coloring in Linear (in ) Time
L Barenboim, M Elkin, F Kuhn
SIAM Journal on Computing 43 (1), 72-95, 2014
226*2014
Distributed graph coloring: Fundamentals and recent developments
L Barenboim, M Elkin
Morgan & Claypool Publishers, 2013
2212013
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
2002004
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
1872008
Deterministic distributed vertex coloring in polylogarithmic time
L Barenboim, M Elkin
Journal of the ACM (JACM) 58 (5), 1-25, 2011
1422011
An improved construction of progression-free sets
M Elkin
Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010
1232010
Computing almost shortest paths
M Elkin
ACM Transactions on Algorithms (TALG) 1 (2), 283-323, 2005
1232005
A faster distributed protocol for constructing a minimum spanning tree
M Elkin
Journal of Computer and System Sciences 72 (8), 1282-1308, 2006
1212006
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
1142004
Sparse sourcewise and pairwise distance preservers
D Coppersmith, M Elkin
SIAM Journal on Discrete Mathematics 20 (2), 463-501, 2006
1132006
Sparse distance preservers and additive spanners
B Bollobás, D Coppersmith, M Elkin
SIAM Journal on Discrete Mathematics 19 (4), 1029-1055, 2005
1022005
-Spanner Constructions for General Graphs
M Elkin, D Peleg
SIAM Journal on Computing 33 (3), 608-631, 2004
91*2004
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
912002
Computing almost shortest paths
M Elkin
Proceedings of the twentieth annual ACM symposium on Principles of …, 2001
902001
Distributed exact shortest paths in sublinear time
M Elkin
Journal of the ACM (JACM) 67 (3), 1-36, 2020
822020
Sublogarithmic approximation for telephone multicast: path out of jungle.
M Elkin, G Kortsarz
SODA 3, 76-85, 2003
762003
Hopsets with constant hopbound, and applications to approximate shortest paths
M Elkin, O Neiman
SIAM Journal on Computing 48 (4), 1436-1480, 2019
742019
Distributed approximation: a survey
M Elkin
ACM SIGACT News 35 (4), 40-57, 2004
732004
The system can't perform the operation now. Try again later.
Articles 1–20