Michael Elkin

发表

Quantum Distributed Network Computing: Lower Bounds and Techniques pdf

Hartmut Klauck, Michael Elkin, Danupon Nanongkai, 2012, ArXiv.

Efficient algorithms for constructing (1+∊,β)-spanners in the distributed and streaming models

Michael Elkin, Jian Zhang, Michael Elkin, 2006, Distributed Computing.

(1 + εΒ)-spanner constructions for general graphs

David Peleg, Michael Elkin, D. Peleg, 2001, STOC '01.

An improved construction of progression-free sets

Michael Elkin, 2010, SODA 2010.

A Simple Deterministic Distributed MST Algorithm, with Near-Optimal Time and Message Complexities

Michael Elkin, Michael Elkin, 2017, PODC.

Deterministic Distributed Sparse and Ultra-Sparse Spanners and Connectivity Certificates

Bernhard Haeupler, M. Ghaffari, Michael Elkin, 2022, 2204.14086.

2 6 D ec 2 00 8 Distributed ( ∆ + 1 )-coloring in linear ( in ∆ ) time

Michael Elkin, Leonid Barenboim, 2008 .

Spanners in the Congested Model

Michael Elkin, Tzalik Maimon, 2018 .

D S ] 17 F eb 2 01 6 Distributed Strong Diameter Network Decomposition

Ofer Neiman, Michael Elkin, 2018 .

Distributed Graph Coloring

Michael Elkin, Leonid Barenboim, 2013 .

Deterministic distributed vertex coloring in polylogarithmic time

Michael Elkin, Leonid Barenboim, 2010 .

Sublogarithmic distributed MIS algorithm for sparse graphs using nash-williams decomposition

Michael Elkin, Leonid Barenboim, 2008, PODC.

$(1+\epsilon)$-Approximate Shortest Paths in Dynamic Streams

Michael Elkin, Chhaya Trehan, 2021, 2107.13309.

Almost Shortest Paths with Near-Additive Error in Weighted Graphs

Ofer Neiman, Michael Elkin, Yuval Gitlitz, 2019, SWAT.

Deterministic Low-Diameter Decompositions for Weighted Graphs and Distributed and Parallel Applications

Bernhard Haeupler, Michael Elkin, C. Grunau, 2022, 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS).

Deterministic Distributed Sparse and Ultra-Sparse Spanners and Connectivity Certificates

Bernhard Haeupler, M. Ghaffari, Michael Elkin, 2022, SPAA.

Efficient algorithms for constructing (1+, varepsilon;, beta)-spanners in the distributed and streaming models.

Jian Zhang, Michael Elkin, Michael Elkin, 2004, PODC 2004.

A Linear-Size Logarithmic Stretch

Seth Pettie, Michael Elkin, Seth Pettie, 2015 .

On efficient distributed construction of near optimal routing schemes

Ofer Neiman, Michael Elkin, 2017, Distributed Computing.

Computing almost shortest paths

Michael Elkin, 2005, PODC '01.

Fast Distributed Algorithms for Maximal Matching and Maximal Independent Set pdf

Leonid Barenboim, Seth Pettie, Johannes Schneider, 2012, ArXiv.

Optimal euclidean spanners: really short, thin and lanky pdf

Michael Elkin, Shay Solomon, Michael Elkin, 2012, STOC '13.

The Locality of Distributed Symmetry Breaking

Leonid Barenboim, Seth Pettie, Johannes Schneider, 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

Deterministic Distributed Vertex Coloring in Polylogarithmic Time

Leonid Barenboim, Michael Elkin, Michael Elkin, 2010, JACM.

Distributed (Delta+1)-Coloring in Linear (in Delta) Time

F. Kuhn, Michael Elkin, Leonid Barenboim, 2008, SIAM J. Comput..

Distributed Graph Coloring: Fundamentals and Recent Developments

Leonid Barenboim, Michael Elkin, Michael Elkin, 2013, Distributed Graph Coloring: Fundamentals and Recent Developments.

Computing almost shortest paths

Michael Elkin, Michael Elkin, 2001, TALG.

