Michael Elkin
Michael Elkin
Подтвержден адрес электронной почты в домене cs.bgu.ac.il - Главная страница
Название
Процитировано
Процитировано
Год
Lower-stretch spanning trees
M Elkin, Y Emek, DA Spielman, SH Teng
SIAM Journal on Computing 38 (2), 608-628, 2008
2312008
The locality of distributed symmetry breaking
L Barenboim, M Elkin, S Pettie, J Schneider
Journal of the ACM (JACM) 63 (3), 1-45, 2016
1982016
Distributed (δ+ 1)-coloring in linear (in δ) time
L Barenboim, M Elkin
Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009
187*2009
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
1582006
Distributed graph coloring: Fundamentals and recent developments
L Barenboim, M Elkin
Synthesis Lectures on Distributed Computing Theory 4 (1), 1-171, 2013
1572013
Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition
L Barenboim, M Elkin
Distributed Computing 22 (5-6), 363-379, 2010
1442010
Deterministic distributed vertex coloring in polylogarithmic time
L Barenboim, M Elkin
Journal of the ACM (JACM) 58 (5), 1-25, 2011
1112011
An improved construction of progression-free sets
M Elkin
Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010
1112010
A faster distributed protocol for constructing a minimum spanning tree
M Elkin
Journal of Computer and System Sciences 72 (8), 1282-1308, 2006
1102006
Computing almost shortest paths
M Elkin
ACM Transactions on Algorithms (TALG) 1 (2), 283-323, 2005
1062005
-Spanner Constructions for General Graphs
M Elkin, D Peleg
SIAM Journal on Computing 33 (3), 608-631, 2004
97*2004
Efficient algorithms for constructing (1+∊, β)-spanners in the distributed and streaming models
M Elkin, J Zhang
Distributed Computing 18 (5), 375-385, 2006
932006
Sparse sourcewise and pairwise distance preservers
D Coppersmith, M Elkin
SIAM Journal on Discrete Mathematics 20 (2), 463-501, 2006
882006
Computing almost shortest paths
M Elkin
Proceedings of the twentieth annual ACM symposium on Principles of …, 2001
872001
Sparse distance preservers and additive spanners
B Bollobás, D Coppersmith, M Elkin
SIAM Journal on Discrete Mathematics 19 (4), 1029-1055, 2005
842005
Distributed approximation: a survey
M Elkin
ACM SIGACT News 35 (4), 40-57, 2004
782004
A combinatorial logarithmic approximation algorithm for the directed telephone broadcast problem
M Elkin, G Kortsarz
SIAM journal on Computing 35 (3), 672-689, 2005
752005
Sublogarithrnic Approximation for Telephone Multicast: Path out of Jungle
M Elkin
Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete …, 2003
602003
Improved broadcast schedule for radio networks
M Elkin, G Kortsarz
Proc. 16th ACM-SIAM Symp. on Discrete Algorithms, 222-231, 2005
532005
Distributed exact shortest paths in sublinear time
M Elkin
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
472017
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20