Author of the publication

Efficient algorithms for constructing (1+epsilon, beta)-spanners in the distributed and streaming models.

, and . Distributed Comput., 18 (5): 375-385 (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Combinatorial Algorithms for Distributed Graph Coloring., and . DISC, volume 6950 of Lecture Notes in Computer Science, page 66-81. Springer, (2011)Light Spanners., , and . ICALP (1), volume 8572 of Lecture Notes in Computer Science, page 442-452. Springer, (2014)Strong Inapproximability of the Basic k-Spanner Problem., and . ICALP, volume 1853 of Lecture Notes in Computer Science, page 636-647. Springer, (2000)Narrow-Shallow-Low-Light Trees with and without Steiner Points., and . ESA, volume 5757 of Lecture Notes in Computer Science, page 215-226. Springer, (2009)A near-optimal fully dynamic distributed algorithm for maintaining sparse spanners. CoRR, (2006)Deterministic Distributed (Delta + o(Δ))-Edge-Coloring, and Vertex-Coloring of Graphs with Bounded Diversity., , and . CoRR, (2016)An improved algorithm for radio broadcast., and . ACM Trans. Algorithms, 3 (1): 8:1-8:21 (2007)Prioritized Metric Structures and Embedding., , and . SIAM J. Comput., 47 (3): 829-858 (2018)Optimal euclidean spanners: really short, thin and lanky., and . STOC, page 645-654. ACM, (2013)Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem., and . STOC, page 438-447. ACM, (2002)