Travelled to:1 × Canada
1 × Denmark
1 × Greece
1 × Poland
1 × Switzerland
1 × The Netherlands
5 × USA
Collaborated with:∅ G.Kortsarz D.Peleg S.Solomon O.Neiman L.Barenboim A.Filtser Y.Emek D.A.Spielman S.Teng
Talks about:spanner (5) problem (4) algorithm (3) approxim (3) distribut (2) construct (2) telephon (2) direct (2) lower (2) delta (2)
Person: Michael Elkin
DBLP: Elkin:Michael
Contributed to:
2015
2014201320092007200520042003200220012000Wrote 11 papers:
- STOC-2015-ElkinFN #metric
- Prioritized Metric Structures and Embedding (ME, AF, ON), pp. 489–498.
- ICALP-v1-2014-ElkinNS
- Light Spanners (ME, ON, SS), pp. 442–452.
- STOC-2013-ElkinS
- Optimal euclidean spanners: really short, thin and lanky (ME, SS), pp. 645–654.
- STOC-2009-BarenboimE #distributed #linear
- Distributed (delta+1)-coloring in linear (in delta) time (LB, ME), pp. 111–120.
- ICALP-2007-Elkin #algorithm #maintenance #streaming
- Streaming and Fully Dynamic Centralized Algorithms for Constructing and Maintaining Sparse Spanners (ME), pp. 716–727.
- STOC-2005-ElkinEST
- Lower-stretch spanning trees (ME, YE, DAS, SHT), pp. 494–503.
- STOC-2004-Elkin #approximate #bound #distributed #problem #trade-off
- Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem (ME), pp. 331–340.
- ICALP-2003-ElkinK #algorithm #approximate #multi #problem
- Approximation Algorithm for Directed Telephone Multicast Problem (ME, GK), pp. 212–223.
- STOC-2002-ElkinK #algorithm #approximate #combinator #problem
- Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem (ME, GK), pp. 438–447.
- STOC-2001-ElkinP #graph
- (1+ε,β)-Spanner Constructions for General Graphs (ME, DP), pp. 173–182.
- ICALP-2000-ElkinP #problem
- Strong Inapproximability of the Basic k-Spanner Problem (ME, DP), pp. 636–647.