#### Filter Results:

- Full text PDF available (35)

#### Publication Year

1995

2019

- This year (7)
- Last 5 years (47)
- Last 10 years (88)

#### Supplemental Content

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Leonid Barenboim, Michael Elkin
- Distributed Computing
- 2009

We study the distributed maximal independent set (henceforth, MIS) problem on sparse graphs. Currently, there are known algorithms with a sublogarithmic running time for this problem on oriented… (More)

- Michael Elkin
- PODC
- 2001

We study the s-sources almost shortest paths (shortly, s-ASP) problem. Given an unweighted graph G = (V, E), and a subset S n V of s nodes, the goal is to compute almost shortest paths between all… (More)

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

We show that every weighted connected graph $G$ contains as a subgraph a spanning tree into which the edges of $G$ can be embedded with average stretch $O (\log^{2} n \log \log n)$. Moreover, we show… (More)

The distributed (∆ + 1)-coloring problem is one of most fundamental and well-studied problems in Distributed Algorithms. Starting with the work of Cole and Vishkin in 86, there was a long line of… (More)

We present new bounds on the locality of several classical symmetry breaking tasks in distributed networks. A sampling of the results include \begin{enumerate} \item A randomized algorithm for… (More)

- Leonid Barenboim, Michael Elkin
- Distributed Graph Coloring: Fundamentals and…
- 2013

The focus of this monograph is on symmetry breaking problems in the message-passing model of distributed computing. In this model a communication network is represented by a n-vertex graph G = (V,E),… (More)

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

Consider an n-vertex graph G = (V, E) of maximum degree Δ, and suppose that each vertex v ∈ V hosts a processor. The processors are allowed to communicate only with their neighbors in G. The… (More)

- Michael Elkin
- SODA
- 2004

This paper studies the problem of constructing a <i>minimum-weight spanning tree (MST)</i> in a distributed network. This is one of the most important problems in the area of distributed computing.… (More)

- Israel Vlodavsky, Phillip Beckhove, +4 authors Michael Elkin
- Cancer Microenvironment
- 2011

Heparan sulfate proteoglycans (HSPGs) are primary components at the interface between virtually every eukaryotic cell and its extracellular matrix. HSPGs not only provide a storage depot for… (More)

- Michael Elkin, David Peleg
- STOC
- 2001

An <italic>(α,Β)</italic>-spanner of a graph <italic>G</italic> is a subgraph <italic>H</italic> such that <italic>d_H(u,w)\le &agr\cdot d_G(u,w)+&Bgr</italic> for every pair of vertices… (More)