Books
1. VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, AWOC 88, Corfu, Greece, June-July 1988.
2. Synthesis of Parallel Algorithms. 22 chapters, 1011 pages. Published by Morgan Kaufmann, San Mateo, California, 1993.
3. Parallel Algorithm Derivation and Program Transformation, (Edited by R. Paige, J. Reif, and R. Wachter), 228 pages. Published by Kluwer Academic Publishers, 1993.
4. Handbook of Randomized Computing (Edited by S. Rajasekaran, P. M. Pardalos, J.H. Reif and J. Rolim), Kluwer Volume I and II, Academic Press, London, 2001.
5. Junghuei Chen and John Reif, Editors, Ninth International Meeting on DNA Based Computers (DNA9), Madison, Wisconsin, June 2-4, 2003, Lecture Notes in Computer Science Vol. 2943, Springer-Verlag, New York, (2004).
Papers (97 downloadable out of total of 195 papers)
1. J.H. Reif, Combinatorial Aspects of Symbolic Program Analysis. Ph.D. Thesis, Harvard University, July 1977.
2. R. Barakat and J.H. Reif, Numerical Solution of the Folker-Plank Equation via Chebyschev Approximations with Reference to First Passage Time Probability Functions. Published in Journal of Computational Physics, Vol. 23, No. 4, April 1977, pp. 425-445.
3. J.H. Reif and H.R. Lewis, Symbolic Evaluation and the Global Value Graph. 4th ACM Symposium on Principals of Programming Languages, Los Angeles, CA, January 1977, pp. 104-118. [PDF] Published as Efficient Symbolic Analysis of Programs, in Journal of Computer and System Sciences, Vol. 32, No. 3, June 1986, pp. 280-314.
4. J.H. Reif, Code Motion. Presented at Conference on Theoretical Computer Science, University of Waterloo, Canada, 1977. Published in SIAM Journal on Computing, Vol. 9, No. 2, May 1980, pp. 375-395.
5. J.H. Reif, Symbolic Program Analysis in Almost Linear Time. 5th Annual ACM Symposium on Principals of Programming Languages, Tucson, AZ, January 1978, pp. 76-83. [PDF] Published as J.H. Reif and R.E. Tarjan, SIAM Journal on Computing, Vol. 11, No. 1, February 1982, pp. 81-93.
6. J.H. Reif, Data Flow Analysis of Communicating Processes. 6th Annual ACM Symposium on Principals of Programming Languages, San Antonio, TX, January 1979, pp. 257-268. [PDF] Published as J.H. Reif and S. Smolka, International Journal of Parallel Programming, Vol. 19, No. 1, February 1990.
7. J.H. Reif, The Complexity of Extending a Graph Imbedding. Computer Science Department, University of Rochester, TR-42, October 1978.
8. G. Miller, I. Filotti, and J.H. Reif, On Determining the Genus of a Graph in 0(v0(g)) Steps, 11th Annual ACM Symposium on Theory of Computing, Atlanta, GA, April 1979, pp. 27-37.
9. J.H. Reif, Universal Games of Incomplete Information. 11th Annual ACM Symposium on Theory of Computing, Atlanta, GA, April 1979, pp. 288-308. Harvard University TR-35-81. [PDF] Published as The Complexity of Two Player Games of Incomplete Information. Journal of Computer and System Sciences, Vol. 29, No. 2, October 1984, pp. 274-301.
10. G.L. Peterson and J.H. Reif, Multiple-Person Alternation. 20th Annual IEEE Symposium on Foundations of Computer Science, San Juan, Puerto Rico, October 1979, pp. 348-363. Published as G.L. Peterson, J.H. Reif, and S. Azhar, Lower Bounds for Multiplayer Non-Cooperative Games of Incomplete Information. in Computers and Mathematics with Applications, Volume 41, April 2001, pp 957-992. [PostScript] [PDF]
11. J.H. Reif, Complexity of the Mover's Problem and Generalizations. 20th Annual IEEE Symposium on Foundations of Computer Science, San Juan, Puerto Rico, October 1979, pp. 421-427. Published as Complexity of the Generalized Mover's Problem, Chapter 11 in Planning, Geometry and Complexity of Robot Motion, Jacob Schwartz, ed., Ablex Pub., Norwood, NJ, 1987, pp. 267-281.
12. G.L. Peterson and J.H. Reif, A Dynamic Logic of Multiprocessing with Incomplete Information. 7th Annual ACM Symposium on Principals of Programming Languages, Las Vegas, NV, January 1980, pp. 193-202. [PDF]
13. J.H. Reif, Logics for Probabilistic Programming. 12th Annual ACM Symposium on Theory of Computing, Los Angeles, CA, April 1980, pp. 8-13. [PDF]
14. J.H. Reif and P. Spirakis, Random Matroids. 12th Annual ACM Symposium on Theory of Computing, Los Angeles, CA, April 1980, pp. 385-397. [PDF] Revised as Harvard University TR-28-81, Probabilistic Analysis of Random Extension-Rotation Algorithms.
15. J.H. Reif and P. Spirakis, Distributed Algorithms for Synchronizing Interprocess Communication Within Real Time. 13th Annual ACM Symposium on Theory of Computing, Milwaukee, WI, 1981, pp. 133-145. Published as Real-Time Synchronization of Interprocess Communications: ACM Journal of Transactions on Programming Languages and Systems, Vol. 6, No. 2, April 1984, pp. 215-238. [PDF]
16. J.H. Reif, Minimum s-t Cut of Planar Undirected Network in 0(n log2n) Time, 8th Colloquium on Automata, Languages and Programming, (Shimon Even and Oded Kariv, editors) volume 115 of Lecture Notes in Computer Science, pages 56-67, Acre (Akko), Israel, 13-17 July 1981. Springer-Verlag. Published in SIAM Journal on Computing, Vol. 12, No. 1, February 1983, pp. 71-81.
17. J.H. Reif, Symmetric Complementation. 14th Annual ACM Symposium on Theory of Computing, San Francisco, CA, May 1982, pp. 201-214. Presented at the NSF/AMS on Probabilistic Computational Complexity, Durham, NH, June 1982. Published in Journal of the ACM(JACM), Vol. 31, No. 2, April 1984, pp. 401-421. [PDF]
18. J.Y. Halpern and J.H. Reif, The Propositional Dynamic Logic of Deterministic, Well-Structured Programs, 22nd Annual IEEE Symposium on Foundations of Computer Science, Nashville, TN, October 1981, pp. 322-334. Published in Journal of Theoretical Computer Science, Vol. 27, 1983, pp. 127-165. [PDF]
19. J.H. Reif and P. Spirakis, Unbounded Speed Variability in Distributed Communication Systems. 9th Annual ACM Symposium on Principals of Programming Languages, Albuquerque, NM, January 1982, pp. 46-56. [PDF] Published in SIAM Journal on Computing, Vol. 14, No. 1, February 1985, pp. 75-92.
20. G.L. Peterson and J.H. Reif, Decision Algorithms for Multiplayer Games of Incomplete Information. Harvard University, TR-34-81. Published as G.L. Peterson, J.H. Reif, and S. Azhar, Decision Algorithms for Multiplayer Non-Cooperative Games of Incomplete Information. Computers and Mathematics with Applications, Vol. 43, Jan. 2002, pp 179-206. [PostScript] [PDF]
21. J.H. Reif and P. Spirakis, K-connectivity in Random Undirected Graphs, Discrete Mathematics, Vol. 54, No. 2, April 1985, pp. 181-191. [PDF]
22. J.H. Reif and P. Spirakis, Strong k-connectivity in Digraphs and Random Digraphs, Harvard University TR-25-81.
23. J.H. Reif, On the Power of Probabilistic Choice in Synchronous Parallel Machines. Harvard University TR-30-81. 9th International Colloquium on Automata, Languages and Programming, Aarhus, Denmark, 1982, pp. 442-450. Published as On Synchronous Parallel Computations with Independent Probabilistic Choice in SIAM Journal on Computing, Vol. 13, No. 1, February 1984, pp. 46-56.
24. J.H. Reif and P. Spirakis, Real Time Resource Allocation in Distributed Systems, ACM Symposium on Principals of Distributed Computing, Ottawa, Canada, August 1982, pp. 84-94. [PDF]
25. J.H. Reif, Parallel Time 0(log n) Time Acceptance of Deterministic CFLs. 23rd Annual IEEE Symposium on Foundations of Computer Science, Chicago, IL, November 1982, pp. 290-296. Published as P. Klein and J.H. Reif, Parallel Time 0(log n) Time Acceptance of Deterministic CFLs on an Exclusive-Write P-RAM, SIAM Journal on Computing, Vol. 17, No. 3, June 1988, pp. 463-485.
26. J.H. Reif and P. Spirakis, Expected Parallel Time and Sequential Space Complexity of Graph and Digraph Problems, Published in Algorithmica, Special Issue on Graph Algorithms, Vol. 7, Numbers 5 & 7, pp. 597-630, 1992.
27. L.G. Valiant and J.H. Reif, A Logarithmic Time Sort for Linear Size Networks. 15th Annual ACM Symposium on Theory of Computing, Boston, MA, April 1983, pp. 10-16. [PDF] Published in Journal of the ACM(JACM), Vol. 34, No. 1, January 1987, pp. 60-76. [PDF]
28. J.H. Reif and W.L. Scherlis, Deriving Efficient Graph Algorithms. Logics of Programs Workshop, Carnegie-Mellon University, Pittsburgh, PA, June 1983, Lecture Notes in Computer Science, Vol. 164, 1984, pp. 421-441. Published in: Verification: Theory and Practice: Essays Dedicated to Zohar Manna on the Occasion of His 64th Birthday (edited by Nachum Dershowitz), LNCS series Vol. 2772, pp 645-681, 2004. [PDF] or [PDF]
29. J.H. Reif and A.P. Sistla, A Multiprocess Network Logic with Temporal and Spatial Modalities, 10th International Colloquium on Automata, Languages and Programming, Barcelona, Spain, July 1983; Lecture Notes in Computer Science, Vol. 154, 1983, pp. 629-639. Published in Journal of Computer and System Sciences, Vol. 30, No. 1, February 1985, pp. 41-53.
30. J.H. Reif, Logarithmic Depth Circuits for Algebraic Functions. 24th Annual IEEE Symposium on Foundations of Computer Science, Tucson, AZ, November 1983, pp. 138-145. Published in SIAM Journal on Computing, Vol. 15, No. 1, February 1986, pp. 231-242.
31. J.H. Reif, An n1+epsilon Processor, 0(logn) Time Probabilistic Sorting Algorithm Abstract. SIAM 2nd Conference on the Applications of Discrete Mathematics, Cambridge, MA, June 1983, p. 27-29.
32. J.H. Reif, Probabilistic Parallel Prefix Computation, 13th Annual International Conference on Parallel Processing, Michigan, 1984. Published in Computers and Mathematics with Applications, Vol. 26, Number 1, July 1993, pp. 101-110. [PDF]
33. J.H. Reif and P. Spirakis, Probabilistic Bidding Gives Optimal Distributed Resource Allocation. 11th International Colloquium on Automata, Languages and Programming, Antwerp, Belgium, July 1984. Published in Lecture Notes in Computer Science, Vol. 172, pp. 391-402.
34. J.H. Reif, Depth-First Search is Inherently Sequential. Information Processing Letters, Vol. 20, No. 5, June 12, 1985, pp. 229-234. [PDF]
35. J.H. Reif, A Topological Approach to Dynamic Graph Connectivity. Information Processing Letters, Vol. 25, No. 1, April 20, 1987, pp. 65-70. [PDF]
36. G. Kar, C.N. Nikolaou, and J.H. Reif, Assigning Processes to Processors: A Fault-Tolerant Approach, 14th International Conference on Fault-Tolerant Computing, Kissimmee, FL, June 1984.
37. M. Ben-Or, D. Kozen, and J.H. Reif, The Complexity of Elementary Algebra and Geometry. 16thAnnual Symposium on Theory of Computing, Washington, DC, April-May 1984, pp. 457-464. [PDF] Published in Journal of Computer and Systems Sciences, Vol. 32, No. 2, April 1986, pp. 251-264.
38. R. Nair, A. Bruss, and J.H. Reif, Linear Time Algorithms for Optimal CMOS Layout, International Workshop on Parallel Computing and VLSI, Amalfi, Italy, May 1984; VLSI: Algorithms and Architectures, North-Holland pub., pp. 327-338.
39. J.H. Reif and J.D. Tygar, Efficient Parallel Pseudo-random Number Generation. CRYPTO-85, Proceedings, Vol. 218, H. Williams and E. Brickell, ed., Springer-Verlag, New York, NY, 1986, pp. 433-446 Presented at the Mathematical Theory of Security, Boston, MA, 1985. Published in SIAM Journal on Computing, Vol. 17, No. 2, April 1988, pp. 404-411.
40. P. Gacs and J.H. Reif, A Simple Three-dimensional Real-time Reliable Cellular Array. 17th Annual ACM Symposium on Theory of Computing, Providence, RI, May 1985, pp. 388-395. [PDF] Published in Journal of Computer and System Sciences, Vol. 36, No. 2, April 1990, pp. 125-147.
41. V. Pan and J.H. Reif, Efficient Parallel Solution of Linear Systems. 17th Annual ACM Symposium on Theory of Computing(STOC85), Providence, RI, (ACM Press, New York) May 1985, pp. 143-152. Presented at the meeting on Efficient Algorithms, Mathematisches Forschungsinstitut, Oberwolfach, W. Germany, November 1984. Presented at 2nd SIAM Conference on Applied Linear Algebra, Raleigh, NC, April 1985. Published as Fast and Efficient Parallel Solution of Sparse Linear Systems. SIAM Journal on Computing, Vol 22, No. 6, pp. 1227-1250, December 1993. [PostScript] [PDF]
42. G. Miller and J.H. Reif, Parallel Tree Contraction and its Application. Harvard University TR-18-85. 26th Annual IEEE Symposium on Foundations of Computer Science, Portland, OR, October 1985, pp. 478-489.
42a Portions Published as Parallel Tree Contraction Part I: Fundamentals, Advances in Computing Research, Vol. 5., pp. 47-72, 1989. [PDF]
42b Portions Published as Parallel Tree Contraction Part II: Further Applications, SIAM Journal on Computing, Vol. 20, No. 6, pp. 1128-1147, December 1991. [PDF]
43. S. Rajasekaran and J.H. Reif, An Optimal Parallel Algorithm for Integer Sorting. 26th Annual IEEE Symposium on Foundations of Computer Science, Portland, OR, October 1985, pp. 496-503. Published as Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms, SIAM Journal on Computing, Vol. 18, No. 3, June 1989, pp. 594-607. [PostScript] [PDF]
44. J.H. Reif and M. Sharir, Motion Planning in the Presence of Moving Obstacles, 26th Annual IEEE Symposium on Foundations of Computer Science, Portland, OR, October 1985, pp. 144-154. Published in Journal of the ACM (JACM), 41:4, July 1994, pp. 764-790. [PDF] or [PostScript] [PDF]
45. J.H. Reif, Probabilistic Algorithms in Group Theory. Foundations of Computation Theory (FCT85), Cottbus, Democratic Republic of Germany, September 1985; appeared in Lecture Notes in Computer Science, Vol. 199, 1985, pp. 341-350. Also TR85-01, Dept. of Computer Science, Harvard University, (1985). Published as S. Azhar and J.H. Reif, Efficient Algorithmic Learning of the Structure of Permutation Groups by Examples, Computers & Mathematics with Applications, Volume 37, Issue 10, May 1999, pp 105-132. [PostScript] [PDF]
46. V. Pan and J.H. Reif, Fast and Efficient Algorithms for Linear Programming and for the Linear Least Squares Problem, 12th International Symposium on Mathematical Programming, MIT, Cambridge, MA, August 1985. Presented as Fast and Efficient Parallel Linear Programming and Least Squares Computations at Aegean Workshop on Computing, Loutraki, Greece, July 1986; Lecture Notes in Computer Science, Springer-Verlag, Vol. 227, 1986, pp. 283-295.
46a An abstract of this paper appears as Efficient Parallel Linear Programming, Operations Research Letters, Vol. 5, No. 3, August 1986, pp. 127-135. [PDF]
46b Full paper published as Fast and Efficient Linear Programming and Linear Least-Squares Computations, Computers and Mathematics with Applications, Vol. 12A, No. 12, 1986, pp. 1217-1227. [PDF]
47. J.H. Reif, The Very Unusual Behavior of Parallel Interpolation Search. 23rd Annual Allerton Conference on Communication, Control and Computing, Monticello, IL, October 1985. Published as D.E. Willard and J.H. Reif, Parallel Processing can be Harmful: the Unusual Behavior of Interpolation Search, Journal of Information and Computation, Vol. 81, No. 3, June 1989, pp. 364-379.
48. J.H. Reif and S. Smolka, The Complexity of Reachability in Distributed Communicating Processes, Journal of Acta Informatica, Vol. 25(3), April 1988, pp.333-354.
49. S. Homer and J.H. Reif, Arithmetic Theories for Computational Complexity Problems, Journal of Information and Control, Vol. 69, nos. 1-3, April/May/June 1986, pp. 1-11.
50. J.A. Storer and J.H. Reif, A Parallel Architecture for High Speed Data Compression, 3rd Symposium on the Frontiers of Massively Parallel Computation, College Park, MD, October 1990, pp. 238-243. Published in Journal of Parallel and Distributed Computation, 13, 1991, pp 222-227. [PDF]