1. Adler I., Karp R.M. and Shamir R. (1983): A family of simplex variants solving an n x d linear program in O(minn2, d2) expected number of pivot steps, University of California, Computer Science Division, Berkeley.
2. Adler I. and Megiddo N. (1983): A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension, Department of Industrial Engineering and Operations Research, University of California, Berkeley.
3. Adler I., Megiddo N. and Todd M.J. (1984): New results on the average behavior of simplex algorithms Bulletin of the American Mathematical Society 11, 378–82.
4. Ahn S., Cooper C., Cornuéjols G. and Frieze A.M. (1988): Probabilistic analysis of a relaxation for the k-median problem, Mathematics of Operations Research 13, 1–31.
5. Alon N. and Kahale N. (1994): A spectral technique for coloring random 3-colorable graphs, Proceedings of the 26th Annual ACM Symposium on Theory of Computing, 346–355.