Author of the publication

Sublinear Random Access Generators for Preferential Attachment Graphs.

, , , and . ICALP, volume 80 of LIPIcs, page 6:1-6:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

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

Spreading Metric Based Graph Partitioning Algorithms., , , and . PPSC, SIAM, (1997)Divide-and-conquer approximation algorithms via spreading metrics, , , and . Journal of the ACM, 47 (4): 585―616 (2000)Better Deterministic Online Packet Routing on Grids., , and . SPAA, page 284-293. ACM, (2015)Revisiting Randomized Parallel Load Balancing Algorithms., and . SIROCCO, volume 5869 of Lecture Notes in Computer Science, page 209-221. Springer, (2009)Optimal Conclusive Sets for Comparator Networks., , and . SIROCCO, volume 4474 of Lecture Notes in Computer Science, page 304-317. Springer, (2007)Embedding Interconnection Networks in Grids via the Layered Cross Product., and . CIAC, volume 1203 of Lecture Notes in Computer Science, page 3-12. Springer, (1997)Scheduling of a Smart Antenna: Capacitated Coloring of Unit Circular-Arc Graphs., and . CAAN, volume 4235 of Lecture Notes in Computer Science, page 58-71. Springer, (2006)Local-optimality guarantees for optimal decoding based on paths., and . ISTC, page 205-209. IEEE, (2012)Linear-programming decoding of Tanner codes with local-optimality certificates., and . ISIT, page 2686-2690. IEEE, (2012)Sublinear Random Access Generators for Preferential Attachment Graphs., , , and . ICALP, volume 80 of LIPIcs, page 6:1-6:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)