Author of the publication

Random Knapsack in Expected Polynomial Time

, and . Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, page 232--241. New York, NY, USA, ACM, (2003)
DOI: 10.1145/780542.780578

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

How Asymmetry Helps Load Balancing. J. ACM, 50 (4): 568--589 (July 2003)Random Knapsack in Expected Polynomial Time, and . Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, page 232--241. New York, NY, USA, ACM, (2003)Probabilistic analysis of knapsack core algorithms, and . Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, page 468--477. Philadelphia, PA, USA, Society for Industrial and Applied Mathematics, (2004)Balanced Allocations: The Heavily Loaded Case, , , and . SIAM J. Comput., 35 (6): 1350--1385 (January 2006)Smoothed Analysis of Integer Programming, and . Math. Program., 110 (1): 21--56 (March 2007)