( en | de | ru )

 

Disambiguation of "Barenboim, Leonid"

Author of the publication

copydeleteadd this publication to your clipboard
Deterministic (Δ + 1)-Coloring in Sublinear (in Δ) Time in Static, Dynamic and Faulty Networks.

. PODC, page 345-354. ACM, (2015)

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.

Leonid Mytnik

Leonid Tzibrouk

Leonid Rothe

Leonid Bock

Leonid Mindel

 

Other publications of authors with the same name

Deterministic distributed vertex coloring in polylogarithmic time., and . PODC, page 410-419. ACM, (2010)Combinatorial Algorithms for Distributed Graph Coloring., and . DISC, volume 6950 of Lecture Notes in Computer Science, page 66-81. Springer, (2011)Load-Balancing Adaptive Clustering Refinement Algorithm for Wireless Sensor Network Clusters., , and . WWIC, volume 10372 of Lecture Notes in Computer Science, page 157-173. Springer, (2017)Secured Distributed Algorithms Without Hardness Assumptions., and . OPODIS, volume 184 of LIPIcs, page 32:1-32:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Fast Distributed Algorithms for Maximal Matching and Maximal Independent Set, , , and . CoRR, (2012)Fast Distributed Backup Placement in Sparse and Dense Networks., and . APOCS, page 90-104. SIAM, (2020)Distributed deterministic edge coloring using bounded neighborhood independence., and . PODC, page 129-138. ACM, (2011)Deterministic (Δ + 1)-Coloring in Sublinear (in Δ) Time in Static, Dynamic and Faulty Networks.. PODC, page 345-354. ACM, (2015)Sublogarithmic distributed MIS algorithm for sparse graphs using nash-williams decomposition., and . PODC, page 25-34. ACM, (2008)On the Locality of Some NP-Complete Problems.. ICALP (2), volume 7392 of Lecture Notes in Computer Science, page 403-415. Springer, (2012)