Michael Elkin

发表

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.

Lower-stretch spanning trees

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

Efficient Algorithms for Constructing Very Sparse Spanners and Emulators

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

Improved schedule for radio broadcast

Guy Kortsarz, Michael Elkin, 2005, SODA '05.

Novel Algorithms for the Network Lifetime Problem in Wireless Settings

Hanan Shpungin, Michael Segal, Michael Elkin, 2008, ADHOC-NOW.

Sublogarithmic approximation for telephone multicast

Guy Kortsarz, Michael Elkin, 2006, J. Comput. Syst. Sci..

Narrow-Shallow-Low-Light Trees with and without Steiner Points

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

Distributed approximation: a survey

Michael Elkin, Michael Elkin, 2004, SIGA.

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

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

Approximating k-spanner problems for kge2

David Peleg, Michael Elkin, 2005, Theor. Comput. Sci..

Focal Impact: The Service Pyramid

Michael Elkin, 2017 .

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

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

Ramsey Spanning Trees and Their Applications

Ittai Abraham, Michael Elkin, Shiri Chechik, 2020, ACM Trans. Algorithms.

Prioritized Metric Structures and Embedding

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

Logarithmic inapproximability of the radio broadcast problem

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

Terminal embeddings

Michael Elkin, Ofer Neiman, Arnold Filtser, 2017, Theor. Comput. Sci..

A faster distributed protocol for constructing a minimum spanning tree

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

Near-Optimal Distributed Routing with Low Memory

Michael Elkin, Ofer Neiman, 2018, PODC.

Near-Additive Spanners In Low Polynomial Deterministic CONGEST Time

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

Novel algorithms for the network lifetime problem in wireless settings

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

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

Michael Elkin, 2020, J. ACM.

Sparse source-wise and pair-wise distance preservers

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

Distributed Construction of Light Networks

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

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.

Sublogarithmic approximation for telephone multicast: path out of jungle (extended abstract)

Guy Kortsarz, Michael Elkin, 2003, SODA '03.

The Hardness of Approximating Spanner Problems

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

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

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

Sparse Sourcewise and Pairwise Distance Preservers

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

Lower-Stretch Spanning Trees

Shang-Hua Teng, Daniel A. Spielman, Michael Elkin, 2008, SIAM J. Comput..

Ramsey Spanning Trees and Their Applications

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

Fast Deterministic Constructions of Linear-Size Spanners and Skeletons pdf

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

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.

Approximating k-Spanner Problems for k>2

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

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

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

Deterministic Distributed Vertex Coloring in Polylogarithmic Time

Leonid Barenboim, Michael Elkin, 2011, J. ACM.

Balancing Degree, Diameter and Weight in Euclidean Spanners

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

Balancing Degree, Diameter, and Weight in Euclidean Spanners pdf

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

Deterministic Distributed Vertex Coloring in Polylogarithmic Time

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

Polylogarithmic Inapproximability of the Radio Broadcast Problem

Guy Kortsarz, Michael Elkin, 2004, APPROX-RANDOM.

Centralized and Parallel Multi-Source Shortest Paths via Hopsets and Fast Matrix Multiplication pdf

Michael Elkin, Ofer Neiman, 2020, ArXiv.

Fast Distributed Algorithms for Maximal Matching and Maximal Independent Set pdf

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

Strong Inapproximability of the Basic k-Spanner Problem

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

Low Stretch Spanning Trees

Michael Elkin, 2008, Encyclopedia of Algorithms.

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

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

Near Isometric Terminal Embeddings for Doubling Metrics pdf

Michael Elkin, Ofer Neiman, 2018, Symposium on Computational Geometry.

Symmetry breaking depending on the chromatic number or the neighborhood growth

Roger Wattenhofer, Johannes Schneider, Michael Elkin, 2013, Theor. Comput. Sci..

Sparse Graph Spanners

Michael Elkin, 2016, Encyclopedia of Algorithms.

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

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

A Combinatorial Logarithmic Approximation Algorithm for the Directed Telephone Broadcast Problem

Guy Kortsarz, Michael Elkin, 2005, SIAM J. Comput..

An Approximation Algorithm for the Directed Telephone Multicast Problem

Guy Kortsarz, Michael Elkin, 2005, Algorithmica.

Light Spanners

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

Sparse Graph Spanners

Michael Elkin, 2008, Encyclopedia of Algorithms.

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

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

Distributed Strong Diameter Network Decomposition pdf

Michael Elkin, Ofer Neiman, 2016, ArXiv.

Synchronizers, Spanners

Michael Elkin, 2016, Encyclopedia of Algorithms.

An Unconditional Lower Bound on the Time-Approximation Trade-off for the Distributed Minimum Spanning Tree Problem

Michael Elkin, 2006, SIAM J. Comput..

Fast Constructions of Lightweight Spanners for General Graphs

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

Near-Additive Spanners and Near-Exact Hopsets, A Unified View

Michael Elkin, Ofer Neiman, 2020, Bull. EATCS.

The Locality of Distributed Symmetry Breaking

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

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

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

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

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

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).

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

Michael Elkin, 2006, ArXiv.

Terminal Embeddings

Michael Elkin, Ofer Neiman, Arnold Filtser, 2015, APPROX-RANDOM.

Distributed deterministic edge coloring using bounded neighborhood independence

