| 2019 | DNA | Implementing Arbitrary CRNs Using Strand Displacing Polymerase. | Shalin Shah, Tianqi Song, Xin Song, Ming Yang, John H. Reif |
| 2018 | DNA | Temporal DNA Barcodes: A Time-Based Approach for Single-Molecule Imaging. | Shalin Shah, John H. Reif |
| 2011 | DNA | Localized Hybridization Circuits. | Harish Chandran, Nikhil Gopalkrishnan, Andrew Phillips, John H. Reif |
| 2010 | DNA | High-Fidelity DNA Hybridization Using Programmable Molecular DNA Devices. | Nikhil Gopalkrishnan, Harish Chandran, John H. Reif |
| 2010 | WAFR | Robomotion: Scalable, Physically Stable Locomotion for Self-reconfigurable Robots. | Sam Slee, John H. Reif |
| 2009 | DNA | Design of a Biomolecular Device That Executes Process Algebra. | Urmi Majumder, John H. Reif |
| 2009 | ICALP | The Tile Complexity of Linear Assemblies. | Harish Chandran, Nikhil Gopalkrishnan, John H. Reif |
| 2008 | DNA | Isothermal Reactivating Whiplash PCR for Locally Programmable Molecular Computation. | John H. Reif, Urmi Majumder |
| 2008 | UC | A Framework for Designing Novel Magnetic Tiles Capable of Complex Self-assemblies. | Urmi Majumder, John H. Reif |
| 2007 | DNA | Activatable Tiles: Compact, Robust Programmable Assembly and Other Applications. | Urmi Majumder, Thomas H. LaBean, John H. Reif |
| 2007 | DNA | Autonomous Programmable Nanorobotic Devices Using DNAzymes. | John H. Reif, Sudheer Sahu |
| 2007 | WoLLIC | Autonomous Programmable Biomolecular Devices Using Self-assembled DNA Nanostructures. | John H. Reif, Thomas H. LaBean |
| 2006 | DNA | Design and Simulation of Self-repairing DNA Lattices. | Urmi Majumder, Sudheer Sahu, Thomas H. LaBean, John H. Reif |
| 2006 | DNA | Capabilities and Limits of Compact Error Resilience Methods for Algorithmic Self-assembly in Two and Three Dimensions. | Sudheer Sahu, John H. Reif |
| 2006 | DNA | A Framework for Modeling DNA Based Molecular Systems. | Sudheer Sahu, Bei Wang, John H. Reif |
| 2006 | WAFR | Asymptotically Optimal Kinodynamic Motion Planning for Self-reconfigurable Robots. | John H. Reif, Sam Slee |
| 2005 | DNA | Complexity of Graph Self-assembly in Accretive Systems and Self-destructible Systems. | John H. Reif, Sudheer Sahu, Peng Yin |
| 2005 | DNA | A Self-assembly Model of Time-Dependent Glue Strength. | Sudheer Sahu, Peng Yin, John H. Reif |
| 2005 | DNA | Design of Autonomous DNA Cellular Automata. | Peng Yin, Sudheer Sahu, Andrew J. Turberfield, John H. Reif |
| 2004 | DNA | Compact Error-Resilient Computational DNA Tiling Assemblies. | John H. Reif, Sudheer Sahu, Peng Yin |
| 2004 | DNA | Designs of Autonomous Unidirectional Walking DNA Devices. | Peng Yin, Andrew J. Turberfield, John H. Reif |
| 2004 | DNA | Design of an Autonomous DNA Nanomechanical Device Capable of Universal Computation and Universal Translational Motion. | Peng Yin, Andrew J. Turberfield, Sudheer Sahu, John H. Reif |
| 2003 | FCT | On Boundaries of Highly Visible Spaces and Applications. | John H. Reif, Zheng Sun |
| 2003 | FCT | Adaptive and Compact Discretization for Weighted Region Optimal Path Finding. | Zheng Sun, John H. Reif |
| 2003 | ICRA | The bridge test for sampling narrow passages with probabilistic roadmap planners. | David Hsu, Tingting Jiang, John H. Reif, Zheng Sun |
| 2003 | ICRA | On energy-minimizing paths on terrains for a mobile robot. | Zheng Sun, John H. Reif |
| 2002 | DNA | DNA Nanotubes: Construction and Characterization of Filaments Composed of TX-tile Lattice. | Dage Liu, John H. Reif, Thomas H. LaBean |
| 2002 | DNA | The Design of Autonomous DNA Nanomechanical Devices: Walking and Rolling DNA. | John H. Reif |
| 2002 | ICALP | Molecular Assembly and Computation: From Theory to Experimental Demonstrations. | John H. Reif |
| 2001 | DNA | Experimental Construction of Very Large Scale DNA Databases with Associative Search Capability. | John H. Reif, Thomas H. LaBean, Michael Pirrung, Vipul S. Rana, Bo Guo, Carl Kingsford, Gene S. Wickham |
| 2001 | ICRA | Programmable Assembly at the Molecular Scale: Self-Assembly of DNA Lattices (Invited Paper). | John H. Reif, Thomas H. LaBean, Nadrian C. Seeman |
| 2001 | ISAAC | BUSHWHACK: An Approximation Algorithm for Minimal Paths through Pseudo-Euclidean Spaces. | Zheng Sun, John H. Reif |
| 2001 | WADS | Movement Planning in the Presence of Flows. | John H. Reif, Zheng Sun |
| 2000 | DNA | Computationally Inspired Biotechnologies: Improved DNA Synthesis and Associative Search Using Error-Correcting Codes and Vector-Quantization. | John H. Reif, Thomas H. LaBean |
| 2000 | DNA | Challenges and Applications for Self-Assembled DNA Nanostructures. | John H. Reif, Thomas H. LaBean, Nadrian C. Seeman |
| 1998 | DCC | Optimal Lossless Compression of a Class of Dynamic Sources. | John H. Reif, James A. Storer |
| 1997 | DCC | Fast and Compact Volume Rendering in the Compressed Transform Domain. | Sefeng Chen, John H. Reif |
| 1997 | DCC | Low-Cost Prevention of Error Propagation for Data Compression with Dynamic Dictionaries. | James A. Storer, John H. Reif |
| 1997 | STOC | Approximate Complex Polynomial Evaluation in Near Constant Work Per Point. | John H. Reif |
| 1996 | DCC | Efficient Lossless Compression of Trees and Graphs. | Shenfeng Chen, John H. Reif |
| 1996 | EuroPar | A Refinement Methodology for Developing Data-Parallel Applications. | Lars S. Nyland, Jan F. Prins, Allen Goldberg, Peter Mills, John H. Reif, Robert A. Wagner |
| 1996 | ICPP | Synthesizing Efficient Out-of-Core Programs for Block Recursive Algorithms Using Block-Cyclic Data Distributions. | Zhiyong Li, John H. Reif, Sandeep K. S. Gupta |
| 1995 | DCC | Fast Pattern Matching for Entropy Bounded Text. | Shenfeng Chen, John H. Reif |
| 1995 | FOCS | Efficient Parallel Solution of Sparse Eigenvalue and Eigenvector Problems. | John H. Reif |
| 1995 | ICALP | Stochastic Graphs Have Short Memory: Fully Dynamic Connectivity in Poly-Log Expected Time. | Sotiris E. Nikoletseas, John H. Reif, Paul G. Spirakis, Moti Yung |
| 1995 | VR | Design and applications of a high-resolution insert head-mounted-display. | Akitoshi Yoshida, Jannick P. Rolland, John H. Reif |
| 1995 | STOC | Work efficient parallel solution of Toeplitz systems and polynomial GCD. | John H. Reif |
| 1995 | SPAA | Parallel Molecular Computation. | John H. Reif |
| 1994 | DCC | Data Compression Techniques for Stock Market Prediction. | Salman Azhar, Greg J. Badros, Arman Glodjo, Ming-Yang Kao, John H. Reif |
| 1994 | FOCS | An O(n^1+epsilon log b) Algorithm for the Complex Roots Problem | C. Andrew Neff, John H. Reif |
| 1994 | SODA | Dynamic Algebraic Algorithms. | John H. Reif, Stephen R. Tate |
| 1994 | SPAA | O(log² n) Time Efficient Parallel Factorization of Dense, Sparse Separable, and Banded Matrices. | John H. Reif |
| 1994 | SPAA | Dynamic Parallel Tree Contraction (Extended Abstract). | John H. Reif, Stephen R. Tate |
| 1993 | DCC | Multispectral Image Compression Algorithms. | Tassos Markas, John H. Reif |
| 1993 | FOCS | Using Difficulty of Prediction to Decrease Computation: Fast Sort, Priority Queue and Convex Hull on Entropy Bounded Inputs | Shenfeng Chen, John H. Reif |
| 1993 | FOCS | An O(n log ^3 n) Algorithm for the Real Root Problem | John H. Reif |
| 1993 | ICALP | The Complexity of N-body Simulation. | John H. Reif, Stephen R. Tate |
| 1993 | SODA | Searching in an Unknown Environment: An Optimal Randomized Algorithm for the Cow-Path Problem. | Ming-Yang Kao, John H. Reif, Stephen R. Tate |
| 1993 | SPAA | Parallel and Output Sensitive Algorithms for Combinatorial and Linear Algebra Problems. | Joseph Cheriyan, John H. Reif |
| 1993 | WADS | A Dynamic Separator Algorithm. | Deganit Armon, John H. Reif |
| 1992 | DCC | Optical Techniques for Image Compression. | John H. Reif, Akitoshi Yoshida |
| 1992 | FOCS | The Power of Combining the Techiques of Algebraic and Numerical Computing: Improved Approximate Multipoint Polynomial Evaluation and Improved Multipole Algorithms | Victor Y. Pan, John H. Reif, Stephen R. Tate |
| 1992 | SODA | Directed | Joseph Cheriyan, John H. Reif |
| 1992 | SPAA | Space and Time Efficient Implementations of Parallel Nested Dissection. | Deganit Armon, John H. Reif |
| 1992 | SPAA | Efficient Parallel Algorithms for Computing all Pair Shortest Paths in Directed Graphs. | Yijie Han, Victor Y. Pan, John H. Reif |
| 1992 | SPAA | Implementations of Randomized Sorting on Large Parallel Machines. | William L. Hightower, Jan F. Prins, John H. Reif |
| 1991 | DCC | Image Compression Methods with Distortion Controlled Capabilities. | Tassos Markas, John H. Reif |
| 1991 | STOC | An Efficient Algorithm for the Genus Problem with Explicit Construction of Forbidden Subgraphs | Hristo N. Djidjev, John H. Reif |
| 1990 | FOCS | The Computability and Complexity of Optical Beam Tracing | John H. Reif, J. D. Tygar, Akitoshi Yoshida |
| 1990 | ICALP | On the Bit-Complexity of Discrete Solutions of PDEs: Compact Multigrid. | Victor Y. Pan, John H. Reif |
| 1990 | SPAA | A Randomized Parallel Algorithm for Planar Graph Isomorphism. | Hillel Gazit, John H. Reif |
| 1990 | SPAA | Randomized Algorithms for Binary Search and Load Balancing with Geometric Applications. | John H. Reif, Sandeep Sen |
| 1989 | COLT | The Light Bulb Problem. | Ramamohan Paturi, Sanguthevar Rajasekaran, John H. Reif |
| 1989 | FOCS | An Optimal Parallel Algorithm for Graph Planarity (Extended Abstract) | Vijaya Ramachandran, John H. Reif |
| 1989 | STOC | Polling: A New Randomized Sampling Technique for Computational Geometry | John H. Reif, Sandeep Sen |
| 1989 | STOC | Optimal Size Integer Division Circuits | John H. Reif, Stephen R. Tate |
| 1988 | FOCS | On the Complexity of Kinodynamic Planning | John F. Canny, Bruce Randall Donald, John H. Reif, Patrick G. Xavier |
| 1988 | ICALP | Nested Annealing: A Provable Improvement to Simulated Annealing. | Sanguthevar Rajasekaran, John H. Reif |
| 1988 | MFCS | 3-Dimensional Shortest Paths in the Presence of Polyhedral Obstacles. | John H. Reif, James A. Storer |
| 1987 | FCT | Ranomized Parallel Computation. | Sanguthevar Rajasekaran, John H. Reif |
| 1987 | FOCS | New Lower Bound Techniques for Robot Motion Planning Problems | John F. Canny, John H. Reif |
| 1987 | FOCS | Some Polynomial and Toeplitz Matrix Computations | Victor Y. Pan, John H. Reif |
| 1987 | ICPP | Optimal Randomized Parallel Algorithms for Computational Geometry. | John H. Reif, Sandeep Sen |
| 1986 | FOCS | An Efficient Parallel Algorithm for Planarity | Philip N. Klein, John H. Reif |
| 1986 | TARK | The Logic of Distributed Protocols. | Richard E. Ladner, John H. Reif |
| 1985 | CRYPTO | Efficient Parallel Pseudo-Random Number Generation. | John H. Reif, J. D. Tygar |
| 1985 | FCT | Probabilistic algorithms in group theory. | John H. Reif |
| 1985 | FOCS | Parallel Tree Contraction and Its Application | Gary L. Miller, John H. Reif |
| 1985 | FOCS | An Optimal Parallel Algorithm for Integer Sorting | John H. Reif |
| 1985 | FOCS | Motion Planning in the Presence of Moving Obstacles | John H. Reif, Micha Sharir |
| 1985 | STOC | A Simple Three-Dimensional Real-Time Reliable Cellular Array | Pter Gcs, John H. Reif |
| 1985 | STOC | Efficient Parallel Solution of Linear Systems | Victor Y. Pan, John H. Reif |
| 1984 | ICALP | Probabilistic Bidding Gives Optimal Distributed Resource Allocation. | John H. Reif, Paul G. Spirakis |
| 1984 | STOC | The Complexity of Elementary Algebra and Geometry (Preliminary Abstract) | Michael Ben-Or, Dexter Kozen, John H. Reif |
| 1983 | FOCS | Logarithmic Depth Circuits for Algebraic Functions | John H. Reif |
| 1983 | ICALP | A Multiprocess Network Logic with Temporal and Spatial Modalities. | John H. Reif, A. Prasad Sistla |
| 1983 | STOC | A Logarithmic Time Sort for Linear Size Networks | John H. Reif, Leslie G. Valiant |
| 1982 | FOCS | Parallel Time O(log N) Acceptance of Deterministic CFLs | John H. Reif |
| 1982 | ICALP | On the Power of Probabilistic Choice in Synchronous Parallel Computations. | John H. Reif |
| 1982 | PODC | Real Time Resource Allocation in Distributed Systems. | John H. Reif, Paul G. Spirakis |
| 1982 | POPL | Unbounded Speed Variability in Distributed Communication Systems. | John H. Reif, Paul G. Spirakis |
| 1982 | STOC | Symmetric Complementation | John H. Reif |
| 1981 | FOCS | The Propositional Dynamic Logic of Deterministic, Well-Structured Programs (Extended Abstract) | Joseph Y. Halpern, John H. Reif |
| 1981 | ICALP | Minimum S-T Cut of a Planar Undirected Network in O(n log²(n)) Time. | John H. Reif |
| 1981 | STOC | Distributed Algorithms for Synchronizing Interprocess Communication within Real Time | John H. Reif, Paul G. Spirakis |
| 1980 | POPL | A Dynamic Logic of Multiprocessing with Incomplete Information. | John H. Reif, Gary L. Peterson |
| 1980 | STOC | Logics for Probabilistic Programming (Extended Abstract) | John H. Reif |
| 1980 | STOC | Random Matroids | John H. Reif, Paul G. Spirakis |
| 1979 | FOCS | Multiple-Person Alternation | Gary L. Peterson, John H. Reif |
| 1979 | FOCS | Complexity of the Mover's Problem and Generalizations (Extended Abstract) | John H. Reif |
| 1979 | POPL | Data Flow Analysis of Communicating Processes. | John H. Reif |
| 1979 | STOC | On Determining the Genus of a Graph in O(v^O(g)) Steps | I. S. Filotti, Gary L. Miller, John H. Reif |
| 1979 | STOC | Universal Games of Incomplete Information | John H. Reif |
| 1978 | POPL | Symbolic Programming Analysis in Almost Linear Time. | John H. Reif |
| 1977 | POPL | Symbolic Evaluation and the Global Value Graph. | John H. Reif, Harry R. Lewis |