Papers by Reif on Sequential and Parallel Optimization (3 papers)


  1. John H. Reif, Simon Kasif, and Deepak Sherlekar, Formula Dissection: A Parallel Algorithm for Constraint Satisfaction. IEEE Workshop on Computer Architecture for Pattern Analysis and Machine Intelligence, Seattle, WA, October 1987, pp. 51-58. Published in Computers and Mathematics with Applications, Vol. 5, (2008), pp. 1170-1177. [PDF] [PDF]
  2. Sanguthevar Rajasekaran and John H. Reif, Nested Annealing: A Provable Improvement to Simulated Annealing. Presented at Workshop on Applications of Combinatorics and Graph Theory to Computer Science, Institute for Mathematics and its Applications, University of Minnesota, December 1987. Presented at the 15th International Colloquium on Automata, Languages and Programming, Tampere, Finland, July 1988; Lecture Notes in Computer Science, Vol. 317, 1988, pp. 455-472. Published in Journal of Theoretical Computer Science, 99(1):157-176, 1 June 1992. [PDF]
  3. John H. Reif and Paul G. Spirakis, Random Matroids. 12th Annual ACM Symposium on Theory of Computing, Los Angeles, CA, April 1980, pp. 385-397. Revised as Probabilistic Analysis of Random Extension-Rotation Algorithms, Harvard University TR-28-81, 1980. [PDF]