Leonid Barenboim, Michael Elkin, 2011, PODC '11.

Distributed deterministic edge coloring using bounded neighborhood independence

Leonid Barenboim, Michael Elkin, 2011, PODC.

Space-efficient path-reporting approximate distance oracles pdf

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

Almost Shortest Paths and PRAM Distance Oracles in Weighted Graphs pdf

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

Fast Constructions of Light-Weight Spanners for General Graphs

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

Combinatorial algorithms for distributed graph coloring

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

Sparse distance preservers and additive spanners

Béla Bollobás, Michael Elkin, Don Coppersmith, 2003, SODA '03.

(2Δ - l)-Edge-Coloring is Much Easier than Maximal Matching in the Distributed Setting

Hsin-Hao Su, Seth Pettie, Michael Elkin, 2015, SODA.

Prioritized Metric Structures and Embedding

Michael Elkin, Ofer Neiman, Arnold Filtser, 2018, SIAM J. Comput..

Combinatorial Algorithms for Distributed Graph Coloring

Leonid Barenboim, Michael Elkin, 2011, DISC.

An improved algorithm for radio broadcast

Guy Kortsarz, Michael Elkin, 2007, ACM Trans. Algorithms.

Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem

Guy Kortsarz, Michael Elkin, 2002, STOC '02.

Narrow-Shallow-Low-Light Trees with and without Steiner Points

Michael Elkin, Shay Solomon, 2009, ESA.

Optimal euclidean spanners: really short, thin and lanky pdf

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

Distributed exact shortest paths in sublinear time

Michael Elkin, Michael Elkin, 2017, STOC.

Distributed (δ+1)-coloring in linear (in δ) time

Leonid Barenboim, Michael Elkin, 2009, STOC '09.

The Client-Server 2-Spanner Problem with Applications to Network Design

David Peleg, Michael Elkin, 2001, SIROCCO.

The Hardness of Approximating Spanner Problems

David Peleg, Michael Elkin, 2000, STACS.

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

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

Distributed Graph Coloring: Fundamentals and Recent Developments

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

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

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

An improved algorithm for radio broadcast

Guy Kortsarz, Michael Elkin, 2007, TALG.

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

Michael Elkin, Shay Solomon, Yefim Dinitz, 2008, FOCS.

Streaming and Fully Dynamic Centralized Algorithms for Constructing and Maintaining Sparse Spanners

Michael Elkin, 2007, ICALP.

An improved construction of progression-free sets

Michael Elkin, 2010, SODA '10.

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.

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

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

Low Stretch Spanning Trees

Michael Elkin, 2016, Encyclopedia of Algorithms.

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

Seth Pettie, Michael Elkin, 2015, SODA.

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

Michael Elkin, Michael Elkin, 2007, TALG.

Light Spanners

Michael Elkin, Shay Solomon, Ofer Neiman, 2014, ICALP.

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

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

Session details: Local algorithms

Michael Elkin, 2011, PODC '11.

Linear-Size Hopsets with Small Hopbound, and Distributed Routing with Low Memory pdf

Michael Elkin, Ofer Neiman, 2017, ArXiv.

The Locality of Distributed Symmetry Breaking

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

Lossless Prioritized Embeddings pdf

Michael Elkin, Ofer Neiman, 2020, SODA.

Steiner Shallow-Light Trees Are Exponentially Lighter than Spanning Ones

Michael Elkin, Shay Solomon, 2015, SIAM J. Comput..

New length bounds for cycle bases

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

Computing almost shortest paths

Michael Elkin, Michael Elkin, 2001, TALG.

Synchronizers, Spanners

Michael Elkin, 2008, Encyclopedia of Algorithms.

Quantum Lower Bounds for Distributed Network Computing

Hartmut Klauck, Michael Elkin, Danupon Nanongkai, 2012 .

Approximation Algorithm for Directed Telephone Multicast Problem

Guy Kortsarz, Michael Elkin, 2003, ICALP.

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

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

Optimizing Budget Allocation in Graphs pdf

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

On efficient distributed construction of near optimal routing schemes

Michael Elkin, Ofer Neiman, 2017, Distributed Computing.

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

Leonid Barenboim, Fabian Kuhn, Michael Elkin, 2014, SIAM J. Comput..

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

Michael Elkin, Michael Elkin, 2017, PODC.

Polylogarithmic Additive Inapproximability of the Radio Broadcast Problem

Guy Kortsarz, Michael Elkin, 2005, SIAM J. Discret. Math..

Session details: Session 3D: Graphs and Population

Michael Elkin, 2018, PODC.

Optimizing budget allocation for center and median points

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

Quantum Distributed Network Computing: Lower Bounds and Techniques pdf

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

Near Isometric Terminal Embeddings for Doubling Metrics

Michael Elkin, Ofer Neiman, 2021, Algorithmica.

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

Michael Elkin, Chhaya Trehan, 2021 .

Ultra-Sparse Near-Additive Emulators

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

Improved Weighted Additive Spanners

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

Computing almost shortest paths

Michael Elkin, 2005 .

A Linear-Size Logarithmic Stretch

Seth Pettie, Michael Elkin, Seth Pettie, 2015 .

Efficient algorithms for constructing very sparse spanners and emulators

Michael Elkin, Ofer Neiman, 2017, SODA 2017.

Optimal Euclidean Spanners

Michael Elkin, Shay Solomon, 2015 .