1. I. Adler, The expected number of pivots needed to solve parametric linear programs and the efficiency of the self-dual simplex method, Technical Report, University of California at Berkeley, May 1983
2. Maximum diameter of abstract polytopes;Adler;Mathematical Programming Study,1974
3. Existence of A-avoiding paths in abstract polytopes;Adler;Mathematical Programming Study,1974
4. I. Adler, V. Koltun, On the relation between arrangement polytopes and the simplex method, Working paper, 2007
5. A simplex variant solving an mXd linear program in O(min(M2,d2)) expected number of pivot steps;Adler;Journal of Complexity,1987