1. Improved time bounds for the maximum flow problem;Ahuja,1988
2. On the Markov chain simulation method for uniform combinatorial distributions and simulated annealing;Aldous;Probab. in Eng. and Inform. Sci.,1987
3. Eigenvalues and expanders;Alon;Combinatorica,1986
4. How hard is it to marry at random? (On the approximation of the permanent);Broder;Proc. 18th Ann. Symp. on Theoory of Computing,1986
5. Errata Section;Broder;Proc. 20th Ann. Symp. on Theory of Computing,1988