Books
1.
VLSI Algorithms and Architectures, 3rd Aegean
Workshop on Computing, AWOC 88, Corfu, Greece, JuneJuly 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 FolkerPlank 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 TR28-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 5667, 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 NonCooperative Games of Incomplete Information. Computers and
Mathematics with Applications, Vol. 43, Jan. 2002, pp 179206. [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. 16th Annual 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 Pseudorandom 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 Realtime 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. 341350. 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. 111.
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]
51.
V. Pan and J.H. Reif, Fast and Efficient Parallel
Solution of Dense Linear Systems. Computers and Mathematics
with Applications, Vol. 17, No. 11, 1989, pp. 1481-1491.
[PDF]
52.
J.H. Reif and J.A. Storer, Shortest Paths in Euclidean
Space with Polyhedral Obstacles. Symposium on Mathematical
Foundations of Computer Science, Czechoslovakia, August
1988. Published as Shortest Paths in the plane with
polygonal obstacles,
Journal of the ACM(JACM)
41:5,
September, 1994, pp. 982-1012. [PDF]
53.
J.H. Reif and J.A. Storer, Minimizing Turns for
Discrete Movement in the Interior of a Polygon, IEEE Journal
of Robotics and Automation, Vol. 3, No. 3, June 1987, pp.
182-193. [PDF]
54.
J.H. Reif, Efficient VLSI Fault Simulation. Computers
and Mathematics with Applications, Vol 25, No. 2, Jan. 1993,
pp. 15-32. [PDF]
55.
R.E. Ladner and J.H. Reif, The Logic of Distributed
Protocols. Conference on Theoretical Aspects of Reasoning
about Knowledge, Los Altos, CA, March 1986, pp. 207-223.
[PDF]
56.
V. Pan and J.H. Reif, Extension of the Parallel Nested
Dissection Algorithm to Path Algebra Problems. Presented at
6th Conference on Foundation of Software Technology and
Theoretical Computer Science, New Delhi, India; Lecture
Notes in Computer Science, Springer Verlag, Vol. 241, 1986.
An abstract of this paper appears as Parallel Nested
Dissection
for
Path
Algebra
Computations,
Operations
Research Letters, Vol. 5, No. 4, October 1986, pp. 177-184.
[PDF] Published as Fast and Efficient Solution of Path
Algebra Problems, Journal of Computer and Systems Sciences,
Vol. 38, No. 3, June 1989, pp. 494-510.
57.
J. Canny and J.H. Reif, New Lower Bound Techniques for
Robot Motion Planning Problems. 28th Annual IEEE Symposium
on Foundations of Computer Science, Los Angeles, CA, October
1987, pp. 49-60. [PDF]
58.
R. Barakat and J.H. Reif, Lower Bounds on the
Computational Efficiency of Optical Computing Systems.
Journal of Applied Optics, Vol. 26, No. 6, March 15, 1987,
pp. 1015-1018.
59.
R. Barakat and J.H. Reif, Polynomial Convolution
Algorithm for Matrix Multiplication with Application for
Optical Computing. Published in Journal of Applied Optics,
Vol. 26, No. 14, July 15, 1987, pp. 2707-2711.
60.
J.H. Reif, A Survey on Advances in the Theory of
Computational Robotics. Appeared in the Proceedings of the
Fourth Workshop of Adaptive Systems Control Theory as
Adaptive and Learning Systems: Theory and Applications, K.S.
Narendra, ed., Plenum Press, New York, NY, 1986.
61.
P. Klein and J.H. Reif, An Efficient Parallel Algorithm
for Planarity. 27th Annual IEEE Symposium on Foundations of
Computer Science, Toronto, Canada, October 1986, pp. 465477. Published in Journal of Computer and System Sciences,
Vol. 37, No. 2, October 1988, pp. 190-246.
62.
C.E. Leiserson, J.P. Mesirov, L. Nekludova, S.M.
Omohundro, J.H. Reif, and W. Taylor, Solving Sparse Systems
of Linear Equations on the Connection Machine. Annual SIAM
Conference, Boston, MA, July 1986.
63.
T. Opsahl and J.H. Reif, Solving Very Large, Sparse
Linear Systems on Mesh-Connected Parallel Computers. First
Symposium on Frontiers of Scientific Computing, NASA,
Goddard Space Flight Center, Greenbelt, MD, September 1986,
pp. 2241-2248.
64.
S. Kasif, J.H. Reif and D. 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.
65.
J.H. Reif and S. Sen, Optimal Randomized Parallel
Algorithms for Computational Geometry. 16th International
Conference on Parallel Processing, St. Charles, IL, August
1987, pp. 270-276. Published in Algorithmica, Vol. 7, No. 1,
January 1992, pp. 91-117. [PDF]
66.
J. Canny, B. Donald, J.H. Reif and P. Xavier. On the
Complexity of Kinodynamic Planning. 29th Annual IEEE
Symposium on Foundations of Computer Science, White Plains,
NY, October 1988, pp. 306-316. Published as Kinodynamic
Motion Planning, Journal of the ACM, Vol 40(5), November
1993, pp. 1048-1066. [PDF]
67.
S. Rajasekaran and J.H. Reif, Randomized Parallel
Computation. Presented at Foundations of Computation Theory
Conference, Kasan, USSR, June 1987; Lecture Notes in
Computer Science, Vol. 278, 1987, pp. 364-376. Published in
Chapter
11
of
Concurrent
Computations:
Algorithms,
Architecture and Technology, S.K. Tewksbury, B.W. Dickinson
and S.C. Schwartz, ed., 1988, pp. 181-202. [PDF]
68.
J.H. Reif and S. Tate, On Threshold Circuits and
Polynomial Computation. 2nd Structure in Complexity Theory
Conference, Ithaca, NY, June 1987. Published in SIAM Journal
on Computing, Vol.21, No. 5, October 1992, 896-908.
[PostScript] [PDF] or [PostScript]
69.
V. Ramachandran and J.H. Reif, An Optimal Parallel
Algorithm for Graph Planarity. 30th Annual IEEE Symposium on
Foundations of Computer Science, Research Triangle Park, NC,
October 1989, pp. 282-287. Published in Journal of Computer
and System Sciences, 49:3, December, 1994, pp. 517-561.
[PostScript] [PDF] or [PostScript]
70.
S. Rajasekaran and J.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. 455472. Published in Journal of Theoretical Computer Science,
99(1):157-176, 1 June 1992. [PDF]
71.
V. Pan and J.H. Reif, Some Polynomial and Toeplitz
Matrix
Computations.
28th
Annual
IEEE
Symposium
on
Foundations of Computer Science, Los Angeles, CA, October
1987, (IEEE Computer Society Press) pp. 173-184.
72.
J.A. Storer and J.H. Reif, Real-time Compression of
Video
on
a
Grid-connected
Parallel
Computer.
3rd International Conference on Supercomputing, Boston, MA,
May 1988. [PDF]
73.
E.W. Davis and J.H. Reif, Architecture and Operation of
the BLITZEN Processing Element. 3rd International Conference
on Computing on Supercomputing, Boston, MA, May 1988. Also
as D.W. Blevin, E.W. Davis and J.H. Reif, Processing Element
and Custom Chip Architecture for the BLITZEN Massively
Parallel Processor, MCNC Technical Report TR87-22, October
1987, revised June 1988.
74.
J.H. Reif and S. Sen, An Efficient Output-Sensitive
Hidden-Surface Removal Algorithm and its Parallelization.
4th Annual ACM Symposium on Computational Geometry, Urbana,
IL, June 1988, pp. 193-200. Published as An Efficient
Output-Sensitive
Hidden-Surface
Removal
Algorithm
for
Polyhedral Terrains, Journal of Mathematical and Computer
Modeling, Vol. 21, No. 5, pp. 89-104, 1995. [PDF] or [PDF]
75.
L.S. Nyland and J.H. Reif, An Algebraic Technique for
Generating Optimal CMOS Circuitry in Linear Time, Computers
and Mathematics with Applications Vol 31, No. 1, Jan. 1996,
pp.85-108. [PDF]
76.
D.W. Blevins, E.W. Davis, R.A. Heaton and J.H. Reif,
BLITZEN: A Highly Integrated Massively Parallel Machine. 2nd
Symposium on Frontiers of Massively Parallel Computation,
Fairfax, VA, October 1988. Published in Journal of Parallel
and Distributed Computing, Vol. 8, February 1990, pp. 150160.
77.
J.H. Reif and S. Tate, Optimal Size Integer Division
Circuits. 21st Annual ACM Symposium on Theory of Computing,
Seattle, WA, May 1989, pp. 264-273. Presented at meeting on
Efficient Algorithms, Mathematisches Forschungsinstitut, W.
Germany, September 1989. Published in SIAM Journal on
Computing, Vol. 19, No. 5, October 1990, pp. 912-924.
[PostScript] [PDF] or [PostScript]
78.
J.H. Reif and S. Sen, Polling: A New Randomized
Sampling Technique for Computational Geometry, 21st Annual
ACM Symposium on Theory of Computing, Seattle, WA, May 1989,
pp. 394-404. [PDF] Revised as Optimal Parallel Randomized
Algorithms for Three-Dimensional Convex Hulls and Related
Problems, Published in SIAM Journal on Computing, Vol. 21,
No. 3, June 1992, pp. 466-485. [PDF] (see also Erratum:
Optimal parallel randomized algorithms for three-dimensional
convex hulls and related problems. SIAM Journal on
Computing, 23(2):447-448, April 1994.)
79.
J.H. Reif and A. Tyagi, Energy Complexity of Optical
Computations, 2nd IEEE Symposium on Parallel and Distributed
Processing,
Dallas,
TX,
December
1990,
pp.
14-21.
[PostScript] [PDF]
80.
E.S. Maniloff, K. Johnson, and J.H. Reif, Holographic
Routing Network for Parallel Processing Machines Holographic
Optics II: Principals and Applications, G. Michael Morris;
Ed. SPIE Proceedings Series, Vol. 1136, EPS/EUROPTICA/SPIE
International Congress on Optical Science and Engineering,
Paris, France, April 1989, pp. 283-289.
81.
J.H. Reif, D. Tygar, and A. Yoshida, The Computability
and Complexity of Optical Beam Tracing. 31st Annual IEEE
Symposium on Foundations of Computer Science, St. Louis, MO,
October 1990, pp. 106-114. Published as The Computability
and Complexity of Ray Tracing in Discrete & Computational
Geometry, 11: pp 265-287 (1994).
82.
S. Azhar, A. McLennan and J.H. Reif, Computation of
Equilibria
in
Noncooperative
Games,
Duke
University
Technical Report CS-1991-36. Proc. Workshop for Computable
Economics, Dec. 1992. [PostScript] [PDF]
83.
R. Paturi, S. Rajasekaran, and J.H. Reif, Efficient and
Robust Learning Using Statistical Bootstrap, Workshop on
Computational Learning Theory, Santa Cruz, CA, August 1989.
[PostScript] [PDF] Published as The Light Bulb Problem,
Information and Computation, 117(2):187-192, March 1995.
[PDF]
84.
J.H. Reif and S. Sen, Randomized Parallel Algorithms.
IBM Workshop on Capabilities and Limitations of Parallel
Computing, San Jose, CA, December 1988.
Information
Processing 89, G. Ritter, ed., Elsevier Science Publishers,
North Holland, 1989, pp. 455-458. Presented as Randomization
in Parallel Algorithms and its Impact on Computational
Geometry, in Optimal Algorithms;Lecture Notes in Computer
Science, Vol. 401, 1989, pp. 1-8. Published as A Case for
Randomized
Parallel
Algorithms
in
Opportunities
and
Constraints of Parallel Computing, J.L.C. Sanz (ed.),
Springer-Verlag New York, 1989, pp. 101-105.
85.
V. Pan and J.H. Reif, On the Bit-Complexity of Discrete
Approximations
to
PDEs.
International
Colloquium
on
Automata, Languages, and Programming(ICALP 90), Warwich,
England, Springer Lecture Notes in Computer Science 443, pp
612-625, July 1990. Published as The Bit-Complexity of
Discrete Solutions of Partial Differential Equations:
Compact
Multigrid,
Computers
and
Mathematics
with
Applications, Vol. 20, No. 2, 1990, pp. 9-16. [PDF]
86.
J.H. Reif and A. Tyagi, Efficient Algorithms for
Optical Computing with the DFT Primitive, Presented at 10th
Conference on Foundations of Software Technology and
Theoretical Computer Science, Bangalore, India, December
1990; Lecture Notes in Computer Science. Published in
Journal of Applied Optics, Vol. 36, 1997, pp. 7327-7341.
[PDF] or [PostScript] [PDF]
87.
J. Canny, A. Rege, and J.H. Reif, An Exact Algorithm
for Kinodynamic Planning in the Plane. 6th Annual ACM
Symposium on Computational Geometry, Berkeley, CA, June
1990, pp. 271-280. [PDF] Published in Discrete and
Computational Geometry, Vol. 6, 1991, pp. 461-484.
88.
J.H. Reif and S. Sen, Randomized Algorithms for Binary
Search and Load Balancing on Fixed Connection Networks with
Geometric Applications. 2nd Annual ACM Symposium on Parallel
Algorithms and Architectures, Crete, Greece, July 1990, pp.
327-337. Published in SIAM Journal of Computing 23:3, June,
1994, pp.633-651. [PDF]
89.
J.H. Reif, Efficient Parallel Algorithms: Theory and
Practice. SIAM 35th Anniversary Meeting, Denver, CO, October
1987. XI World Computer Congress, IFIP 89, San Francisco,
CA, 1989.
90.
H. Djidjev and J.H. Reif, An Efficient Algorithm for
the Genus Problem with Explicit Construction of Forbidden
Subgraphs. 23rd Annual ACM Symposium on Theory of Computing,
New Orleans, LA, May 1991, pp. 337-347. [PDF]
91.
H. Gazit and J.H. Reif, A Randomized Parallel Algorithm
for Planar Graph Isomorphism. 2nd Annual ACM Symposium on
Parallel Algorithms and Architectures, Crete, Greece, July
1990, pp. 210-219. Published in Journal of Algorithms, Vol.
28, No. 2, pp 290-314, August 1998. [PostScript] [PDF]
92.
V. Pan and J.H. Reif, The Parallel Computation of
Minimum Cost Paths in Graphs by Stream Contraction,
Information Processing Letters, Vol. 40, October 25,1991,
pp. 79-83. [PDF]
93.
J.H. Reif and S. Tate, Approximate Kinodynamic Planning
Using L2-norm Dynamic Bounds. Duke University Technical
Report CS-1990-13, 1989. Published in
Computers and
Mathematics with Applications, Vol. 27, No.5, pp.29-44,
March 1994. [PostScript] [PDF] or [PostScript]
94.
Royals, M., T. Markas, N. Kanopoulos, J.H. Reif and J.
Storer, On the Design and Implementation of a Lossless Data
Compression and Decompression Chip, IEEE Journal of Solid
State Circuits (JSSC), Vol. 28, No. 9, pp. 948-953, Sep.
1993. [PDF]
95.
M. Karr, S. Krishnan, J.H. Reif, Derivation of the
Ellipsoid Algorithm, Duke University Technical Report CS1991-17, (1990).
96.
J.H. Reif and A. Tyagi, An Optical Delay Line Memory
Model with Efficient Algorithms. Advanced Research in VLSI
Conference, MIT Press, Santa Cruz, CA, March 1991. Published
in Optical Engineering, 36(09), 2521-2535, Sept. (1997).
[PostScript] [PDF]
97.
S. Azhar and J.H. Reif, Crypto-Complexity Based Models
of Efficiency in Capital Markets, 1994.
98.
J.H. Reif and S. Tate, Continuous Alternation: The
Complexity of Pursuit in Continuous Domains, Special Issue
on
Computational
Robotics:
the
Geometric
Theory
of
Manipulation, Planning and Control, Algorithmica, Vol. 10,
pp. 151-181, 1993. [PostScript] [PDF] or [PostScript]
99.
J.H. Reif and A. Yoshida, Optical Expanders with
Applications in Optical Computing, Journal of Applied
Optics, 32, 1993, p.159-165. [PDF] or [PostScript] [PDF]
100.
J. A. Storer and J.H. Reif, Low-Cost Prevention of
Error Propagation for Data Compression with Dynamic
Dictionaries, Proceedings: IEEE Data Compression Conference
(DCC'97) Snowbird, UT, IEEE Computer Society Press, James
A. Storer, Martin Cohn (Eds.), March 1997, pp 171-180.
Published as Error Resilient Optimal Data Compression,
SICOMP, Vol 26, Num 4, July 1997, pp 934-939. [PostScript]
[PDF]
101.
P.H. Mills, L.S. Nyland, J.F. Prins, J.H. Reif and R.A.
Wagner, Prototyping Parallel and Distributed Programs in
Proteus. 3rd IEEE Symposium on Parallel and Distributed
Processing, Dallas, TX, pp. 10-19, IEEE, 1991. [PostScript]
[PDF] or [Gzip.PostScript]
102.
J.A. Storer, T. Markas and J.H. Reif, A Massively
Parallel VLSI Compression System using a Compact Dictionary.
IEEE Workshops on VLSI & Signal Processing, 1990, San Diego,
CA. Published as A Massively Parallel VLSI Compression
System Using a Compact Dictionary, VLSI Signal Processing,
No. 4, 1990 (edited by H.S. Moscovitz and K. Yao and R.
Jain), IEEE Press, 1990, New York, NY, pp. 329-338.
103.
S. Krishan and J.H. Reif, Towards Randomized Strongly
Polynomial
Algorithms
for
Linear
Programming,
Duke
University Technical Report CS-1991-18.
104.
V. Pan and J.H. Reif, Decreasing the Precision of
Linear Algebra Computations by Using Compact Multigrid and
Backward Interval Analysis. 4th SIAM Conference in Applied
Linear Algebra, Minneapolis, MN, September 1991. Published
as Compact Multigrid, SIAM Journal of Scientific and
Statistical Computing, Vol. 13, No. 1, pp. 119-127, (1992).
105.
T. Markas and J.H. Reif, Fast Computations of Vector
Quantization Algorithms. NASA Technical Report TR-91-58,
1991.
106.
Tassos Markas and J.H. Reif, Image Compression Methods
with
Distortion
Controlled
Capabilities.
IEEE
Data
Compression Conference (DCC 91), Snowbird, UT,
IEEE
Computer Society Press, April 1991, pp. 93-102. Published
as Quad Tree Structures for Image Compression Applications,
special issue of Journal of Information Processing and
Management, 1992, pp. 707-721. [PDF]
107.
J. Cheriyan and J.H. Reif, Algebraic Methods for
Testing the k-Vertex Connectivity of Directed Graphs, 3rd
Annual ACM-SIAM Symposium on Discrete Algorithms, Orlando,
Florida, 1992. [PDF] Published as "Directed s-t Numberings,
Rubber Bands, and Testing Digraph k-Vertex Connectivity," in
Combinatorica 14(4) 435-451, 1994.
108.
J.H. Reif and A. Yoshida, Optical Techniques for Image
Compression. 2nd Annual IEEE Data Compression Conference
(DCC 92), Snowbird, UT, IEEE Computer Society Press, James
A. Storer, Martin Cohn (Eds.), March 1992, pp. 32-41. Also
in Image and Text Compression, edited by J. A. Storer,
Kluwer Academic Publishers, 1992. Published as "Optical
Computing Techniques for Image/Video Compression," in
Proceedings of the IEEE, 82:6, June 1994, pp. 948-954. [PDF]
109.
J.H. Reif and H. Wang, On Line Navigation Through
Regions of Variable Densities. ARO Computational Geometry
Workshop, Raleigh, North Carolina, October, 1993. Rewritten
as On-Line Navigation Through Weighted Regions. [PostScript]
[PDF] or [PostScript]
110.
M. Kao, J.H. Reif, and S. Tate, Searching in an Unknown
Environment: An Optimal Randomized Algorithm for the CowPath Problem, Proceedings of the 4th Annual ACM-SIAM
Symposium on Discrete Algorithms (SODA'93), Austin, TX, Jan
1993, pp.441-447. Published in Information and Computation,
Vol 131, No. 1 (1996), p 63-80. [PostScript] [PDF] or
[PostScript]
111.
J.H.
Reif,
O(log2
n)
Time
Efficient
Parallel
Factorization of Dense, Sparse Separable, and Banded
Matrices. 5th Annual ACM Symposium on Parallel Algorithms
and Architectures (SPAA'94), Cape May, NJ, June 1994.
[PostScript] [PDF]
112.
J.H. Reif, An O(n log3 n) Algorithm for the Real Root
Problem. 34th Annual IEEE Conference on Foundations of
Computer Science (FOCS '93) Proceedings, November 1993, Palo
Alto, CA, pp. 626-635. Revised as An Efficient Algorithm for
the Real Root and Symmetric Tridiagonal Eigenvalue Problems,
1994. [PostScript] [PDF] and [PostscriptFigures]
113.
T. Markas and J.H. Reif, Memory-Shared Parallel
Architectures for Vector Quantization Algorithms, 1992.
Picture Coding Symposium, Lusanne Switzerland, March, 1993.
114.
P. Mills, L. Nyland, J. Prins, and J.H. Reif,
Prototyping
N-body
Simulation
in
Proteus,
Sixth
International Parallel Processing Symposium, IEEE, Beverly
Hills, CA, pp. 476-482, 1992. [PostScript] [PDF] or
[PostScript]
115.
D. Armon and J.H. Reif, An Optimal Space and Efficient
Parallel Nested Dissection Algorithm, 1992. 4th Annual ACM
Symposium on Parallel Algorithms and Architectures, San
Diego, CA, July 1992. [PDF]
116.
P. Mills, L. Nyland, J. Prins, and J.H. Reif,
Prototyping High-Performance Parallel Computing Applications
in Proteus. DARPA Software Technology Conference, May, 1992.
[PostScript] [PDF]
117.
V. Pan, J.H. Reif, S. Tate. The Power of Combining the
Techniques of Algebraic and Numerical Computing: Improved
Approximate Multipoint Polynomial Evaluation and Improved
Multipole Algorithms,
32th Annual IEEE Symposium on
Foundations of Computer Science (FOCS'92), Pittsburgh, PA,
Oct. 1992, pp. 703-713. Rewritten as J.H. Reif and S. Tate,
"N-body simulation I: Fast algorithms for potential field
evaluation and Trummer's problem". Tech. Report. #N-96-002,
Univ. of North Texas, Dept. of Computer Science (1996).
[PostScript] [PDF]
118.
W.L.
Hightower,
J.
Prins,
and
J.H.
Reif,
Implementations of Randomized Sorting on Large Parallel
Machines. 4th Annual ACM Symposium on Parallel Algorithms
and Architectures (SPAA'92), San Diego, CA, July 1992. [PDF]
119.
Y. Han, V. Pan, and J.H. Reif, Efficient Parallel
Algorithms for Computing All Pair Shortest Paths in Directed
Graphs. University of Kentucky Technical Report 204-92. 4th
Annual
ACM
Symposium
on
Parallel
Algorithms
and
Architectures, San Diego, CA, July 1992, pp. 353-362.
Published in Algorithmica, Vol 17, pp. 399-415, 1997. [PDF]
120.
J.H. Reif and H. Wang, Social Potential Fields: A
Distributed Behavioral Control for Autonomous Robots,
Workshop on Algorithmic Foundations of Robotics (WAFR'94),
San Francisco, California, February, 1994; The Algorithmic
Foundations of Robotics, A.K.Peters, Boston, MA. 1995.
Published in Robotics and Autonomous Systems, Vol. 27, no.3,
pp.171-194, (May 1999). [PostScript] [PDF]
121.
J.H. Reif and S. R. Tate, Dynamic Algebraic Algorithms,
Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete
Algorithms (SODA'94), TX, Jan. 1994. pp.290-301. Published
as On Dynamic Algorithms for Algebraic Problems, Journal of
Algorithms, Volume 22, Number 2, pp. 347-371, February 1997.
[PostScript] [PDF]
122.
J.H. Reif and S. R. Tate, Dynamic Parallel Tree
Contraction, 5th Annual ACM Symposium on Parallel Algorithms
and Architectures (SPAA'94), Cape May, NJ, June 1994.
pp.114-121. [PostScript] [PDF] or [PostScript]
123.
D. Armon and J.H. Reif, A Dynamic Separator Algorithm
with Applications to Computational Geometry and Nested
Dissection, 3rd Annual Workshop on Algorithms and Data
Structures (WADS '93), Montreal, Quebec, Canada, August,
1993, p.107-118. [PDF]
124.
S. Azhar, G. Badros, A. Glodjo, M. Kao, and J.H. Reif,
Data Compression Techniques for Stock Market Prediction,
Proceedings: IEEE Data Compression Conference (DCC'94),
Snowbird, UT, IEEE Computer Society Press, James A. Storer,
Martin Cohn (Eds.), March 1994, p. 72-82. [PDF]
125.
J. Cheriyan and J.H. Reif, Parallel and Output
Sensitive Algorithms for Combinatorial and Linear Algebra
Problems, 1992. 4th Annual ACM Symposium on Parallel
Algorithms and Architectures (SPAA'93), Velon, Germany, July
1993, p.50-56. Published as J.H. Reif, Parallel Output
Sensitive Algorithms for Combinatorial and Linear Algebra
Problems, Journal of Computer and System Sciences, Vol. 62,
May 2001, pp 398-412. [PostScript] [PDF]
126.
S. Nikoletseas, J.H. Reif, P.G. Spirakis, and M. Yung,
Stochastic
Graphs
Have
Short
Memory:
Fully
Dynamic
Connectivity in Poly-Log Expected Time. Proceedings of the
22nd
Annual
Colloquium
on
Automata,
Languages
and
Programming
(ICALP'93),
Szeged,
Hungary,
July
1993.
[PostScript] [PDF]
127.
S.R. Tate and J.H. Reif, The Complexity of N-body
Simulation, Proceedings of the 20th Annual Colloquium on
Automata, Languages and Programming (ICALP'93), Lund,
Sweden, July, 1993, p. 162-176. [PostScript] [PDF] or
[PostScript]
128.
Tassos Markas and J.H. Reif, Multispectral Image
Compression Algorithms, Proceedings: IEEE Data Compression
Conference (DCC'93), Snowbird, UT, IEEE Computer Society
Press, James A. Storer, Martin Cohn (Eds.), p.391-400,
March 1993. [PDF]
129.
P. Mills, J. Prins, and J.H. Reif, Rate Control as a
Language Construct for Parallel and Distributed Programming,
Proc. IEEE Workshop on Parallel and Distributed Real-Time
Systems (IPPS'93), pp. 164-170, 1993. [PostScript] [PDF]
130.
R. Barakat and J.H. Reif, Diffraction Realization of an
Optical Expander, (1993).
131.
L. S. Nyland, J. F. Prins, and J.H. Reif, A Data
Parallel Implementation of the Adaptive Fast Multipole
Algorithm. Dartmouth Institute for Advanced Graduate Studies
(DAGS '93), Hanover, NH, June, 1993. [PostScript] [PDF]
132.
S. Chen and J.H. Reif, Using Difficulty of Prediction
to Decrease Computation: Fast Sort, Priority Queue and
Convex Hull on Entropy Bounded Inputs, 34th Annual IEEE
Conference on Foundations of Computer Science (FOCS '93)
Proceedings, November 1993, Palo Alto, CA, pp. 104-112.
[PDF]
133.
Neff,
A.
and
J.H.
Reif,
An
O(n^{1+epsilon}
logb)
Algorithm for the Complex Roots Problem. 35th Annual IEEE
Conference on Foundations of Computer Science (FOCS '94)
Proceedings, Santa Fe, NM, November 1994. pp.540-547.
Improved Paper Published as An Efficient Algorithm for the
Complex Roots Problem, Journal of Complexity, 12(2):81-115,
(June 1996). [PostScript] [PDF]
134.
A. Goldberg, J. Prins, R. Faith, Z. Li, P. Mills, L.
Nyland, D. Palmer, J.H. Reif, J. Riely, and S. Westfold, The
Proteus System for the Development of Parallel Applications.
Prototyping and Software Development (M.C.~Harrison, ed.),
Lecture Notes in Computer Science, pp.~151--190, SpringerVerlag, 1996. [PostScript] [PDF]
135.
P.H. Mills, L.S. Nyland, J.F. Prins, and J.H. Reif,
Software Issues in High-Performance Computing and a
Framework for the Development of HPC Applications,Developing
a Computer Science Agenda for High Performance Computing (U.
Vishkin, ed.) pp.110-117, ACM, 1994. [PostScript] [PDF]
136.
A. Goldberg, P. H. Mills, L. S. Nyland, J. F. Prins,
J.H. Reif, and J. Riely, Specification and Development of
Parallel Algorithms with the Proteus System, DIMACS Series
in Discrete Mathematics and Theoretical Computer Science,
AMS Press, Vol. 18, 1994, pp. 383-399. [PostScript] [PDF]
137.
V. Pan and J.H. Reif, Generalized Compact Multi-grid,
Computers Math Applications, Volume 25, Number 9, p.3-5, May
1993. [PDF]
138.
J.H. Reif and
Bound for Finding
Published in Journal
1994, pp. 1013-1019.
J. Storer, A Single-Exponential Upper
Shortest Paths in Three Dimensions.
of the ACM(JACM), Vol. 41, No. 5, Sept.
[PDF]
139.
S. Chen and J.H. Reif, Pattern Matching for Entropy
Bounded Text. Proceedings: IEEE Data Compression Conference
(DCC'95) Snowbird, UT, IEEE Computer Society Press, James
A. Storer, Martin Cohn (Eds.), March 1995, pp. 282-301.
[PDF]
140.
J.H. Reif, Efficient Parallel Solution of Sparse
Eigenvalue and Eigenvector Problems, Proceedings of the 36th
Annual IEEE Symposium on Foundations of Computer Science
(FOCS'95) Milwaukee, WI, October 23-25, 1995, pp.123-132.
Published
as
Efficient
Parallel
Computation
of
the
Characteristic Polynomial of a Sparse, Separable Matrix,
Algorithmica, 29: 487-510 (2001). [PDF]
141.
A. Yoshida, J. Rolland and J.H. Reif, and, Design and
Applications of a High Resolution Insert Head-Mounted
Display.
IEEE
Virtual
Reality
Annual
International
Symposium (VRAIS'95), Research Triangle Park, NC, March 1115, 1995, pp 84-93. [PostScript] [PDF] Also, J. Rolland and
A. Yoshida, and J.H. Reif, Optical design and analysis of a
head-mounted display with a high-resolution insert, (Novel
Optical Systems Design and Optimization, Jose M. Sasian;
Ed.,), Proc. SPIE Vol. 2537, p. 71-82, Aug. 1995. Published
as Rolland, J.P., A. Yoshida, L. Davis, and J.H. Reif, High
resolution inset head-mounted display, Applied Optics:
Optical Technology and Biomedical Optics, 37(19), 4183-4193
(1998). [PDF]
142.
S. Gupta, Z. Li, and J.H. Reif, Generating Efficient
Programs for Two-Level Memories from Tensor-Products.
Proceedings of the 7th IASTED/ISMM International Conference
on Parallel and Distributed Computing and Systems Washington
DC, October 1995, pp. 510-513. [PostScript] [PDF]
143.
J.H. Reif, Parallel Molecular Computation: Models and
Simulations. Proceedings: 7th Annual ACM Symposium on
Parallel Algorithms and Architectures (SPAA'95) Santa
Barbara,
CA,
July
1995,
pp.
213-223.
Published
in
Algorithmica, special issue on Computational Biology, Vol.
25,
No.
2,
142-176,
1999.
[PDF]
[PostScript]
and
[PostScriptFigures]
144.
J.H. Reif, Work Efficient Parallel Solution of Toeplitz
Systems and Polynomial GCD. Proc. of the 27th ACM Symposium
on Theory of Computing (STOC 95), Las Vegas, NV, May 29-June
1, (ACM Press, New York) 1995, pp.751-761. Revised as
Efficient Parallel Factorization and Solution of Structured
and Unstructured Linear Systems, to appear in Journal of
Computer and System Sciences, 2002. [PostScript] [PDF]
145.
S. Gupta, Z. Li, and J.H. Reif, Synthesizing Efficient
Out-of-Core Programs for Block Recursive Algorithms using
Block-Cyclic Data Distributions. Proceedings of the 1996
International
Conference
on
Parallel
Processing,
Bloomingdale, IL, Proc. Int'l Conf. Parallel Processing,
vol. II, pp 142-149, 1996. August 1996. Published inIEEE
Transactions on Parallel and Distributed Systems, Vol. 10,
No. 3, March 1999, pp 297-315. [PDF] or [PostScript] [PDF]
146.
L. Nyland, J. Prins, A. Goldberg, P. Mills, J.H. Reif,
and R. Wagner. A Refinement Methodology for Developing DataParallel
Applications,
Euro-Par'96,
Lecture
Notes
in
Computer Science, Springer-Verlag, pp.145-150, 1996.
147.
S. Chen and J.H. Reif, Compression of Trees and
Digraphs, Abstract, Proceedings: IEEE Data Compression
Conference (DCC'96), Snowbird, UT, James A. Storer, Martin
Cohn (Eds.), IEEE Computer Society Press, ISBN 0-8186-73583, March 1996. [PDF]
148.
J.H. Reif and H. Wang, Nonuniform discretization
approximation for Kinodynamic motion planning and its
applications, Workshop on Foundations of Robotics, Toulouse,
France, July 1996, 97-112. Published in Siam Journal of
Computing (SICOMP), Volume 30, No. 1, pages 161-190, (2000).
[PostScript] [PDF] or [PostScript]
149.
Z. Li, P. H. Mills, and J.H. Reif, Models and Resource
Metrics for Parallel and Distributed Computation, Proc. 28th
Annual Hawaii International Conference on System Sciences
(HICSS-28 Parallel Algorithms Software Technology Track),
Wailea, Maui, Hawaii, January 3-6, 1995. Published in
Parallel Algorithms and Applications, Vol. 8, pp. 35-59,
1996. [PostScript] [PDF]
150.
E. Gelenbe, N.Schmajuk, J. Staddon, and J.H. Reif,
Autonomous Search and the Search for Robots and Mines: A
Survey, Robotics and Autonomous Systems, Vol. 22, pp. 23-33.
(November 1997). [PostScript] [PDF]
151.
J.H. Reif, Approximate Complex Polynomial Evaluation in
Near Constant Work Per Point. Proc. 29th ACM Symposium on
Theory of Computing (STOC'97), May 4-6, El Paso, Texas,
1997, pp. 30-39. Published in Siam Journal of Computing
(SICOMP), Vol. 28 Number 6 pp. 2059-2089, 1999. [PostScript]
[PDF]
152.
J.H. Reif, Efficient Approximate Solution of Sparse
Linear Systems, Published in Computers and Mathematics with
Applications, Vol. 36, No. 9, Nov. 1998, pp 37-58.
[PostScript] [PDF] (Also, see errata [PDF])
153.
J.H. Reif and S. Tate, Fast spatial decomposition and
closest pair computation for limited precision input, Tech.
Report. #N-96-001, Univ. of North Texas, Dept. of Computer
Science (1996). Journal of Algorithmica, Volume 28, Number
3, 2000, pp. 271-287. [PDF] or [PostScript] [PDF]
154.
S. Chen and J.H. Reif, Fast and Compact Fast and
Compact Volume Rendering in the Compressed Transform,
Proceedings: IEEE Data Compression Conference (DCC'97)
Snowbird, UT, James A. Storer, Martin Cohn (Eds.), IEEE
Computer Society Press, March 1997, pp 271-280. [PDF]
155.
J.H. Reif and D. Yen, Derivation of Parallel Graph
Connectivity
Algorithms
via
Stream
Contraction,
Duke
University Technical Report, 1989.
156.
J.H. Reif, Local Parallel Biomolecular Computation,
Proc. DNA-Based Computers, III: University of Pennsylvania,
June 23-26, 1997. DIMACS Series in Discrete Mathematics and
Theoretical Computer Science, H. Rubin and D. H. Wood,
editors. American Mathematical Society, Providence, RI, vol.
48, 1999, pp. 217-254. A postscript version of this paper
and
figures
are
at
URL:
[PostScript]
[PDF]
and
[PostScriptFigures]
157.
J.H. Reif, On the Impossibility of Interaction-Free
Quantum Sensing for Small I/O Bandwidth, Information and
Computation, Jan 2000, pp. 1-20. [PostScript] [PDF]
158.
J.H. Reif, Robust, Adaptive and Dynamic Robotic Motion
Planning, 19th NSF Design and Manufacturing Grantees
Conference, Monterrey, Mexico, Jan 1998. [PostScript] [PDF]
159.
J.H. Reif and S. Sen, Parallel Computational Geometry:
An approach using randomization. Published as Chapter 8 in
Handbook of Computational Geometry, Edited by Jorge Urrutia
and
Jörg-Rudiger
Sack,
Elsevier
Science
Publishing,
Amsterdam, the Netherlands, pp. 765-828. 1999. [PostScript]
[PDF]
160.
J.H. Reif, Paradigms for Biomolecular Computation,
First International Conference on Unconventional Models of
Computation, Auckland, New Zealand, January 1998. Published
in Unconventional Models of Computation, edited by C.S.
Calude, J. Casti, and M.J. Dinneen, Springer Publishers,
January 1998, pp 72-93. [PostScript] [PDF]
161.
J.H.
Reif
and
J.
A.
Storer,
Optimal
Lossless
Compression of a Class of Dynamic Sources, Data Compression
Conference (DCC'98), Snowbird, UT, James A. Storer, Martin
Cohn (Eds.), IEEE Computer Society Press, March, 1998.
[PDF]. Published as Optimal Encoding of Non-stationary
Sources, Special Issue of Information Sciences, Volume 135,
pp. 87-105 (2001). [PDF]
162.
J.H. Reif and H. Wang, The Complexity of the Two
Dimensional Curvature-Constrained Shortest-Path Problem,
Third International Workshop on Algorithmic Foundations of
Robotics (WAFR98), Pub. by A. K. Peters Ltd, Houston, Texas,
pages 49-57, June, 1998. [PostScript] [PDF]
163.
J.H. Reif and Z. Sun, The Computational Power of
Frictional Mechanical Systems, Third International Workshop
on Algorithmic Foundations of Robotics, (WAFR98), Pub. by A.
K. Peters Ltd, Houston, Texas, pages 223-236, Mar. 5-7 1998.
Published
as
The
Computational
Power
of
Frictional
Mechanical Systems, SIAM Journal of Computing(SICOMP), Vol.
32, No. 6, pp. 1449-1474, (2003). [PDF] or [PDF]. Talk
slides: [HTML]
164.
A. Gehani and J.H. Reif, Micro flow Bio-Molecular
Computation, 4th DIMACS Workshop on DNA Based Computers,
University of Pennsylvania, June 15-19, 1998. DNA Based
Computers, IV, DIMACS Series in Discrete Mathematics and
Theoretical Computer Science, (ed. H. Rubin), American
Mathematical Society, 1999. Also appeared in a special issue
of Biosystems, Journal of Biological and Informational
Processing Sciences, Vol. 52, Nos. 1-3, (Edited By L. Kari,
H. Rubin, and D. H. Wood), pp 197-216, (October 1999).
[PostScript] [PDF]
165.
J.H.
Reif,
Alternative
Computational
Models:
A
Comparison of Biomolecular and Quantum Computation, 18th
Invited paper, International Conference on Foundations of
Software
Technology
and
Theoretical
Computer
Science
(FST&TCS98), (December, 1998). [PostScript] [PDF]
166.
J.H. Reif and Zheng Sun, Nano-Robotics Motion Planning
and Its Applications in Nanotechnology and Biomolecular
Computing, NSF Design and Manufacturing Grantees Conference,
Jan 5-8, 1999. [HTML]
167.
LaBean, T. H., Yan, H., Kopatsch, J., Liu, F., Winfree,
E., Reif, J.H. & Seeman, N.C., The construction, analysis,
ligation
and
self-assembly
of
DNA
triple
crossover
complexes, Journal of American Chemistry Society(JACS) 122,
1848-1860 (2000). [PDF]
168.
J.H. Reif, Efficient Quantum Compression, submitted for
publication, November, 1999. [PostScript] [PDF]
169.
J.H. Reif, Quantum Information Processing: Compression,
Coding, and Related Computations, (Jan., 1999) [PostScript]
[PDF]
170.
John Fischer and John Reif, Nonparametric Multiscale
Multimodal Model for Detection/Recognition, Multi-Modality
Image Fusion Conference, Rochester, NY, Oct 6-7, 1999. [PDF]
171.
Gehani, A., T. H. LaBean, and J.H. Reif, DNA-based
Cryptography, Proc. DNA Based Computers V: Cambridge, MA,
June 14-16, 1999. Published in DIMACS Series in Discrete
Mathematics and Theoretical Computer Science, Volume 54,
edited by E. Winfree and D.K. Gifford, American Mathematical
Society, Providence, RI, pp. 233-249, (2000). [PDF] talk
slides: [PDF]. Published as an invited paper in "Aspects of
Molecular Computing - Essays dedicated to Tom Head on the
occasion of his 70th Birthday", Springer Verlag series in
Natural Computing (edited by N. Jonoska, G. Paun and G.
Rozenberg) LNCS 2950 Festschrift, Springer, pp. 167-188,
(2004).
172.
T. H. LaBean, E. Winfree, and J.H. Reif, Experimental
Progress in Computation by Self-Assembly of DNA Tilings,
Published in DIMACS Series in Discrete Mathematics and
Theoretical Computer Science, Volume 54, edited by E.
Winfree and D.K. Gifford, American Mathematical Society,
Providence, RI, pp. 123-140, (2000). [PostScript] [PDF] or
[PostScript] and [HTML Lecture]
173.
J.H. Reif and Z. Sun. An efficient approximation
algorithm for weighted region shortest path problem. In
Proceedings of the 4th Workshop on Algorithmic Foundations
of Robotics(WAFR2000),Pub. by A. K. Peters Ltd, Hanover, New
Hampshire, pages 191-203, Mar. 16-18 2000. [PostScript]
[PDF]. Talk slides: [HTML]
174.
J.H. Reif and Z. Sun. Movement planning in the presence
of flows. In Proceedings of the 7th International Workshop
on Algorithms and Data Structures (WADS2001), volume 2125 of
Lecture Notes in Computer Science, pages 450-461, Brown
University, Providence, RI, August 8-10, (2001). Published
in Algorithmica, Volume 39, Number 2, pages 127-153,
February 2004. [PDF] or [PDF]. Talk slides: [HTML]
175.
J.H. Reif and T. H. LaBean, Computationally Inspired
Biotechnologies: Improved DNA Synthesis and Associative
Search Using Error-Correcting Codes and Vector-Quantization,
Sixth International Meeting on DNA Based Computers (DNA6),
DIMACS Series in Discrete Mathematics and Theoretical
Computer Science, Edited by A. Condon and G. Rozenberg.
Lecture Notes in Computer Science, Springer-Verlag, Berlin
Heidelberg, vol. 2054, pp. 145-172 (2001). [PostScript]
[PDF] talk slides: [PDF]
176.
J.H. Reif, T.H. LaBean, and N.C. Seeman, Challenges and
Applications for Self-Assembled DNA Nanostructures, Proc.
Sixth International Workshop on DNA-Based Computers, Leiden,
The Netherlands, June, 2000. DIMACS Series in Discrete
Mathematics and Theoretical Computer Science, Edited by A.
Condon and G. Rozenberg. Lecture Notes in Computer Science,
Springer-Verlag, Berlin Heidelberg, vol. 2054, 2001, pp.
173-198. [PostScript] [PDF] talk slides: [PDF] [PPT]
177.
C. Mao, LaBean, T.H. Reif, J.H., Seeman, Logical
Computation Using Algorithmic Self-Assembly of DNA TripleCrossover Molecules, Nature, vol. 407, Sept. 28 2000, pp.
493-495; C. Erratum: Nature 408, 750-750(2000). [PDF] or
[PDF]
178.
J.H. Reif and T. H. LaBean, and N.C. Seeman.
"Programmable Assembly at the Molecular Scale: Self-Assembly
of DNA Lattices", Invited paper, 2001 IEEE International
Conference on Robotics and Automation (ICRA2001), Seoul,
Korea, ed. Lee Beom (May, 2001).
179.
Z. Sun and J.H. Reif. BUSHWHACK: An approximation
algorithm for minimal paths through pseudo-Euclidean spaces.
In Proceedings of the 12th Annual International Symposium on
Algorithms and Computation(ISAAC01),
Christchurch, New
Zealand, Dec 19-21, 2001, Pub. in volume 2223 of Lecture
Notes in Computer Science, pages 160-171, Dec, 2001.
[PostScript] [PDF]
180.
J. H. Reif, T. H. LaBean, M. Pirrung, V. Rana, B. Guo,
K. Kingsford, and G. Wickham, Experimental Construction of
Very Large Scale DNA Databases with Associative Search
Capability, Seventh International Meeting on DNA Based
Computers (DNA7), Tampa, FL, June 11-13, 2001. Lecture Notes
in Computer Science, Springer-Verlag, New York, Volume 2340,
pages 231-247, (2002). [PostScript] [PDF] slides: [PDF]
[PPT]
181.
J. H. Reif, DNA Lattices: A Method for Molecular Scale
Patterning
and
Computation,
special
issue
on
BioComputation, Computer and Scientific Engineering Magazine,
IEEE Computer Society, Vol. 4, No. 1, February 2002, pp 3241. [PostScript][PDF]
182.
J. H. Reif, The Emergence of the Discipline of
Biomolecular Computation in the US, invited paper to the
special issue on Biomolecular Computing, New Generation
Computing, edited by Masami Hagiya, Masayuki Yamamura, and
Tom
Head,
Vol.
20,
No.
3,
pp.
217-236,
(2002).
[PostScript][PDF]
183.
J. H. Reif, Molecular Assembly and Computation: From
Theory to Experimental Demonstrations, plenary paper, 29-th
International
Colloquium
on
Automata,
Languages,
and
Programming(ICALP), Málaga, Spain (July 8, 2002). Lecture
Notes in Computer Science, New York, Volume 2380, pages 121, (2002). [PostScript][PDF] slides: [PDF] [PPT]
184.
J. H. Reif, The Design of Autonomous DNA Nanomechanical
Devices: Walking and Rolling DNA. DNA Based Computers
(DNA8), Sapporo, Japan, June 10-13, 2002, (Edited by Masami
Hagiya and Azuma Ohuchi), Lecture Notes in Computer Science,
No. 2568, Springer-Verlag, New York, (2003), pages 22-37.
Published in Natural Computing, DNA8 special issue, Vol. 2,
p 439-461, (2003). [PDF] or [PostScript][PDF] Talk Slides:
[PDF]
185.
Dage Liu, John H. Reif, Thomas H. LaBean, DNA
Nanotubes, Construction and Characterization of Filaments
Composed of TX-tile Lattice. DNA Based Computers (DNA8),
Sapporo, Japan, June 10-13, 2002, (Edited by Masami Hagiya
and Azuma Ohuchi), Lecture Notes in Computer Science, No.
2568, Springer-Verlag, New York, (2003), pages 10-21.
Published as “DNA nanotubes self-assembled from triplecrossover tiles as templates for conductive nanowires”,
Proceedings of the National Academy of Science(PNAS), Vol.
101, No. 3, pp 717-722, (January 20, 2004).[PDF]
186.
John H. Reif, DNA Computation - Perspectives: Successes
and Challenges, Science, 296: 478-479, April 19, 2002.
[PostScript][PDF]
187.
Z. Sun and J. H. Reif, On Energy-minimizing Paths on
Terrains for a Mobile Robot, 2003 IEEE International
Conference on Robotics and Automation(ICRA2003), Taipei,
Taiwan, May 12-17, 2003. [PostScript] [PDF]
188.
D. Hsu, T. Jiang, J. H. Reif, and Z. Sun, The Bridge
Test for Sampling Narrow Passages with Probabilistic Roadmap
Planners, 2003 IEEE International Conference on Robotics and
Automation(ICRA2003), Taipei, Taiwan, May 12-17, 2003.
[PostScript] [PDF]
189.
Z. Sun and J. H. Reif, On Boundaries of Highly Visible
Spaces and Applications, 14th Symposium on Fundamentals of
Computation Theory, Malmö Högskola, Sweden, August 12-15,
2003, Springer-Verlag Lecture Notes in Computer Science,
2003. Invited publication in special issue of Theoretical
Computer Science, 2004. [PostScript] [PDF]
190.
Hao Yan, Thomas H. LaBean, Liping Feng, and John H.
Reif, Directed Nucleation Assembly of Barcode Patterned DNA
Lattices,
Proceedings
of
the
National
Academy
of
Science(PNAS), Volume 100, No. 14, pp. 8103-8108, July 8,
(2003). [PostScript] [PDF]
191.
Hao Yan, Liping Feng, Thomas H. LaBean, and John Reif,
DNA Nanotubes, Parallel Molecular Computation of Pair-Wise
XOR Using DNA String Tile, Ninth International Meeting on
DNA Based Computers (DNA9), Madison, Wisconsin, June 2-4,
2003, (Edited by Junghuei Chen and John Reif), Abstract in
Lecture Notes in Computer Science, Springer-Verlag, New
York, (2003). Published in Journal of American Chemistry
Society(JACS), Vol. 125, No. 47, pp. 14246-14247, 2003.
[PDF] or [PDF]
192.
Hao Yan, Sung Ha Park, Liping Feng, John Reif, and
Thomas
H.
LaBean,
4x4
DNA
Tile
and
Lattices:
Characterization, Self-Assembly and Metallization of a Novel
DNA Nanostructure Motif, Ninth International Meeting on DNA
Based Computers (DNA9), Madison, Wisconsin, June 2-4, 2003,
(Edited by Junghuei Chen and John Reif), Lecture Notes in
Computer
Science,
Springer-Verlag,
New
York,
(2003).
Published as Hao Yan, Sung Ha Park, Gleb Finkelstein, John
H. Reif, and Thomas H. LaBean, DNA-Templated Self-Assembly
of Protein Arrays and Highly Conductive Nanowires, Science,
Vol. 301, pp. 1882-1884, Sep 26 2003. [PDF] or [PDF]
193.
Liping Feng, Sung Ha Park, John H. Reif, and Hao Yan, A
Two State DNA Lattice Actuated by DNA Motors, Angewandte
Chemie [International Edition], Vol. 42, pp. 4342-4346,
Sept. 2003. [PDF] or [PDF]
194.
J. H.
Reif and Z. Sun, Adaptive and Compact
Discretization for Weighted Region Optimal Path Finding.
14th Symposium on Fundamentals of Computation Theory, Malmö
Högskola, Sweden, August 12-15, 2003, Springer-Verlag
Lecture Notes in Computer Science, 2003. [PostScript] [PDF]
195.
Tinging Jiang and John H. Reif, Efficient Methods for
Stochastic Simulations of Biomolecular Motions, submitted
for publication, July, 2003. [PDF]
196.
Li, H.; Park, S. H.; Reif, John H.; LaBean, T. H.;
Yan, H.,
DNA-Templated Self-Assembly of Protein and
Nanoparticle Linear Arrays, Journal of American Chemistry
Society(JACS), Vol. 126, No. 2, pp. 418-419, 2004. [PDF]
197.
Thomas H. LaBean, Hao Yan, Sung Ha Park, Liping Feng,
Peng Yin, Hanying Li, Sang Jung Ahn, Dage Liu, Xiaoju Guan,
and John H. Reif, Overview of New Structures for DNA-Based
Nanofabrication and Computation, Invited paper to appear in
Information Sciences, 2004. [PDF]
198.
John H. Reif, Sudheer Sahu, Peng Yin, Compact ErrorResilient
Computational
DNA
Tiling
Assemblies,
Tenth
International Meeting on DNA Based Computers (DNA10),
Milano, Italy, June 7-10, 2004. Lecture Notes in Computer
Science, Springer-Verlag, New York, (2004).
[PDF] Talk:
[PDF] [PPT]
199.
Peng Yin, Hao Yan, Xiaoju G. Daniell Andrew J.
Turberfield, John H. Reif, A Unidirectional DNA Walker
Moving Autonomously Along a Linear Track, Submitted for
publication, 2004. Abstract: [PDF] Poster: [PDF] [PPT]
200.
Peng Yin, Andrew J. Turberfield, John H. Reif, Designs
for Autonomous Unidirectional Walking DNA Devices, Tenth
International Meeting on DNA Based Computers (DNA10),
Milano, Italy, June 7-10, 2004. Lecture Notes in Computer
Science, Springer-Verlag, New York, (2004). [PDF] Talk:
[PDF] [PPT]
201.
Peng Yin, Andrew J. Turberfield, John H. Reif, Design
of an Autonomous DNA Nanomechanical Device Capable of
Universal Computation and Universal Translational Motion,
Tenth International Meeting on DNA Based Computers (DNA10),
Milano, Italy, June 7-10, 2004. Lecture Notes in Computer
Science, Springer-Verlag, New York, (2004). [PDF] Poster:
[PDF] [PPT]
202.
Peng Yin, Bo Guo, Christina Belmore, Will Palmeri,
Erik Winfree, Thomas H. LaBean, John H. Reif, TileSoft:
Sequence Optimization Software For Designing DNA Secondary
Structures, Poster, Tenth International Meeting on DNA
Based Computers (DNA10), Milano, Italy, June 7-10, 2004.
Lecture Notes in Computer Science, Springer-Verlag, New
York, (2004). [PDF] Poster: [PDF] [PPT]
203.
John H. Reif, DNA-Based Nano-Engineering: DNA and its
Enzymes as the Engines of Creation at the Molecular Scale,
Invited Talk, Tenth International Meeting on DNA Based
Computers (DNA10), Milano, Italy, June 7-10, 2004. Lecture
Notes in Computer Science, Springer-Verlag, New York,
(2004). Abstract: [PDF] Talk: [PDF] [PPT]
204.
John H. Reif, Thomas LaBean, Sudheer Sahu, Hao Yan,
Peng
Yin,
Design,
Simulation,
and
Experimental
Demonstration of Self-Assembled DNA Nanostructures and DNA
Motors, Computational Modeling and Simulation of Materials
(CIMTEC) Conference, Acireale, Sicily, Italy, May 29-June
4, 2004 [PDF]