Exponentially small bounds on the expected optimum of the partition and subset sum problems

Sharp threshold and scaling window for the integer partitioning problem

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing

A physicist's approach to number partitioning

Theoretical Computer Science - Phase transitions in combinatorial problems

Random knapsack in expected polynomial time

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing

Probabilistic analysis of knapsack core algorithms

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms

Typical properties of winners and losers in discrete optimization

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing

Random knapsack in expected polynomial time

Journal of Computer and System Sciences - Special issue: STOC 2003

Proof of the local REM conjecture for number partitioning. II. Growing energy scales

Random Structures & Algorithms