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

A note on models for non-probabilistic analysis of packet switching networks.. Inf. Process. Lett., 84 (5): 237-240 (2002)Tight bounds for the performance of Longest In System on DAGs., and . J. Algorithms, 55 (2): 101-112 (2005)Distributed Approximate Matching., , and . SIAM J. Comput., 39 (2): 445-460 (2009)Semi-Streaming Set Cover., and . CoRR, (2014)New stability results for adversarial queuing., , and . SPAA, page 192-199. ACM, (2002)Rate vs. buffer size: greedy information gathering on the line., and . SPAA, page 305-314. ACM, (2007)A Randomness-Rounds Tradeoff in Private Computation., and . SIAM J. Discret. Math., 11 (1): 61-80 (1998)Online Budgeted Maximum Coverage., and . ESA, volume 57 of LIPIcs, page 73:1-73:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Online time-constrained scheduling in linear networks., , and . INFOCOM, page 855-865. IEEE, (2005)Sublinear Random Access Generators for Preferential Attachment Graphs., , , and . ACM Trans. Algorithms, 17 (4): 28:1-28:26 (2021)