- Zvi Galil and Nimrod Megiddo. A fast selection algorithm and the
problem of optimum distribution of effort. Journal of the
ACM, 26(1):58-64, January 1979.
- Nimrod Megiddo. Applying
parallel computation algorithms in the design of serial algorithms.
Journal of the ACM, 30(4):852-865, October 1983.
- Nimrod Megiddo. Linear
programming in linear time when the dimension is fixed.
Journal of the ACM, 31(1):114-127, January 1984.
- Ilan Adler and Nimrod Megiddo. A simplex algorithm whose average
number of steps is bounded between two quadratic functions of the
smaller dimension. Journal of the ACM, 32(4):871-895,
- N. Megiddo, S. L. Hakimi, M. R. Garey, D. S. Johnson, and C. H.
complexity of searching a graph. Journal of the ACM,
35(1):18-44, January 1988.
- Edith Cohen and Nimrod Megiddo. Strongly polynomial-time and NC
algorithms for detecting cycles in periodic graphs. Journal of
the ACM, 40(4):791-830, September 1993.
- Noga Alon and Nimrod Megiddo. Parallel linear programming in fixed
dimension almost surely in constant time. Journal of the
ACM, 41(2):422-434, March 1994.