Deterministic PRAM Approximate Shortest Paths in Polylogarithmic Time and Slightly Super-Linear Work pdf

Michael Elkin, Shaked Matar, Michael Elkin, 2020, SPAA.

Almost Shortest Paths and PRAM Distance Oracles in Weighted Graphs pdf

Michael Elkin, Ofer Neiman, Yuval Gitlitz, 2019, ArXiv.

Ramsey Spanning Trees and Their Applications

Ittai Abraham, Michael Elkin, Shiri Chechik, 2017, SODA.

Space-efficient path-reporting approximate distance oracles pdf

Christian Wulff-Nilsen, Michael Elkin, Ofer Neiman, 2014, Theor. Comput. Sci..

Prioritized Metric Structures and Embedding

Michael Elkin, Ofer Neiman, Arnold Filtser, 2015, STOC.

Improved Weighted Additive Spanners pdf

Ofer Neiman, Michael Elkin, Yuval Gitlitz, 2020, DISC.

Efficient Algorithms for Constructing Very Sparse Spanners and Emulators

Michael Elkin, Ofer Neiman, Ofer Neiman, 2016, SODA.

Locally-iterative Distributed (Δ + 1)-coloring and Applications

Michael Elkin, Leonid Barenboim, Uri Goldenberg, 2021, J. ACM.

Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition

Leonid Barenboim, Michael Elkin, Michael Elkin, 2008, PODC '08.

Ultra-Sparse Near-Additive Emulators

Michael Elkin, Shaked Matar, Michael Elkin, 2021, PODC.

A fast network-decomposition algorithm and its applications to constant-time distributed computation

Leonid Barenboim, Cyril Gavoille, Michael Elkin, 2015, Theor. Comput. Sci..

A Linear-Size Logarithmic Stretch Path-Reporting Distance Oracle for General Graphs

Seth Pettie, Michael Elkin, Seth Pettie, 2015, SODA.

New length bounds for cycle bases

Romeo Rizzi, Christian Liebchen, Michael Elkin, 2007, Inf. Process. Lett..

Approximating k-Spanner Problems for k>2

David Peleg, Michael Elkin, D. Peleg, 2001, IPCO.

Strong Inapproximability of the Basic k-Spanner Problem

David Peleg, Michael Elkin, D. Peleg, 2000, ICALP.

Deterministic Distributed (Delta + o(Delta))-Edge-Coloring, and Vertex-Coloring of Graphs with Bounded Diversity

Leonid Barenboim, Michael Elkin, Tzalik Maimon, 2016, PODC.

Deterministic Distributed (∆ + o(∆))-Edge-Coloring, and Vertex-Coloring of Graphs with Bounded Diversity

Michael Elkin, Leonid Barenboim, Tzalik Maimon, 2021 .

Novel algorithms for the network lifetime problem in wireless settings

Hanan Shpungin, Michael Segal, Michael Elkin, 2008, Wirel. Networks.

Bounds on the performance of back-to-front airplane boarding policies

Michael Elkin, Eitan Bachmat, Michael Elkin, 2008, Oper. Res. Lett..

Sparse Sourcewise and Pairwise Distance Preservers

Michael Elkin, Don Coppersmith, D. Coppersmith, 2006, SIAM J. Discret. Math..

(1+epsilon, beta)-Spanner Constructions for General Graphs

David Peleg, Michael Elkin, D. Peleg, 2004, SIAM J. Comput..

A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation - (Extended Abstract) pdf

Leonid Barenboim, Cyril Gavoille, Michael Elkin, 2015, SIROCCO.

Distributed approximation: a survey

Michael Elkin, Michael Elkin, 2004, SIGA.

Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem

Michael Elkin, Michael Elkin, 2004, STOC '04.

Distributed Strong Diameter Network Decomposition: Extended Abstract

Michael Elkin, Ofer Neiman, Ofer Neiman, 2016, PODC.

Can quantum communication speed up distributed computation?

Hartmut Klauck, Michael Elkin, Danupon Nanongkai, 2012, PODC.

Logarithmic inapproximability of the radio broadcast problem

