John H. Reif

• Steve Homer and John Reif. Arithmetic theories for computational complexity problems. Information and Control, 69(1-3):1-11, April/May/June 1986. Citations.

• Dan E. Willard and John H. Reif. Parallel processing can be harmful: The unusual behavior of interpolation search. Information and Computation, 81(3):364-379, June 1989. Citations.

• Ramamohan Paturi, Sanguthevar Rajasekaran, and John Reif. The light bulb problem. Information and Computation, 117(2):187-192, March 1995. Abstract and References.

• Ming-Yang Kao, John H. Reif, and Stephen R. Tate. Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem. Information and Computation, 131(1):63-79, 25 November 1996. Abstract and References.

Shortcuts: