Author of the publication

Designing Broadcasting Algorithms in the Postal Model for Message-Passing Systems.

, and . SPAA, page 13-22. ACM, (1992)

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

Scheduling Techniques for Media-on-Demand., , and . Algorithmica, 52 (4): 413-439 (2008)Windows scheduling as a restricted version of bin packing., , and . ACM Trans. Algorithms, 3 (3): 28 (2007)Sensor-mission assignment in wireless sensor networks., , , , , and . ACM Trans. Sens. Networks, 6 (4): 36:1-36:33 (2010)Quantifying the Strength of the Friendship Paradox., , , , and . COMPLEX NETWORKS (2), volume 813 of Studies in Computational Intelligence, page 460-472. Springer, (2018)A study on the friendship paradox - quantitative analysis and relationship with assortative mixing., , , , and . Appl. Netw. Sci., 4 (1): 71 (2019)Competitive on-line stream merging algorithms for media-on-demand., and . J. Algorithms, 48 (1): 59-90 (2003)Sharing Memory Robustly in Message-Passing Systems., , and . PODC, page 363-375. ACM, (1990)Fast Deflection Routing for Packets and Worms (Extended Summary)., , , and . PODC, page 75-86. ACM, (1993)Bandwidth allocation with preemption., , , , and . STOC, page 616-625. ACM, (1995)Sum Multi-coloring of Graphs., , , , and . ESA, volume 1643 of Lecture Notes in Computer Science, page 390-401. Springer, (1999)