| 2026 | SPAA | Time-, Message- and Memory-Efficient Distributed Minimum Spanning Tree and Partwise Aggregation. | Michael Elkin, Tanya Goldenfeld |
| 2026 | SPAA | Efficient Parallel (Δ + 1)-Edge-Coloring. | Ariel Khuzman, Michael Elkin |
| 2023 | FOCS | Path-Reporting Distance Oracles with Logarithmic Stretch and Size O(n log log n). | Michael Elkin, Idan Shabat |
| 2022 | FOCS | Deterministic Low-Diameter Decompositions for Weighted Graphs and Distributed and Parallel Applications. | Vclav Rozhon, Michael Elkin, Christoph Grunau, Bernhard Haeupler |
| 2022 | PODC | Brief Announcement: (1+ε)-Approximate Shortest Paths in Dynamic Streams. | Michael Elkin, Chhaya Trehan |
| 2022 | STACS | Centralized, Parallel, and Distributed Multi-Source Shortest Paths via Hopsets and Rectangular Matrix Multiplication. | Michael Elkin, Ofer Neiman |
| 2022 | SPAA | Deterministic Distributed Sparse and Ultra-Sparse Spanners and Connectivity Certificates. | Marcel Bezdrighin, Michael Elkin, Mohsen Ghaffari, Christoph Grunau, Bernhard Haeupler, Saeed Ilchi, Vclav Rozhon |
| 2021 | PODC | Ultra-Sparse Near-Additive Emulators. | Michael Elkin, Shaked Matar |
| 2021 | SPAA | Deterministic PRAM Approximate Shortest Paths in Polylogarithmic Time and Slightly Super-Linear Work. | Michael Elkin, Shaked Matar |
| 2020 | PODC | Distributed Construction of Light Networks. | Michael Elkin, Arnold Filtser, Ofer Neiman |
| 2020 | SODA | Lossless Prioritized Embeddings. | Michael Elkin, Ofer Neiman |
| 2019 | PODC | Near-Additive Spanners In Low Polynomial Deterministic CONGEST Time. | Michael Elkin, Shaked Matar |
| 2019 | SPAA | Linear-Size Hopsets with Small Hopbound, and Constant-Hopbound Hopsets in RNC. | Michael Elkin, Ofer Neiman |
| 2018 | PODC | 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 |
| 2018 | PODC | Session details: Session 3D: Graphs and Population. | Michael Elkin |
| 2018 | PODC | Near-Optimal Distributed Routing with Low Memory. | Michael Elkin, Ofer Neiman |
| 2018 | SODA | Ramsey Spanning Trees and their Applications. | Ittai Abraham, Shiri Chechik, Michael Elkin, Arnold Filtser, Ofer Neiman |
| 2017 | PODC | Deterministic Distributed (Delta + o(Delta))-Edge-Coloring, and Vertex-Coloring of Graphs with Bounded Diversity. | Leonid Barenboim, Michael Elkin, Tzalik Maimon |
| 2017 | PODC | A Simple Deterministic Distributed MST Algorithm, with Near-Optimal Time and Message Complexities. | Michael Elkin |
| 2017 | SODA | Efficient Algorithms for Constructing Very Sparse Spanners and Emulators. | Michael Elkin, Ofer Neiman |
| 2017 | STOC | Distributed exact shortest paths in sublinear time. | Michael Elkin |
| 2016 | FOCS | Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths. | Michael Elkin, Ofer Neiman |
| 2016 | PODC | Distributed Strong Diameter Network Decomposition: Extended Abstract. | Michael Elkin, Ofer Neiman |
| 2016 | PODC | On Efficient Distributed Construction of Near Optimal Routing Schemes: Extended Abstract. | Michael Elkin, Ofer Neiman |
| 2015 | SODA | A Linear-Size Logarithmic Stretch Path-Reporting Distance Oracle for General Graphs. | Michael Elkin, Seth Pettie |
| 2015 | SODA | (2Δ - l)-Edge-Coloring is Much Easier than Maximal Matching in the Distributed Setting. | Michael Elkin, Seth Pettie, Hsin-Hao Su |
| 2015 | STOC | Prioritized Metric Structures and Embedding. | Michael Elkin, Arnold Filtser, Ofer Neiman |
| 2015 | SIROCCO | A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation - (Extended Abstract). | Leonid Barenboim, Michael Elkin, Cyril Gavoille |
| 2014 | ICALP | Light Spanners. | Michael Elkin, Ofer Neiman, Shay Solomon |
| 2014 | PODC | Can quantum communication speed up distributed computation? | Michael Elkin, Hartmut Klauck, Danupon Nanongkai, Gopal Pandurangan |
| 2013 | SODA | Fast Constructions of Light-Weight Spanners for General Graphs. | Michael Elkin, Shay Solomon |
| 2013 | STOC | Optimal euclidean spanners: really short, thin and lanky. | Michael Elkin, Shay Solomon |
| 2012 | FOCS | The Locality of Distributed Symmetry Breaking. | Leonid Barenboim, Michael Elkin, Seth Pettie, Johannes Schneider |
| 2011 | FOCS | Steiner Shallow-Light Trees are Exponentially Lighter than Spanning Ones. | Michael Elkin, Shay Solomon |
| 2011 | PODC | Distributed deterministic edge coloring using bounded neighborhood independence. | Leonid Barenboim, Michael Elkin |
| 2010 | ESA | Balancing Degree, Diameter and Weight in Euclidean Spanners. | Shay Solomon, Michael Elkin |
| 2010 | PODC | Deterministic distributed vertex coloring in polylogarithmic time. | Leonid Barenboim, Michael Elkin |
| 2010 | SODA | An Improved Construction of Progression-Free Sets. | Michael Elkin |
| 2009 | ESA | Narrow-Shallow-Low-Light Trees with and without Steiner Points. | Michael Elkin, Shay Solomon |
| 2009 | STOC | Distributed (delta+1)-coloring in linear (in delta) time. | Leonid Barenboim, Michael Elkin |
| 2008 | FOCS | Shallow-Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners. | Yefim Dinitz, Michael Elkin, Shay Solomon |
| 2008 | PODC | Sublogarithmic distributed MIS algorithm for sparse graphs using nash-williams decomposition. | Leonid Barenboim, Michael Elkin |
| 2007 | ICALP | Streaming and Fully Dynamic Centralized Algorithms for Constructing and Maintaining Sparse Spanners. | Michael Elkin |
| 2007 | PODC | A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners. | Michael Elkin |
| 2005 | SODA | Sparse source-wise and pair-wise distance preservers. | Don Coppersmith, Michael Elkin |
| 2005 | SODA | Improved schedule for radio broadcast. | Michael Elkin, Guy Kortsarz |
| 2005 | STOC | Lower-stretch spanning trees. | Michael Elkin, Yuval Emek, Daniel A. Spielman, Shang-Hua Teng |
| 2004 | PODC | Efficient algorithms for constructing (1+, varepsilon;, beta)-spanners in the distributed and streaming models. | Michael Elkin, Jian Zhang |
| 2004 | SODA | A faster distributed protocol for constructing a minimum spanning tree. | Michael Elkin |
| 2004 | STOC | Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem. | Michael Elkin |
| 2003 | ICALP | Approximation Algorithm for Directed Telephone Multicast Problem. | Michael Elkin, Guy Kortsarz |
| 2003 | SODA | Sparse distance preservers and additive spanners. | Bla Bollobs, Don Coppersmith, Michael Elkin |
| 2003 | SODA | Sublogarithmic approximation for telephone multicast: path out of jungle. | Michael Elkin, Guy Kortsarz |
| 2002 | STOC | Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem. | Michael Elkin, Guy Kortsarz |
| 2001 | IPCO | Approximating k-Spanner Problems for k>2. | Michael Elkin, David Peleg |
| 2001 | PODC | Computing almost shortest paths. | Michael Elkin |
| 2001 | STOC | (1+epsilon, beta)-spanner constructions for general graphs. | Michael Elkin, David Peleg |
| 2001 | SIROCCO | The Client-Server 2-Spanner Problem with Applications to Network Design. | Michael Elkin, David Peleg |
| 2000 | ICALP | Strong Inapproximability of the Basic | Michael Elkin, David Peleg |
| 2000 | STACS | The Hardness of Approximating Spanner Problems. | Michael Elkin, David Peleg |