Author of the publication

Near-Optimal Distributed Implementations of Dynamic Algorithms for Symmetry Breaking Problems.

, , and . ITCS, volume 215 of LIPIcs, page 7:1-7:25. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)

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.

No persons found for author name Solomon, Shay
add a person with the name Solomon, Shay
 

Other publications of authors with the same name

An Optimal-Time Construction of Sparse Euclidean Spanners with Tiny Diameter.. SODA, page 820-839. SIAM, (2011)Steiner Shallow-Light Trees are Exponentially Lighter than Spanning Ones., and . FOCS, page 373-382. IEEE Computer Society, (2011)Steiner Shallow-Light Trees Are Exponentially Lighter than Spanning Ones., and . SIAM J. Comput., 44 (4): 996-1025 (2015)Fast Constructions of Light-Weight Spanners for General Graphs, and . CoRR, (2012)Improved Dynamic Graph Coloring., and . CoRR, (2019)The Tower of Hanoi problem on Pathh graphs, , and . CoRR, (2011)Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rules., and . ISAAC, volume 4288 of Lecture Notes in Computer Science, page 36-47. Springer, (2006)Balancing Degree, Diameter and Weight in Euclidean Spanners., and . ESA (1), volume 6346 of Lecture Notes in Computer Science, page 48-59. Springer, (2010)Improved Dynamic Graph Coloring., and . ESA, volume 112 of LIPIcs, page 72:1-72:16. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2018)When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time., and . ICALP, volume 132 of LIPIcs, page 17:1-17:17. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2019)