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
2502016
Lower-stretch spanning trees
M Elkin, Y Emek, DA Spielman, SH Teng
SIAM Journal on Computing 38 (2), 608-628, 2008
2452008
Distributed (δ+ 1)-coloring in linear (in δ) time
L Barenboim, M Elkin
Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009
221*2009
Distributed graph coloring: Fundamentals and recent developments
L Barenboim, M Elkin
Synthesis Lectures on Distributed Computing Theory 4 (1), 1-171, 2013
2102013
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
1992006
Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition
L Barenboim, M Elkin
Distributed Computing 22 (5), 363-379, 2010
1862010
Deterministic distributed vertex coloring in polylogarithmic time
L Barenboim, M Elkin
Journal of the ACM (JACM) 58 (5), 1-25, 2011
1392011
An improved construction of progression-free sets
M Elkin
Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010
1232010
A faster distributed protocol for constructing a minimum spanning tree
M Elkin
Journal of Computer and System Sciences 72 (8), 1282-1308, 2006
1212006
Computing almost shortest paths
M Elkin
ACM Transactions on Algorithms (TALG) 1 (2), 283-323, 2005
1212005
Efficient algorithms for constructing (1+∊, β)-spanners in the distributed and streaming models
M Elkin, J Zhang
Distributed Computing 18 (5), 375-385, 2006
1112006
Sparse sourcewise and pairwise distance preservers
D Coppersmith, M Elkin
SIAM Journal on Discrete Mathematics 20 (2), 463-501, 2006
1082006
Sparse distance preservers and additive spanners
B Bollobás, D Coppersmith, M Elkin
SIAM Journal on Discrete Mathematics 19 (4), 1029-1055, 2005
992005
Computing almost shortest paths
M Elkin
Proceedings of the twentieth annual ACM symposium on Principles of …, 2001
902001
-Spanner Constructions for General Graphs
M Elkin, D Peleg
SIAM Journal on Computing 33 (3), 608-631, 2004
88*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
852005
Distributed exact shortest paths in sublinear time
M Elkin
Journal of the ACM (JACM) 67 (3), 1-36, 2020
832020
Distributed approximation: a survey
M Elkin
ACM SIGACT News 35 (4), 40-57, 2004
742004
Sublogarithmic approximation for telephone multicast: path out of jungle.
M Elkin, G Kortsarz
SODA 3, 76-85, 2003
702003
Efficient algorithms for constructing very sparse spanners and emulators
M Elkin, O Neiman
ACM Transactions on Algorithms (TALG) 15 (1), 1-29, 2018
672018
The system can't perform the operation now. Try again later.
Articles 1–20