( en | de | ru )

 

Disambiguation of "Rosén, Adi"

Author of the publication

copydeleteadd this publication to your clipboard
Rate vs. buffer size: greedy information gathering on the line.

, and . SPAA, page 305-314. ACM, (2007)

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.

Jonas Rosén

Adi Heindl

Adi Palm

Adi Winteler

Adi Wibisono

 

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)A Randomness-Rounds Tradeoff in Private Computation., and . SIAM J. Discret. Math., 11 (1): 61-80 (1998)On-Line Competitive Algorithms for Call Admission in Optical Networks., , , , and . Algorithmica, 31 (1): 29-43 (2001)Online algorithms with advice for bin packing and scheduling problems., , and . Theor. Comput. Sci., (2015)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)Online time-constrained scheduling in linear networks., , and . INFOCOM, page 855-865. IEEE, (2005)Online Budgeted Maximum Coverage., and . ESA, volume 57 of LIPIcs, page 73:1-73:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Random Sources in Private Computation., and . ASIACRYPT (1), volume 13791 of Lecture Notes in Computer Science, page 443-473. Springer, (2022)