- The Hardness of Approximating Spanner Problems Michael Elkin # David Peleg +
- Private Approximation of NPhard Functions [Extended Abstract]
- Combinatorial Logarithmic Approximation Algorithm for Directed Telephone Broadcast Problem
- An Approximation Algorithm for the Directed Telephone Multicast Problem #
- Distributed Computing manuscript No. (will be inserted by the editor)
- Linear Lower Bounds on RealWorld Implementations of Concurrent Objects
- A Faster Distributed Protocol for Constructing a Minimum Spanning Tree
- Sparse Sourcewise and Pairwise Distance Preservers Extended Abstract
- An Improved Construction of Progression-Free Sets Michael Elkin
- Approximating kSpanner Problems for k ? 2 Michael Elkin \Lambda David Peleg \Lambda y
- Sublogarithmic Approximation for Telephone Multicast: Path out of Jungle
- Approximating Graph Metric by Spanning Trees (2005; Elkin, Emek, Spielman, Teng)
- SPARSE SOURCEWISE AND PAIRWISE DISTANCE PRESERVERS DON COPPERSMITH # AND MICHAEL ELKIN +
- Computing Almost Shortest Paths Michael Elkin y
- (1 + #, #)Spanner Constructions for General Graphs
- Narrow-Shallow-Low-Light Trees with and without Steiner Points
- Constant-RMR Implementations of CAS and Other Synchronization Primitives Using Read and Write
- An improved algorithm for radio broadcast Michael Elkin #+ Guy Kortsarz #
- Noname manuscript No. (will be inserted by the editor)
- Distributed Deterministic Edge Coloring using Bounded Neighborhood Independence
- Balancing Degree, Diameter and Weight in Euclidean Spanners
- An Improved Construction of Progression-Free Sets Michael Elkin
- Shallow-Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners
- A Near-Optimal Distributed Fully Dynamic Algorithm for Maintaining Sparse Spanners
- An Improved Construction of Progression-Free Sets
- A combinatorial logarithmic approximation algorithm for the directed telephone broadcast problem
- PEDS: A Parallel Error Detection Scheme for TCAM Devices
- Deterministic Distributed Vertex Coloring in Polylogarithmic Time
- The Hardness of Approximating Spanner Michael Elkin ? and David Peleg ??
- A Faster Distributed Protocol for Constructing a Minimum Spanning Tree #
- Unconditional Lower Bounds on the TimeApproximation Tradeoffs for the
- Private Approximation of NP-hard Functions [Extended Abstract]
- New Length Bounds for Cycle Bases # Michael Elkin a Christian Liebchen b Romeo Rizzi c,#
- Sparse Distance Preservers and Additive Spanners 1 Bela Bollobas #+# Don Coppersmith Michael Elkin ###
- ACM SIGACT News Distributed Computing Column 16 Sergio Rajsbaum #
- Adaptive Randomized Mutual Exclusion in Sub-Logarithmic Expected Time
- The Complexity of Obstruction-Free Implementations
- Synchronizers, Spanners (1985; Awerbuch)
- On an Infinite Family of Solvable Hanoi Graphs DANY AZRIEL, NOAM SOLOMON, AND SHAY SOLOMON
- Polylogarithmic Inapproximability of the Radio Broadcast Problem
- Polylogarithmic Additive Inapproximability of the Radio Broadcast Problem
- AN UNCONDITIONAL LOWER BOUND ON THE TIMEAPPROXIMATION TRADEOFF FOR THE
- Novel Algorithms for the Network Lifetime Problem in Wireless Settings
- CAR-STM: Scheduling-Based Collision Avoidance and Resolution for Software Transactional Memory
- On the Impact of Serializing Contention Management on STM Performance
- Time and Space Lower Bounds for Implementations Using k-CAS
- Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rules
- Streaming and Fully Dynamic Centralized Algorithms for Constructing and Maintaining
- Sparse Graph Spanners (2005; Elkin, Peleg)
- An improved algorithm for radio broadcast (Extended abstract)
- Computing Almost Shortest Paths \Lambda Michael Elkin \Lambda
- Distributed Computing manuscript No. (will be inserted by the editor)
- Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners
- On Optimal Solutions for the Bottleneck Tower of Hanoi Problem
- A Scalable Lock-free Stack Algorithm Danny Hendler
- Bounded-Wait Combining: Constructing Robust and High-Throughput Shared Objects
- Distrib. Comput. (2005) DOI 10.1007/s00446-005-0144-5
- Tight RMR Lower Bounds for Mutual Exclusion and Other Problems
- Space-Efficient TCAM-based Classification Using Gray Coding
- On the Inherent Weakness of Conditional Synchronization Department of
- Work Dealing [Extended Abstract]
- Solo-Valency and the Cost of Coordination Danny Hendler
- Randomized Mutual Exclusion in O(log N / log log N) RMRs [Extended Abstract]
- Distributed ( + 1)-Coloring in Linear (in ) Time Leonid Barenboim
- Narrow-Shallow-Low-Light Trees with and without Steiner Points
- Streaming and Fully Dynamic Centralized Algorithms for Constructing and Maintaining
- LowerStretch Spanning Trees Michael Elkin #
- Logarithmic Inapproximability of the Radio Broadcast Problem
- Sublogarithmic Distributed MIS Algorithm for Sparse Graphs using Nash-Williams Decomposition
- Optimality of an Algorithm Solving the Bottleneck Tower of Hanoi Problem
- An O(1) RMRs Leader Election Algorithm Wojciech Golab
- Flat Combining and the Synchronization-Parallelism Danny Hendler
- Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners
- Synchronizing without Locks is Inherently Expensive Hagit Attiya
- Non-Blocking Steal-Half Work Queues Danny Hendler
- CCCG 2011, Toronto ON, August 1012, 2011 Optimizing Budget Allocation in Graphs
- Steiner Shallow-Light Trees are Exponentially Lighter than Spanning Ones
- Combinatorial Algorithms for Distributed Graph Leonid Barenboim
- Noname manuscript No. (will be inserted by the editor)
- Deterministic Distributed Vertex Coloring in Polylogarithmic Time