Guy Kortsarz, Michael Elkin, G. Kortsarz, 2004, J. Algorithms.

Locally-Iterative Distributed (Δ+ 1): -Coloring below Szegedy-Vishwanathan Barrier, and Applications to Self-Stabilization and to Restricted-Bandwidth Models

Leonid Barenboim, Michael Elkin, Uri Goldenberg, 2017, PODC.

Light Spanners

Michael Elkin, Shay Solomon, Ofer Neiman, 2014, SIAM J. Discret. Math..

Sparse source-wise and pair-wise distance preservers

Michael Elkin, Don Coppersmith, D. Coppersmith, 2005, SODA '05.

Lower-stretch spanning trees

Shang-Hua Teng, Daniel A. Spielman, Michael Elkin, 2004, STOC '05.

A faster distributed protocol for constructing a minimum spanning tree

Michael Elkin, Michael Elkin, 2004, SODA '04.

Combinatorial algorithms for distributed graph coloring

Leonid Barenboim, Michael Elkin, Michael Elkin, 2011, Distributed Computing.

Distributed Exact Shortest Paths in Sublinear Time

Michael Elkin, Michael Elkin, 2020, J. ACM.

Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners

Michael Elkin, Michael Elkin, 2007, TALG.

Efficient algorithms for constructing (1+,ε, β)-spanners in the distributed and streaming models

Michael Elkin, Jian Zhang, Michael Elkin, 2004, PODC '04.

Centralized, Parallel, and Distributed Multi-Source Shortest Paths via Hopsets and Rectangular Matrix Multiplication

Ofer Neiman, Michael Elkin, 2022, STACS.

Quantum Lower Bounds for Distributed Network Computing

Hartmut Klauck, Michael Elkin, Danupon Nanongkai, 2012 .

Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths

Michael Elkin, Ofer Neiman, Ofer Neiman, 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

Fast Constructions of Lightweight Spanners for General Graphs

Michael Elkin, Shay Solomon, Michael Elkin, 2012, ACM Trans. Algorithms.

Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners

Michael Elkin, Shay Solomon, Yefim Dinitz, 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

Optimal Euclidean Spanners

Michael Elkin, Shay Solomon, 2015 .

Balancing Degree, Diameter, and Weight in Euclidean Spanners pdf

Michael Elkin, Shay Solomon, Michael Elkin, 2011, SIAM J. Discret. Math..

Balancing Degree, Diameter and Weight in Euclidean Spanners

Michael Elkin, Shay Solomon, Michael Elkin, 2010, ESA.

Linear-Size hopsets with small hopbound, and constant-hopbound hopsets in RNC

Michael Elkin, Ofer Neiman, Ofer Neiman, 2019, Distributed Computing.

Distributed exact shortest paths in sublinear time

Michael Elkin, Michael Elkin, 2017, STOC.

Fast Deterministic Constructions of Linear-Size Spanners and Skeletons pdf

Michael Elkin, Shaked Matar, Michael Elkin, 2019, ArXiv.

Distributed Construction of Light Networks

Michael Elkin, Ofer Neiman, Arnold Filtser, 2019, PODC.

Near-Additive Spanners In Low Polynomial Deterministic CONGEST Time

Michael Elkin, Shaked Matar, Michael Elkin, 2019, PODC.

Fast Constructions of Light-Weight Spanners for General Graphs

Michael Elkin, Shay Solomon, Michael Elkin, 2012, SODA.

The Hardness of Approximating Spanner Problems

David Peleg, Michael Elkin, D. Peleg, 1999, Theory of Computing Systems.

Optimizing budget allocation for center and median points

Eran Omri, Lee-Ad Gottlieb, Boaz Ben-Moshe, 2016, Theor. Comput. Sci..

Optimizing Budget Allocation in Graphs pdf

Eran Omri, Boaz Ben-Moshe, Michael Elkin, 2014, CCCG.

A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners

Michael Elkin, Michael Elkin, 2006, PODC '07.

Steiner Shallow-Light Trees are Exponentially Lighter than Spanning Ones

Michael Elkin, Shay Solomon, Michael Elkin, 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.