Almost random graphs with simple hash functions (2003)

by Martin Dietzfelbinger, Philipp Woelfel
Venue:In Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC