Author of the publication

Packet Routing and Job-Shop Scheduling in O(Congestion + Dilation) Steps.

, , and . Combinatorica, 14 (2): 167-186 (1994)

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

Approximation Algorithms for Steiner and Directed Multicuts., , , and . J. Algorithms, 22 (2): 241-269 (1997)Portable and Efficient Parallel Computing Using the BSP Model., , , , and . IEEE Trans. Computers, 48 (7): 670-689 (1999)On the tandem duplication-random loss model of genome rearrangement., , , and . SODA, page 564-570. ACM Press, (2006)Distributed algorithms for multicommodity flow problems via approximate steepest descent framework., , and . SODA, page 949-957. SIAM, (2007)Geometry, flows, and graph-partitioning algorithms., , and . Commun. ACM, 51 (10): 96-105 (2008)Finding Near-Optimal Cuts: An Empirical Evaluation., and . SODA, page 212-221. ACM/SIAM, (1993)New Absolute Fast Converging Phylogeny Estimation Methods with Improved Scalability and Accuracy., , and . WABI, volume 113 of LIPIcs, page 8:1-8:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Beyond Gaussians: Spectral Methods for Learning Mixtures of Heavy-Tailed Distributions., and . COLT, page 21-32. Omnipress, (2008)Learning Mixtures of Product Distributions Using Correlations and Independence., and . COLT, page 9-20. Omnipress, (2008)Universal Packet Routing Algorithms (Extended Abstract), , and . FOCS, page 256-269. IEEE Computer Society, (1988)