Michael Elkin
- The Locality of Distributed Symmetry Breaking
2016/06/28 by Leonid Barenboim, Michael Elkin, Seth Pettie +1 · 12 citations
Computer Science · #Complexity and Algorithms in Graphs #Optimization and Search Problems #Cryptography and Data Security
- An Improved Construction of Progression-Free Sets
2008/01/28 by Michael Elkin, Elkin, Michael · 1 voice · 2 citations
Computer Science · #math.NT #math.GM
- Hopsets with Constant Hopbound, and Applications to Approximate Shortest\n Paths
2016/05/15 by Michael Elkin, Elkin, Michael, Ofer Neiman +1 · 4 citations
Computer Science · Mathematics · #Complexity and Algorithms in Graphs #Advanced Graph Theory Research #Limits and Structures in Graph Theory
- Lower-Stretch Spanning Trees
2004/11/17 by Michael Elkin, Yuval Emek, Elkin, Michael +5 · 3 citations
Computer Science · #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences #G.2.2 #cs.DM #cs.DS
- Deterministic Distributed Vertex Coloring in Polylogarithmic Time
2010/03/08 by Leonid Barenboim, Barenboim, Leonid, Michael Elkin +1 · 3 citations
Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Cryptography and Data Security #Distributed #FOS: Computer and information sciences #Parallel #and Cluster Computing (cs.DC)
- Deterministic Distributed Vertex Coloring in Polylogarithmic Time
2011/10/01 by Leonid Barenboim, Michael Elkin · 5 citations
Computer Science · #Complexity and Algorithms in Graphs #Cryptography and Data Security #Advanced Graph Theory Research
- Optimal Euclidean spanners: really short, thin and lanky
2012/07/07 by Michael Elkin, Shay Solomon, Elkin, Michael +1 · 3 citations
Computer Science · Engineering · #Advanced Numerical Analysis Techniques #Computational Geometry and Mesh Generation #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
- Shallow, Low, and Light Trees, and Tight Lower Bounds for Euclidean Spanners
2008/01/23 by Yefim Dinitz, Michael Elkin, Dinitz, Yefim +3 · 2 citations
Computer Science · #Complexity and Algorithms in Graphs #Computational Geometry (cs.CG) #Computational Geometry and Mesh Generation #Data Management and Algorithms #Data Structures and Algorithms (cs.DS) #F.2.2 #F.2.3 #FOS: Computer and information sciences #G.2.2
- Distributed Deterministic Edge Coloring using Bounded Neighborhood Independence
2010/10/12 by Leonid Barenboim, Michael Elkin, Barenboim, Leonid +1 · 1 citation
Computer Science · #Complexity and Algorithms in Graphs #Cryptography and Data Security #Distributed #FOS: Computer and information sciences #Optimization and Search Problems #Parallel #and Cluster Computing (cs.DC)
- Distributed (Δ+1)-Coloring in Linear (in Δ) Time
2014/01/01 by Leonid Barenboim, Michael Elkin, Fabian Kuhn · 1 citation
Computer Science · #Complexity and Algorithms in Graphs #Cryptography and Data Security #Optimization and Search Problems
- Balancing Degree, Diameter and Weight in Euclidean Spanners
2011/08/30 by Shay Solomon, Michael Elkin, Solomon, Shay +1 · 1 citation
Computer Science · Engineering · #Complexity and Algorithms in Graphs #Computational Geometry (cs.CG) #Computational Geometry and Mesh Generation #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Vehicle License Plate Recognition
- Path-Reporting Distance Oracles with Logarithmic Stretch and Size O(n loglog n)
2023/04/10 by Michael Elkin, Elkin, Michael, Idan Shabat +1 · 1 citation
Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Cryptography and Data Security #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences