1. “The Expected Number of Pivots Needed to Solve Parametric Linear Programs and the Efficiency of the Self-Dual Simplex Method,”;Adler,1983
2. Adler, I., R. Karp, and R. Shamir (1983a), “A Family of Simplex Variants Solving an m × d Linear Program in Expected Number of Pivot Steps Depending On d Only,” Report No. UCB/CSD 83/157, Computer Science Division, University of California, Berkeley, CA.
3. Adler, I., R. M. Karp, and R. Shamir (1983b), “A Simplex Variant Solving An m × d Linear Program in 0(min(m2,d2)) Expected Number of Pivot Steps,” Report UCB/CSD 83/158, Computer Science Division, University of California, Berkeley, CA.
4. “A Simplex Algorithm Whose Average Number of Steps is Bounded between Two Quadratic Functions of Smaller Dimension,”;Adler;Journal of the Association for Computing Machinery,1984
5. The Design and Analysis of Computer Algorithms;Aho,1974