Average case analysis of a heuristic for the assignment problem

Paul Erdös (1913-996): his influence on the theory of computing

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing

Constructive Bounds and Exact Expectations for the Random Assignment Problem

RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science

Selected topics on assignment problems

Discrete Applied Mathematics

Existence of a perfect matching in a random (1 +e-1)--out bipartite graph

Journal of Combinatorial Theory Series B

Proofs of the Parisi and Coppersmith-Sorkin random assignment conjectures

Random Structures & Algorithms

Algorithmic methodologies for ultra-efficient inexact architectures for sustaining technology scaling

Proceedings of the 9th conference on Computing Frontiers

What to do about the end of Moore's law, probably!

Proceedings of the 49th Annual Design Automation Conference