( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Sublinear Random Access Generators for Preferential Attachment Graphs.

, , , и . ICALP, том 80 из LIPIcs, стр. 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.

Jonas Rosén

Adi Heindl

Adi Palm

Adi Winteler

Adi Wibisono

 

Другие публикации лиц с тем же именем

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., и . J. Algorithms, 55 (2): 101-112 (2005)A Randomness-Rounds Tradeoff in Private Computation., и . SIAM J. Discret. Math., 11 (1): 61-80 (1998)On-Line Competitive Algorithms for Call Admission in Optical Networks., , , , и . Algorithmica, 31 (1): 29-43 (2001)Online algorithms with advice for bin packing and scheduling problems., , и . Theor. Comput. Sci., (2015)New stability results for adversarial queuing., , и . SPAA, стр. 192-199. ACM, (2002)Rate vs. buffer size: greedy information gathering on the line., и . SPAA, стр. 305-314. ACM, (2007)Online time-constrained scheduling in linear networks., , и . INFOCOM, стр. 855-865. IEEE, (2005)Online Budgeted Maximum Coverage., и . ESA, том 57 из LIPIcs, стр. 73:1-73:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Random Sources in Private Computation., и . ASIACRYPT (1), том 13791 из Lecture Notes in Computer Science, стр. 443-473. Springer, (2022)