Searching for authors named "Michael Elkin" – sorted by Relevance.
13 documents found, showing 1 through 10.
Next 10 →
-
Sparse source-wise and pair-wise distance preservers
- … * Michael Elkin ### Abstract We introduce and study the notions of pair-wise and source-wise preservers…
- Cited by 6 (0 self) – Add To MetaCart
-
A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners
- … [Extended Abstract] Michael Elkin Department of Computer Science, Ben-Gurion University of the Negev, Beer…
- Cited by 2 (1 self) – Add To MetaCart
-
Distributed Approximation - A Survey
- … Distributed Approximation - A Survey Michael Elkin *# Abstract Recently considerable progress…
- Cited by 3 (0 self) – Add To MetaCart
-
A Faster Distributed Protocol for Constructing a Minimum Spanning Tree
- … A Faster Distributed Protocol for Constructing a Minimum Spanning Tree* Michael Elkin…
- Cited by 18 (2 self) – Add To MetaCart
-
Computing Almost Shortest Paths
- … Computing Almost Shortest Paths \Lambda Michael Elkin \Lambda Abstract We study the s…
- Cited by 32 (10 self) – Add To MetaCart
-
Efficient algorithms for constructing (1 + ɛ, β)-spanners in the distributed and streaming models
- … ∗ ABSTRACT Michael Elkin † Computer Science Department Yale University, P.O. Box 208285 New Haven, CT 06520…
- Cited by 11 (6 self) – Add To MetaCart
-
Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners
- … Spanners Michael Elkin 1 Department of Computer Science, Ben-Gurion University of the Negev, Beer…
- Cited by 3 (1 self) – Add To MetaCart
-
Approximating k-spanner problems for k > 2
- …Approximating k-Spanner Problems for k > 2 Michael Elkin ∗ David Peleg † January 13, 2005 Abstract…
- Cited by 2 (0 self) – Add To MetaCart
-
1 + ffl; fi)-Spanner constructions for general graphs
- … (1 + ffl, fi )-Spanner Constructions for General Graphs Michael Elkin * David Peleg…
- Cited by 6 (2 self) – Add To MetaCart
-
Polylogarithmic additive inapproximability of the radio broadcast problem
- … Polylogarithmic Additive Inapproximability of the Radio Broadcast Problem Michael Elkin…
- Cited by 6 (0 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
