Author of the publication

Tight Bounds on the Complexity of Parallel Sorting

. Proceedings of the Sixteenth Annual ACM Symposium on Theory of Computing, page 71--80. New York, NY, USA, ACM, (1984)
DOI: 10.1145/800057.808667

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

Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks., and . STOC, page 487-496. ACM, (1994)Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web, , , , , and . Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, page 654--663. New York, NY, USA, ACM, (1997)Secure spread spectrum watermarking for images, audio and video., , , and . ICIP (3), page 243-246. IEEE Computer Society, (1996)Semi-oblivious routing: lower bounds., , and . SODA, page 929-938. SIAM, (2007)Semi-oblivious routing., , and . SPAA, page 234. ACM, (2006)Hypercubic Sorting Networks, and . SIAM Journal on Computing, 27 (1): 1--47 (February 1998)Tight Bounds on the Complexity of Parallel Sorting. Proceedings of the Sixteenth Annual ACM Symposium on Theory of Computing, page 71--80. New York, NY, USA, ACM, (1984)Correction: Basic Network Creation Games., , , , and . SIAM J. Discret. Math., 28 (3): 1638-1640 (2014)Improving performance on the internet.. Commun. ACM, 52 (2): 44-51 (2009)Basic network creation games., , , and . SPAA, page 106-113. ACM, (2010)