Követés
Michael Elkin
Michael Elkin
E-mail megerősítve itt: cs.bgu.ac.il - Kezdőlap
Cím
Hivatkozott rá
Hivatkozott rá
Év
The locality of distributed symmetry breaking
L Barenboim, M Elkin, S Pettie, J Schneider
Journal of the ACM (JACM) 63 (3), 1-45, 2016
3052016
Lower-stretch spanning trees
M Elkin, Y Emek, DA Spielman, SH Teng
Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005
2622005
Distributed graph coloring: Fundamentals and recent developments
L Barenboim, M Elkin
Springer Nature, 2022
2542022
Distributed (δ+ 1)-coloring in linear (in δ) time
L Barenboim, M Elkin
Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009
2372009
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
2092008
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
2082004
Deterministic distributed vertex coloring in polylogarithmic time
L Barenboim, M Elkin
Journal of the ACM (JACM) 58 (5), 1-25, 2011
1462011
An improved construction of progression-free sets
M Elkin
Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010
1422010
Computing almost shortest paths
M Elkin
ACM Transactions on Algorithms (TALG) 1 (2), 283-323, 2005
1312005
Sparse sourcewise and pairwise distance preservers
D Coppersmith, M Elkin
SIAM Journal on Discrete Mathematics 20 (2), 463-501, 2006
1282006
A faster distributed protocol for constructing a minimum spanning tree
M Elkin
Journal of Computer and System Sciences 72 (8), 1282-1308, 2006
1262006
Sublogarithmic approximation for telephone multicast
M Elkin, G Kortsarz
Journal of Computer and System Sciences 72 (4), 648-659, 2006
1162006
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
1162004
Sparse distance preservers and additive spanners
B Bollobás, D Coppersmith, M Elkin
SIAM Journal on Discrete Mathematics 19 (4), 1029-1055, 2005
1042005
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
972002
Distributed exact shortest paths in sublinear time
M Elkin
Journal of the ACM (JACM) 67 (3), 1-36, 2020
942020
Computing almost shortest paths
M Elkin
Proceedings of the twentieth annual ACM symposium on Principles of …, 2001
932001
Efficient algorithms for constructing very sparse spanners and emulators
M Elkin, O Neiman
ACM Transactions on Algorithms (TALG) 15 (1), 1-29, 2018
842018
Hopsets with constant hopbound, and applications to approximate shortest paths
M Elkin, O Neiman
SIAM Journal on Computing 48 (4), 1436-1480, 2019
832019
Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners
M Elkin
ACM Transactions on Algorithms (TALG) 7 (2), 1-17, 2011
732011
A rendszer jelenleg nem tudja elvégezni a műveletet. Próbálkozzon újra később.
Cikkek 1–20