John H. Reif

Bio

Molecular assembly, DNA computing, robot motion planning, parallel algorithms, randomized algorithms, graph algorithms, algebraic computation, data compression, optical computation, and quantum computation.

Education

• B.S. Tufts University, 1973
• M.S. Harvard University, 1975
• Ph.D. Harvard University, 1977

Positions

• A. Hollis Edens Distinguished Professor of Computer Science
• Professor of Computer Science
• Professor in the Thomas Lord Department of Mechanical Engineering and Materials Science

Awards, Honors, and Distinctions

• Tufts Notable. Tufts University. 2010
• AAAS Fellow. American Association for the Advancement of Science. 2003
• Highly Cited Researcher. Thomson Reuters. 2001
• Fellow. Association for Computing Machinery. 1997
• Fellows. Institute for Electrical and Electronics Engineers. 1993

Courses Taught

• COMPSCI 93: History of Computing, Cryptography, and Robotic Devices
• COMPSCI 891: Special Readings in Computer Science
• COMPSCI 590D: Advanced Topics in Computer Science
• COMPSCI 534D: Computational Complexity
• COMPSCI 534: Computational Complexity
• COMPSCI 531D: Introduction to Algorithms

Publications

• Fu D, Reif J. A biomimetic branching signal-passing tile assembly model with dynamic growth and disassembly. Journal of the Royal Society, Interface. 2024 Aug;21(217):20230755.
• Nagipogu RT, Reif JH. Leak-resilient enzyme-free nucleic acid dynamical systems through shadow cancellation. Journal of the Royal Society Interface. 2024 Jun 19;21(215).
• Nagipogu RT, Fu D, Reif JH. A survey on molecular-scale learning systems with relevance to DNA computing. Nanoscale. 2023 May;15(17):7676u201394.
• Yang M, Reif J. Social DNA Nanorobots. In: Natural Computing Series. 2023. p. 371u201396.
• Fu D, Pradeep Narayanan R, Prasad A, Zhang F, Williams D, Schreck JS, et al. Automated design of 3D DNA origami with non-rasterized 2D curvature. Science advances. 2022 Dec;8(51):eade4455.
• Reif J, Fu D, Williams D, Yan H, Zhang F, Prasad A. Data from: Automated design of 3D DNA origami with non-rasterized 2D curvature. 2022.
• Bui H, Chandran H, Garg S, Gopalkrishnan N, Mokhtar R, Reif J, et al. DNA computing. In: Computing Handbook: Two-Volume Set. 2022. p. 1u201342.
• Song X, Coulter FJ, Yang M, Smith JL, Tafesse FG, Messer WB, et al. A lyophilized colorimetric RT-LAMP test kit for rapid, low-cost, at-home molecular testing of SARS-CoV-2 and other pathogens. Scientific reports. 2022 Apr;12(1):7043.
• Song X, Shah S, Reif J. Multidimensional data organization and random access in large-scale DNA storage systems. Theoretical Computer Science. 2021 Nov 26;894:190u2013202.
• Song X, Shah S, Reif J. An Overview of DNAu2010Based Digital Data Storage. In: Katz E, editor. DNA- and RNA-Based Computing Systems. John Wiley & Sons; 2021. p. 345u201352.
• Fu D, Reif J. 3d DNA nanostructures: The nanoscale architect. Applied Sciences (Switzerland). 2021 Mar 2;11(6).
• Mokhtar R, Song T, Fu D, Shah S, Song X, Yang M, et al. DNA Origami Transformers. In: DNA- and RNA-Based Computing Systems. 2021. p. 307u201326.
• Song X, Reif J. Optics-Free Imaging with DNA Microscopy: An Overview. In: Adamatzky A, editor. Handbook of Unconventional Computing. World Scientific; 2021. p. 181u201391.
• Song X, Fu D, Shah S, Reif J. UV-Micropatterned Miniaturization: Rapid In Situ Photopatterning and Miniaturization of Microscale Features on Shrinkable Thermoplastics. Advanced Materials Technologies. 2020 Jun 1;5(6).
• Shah S, Wee J, Song T, Ceze L, Strauss K, Chen Y-J, et al. Using Strand Displacing Polymerase To Program Chemical Reaction Networks. Journal of the American Chemical Society. 2020 May;142(21):9587u201393.
• Garg S, Bui H, Eshra A, Shah S, Reif J. Nucleic Acid Hairpins: A Robust and Powerful Motif for Molecular Devices. In: World Scientific Series in Nanoscience and Nanotechnology. 2020. p. 175u201399.
• Narayanan RP, Fu D, Zhang F, Williams D, Schreck J, Reif J, et al. Autonomous Design of Biomimetic 3D DNA Origami Capsules. In: 17th Annual Conference on Foundations of Nanoscience, FNANO 2020: Self-Assembled Architectures and Devices. 2020. p. 164u20135.
• Song T, Eshra A, Shah S, Bui H, Fu D, Yang M, et al. Fast and compact DNA logic circuits based on single-stranded gates using strand-displacing polymerase. Nature nanotechnology. 2019 Nov;14(11):1075u201381.
• Song T, Shah S, Bui H, Garg S, Eshra A, Fu D, et al. Programming DNA-Based Biomolecular Reaction Networks on Cancer Cell Membranes. Journal of the American Chemical Society. 2019 Oct;141(42):16539u201343.
• Song X, Reif J. Nucleic Acid Databases and Molecular-Scale Computing. ACS nano. 2019 Jun;13(6):6256u201368.
• Shah S, Dubey AK, Reif J. Improved Optical Multiplexing with Temporal DNA Barcodes. ACS synthetic biology. 2019 May;8(5):1100u201311.
• Shah S, Dubey AK, Reif J. Programming Temporal DNA Barcodes for Single-Molecule Fingerprinting. Nano letters. 2019 Apr;19(4):2668u201373.
• Shah S, Song T, Song X, Yang M, Reif J. Implementing Arbitrary CRNs Using Strand Displacing Polymerase. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2019. p. 21u201336.
• Eshra A, Shah S, Song T, Reif J. Renewable DNA hairpin-based logic circuits. IEEE Transactions on Nanotechnology. 2019 Jan 1;18:252u20139.
• Song T, Gopalkrishnan N, Eshra A, Garg S, Mokhtar R, Bui H, et al. Improving the Performance of DNA Strand Displacement Circuits by Shadow Cancellation. ACS nano. 2018 Nov;12(11):11689u201397.
• Garg S, Shah S, Bui H, Song T, Mokhtar R, Reif J. Renewable Time-Responsive DNA Circuits. Small (Weinheim an der Bergstrasse, Germany). 2018 Jul;e1801470.
• Bui H, Shah S, Mokhtar R, Song T, Garg S, Reif J. Localized DNA Hybridization Chain Reactions on DNA Origami. ACS nano. 2018 Feb;12(2):1146u201355.
• Shah S, Reif J. Temporal DNA barcodes: A time-based approach for single-molecule imaging. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2018. p. 71u201386.
• Song T, Garg S, Mokhtar R, Bui H, Reif J. Design and Analysis of Compact DNA Strand Displacement Circuits for Analog Computation Using Autocatalytic Amplifiers. ACS synthetic biology. 2018 Jan;7(1):46u201353.
• Fu D, Shah S, Song T, Reif J. DNA-Based Analog Computing. Methods in molecular biology (Clifton, NJ). 2018 Jan;1772:411u20137.
• Reif JH. DNA robots sort as they walk. Science (New York, NY). 2017 Sep;357(6356):1095u20136.
• Song X, Eshra A, Dwyer C, Reif J. Renewable DNA seesaw logic circuits enabled by photoregulation of toehold-mediated strand displacement. RSC Advances. 2017 Jan 1;7(45):28130u201344.
• Bui H, Garg S, Miao V, Song T, Mokhtar R, Reif J. Design and analysis of linear cascade DNA hybridization chain reactions using DNA hairpins. New Journal of Physics. 2017;19:015006u2013015006.
• Bui H, Miao V, Garg S, Mokhtar R, Song T, Reif J. Design and Analysis of Localized DNA Hybridization Chain Reactions. Small. 2017;1602983-n/a.
• Majumder U, Garg S, LaBean TH, Reif JH. Activatable tiles for compact robust programmable molecular assembly and other applications. Natural Computing. 2016 Dec 1;15(4):611u201334.
• Song T, Garg S, Mokhtar R, Bui H, Reif J. Analog Computation by DNA Strand Displacement Circuits. ACS synthetic biology. 2016 Aug;5(8):898u2013912.
• Tyagi A, Reif JH. Energy complexity of optical computations. International Journal of Unconventional Computing. 2016 Jan 1;12(5u20136):393u2013412.
• Alhalabi W, Reif J, Elsheikh Z, Felimban H, Fallata M, Thabit K, et al. The co-learning in the design, simulation and optimization of a solar concentrating system. Computers in Human Behavior. 2015 Oct 1;51:857u201366.
• Dalchau N, Chandran H, Gopalkrishnan N, Phillips A, Reif J. Probabilistic Analysis of Localized DNA Hybridization Circuits. ACS synthetic biology. 2015 Aug;4(8):898u2013913.
• Reif JH, Alhalabi W. Solar-thermal powered desalination: Its significant challenges and potential. Renewable and Sustainable Energy Reviews. 2015 Aug 1;48:152u201365.
• Garg S, Chandran H, Gopalkrishnan N, LaBean TH, Reif J. Directed enzymatic activation of 1-D DNA tiles. ACS nano. 2015 Feb;9(2):1072u20139.
• Chandran H, Gopalkrishnan N, Yurke B, Reif J. Meta-DNA: A DNA-based approach to synthetic biology. 2014 Mar 1;171u2013200.
• Bui H, Chandran H, Garg S, Gopalkrishnan N, Mokhtar R, Reif J, et al. DNA computing. In: Computing Handbook, Third Edition: Computer Science and Software Engineering. 2014. p. 25-1-25u201342.
• Chandran H, Gopalkrishnan N, Reif J. Tile Complexity of Approximate Squares. Algorithmica. 2013 May 1;66(1):1u201317.
• Chandran H, Rangnekar A, Shetty G, Schultes EA, Reif JH, LaBean TH. An autonomously self-assembling dendritic DNA nanostructure for target DNA detection. Biotechnology journal. 2013 Feb;8(2):221u20137.
• Chandran H, Gopalkrishnan N, Reif J. DNA nanorobotics. In: Nanorobotics: Current Approaches and Techniques. 2013. p. 355u201382.
• Chandran H, Garg S, Gopalkrishnan N, Reif JH. Biomolecular Computing Systems. 2012 Dec 21;199u2013223.
• Reif JH. Local parallel biomolecular computation. International Journal of Unconventional Computing. 2012 Dec 1;8(5u20136):459u2013507.
• Reif JH. Mechanical computing: The computational complexity of physical devices. In: Computational Complexity: Theory, Techniques, and Applications. 2012. p. 1821u201336.
• Chandran H, Gopalkrishnan N, Reif J. Tile complexity of linear assemblies. SIAM Journal on Computing. 2012 Sep 24;41(4):1051u201373.
• Chandran H, Gopalkrishnan N, Yurke B, Reif J. Meta-DNA: synthetic biology via DNA nanostructures and hybridization reactions. Journal of the Royal Society, Interface. 2012 Jul;9(72):1637u201353.
• Reif JH, Chandran H, Gopalkrishnan N, LaBean T. Self-Assembled DNA Nanostructures and DNA Devices. In: Nanofabrication Handbook. 2012. p. 299u2013328.
• Reif JH, LaBean TH. Engineering natural computation by autonomous DNA-based biomolecular devices. In: Handbook of Natural Computing. 2012. p. 1320u201353.
• Chandran H, Gopalkrishnan N, Phillips A, Reif J. Localized hybridization circuits. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2011 Sep 29;6937 LNCS:64u201383.
• Reif JH. Biochemistry. Scaling up DNA computation. Science (New York, NY). 2011 Jun;332(6034):1156u20137.
• Reif JH. Keynote: DNA-based molecular devices. 2011 IEEE 1st International Conference on Computational Advances in Bio and Medical Sciences, ICCABS 2011. 2011 Apr 14;3.
• Reif JH, Sahu S, Yin P. Complexity of graph self-assembly in accretive systems and self-destructible systems. Theoretical Computer Science. 2011 Apr 8;412(17):1592u2013605.
• Reif J, Slee S. Asymptotically optimal kinodynamic motion planning for a class of modular self-reconfigurable robots. International Journal of Computational Geometry and Applications. 2011 Apr 1;21(2):131u201355.
• Majumder U, Reif JH. Design of a biomolecular device that executes process algebra. Natural Computing. 2011 Mar 1;10(1):447u201366.
• Majumder U, Rangnekar A, Gothelf KV, Reif JH, LaBean TH. Design and construction of double-decker tile as a route to three-dimensional periodic assembly of DNA. Journal of the American Chemical Society. 2011 Mar;133(11):3843u20135.
• Gopalkrishnan N, Chandran H, Reif J. High-fidelity DNA hybridization using programmable molecular DNA devices. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2011 Feb 1;6518 LNCS:59u201370.
• Slee S, Reif J. Robomotion: Scalable, physically stable locomotion for self-reconfigurable robots. Springer Tracts in Advanced Robotics. 2010 Dec 20;68(STAR):121u201337.
• Sahu S, Reif JH. Capabilities and limits of compact error resilience methods for algorithmic self-assembly. Algorithmica (New York). 2010 Apr 1;56(4):480u2013504.
• Reif JH, Majumder U. Isothermal reactivating Whiplash PCR for locally programmable molecular computation. Natural Computing. 2010 Jan 1;9(1):183u2013206.
• Majumder U, Reif JH. Design of a biomolecular device that executes process algebra. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2009 Dec 11;5877 LNCS:97u2013105.
• Reif J, Lieberman M. Conference motivation: The challenge of self-assembly of molecular scale structures. Extended Abstracts for 6th Annual Conference on Foundations of Nanoscience: Self-Assembled Architectures and Devices, FNANO 2009. 2009 Dec 1;
• LaBean TH, Shetty G, Yin P, Schultes EA, Chandran H, Reif JH. A dendritic DNA Nanostructure for target DNA detection. Extended Abstracts for 6th Annual Conference on Foundations of Nanoscience: Self-Assembled Architectures and Devices, FNANO 2009. 2009 Dec 1;60u20131.
• LaBean TH, Shetty G, Yan H, Schultes EA, Chandran H, Reif JH. Target DNA detection by strand displacement and deoxyribozymogen amplification. Extended Abstracts for 6th Annual Conference on Foundations of Nanoscience: Self-Assembled Architectures and Devices, FNANO 2009. 2009 Dec 1;82u20133.
• Reif JH, Majumder U. Isothermal reactivating whiplash PCR for locally programmable molecular computation. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2009 Nov 27;5347 LNCS:41u201356.
• Reif JH. Quantum Computing. 2009 Nov 24;67u2013109.
• Reif JH, LaBean TH. DNA Nanotechnology and its Biological Applications. 2009 Nov 24;349u201375.
• Chandran H, Gopalkrishnan N, Reif J. The tile complexity of linear assemblies. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2009 Nov 12;5555 LNCS(PART 1):235u201353.
• Reif JH, Sahu S. Autonomous programmable DNA nanorobotic devices using DNAzymes. Theoretical Computer Science. 2009 Apr 1;410(15):1428u201339.
• Sahu S, Yin P, Reif JH. A self-assembly model of time-dependent glue strength. In: Natural Computing Series. 2009. p. 185u2013204.
• Reif J, Weiss P. Conference motivation: The challenge of self-assembly of molecular scale structures. 5th Conference on Foundations of Nanoscience: Self-Assembled Architectures and Devices, FNANO 2008. 2008 Dec 1;
• Sahu S, Wang B, Reif JH. A framework for modeling DNA based molecular systems. Journal of Computational and Theoretical Nanoscience. 2008 Nov 1;5(11):2124u201334.
• Sahu S, LaBean TH, Reif JH. A DNA nanotransport device powered by polymerase phi29. Nano letters. 2008 Nov;8(11):3870u20138.
• Reif JH, Slee S. Asymptotically optimal kinodynamic motion planning for self-reconfigurable robots. Springer Tracts in Advanced Robotics. 2008 Oct 20;47:457u201372.
• Majumder U, Reif JH. A framework for designing novel magnetic tiles capable of complex self-assemblies. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2008 Sep 25;5204 LNCS:129u201345.
• Majumder U, LaBean TH, Reif JH. Activatable tiles: Compact, robust programmable assembly and other applications. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2008 Aug 27;4848 LNCS:15u201325.
• Reif JH, Sahu S. Autonomous programmable nanorobotic devices using DNAzymes. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2008 Aug 27;4848 LNCS:66u201378.
• Yin P, Hariadi RF, Sahu S, Choi HMT, Park S, LaBean TH, et al. BIOT 349-Programming molecular tube circumferences. In: ABSTRACTS OF PAPERS OF THE AMERICAN CHEMICAL SOCIETY. AMER CHEMICAL SOC; 2008.
• Yin P, Hariadi RF, Sahu S, Choi HMT, Park SH, Labean TH, et al. Programming DNA tube circumferences. Science (New York, NY). 2008 Aug;321(5890):824u20136.
• Reif JH, Kasif S, Sherlekar D. Formula dissection: A parallel algorithm for constraint satisfaction. Computers and Mathematics with Applications. 2008 Mar 1;55(6):1170u20137.
• Majumder U, Sahu S, Reif JH. Stochastic analysis of reversible self-assembly. Journal of Computational and Theoretical Nanoscience. 2008 Jan 1;5(7):1289u2013305.
• Reif J, Slee S. Optimal kinodynamic motion planning for 2D reconfiguration of self-reconfigurable robots. In: Robotics: Science and Systems. 2008. p. 153u201360.
• Gehani A, Reif J. Super-resolution video analysis for forensic investigations. IFIP International Federation for Information Processing. 2007 Dec 3;242:281u201399.
• Majumder U, LaBean TH, Reif JH. Activatable DNA tiles for compact error-resilient directional assembly. 4th Conference on Foundations of Nanoscience: Self-Assembled Architectures and Devices, FNANO 2007. 2007 Dec 1;60u20134.
• Majumder U, Sahu S, Reif J. Reversible self-assembly of squares as a rapidly mixing Markov Chain. 4th Conference on Foundations of Nanoscience: Self-Assembled Architectures and Devices, FNANO 2007. 2007 Dec 1;155u20137.
• Yin P, Hariadi RF, Sahu S, Choi HMT, Park SH, Walters B, et al. Abstract: Single strand DNA tiles and molecular tubes with precisely programmable circumferences. 4th Conference on Foundations of Nanoscience: Self-Assembled Architectures and Devices, FNANO 2007. 2007 Dec 1;71u20138.
• Reif JH, Labean TH. Autonomous programmable biomolecular devices using self-assembled DNA nanostructures. Communications of the ACM. 2007 Sep 1;50(9):46u201353.
• Sun Z, Reif JH. On robotic optimal path planning in polygonal regions with pseudo-Euclidean metrics. In: IEEE transactions on systems, man, and cybernetics Part B, Cyberneticsu202f: a publication of the IEEE Systems, Man, and Cybernetics Society. 2007. p. 925u201336.
• Labean TH, Gothelf KV, Reif JH. Self-Assembling DNA Nanostructures for Patterned Molecular Assembly. 2007 Feb 19;79u201397.
• Reif JH, Chakraborty S. Efficient and exact quantum compression. Information and Computation. 2007 Jan 1;205(7):967u201381.
• Reif JH, Labean TH. Autonomous programmable biomolecular devices using self-assembled DNA nanostructures. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2007 Jan 1;4576 LNCS:297u2013306.
• Rajasekaran S, Reif J. Handbook of parallel computing: Models, algorithms and applications. 2007.
• Reif J. Conference motivation: The challenge of selfassembly of molecular scale structures. 3rd Conference on Foundations of Nanoscience: Self-Assembled Architectures and Devices, FNANO 2006. 2006 Dec 1;
• Sahu S, Wang B, Reif JH. A framework for modeling DNA based molecular systems. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2006 Dec 1;4287 LNCS:250u201365.
• Majumder U, Sahu S, LaBean TH, Reif JH. Design and simulation of self-repairing DNA lattices. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2006 Dec 1;4287 LNCS:195u2013214.
• Sahu S, Reif JH. Capabilities and limits of compact error resilience methods for algorithmic self-assembly in two and three dimensions. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2006 Dec 1;4287 LNCS:223u201338.
• Yin P, Sahu S, Turberfield AJ, Reif JH. Design of autonomous DNA cellular automata. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2006 Jul 13;3892 LNCS:399u2013416.
• Sahu S, Yin P, Reif JH. A self-assembly model of time-dependent glue strength. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2006 Jul 13;3892 LNCS:290u2013304.
• Reif JH, Sahu S, Yin P. Complexity of graph self-assembly in accretive systems and self-destructible systems. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2006 Jul 13;3892 LNCS:257u201374.
• Reif JH, Sun Z. On boundaries of highly visible spaces and applications. Theoretical Computer Science. 2006 Apr 4;354(3):379u201390.
• Sun Z, Reif JH. On finding approximate optimal paths in weighted regions. Journal of Algorithms. 2006 Jan 1;58(1):1u201332.
• Park SH, Pistol C, Ahn SJ, Reif JH, Lebeck AR, Dwyer C, et al. Finite-size, Fully-Addressable DNA Tile Lattices Formed by Hierarchical Assembly Procedures. Angewandte Chemie. 2006;45:735-739-735u20139.
• Reif JH, Sahu S, Yin P. Compact Error-Resilient Computational DNA Tilings. In: Chen J, Jonoska N, Rozenberg G, editors. Nanotechnology: Science and Computation. Springer; 2006. p. 79u2013103.
• LaBean TH, Park SH, Ahn SJ, Reif JH. Stepwise DNA self-assembly of fixed-size nanostructures. 2nd Conference on Foundations of Nanoscience: Self-Assembled Architectures and Devices, FNANO 2005. 2005 Dec 1;178u201380.
• Sun Z, Hsu D, Jiang T, Kurniawati H, Reif JH. Narrow passage sampling for probabilistic roadmap planning. IEEE Transactions on Robotics. 2005 Dec 1;21(6):1105u201315.
• Park SH, Li H, Yan H, Reif JH, Finkelstein G, LaBean TH. Self-assembled 1D DNA nanostructures as templates for silver nanowires. 2nd Conference on Foundations of Nanoscience: Self-Assembled Architectures and Devices, FNANO 2005. 2005 Dec 1;193u20136.
• Azhar S, McLennan A, Reif JH. Computation of equilibriain noncooperative games. Computers and Mathematics with Applications. 2005 Sep 1;50(5u20136):823u201354.
• Chen J, Rozenberg G. Preface. Natural Computing. 2005 Jun 1;4(2):81u20132.
• Park SH, Yin P, Liu Y, Reif JH, LaBean TH, Yan H. Programmable DNA self-assemblies for nanoscale organization of ligands and proteins. Nano letters. 2005 Apr;5(4):729u201333.
• Park SH, Barish R, Li H, Reif JH, Finkelstein G, Yan H, et al. Three-Helix Bundle DNA Tiles Self-Assemble into 2D Lattice or 1D Templates for Silver Nanowires. Nano Letters. 2005 Mar;5:693.
• Sun Z, Reif JH. On finding energy-minimizing paths on terrains. IEEE Transactions on Robotics. 2005 Feb 1;21(1):102u201314.
• Reif JH. Efficient parallel factorization and solution of structured and unstructured linear systems. Journal of Computer and System Sciences. 2005 Jan 1;71(1):86u2013143.
• Reif JH, LaBean TH, Sahu S, Yan H, Yin P. Design, simulation, and experimental demonstration of self-assembled DNA nanostructures and motors. Lecture Notes in Computer Science. 2005 Jan 1;3566:173u201387.
• Reif JH, Sahu S, Yin P. Compact error-resilient computational DNA tiling assemblies. Lecture Notes in Computer Science. 2005 Jan 1;3384:293u2013307.
• Yin P, Turberfield AJ, Reif JH. Designs of autonomous unidirectional walking DNA devices. Lecture Notes in Computer Science. 2005 Jan 1;3384:410u201325.
• Yin P, Turberfield AJ, Sahu S, Reif JH. Design of an autonomous DNA nanomechanical device capable of universal computation and universal translational motion. Lecture Notes in Computer Science. 2005 Jan 1;3384:426u201344.
• Yin P, Yan H, Daniell XG, Turberfield AJ, Reif JH. A unidirectional DNA walker that moves autonomously along a track. Angewandte Chemie (International ed in English). 2004 Sep;43(37):4906u201311.
• Park SH, Yan H, Reif JH, LaBean TH, Finkelstein G. Electronic nanostructures templated on self-assembled DNA scaffolds. Nanotechnology. 2004 Jul;15:S525u20137.
• Reif JH, Sun Z. Movement planning in the presence of flows. Algorithmica (New York). 2004 Feb 1;39(2):127u201353.
• Gehani A, Labean T, Reif J. DNA-based cryptography. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2004 Jan 1;2950:167u201388.
• Reif JH, Scherlis WL. Deriving efficient graph algorithms. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2004 Jan 1;2772:645u201381.
• Li H, Park SH, Reif JH, LaBean TH, Yan H. DNA-templated self-assembly of protein and nanoparticle linear arrays. Journal of the American Chemical Society. 2004 Jan;126(2):418u20139.
• Liu D, Park SH, Reif JH, LaBean TH. DNA nanotubes self-assembled from triple-crossover tiles as templates for conductive nanowires. Proceedings of the National Academy of Sciences of the United States of America. 2004 Jan;101(3):717u201322.
• Yan H, Yin P, Park SH, Li HY, Feng LP, Guan XJ, et al. Self-assembled DNA structures for nanoconstruction. In: Fritzsche W, editor. DNA-BASED MOLECULAR ELECTRONICS. AMER INST PHYSICS; 2004. p. 43u201352.
• Sun Z, Reif J. On energy-minimizing paths on terrains for a mobile robot. Proceedings - IEEE International Conference on Robotics and Automation. 2003 Dec 9;3:3782u20138.
• Hsu D, Jiang T, Reif J, Sun Z. The bridge test for sampling narrow passages with probabilistic roadmap planners. Proceedings - IEEE International Conference on Robotics and Automation. 2003 Dec 9;3:4420u20136.
• Reif JH. The design of autonomous DNA nano-mechanical devices: Walking and rolling DNA. Natural Computing. 2003 Dec 1;2(4):439u201361.
• Yan H, Feng L, LaBean TH, Reif JH. Parallel molecular computations of pairwise exclusive-or (XOR) using DNA "string tile" self-assembly. J Am Chem Soc. 2003 Nov 26;125(47):14246u20137.
• Feng L, Park SH, Reif JH, Yan H. A two-state DNA lattice switched by DNA nanoactuator. Angew Chem Int Ed Engl. 2003 Sep 22;42(36):4342u20136.
• Reif JH. Guest Editor's Foreword. Journal of Computer and System Sciences. 2003 Sep;67(2):211u2013211.
• Reif JH, Sun Z. On frictional mechanical systems and their computational power. SIAM Journal on Computing. 2003 Sep 1;32(6):1449u201374.
• Ahn SJ, Park SH, Yan H, Reif JH, LaBean TH. Step-wise assembly of DNA tilings and their applications. In: ABSTRACTS OF PAPERS OF THE AMERICAN CHEMICAL SOCIETY. AMER CHEMICAL SOC; 2003. p. U437u2013U437.
• Yan H, Park SH, Finkelstein G, Reif JH, LaBean TH. DNA-Templated Self-Assembly of Protein Arrays and Highly Conductive Nanowires. Science. 2003 Sep;301:1882.
• Yan H, LaBean TH, Feng L, Reif JH. Directed nucleation assembly of DNA tile complexes for barcode-patterned lattices. Proc Natl Acad Sci U S A. 2003 Jul 8;100(14):8103u20138.
• Reif JH. The design of autonomous DNA nanomechanical devices: Walking and rolling DNA. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2003 Jan 1;2568:22u201337.
• Liu D, Reif JH, LaBean TH. DNA nanotubes: Construction and characterization of filaments composed of TX-tile lattice. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2003 Jan 1;2568:10u201321.
• Reif JH, Sun Z. On boundaries of highly visible spaces and applications. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2003 Jan 1;2751:271u201383.
• Sun Z, Reif JH. Adaptive and compact discretization for weighted region optimal path finding. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2003 Jan 1;2751:258u201370.
• LaBean TH, Yan H, Park SH, Feng LP, Yin P, Li HY, et al. Overview of new structures for DNA-Based nanofabrication and computation. In: Chen SH, Cheng HD, Chiu DKY, Das S, Duro R, Kerre EE, et al., editors. PROCEEDINGS OF THE 7TH JOINT CONFERENCE ON INFORMATION SCIENCES. ASSOC INTELLIGENT MACHINERY; 2003. p. 1475u20138.
• Reif JH. Computing. Successes and challenges. Science (New York, NY). 2002 Apr;296(5567):478u20139.
• Reif JH. The emerging discipline of biomolecular computation in the US. New Generation Computing. 2002 Jan 1;20(3):217u201336.
• Reif JH. Molecular assembly and Computation: From theory to experimental demonstrations. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2002 Jan 1;2380 LNCS:1u201321.
• Reif JH, LaBean TH, Pirrung M, Rana VS, Guo B, Kingsford C, et al. Experimental construction of very large scale DNA databases with associative search capability. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2002. p. 231u201347.
• Reif JH. DNA lattices: A method for molecular-scale patterning and computation. Computing in Science and Engineering. 2002 Jan 1;4(1):32u201341.
• Peterson G, Reif J, Azhar S. Decision algorithms for multiplayer noncooperative games of incomplete information. Computers and Mathematics with Applications. 2002 Jan 1;43(1u20132):179u2013206.
• Reif J. Proceedings of the 34th Annual ACM Symposium on Theory of Computing, Montreal, Quebec, Canada, 19-21 May 2002: Foreword. Conference Proceedings of the Annual ACM Symposium on Theory of Computing. 2002 Jan 1;
• Sun Z, Reif J. BUSHWHACK: An approximation algorithm for minimal paths through pseudo-euclidean spaces. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2001 Dec 1;2223 LNCS:160u201371.
• Reif JH, Storer JA. Optimal encoding of non-stationary sources. Information Sciences. 2001 Jun 1;135(1u20132):87u2013105.
• Reif JH, LaBean TH. Computationally inspired biotechnologies: Improved DNA synthesis and associative search using error-correcting codes and vector-quantization. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2001. p. 145u201372.
• Reif JH, LaBean TH, Seeman NC. Challenges and applications for self-assembled DNA nanostructures. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2001. p. 173u201398.
• Reif JH. Parallel output-sensitive algorithms for combinatorial and linear algebra problems. Journal of Computer and System Sciences. 2001 Jan 1;62(3):398u2013412.
• Reif JH, LaBean TH, Seeman NC. Programmable assembly at the molecular scale: Self-assembly of DNA lattices (invited paper). Proceedings - IEEE International Conference on Robotics and Automation. 2001 Jan 1;1:966u201371.
• Reif JH. Efficient parallel computation of the characteristic polynomial of a sparse, separable matrix. Algorithmica (New York). 2001 Jan 1;29(3):487u2013510.
• Peterson G, Reif J, Azhar S. Lower bounds for multiplayer noncooperative games of incomplete information. Computers and Mathematics with Applications. 2001 Jan 1;41(7u20138):957u201392.
• Reif J, Sun Z. Movement planning in the presence of flows. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2001. p. 450u201361.
• Seeman NC, Mao CD, LaBean T, Reif JH. XOR operations by algorithmic assembly of DNA tiles. In: BIOPHYSICAL JOURNAL. BIOPHYSICAL SOCIETY; 2001. p. 10A-10A.
• Reif J, Sun Z. An efficient approximation for weighted region shortest path problem. In: Donald BR, Lynch KM, Rus D, editors. ALGORITHMIC AND COMPUTATIONAL ROBOTICS: NEW DIRECTIONS. A K PETERS, LTD; 2001. p. 191u2013203.
• Mao C, Labean TH, Relf JH, Seeman N. Erratum: Logical computation using algorithmic self-assembly of triple-crossover molecules (Nature (2000) 407 (493-496)). Nature. 2000 Dec 7;408(6813):750.
• Reif JH, Wang H. Nonuniform discretization for kinodynamic motion planning and its applications. SIAM Journal on Computing. 2000 Dec 1;30(1):161u201390.
• Reif JH, Tate SR. Fast spatial decomposition and closest pair computation for limited precision input. Algorithmica (New York). 2000 Nov 1;28(3):271u201387.
• Mao C, LaBean TH, Relf JH, Seeman NC. Logical computation using algorithmic self-assembly of DNA triple-crossover molecules. Nature. 2000 Sep;407(6803):493u20136.
• LaBean TH, Yan H, Kopatsch J, Liu F, Winfree E, Reif JH, et al. Construction, analysis, ligation, and self-assembly of DNA triple crossover complexes. Journal of the American Chemical Society. 2000 Mar 8;122(9):1848u201360.
• Reif J. On the impossibility of interaction-free quantum sensing for small I/O bandwidth. Information and Computation. 2000 Jan 1;163(1):103u201322.
• Gehani A, Reif J. Micro flow bio-molecular computation. Bio Systems. 1999 Oct;52(1u20133):197u2013216.
• Reif JH. Efficient approximate solution of sparse linear systems (vol 36, pg 37, 1998). COMPUTERS & MATHEMATICS WITH APPLICATIONS. 1999 Jul 1;38(2):141u2013141.
• Reif JH, Wang H. Social potential fields: A distributed behavioral control for autonomous robots. Robotics and Autonomous Systems. 1999 May 31;27(3):171u201394.
• Azhar S, Reif JH. Efficient algorithmic learning of the structure of permutation groups by examples. Computers and Mathematics with Applications. 1999 Jan 1;37(10):105u201332.
• Reif JH. Approximate complex polynomial evaluation in near constant work per point. SIAM Journal on Computing. 1999 Jan 1;28(6):2059u201389.
• Reif JH. Parallel biomolecular computation: Models and simulations. Algorithmica (New York). 1999 Jan 1;25(2u20133):142u201375.
• Li Z, Reif JH, Gupta SKS. Synthesizing efficient out-of-core programs for block recursive algorithms using block-cyclic data distributions. IEEE Transactions on Parallel and Distributed Systems. 1999 Jan 1;10(3):297u2013315.
• Reif JH. Alternative computational models: A comparison of biomolecular and quantum computation extended abstract. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1998. p. 102u201326.
• Rolland JP, Yoshida A, Davis LD, Reif JH. High-resolution inset head-mounted display. Applied optics. 1998 Jul;37(19):4183u201393.
• Reif JH. Paradigms for biomolecular computation. Calude CS, Casti J, Dinneen MJ, editors. UNCONVENTIONAL MODELS OF COMPUTATION. 1998 Jan 1;72u201393.
• Reif JH. Efficient Approximate Solution of Sparse Linear Systems. Computers and Mathematics with Applications. 1998 Jan 1;36(9):37u201358.
• Reif JH, Storer JA. Optimal lossless compression of a class of dynamic sources. Data Compression Conference Proceedings. 1998 Jan 1;501u201310.
• Reif J, Sun Z. The computational power of frictional mechanical systems. In: Agarwal PK, Kavraki LE, Mason MT, editors. ROBOTICS: THE ALGORITHMIC PERSPECTIVE. A K PETERS, LTD; 1998. p. 223u201336.
• Gazit H, Reif JH. A Randomized Parallel Algorithm for Planar Graph Isomorphism. Journal of Algorithms. 1998 Jan 1;28(2):290u2013314.
• Reif J, Wang H. The complexity of the two dimensional curvature-constrained shortest-path problem. In: ROBOTICS: THE ALGORITHMIC PERSPECTIVE. 1998. p. 49u201357.
• Gelenbe E, Schmajuk N, Staddon J, Reif J. Autonomous search by robots and animals: A survey. Robotics and Autonomous Systems. 1997 Nov 10;22(1):23u201334.
• Reif JH, Tyagi A. Efficient parallel algorithms for optical computing with the discrete Fourier transform (DFT) primitive. Applied optics. 1997 Oct;36(29):7327u201340.
• Reif J, Wang HY. Non-uniform discretization approximations for kinodynamic motion planning and its applications. In: ALGORITHMS FOR ROBOTIC MOTION AND MANIPULATION. 1997. p. 97u2013112.
• Chen S, Reif JH. Fast and compact volume rendering in the compressed transform domain. Data Compression Conference Proceedings. 1997 Jan 1;271u201380.
• Reif JH, Tate SR. On Dynamic Algorithms for Algebraic Problems. Journal of Algorithms. 1997 Jan 1;22(2):347u201371.
• Han Y, Pan VY, Reif JH. Efficient Parallel Algorithms for Computing All Pair Shortest Paths in Directed Graphs1. Algorithmica (New York). 1997 Jan 1;17(4):399u2013415.
• Storer JA, Reif JH. Error-resilient optimal data compression. SIAM Journal on Computing. 1997 Jan 1;26(4):934u201349.
• Reif JH, Tyagi A. Optical delay line memory model with efficient algorithms. Optical Engineering. 1997 Jan 1;36(9):2521u201335.
• Reif JH. Approximate complex polynomial evaluation in near constant work per point. Conference Proceedings of the Annual ACM Symposium on Theory of Computing. 1997 Jan 1;30u20139.
• Storer JA, Reif J. Low-cost prevention of error-propagation for data compression with dynamic dictionaries. Data Compression Conference Proceedings. 1997 Jan 1;171u201380.
• Kao MY, Reif JH, Tate SR. Searching in an Unknown Environment: An Optimal Randomized Algorithm for the Cow-Path Problem. Information and Computation. 1996 Nov 25;131(1):63u201379.
• Li Z, Reif JH, Gupta KS. Synthesizing efficient out-of-core programs for block recursive algorithms using block-cyclic data distributions. In: Proceedings of the International Conference on Parallel Processing. 1996. p. II142u20139.
• Neff AC, Reif JH. An efficient algorithm for the complex roots problem. Journal of Complexity. 1996 Jan 1;12(2):81u2013115.
• Nyland LS, Reif JH. An algebraic technique for generating optimal CMOS circuitry in linear time. Computers and Mathematics with Applications. 1996 Jan 1;31(1):85u2013108.
• Nyland L, Prins J, Goldberg A, Mills P, Reif J, Wagner R. A refinement methodology for developing Data-Parallel applications. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1996. p. 145u201350.
• Yoshida A, Rolland JP, Reif JH. Optical design and analysis of a head-mounted display with a high-resolution insert. Proceedings of SPIE - The International Society for Optical Engineering. 1995 Dec 1;2537:71u201382.
• Reif JH. Efficient parallel solution of sparse eigenvalue and eigenvector problems. Annual Symposium on Foundations of Computer Science - Proceedings. 1995 Dec 1;123u201332.
• Reif JH, Sen S. An efficient output-sensitive hidden-surface removal algorithm for polyhedral terrains. Mathematical and Computer Modelling. 1995 Jan 1;21(5):89u2013104.
• Paturi R, Rajasekaran S, Reif J. The light bulb problem. Information and Computation. 1995 Jan 1;117(2):187u201392.
• Yoshida A, Rolland JP, Reif JH. Design and applications of a high-resolution insert head-mounted-display. Proceedings - Virtual Reality Annual International Symposium. 1995 Jan 1;84u201393.
• Reif JH. Parallel molecular computation. Annual ACM Symposium on Parallel Algorithms and Architectures. 1995 Jan 1;213u201323.
• Chen S, Reif JH. Fast pattern matching for entropy bounded text. Data Compression Conference Proceedings. 1995 Jan 1;282u201391.
• Li Z, Mills PH, Reif JH. Models and resource metrics for parallel and distributed computation. In: Proceedings of the Annual Hawaii International Conference on System Sciences. 1995. p. 51u201360.
• Nikoletseas S, Reif J, Spirakis P, Yung M. Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1995. p. 160u201370.
• REIF JH, WANG HY. Social potential fields: A distributed behavioral control for autonomous robots. In: Goldberg K, Halperin D, Latombe JC, Wilson R, editors. ALGORITHMIC FOUNDATIONS OF ROBOTICS. A K PETERS, LTD; 1995. p. 331u201345.
• Reif JH, Tygar JD, Yoshida A. Computability and complexity of ray tracing. Discrete & Computational Geometry. 1994 Dec 1;11(1):265u201388.
• Cheriyan J, Reif JH. Directed s-t numberings, Rubber bands, and testing digraph k-vertex connectivity. Combinatorica. 1994 Dec 1;14(4):435u201351.
• Reif JH. O(log²n) time efficient parallel factorization of dense, sparse separable, and banded matrices. In: Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1994. 1994. p. 278u201389.
• Reif JH, Tate SR. Dynamic parallel tree contraction (extended abstract). In: Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1994. 1994. p. 114u201321.
• Reif JH, Sen S. Erratum: Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems. SIAM Journal on Computing. 1994 Apr;23(2):447u20138.
• Reif JH, Storer JA. A Single-Exponential Upper Bound for Finding Shortest Paths in Three Dimensions. Journal of the ACM (JACM). 1994 Jan 9;41(5):1013u20139.
• Storer JA, Reif JH. Shortest Paths in the Plane with Polygonal Obstacles. Journal of the ACM (JACM). 1994 Jan 9;41(5):982u20131012.
• Reif J, Sharir M. Motion Planning in the Presence of Moving Obstacles. Journal of the ACM (JACM). 1994 Jan 7;41(4):764u201390.
• Yoshida A, Reif JH. Optical Computing Techniques for Image/Video Compression. Proceedings of the IEEE. 1994 Jan 1;82(6):948u201354.
• Azhar S, Badros GJ, Glodjo A, Kao MY, Reif JH. Data compression techniques for stock market prediction. Proceedings of the Data Compression Conference. 1994 Jan 1;72u201382.
• Reif JH. Models and resource metrics for parallel and distributed computation. Proceedings of the International Conference on Parallel Processing. 1994 Jan 1;404.
• Reif JH, Tate SR. Approximate kinodynamic planning using L2-norm dynamic bounds. Computers and Mathematics with Applications. 1994 Jan 1;27(5):29u201344.
• Ramachandran V, Reif J. Planarity testing in parallel. Journal of Computer and System Sciences. 1994 Jan 1;49(3):517u201361.
• Reif JH, Tate SR. Dynamic algebraic algorithms. Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms. 1994 Jan 1;290u2013301.
• Reif JH, Sen S. Randomized algorithms for binary search and load balancing on fixed connection networks with geometric applications. SIAM Journal on Computing. 1994 Jan 1;23(3):633u201351.
• Reif JH, Yoshida A. Free space optical message routing for high performance parallel computers. In: Proceedings of the 1st International Workshop on Massively Parallel Processing Using Optical Interconnections, MPPOI 1994. 1994. p. 37u201344.
• Neff CA, Reif JH. An O(n^1+u03b5 log B) algorithm for the complex roots problem. In: Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS. 1994. p. 540u20137.
• Chen S, Reif JH. Using difficulty of prediction to decrease computation: Fast sort, priority queue and convex hull on entropy bounded inputs. Annual Symposium on Foundatons of Computer Science (Proceedings). 1993 Dec 1;104u201312.
• Reif JH. O(n log³ n) algorithm for the real root problem. Annual Symposium on Foundatons of Computer Science (Proceedings). 1993 Dec 1;626u201335.
• Reif JH, Tate SR. Continuous alternation: The complexity of pursuit in continuous domains. Algorithmica. 1993 Oct 1;10(2u20134):156u201381.
• Cheriyan J, Reif JH. Parallel and output sensitive algorithms for combinatorial and linear algebra problems. In: Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1993. 1993. p. 50u20136.
• Donald B, Xavier P, Canny J, Reif J. Kinodynamic Motion Planning. Journal of the ACM (JACM). 1993 Jan 11;40(5):1048u201366.
• Markas T, Reif J. Multispectral image compression algorithms. In: Data Compression Conference Proceedings. 1993. p. 391u2013400.
• Armon D, Reif J. A dynamic separator algorithm. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1993. p. 108u201318.
• Reif JH, Tate SR. The complexity of N-body simulation. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1993. p. 162u201376.
• Reif JH. Efficient VLSI fault simulation. Computers and Mathematics with Applications. 1993 Jan 1;25(2):15u201332.
• Reif JH, Yoshida A. Optical expanders with applications in optical computing. Applied optics. 1993 Jan;32(2):159u201365.
• Pan V, Reif J. Fast and efficient parallel solution of sparse linear systems. SIAM Journal on Computing. 1993 Jan 1;22(6):1227u201350.
• Reif JH. Probabilistic parallel prefix computation. Computers and Mathematics with Applications. 1993 Jan 1;26(1):101u201310.
• Storer JA, Markas T, Royals M, Kanopoulos N, Reif JH. On the Design and Implementation of a Lossless Data Compression and Decompression Chip. IEEE Journal of Solid-State Circuits. 1993 Jan 1;28(9):948u201353.
• REIF JH. AN O(N LOG3N) ALGORITHM FOR THE REAL ROOT PROBLEM. In: 34TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE: PROCEEDINGS. 1993. p. 626u201335.
• Pan V, Reif J. Generalized compact multi-grid. Computers and Mathematics with Applications. 1993 Jan 1;25(9):3u20135.
• Kao MY, Reif JH, Tate SR. Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem. Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms. 1993 Jan 1;441u20137.
• Mills PH, Nyland LS, Prins JF, Reif JH. Prototyping N-body simulation in Proteus. Proceedings of the International Conference on Parallel Processing. 1992 Dec 1;476u201382.
• Rajasekaran S, Reif JH. Nested annealing: a provable improvement to simulated annealing. Theoretical Computer Science. 1992 Jun 1;99(1):157u201376.
• Reif JH, Sen S. Optimal randomized parallel algorithms for computational geometry. Algorithmica. 1992 Jun 1;7(1u20136):91u2013117.
• Reif JH, Sen S. Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems. SIAM Journal on Computing. 1992 Jun;21(3):466u201385.
• Han Y, Pan V, Reif J. Efficient parallel algorithms for computing all pair shortest paths in directed graphs. 4th Annual ACM Symposium on Parallel Algorithms and Architectures. 1992 Jan 1;353u201362.
• Armon D, Reif J. Space and time efficient implementations of parallel nested dissection. 4th Annual ACM Symposium on Parallel Algorithms and Architectures. 1992 Jan 1;344u201352.
• Markas T, Reif J. Quad tree structures for image compression applications. Information Processing and Management. 1992 Jan 1;28(6):707u201321.
• Hightower WL, Prins JF, Reif JH. Implementations of randomized sorting on large parallel machines. 4th Annual ACM Symposium on Parallel Algorithms and Architectures. 1992 Jan 1;158u201367.
• Reif JH, Yoshida A. Optical techniques for image compression. In: Data Compression Conference Proceedings. 1992. p. 32u201341.
• Reif JH, Tate SR. On threshold circuits and polynomial computation. SIAM Journal on Computing. 1992 Jan 1;21(5):896u2013908.
• Reif J, Spirakis P. Expected parallel time and sequential space complexity of graph and digraph problems. Algorithmica (New York). 1992;7(5u20136):597u2013630.
• Pan VY, Reif JH, Tate SR. The power of combining the techniques of algebraic and numerical computing: Improved approximate multipoint polynomial evaluation and improved multipole algorithms. In: Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS. 1992. p. 703u201313.
• Pan V, Reif J. Compact Multigrid. SIAM Journal on Scientific and Statistical Computing. 1992 Jan;13(1):119u201327.
• Canny J, Rege A, Reif J. An exact algorithm for kinodynamic planning in the plane. Discrete & Computational Geometry. 1991 Dec 1;6(1):461u201384.
• Pan V, Reif J. The parallel computation of minimum cost paths in graphs by stream contraction. Information Processing Letters. 1991 Oct 25;40(2):79u201383.
• Markas T, Reif J. Image compression methods with distortion controlled capabilities. In: Data Compression Conference Proceedings. 1991. p. 93u2013102.
• Reif JH, Tygar JD, Yoshida A. The computability and complexity of optical beam tracing. IEEE Transactions on Industry Applications. 1991 Jan 1;27(1 pt 1):106u201314.
• Miller GL, Reif JH. Parallel tree contraction. Part 2. Further applications. SIAM Journal on Computing. 1991 Jan 1;20(6):1128u201347.
• Storer JA, Reif JH. A parallel architecture for high-speed data compression. Journal of Parallel and Distributed Computing. 1991 Jan 1;13(2):222u20137.
• Mills PH, Nyland LS, Prins JF, Reif JH, Wagner RA. Prototyping parallel and distributed programs in Proteus. In: Proceedings of the 3rd IEEE Symposium on Parallel and Distributed Processing 1991. 1991. p. 26u201334.
• Reif JH, Sen S. Randomized algorithms for binary search and load balancing on fixed connection networks with geometric applications. Algorithms and Architectures. 1990 Dec 1;327u201337.
• Gazit H, Reif JH. Randomized parallel algorithm for planar graph isomorphism. Algorithms and Architectures. 1990 Dec 1;210u20139.
• Storer JA, Reif JH. A parallel architecture for high speed data compression. 1990 Dec 1;238u201343.
• Reif JH, Smolka SA. Data flow analysis of distributed communicating processes. International Journal of Parallel Programming. 1990 Feb 1;19(1):1u201330.
• Canny J, Rege A, Reif J. Exact algorithm for kinodynamic planning in the plane. 1990 Jan 1;271u201380.
• Blevins DW, Dams EW, Heaton RA, Reif JH. BLITZEN: A highly integrated massively parallel machine. Journal of Parallel and Distributed Computing. 1990 Jan 1;8(2):150u201360.
• Pan V, Reif J. The bit-complexity of discrete solutions of partial differential equations: Compact multigrid. Computers and Mathematics with Applications. 1990 Jan 1;20(2):9u201316.
• Pan V, Reif J. On the bit-complexity of discrete solutions of PDEs: Compact multigrid. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1990. p. 612u201325.
• Reif J, Tyagi A. Efficient parallel algorithms for optical computing with the DFT primitive. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1990. p. 149u201360.
• Tyagi A, Reif J. Energy complexity of optical computations. In: Proceedings of the 2nd IEEE Symposium on Parallel and Distributed Processing 1990, SPDP 1990. 1990. p. 14u201321.
• Reif JH, Tate SR. Optimal size integer division circuits. SIAM Journal on Computing. 1990 Jan 1;19(5):912u201324.
• Paturi R, Rajasekaran S, Reif J. The light bulb problem. In: Proceedings of the 2nd Annual Workshop on Computational Learning Theory, COLT 1989. 1989. p. 261u20138.
• Reif JH, Tate SR. Optimal size integer division circuits. 1989 Jan 1;264u201373.
• Reif JH, Sen S. Polling: A new randomized sampling technique for computational geometry. 1989 Jan 1;394u2013404.
• Willard DE, Reif JH. Parallel processing can be harmful: The unusual behavior of interpolation search. Information and Computation. 1989 Jan 1;81(3):364u201379.
• Rajasekaran S, Reif JH. Optimal and sublogarithmic time randomized parallel sorting algorithms. SIAM Journal on Computing. 1989 Jan 1;18(3):594u2013607.
• Pan V, Reif J. Fast and efficient solution of path algebra problems. Journal of Computer and System Sciences. 1989 Jan 1;38(3):494u2013510.
• Ramachandran V, Reif J. Optimal parallel algorithm for graph planarity. Annual Symposium on Foundations of Computer Science (Proceedings). 1989 Jan 1;282u20137.
• Pan V, Reif J. Fast and efficient parallel solution of dense linear systems. Computers and Mathematics with Applications. 1989 Jan 1;17(11):1481u201391.
• REIF JH, SEN S. RANDOMIZATION IN PARALLEL ALGORITHMS AND ITS IMPACT ON COMPUTATIONAL GEOMETRY. In: DJIDJEV H, editor. OPTIMAL ALGORITHMS. SPRINGER-VERLAG BERLIN; 1989. p. 1u20138.
• Maniloff ES, Johnson KM, Reif J. Holographic routing network for parallel processing machines. In: Proceedings of SPIE - The International Society for Optical Engineering. 1989. p. 283u20139.
• Reif JH, Sen S. Randomization in parallel algorithms and its impact on computational geometry. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1989 Jan 1;401 LNCS:1u20138.
• Blevins DW, Davis EW, Heaton RA, Reif JH. BLITZEN: A highly integrated massively parallel machine. 1988 Dec 1;399u2013406.
• Reif JH, Smolka SA. COMPLEXITY OF REACHABILITY IN DISTRIBUTED COMMUNICATING PROCESSES. Acta Informatica. 1988 Apr 1;25(3):333u201354.
• Reif JH, Sen S. An efficient output-sensitive hidden-surface removal algorithm and its parallelization. In: Proceedings of the 4th Annual Symposium on Computational Geometry, SCG 1988. 1988. p. 193u2013200.
• Gu00e1cs P, Reif J. A simple three-dimensional real-time reliable cellular array. Journal of Computer and System Sciences. 1988 Jan 1;36(2):125u201347.
• Reif JH, Smolka SA. The complexity of reachability in distributed communicating processes. Acta Informatica. 1988 Jan 1;25(3):333u201354.
• Klein PN, Reif JH. An efficient parallel algorithm for planarity. Journal of Computer and System Sciences. 1988 Jan 1;37(2):190u2013246.
• Reif JH, Tygar JD. Efficient parallel pseudorandom number generation. SIAM Journal on Computing. 1988 Jan 1;17(2):404u201311.
• Reif JH, Storer JA. 3-dimensional shortest paths in the presence of polyhedral obstacles. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1988 Jan 1;324 LNCS:85u201392.
• Klein PN, Reif JH. Parallel time O(log n) acceptance of deterministic CFLs on an exclusive-write P-RAM. SIAM Journal on Computing. 1988 Jan 1;17(3):463u201385.
• Canny J, Reif J, Donald B, Xavier P. On the complexity of kinodynamic planning. Annual Symposium on Foundations of Computer Science (Proceedings). 1988 Jan 1;306u201316.
• RAJASEKARAN S, REIF JH. NESTED ANNEALING - A PROVABLE IMPROVEMENT TO SIMULATED ANNEALING. LECTURE NOTES IN COMPUTER SCIENCE. 1988 Jan 1;317:455u201372.
• Kasif S, Reif JH, Sherlekar DD. FORMULA DISSECTION: A PARALLEL ALGORITHM FOR CONSTRAINT SATISFACTION. 1987 Dec 1;51u20138.
• Opsahl T, Reif J. SOLVING VERY LARGE, SPARSE LINEAR SYSTEMS ON MESH-CONNECTED PARALLEL COMPUTERS. NASA Conference Publication. 1987 Dec 1;249u201356.
• Reif JH, Sen S. OPTIMAL RANDOMIZED PARALLEL ALGORITHMS FOR COMPUTATIONAL GEOMETRY. Proceedings of the International Conference on Parallel Processing. 1987 Dec 1;270u20137.
• Barakat R, Reif J. Polynomial convolution algorithm for matrix multiplication with application for optical computing. Applied optics. 1987 Jul;26(14):2707u201311.
• Reif JH. A topological approach to dynamic graph connectivity. Information Processing Letters. 1987 Apr 20;25(1):65u201370.
• Pan V, Reif JH. Response:solving linear equations. Science (New York, NY). 1987 Apr;236(4800):462u20133.
• Barakat R, Reif J. Lower bounds on the computational efficiency of optical computing systems. Applied optics. 1987 Mar;26(6):1015u20138.
• Reif JH, Storer JA. MINIMIZING TURNS FOR DISCRETE MOVEMENT IN THE INTERIOR OF A POLYGON. IEEE journal of robotics and automation. 1987;RA-3(3):182u201393.
• Canny J, Reif J. NEW LOWER BOUND TECHNIQUES FOR ROBOT MOTION PLANNING PROBLEMS. Annual Symposium on Foundations of Computer Science (Proceedings). 1987 Jan 1;49u201360.
• Reif JH. ON THRESHOLD CIRCUITS AND POLYNOMIAL COMPUTATION. 1987 Jan 1;118u201323.
• Reif JH, Valiant LG. A logarithmic time sort for linear size networks. Journal of the ACM (JACM). 1987 Jan 1;34(1):60u201376.
• Reif JH, Storer JA. Minimizing Turns for Discrete Movement in the Interior of a Polygon. IEEE Journal on Robotics and Automation. 1987 Jan 1;3(3):182u201393.
• Rajasekaran S, Reif JH. Randomized parallel computation. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1987 Jan 1;278 LNCS:364u201376.
• Pan V, Reif J. SOME POLYNOMIAL AND TOEPLITZ MATRIX COMPUTATIONS. Annual Symposium on Foundations of Computer Science (Proceedings). 1987 Jan 1;173u201384.
• Reif JH. SURVEY ON ADVANCES IN THE THEORY OF COMPUTATIONAL ROBOTICS. 1986 Dec 1;331u20137.
• Pan V, Reif J. Fast and efficient parallel linear programming and linear least squares computations. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1986. p. 283u201395.
• Homer S, Reif J. Arithmetic theories for computational complexity problems. Information and Control. 1986 Jan 1;69(1u20133):1u201311.
• Pan V, Reif J. Parallel nested dissection for path algebra computations. Operations Research Letters. 1986 Jan 1;5(4):177u201384.
• Pan V, Reif J. Efficient parallel linear programming. Operations Research Letters. 1986 Jan 1;5(3):127u201335.
• Pan V, Reif J. Fast and efficient linear programming and linear least-squares computations. Computers and Mathematics with Applications. 1986 Jan 1;12(12 PART A):1217u201327.
• Reif JH, Lewis HR. Efficient symbolic analysis of programs. Journal of Computer and System Sciences. 1986 Jan 1;32(3):280u2013314.
• Ben-Or M, Kozen D, Reif J. The complexity of elementary algebra and geometry. Journal of Computer and System Sciences. 1986 Jan 1;32(2):251u201364.
• Reif JH. LOGARITHMIC DEPTH CIRCUITS FOR ALGEBRAIC FUNCTIONS. SIAM Journal on Computing. 1986 Jan 1;15(1):231u201342.
• Klein PN, Reif JH. EFFICIENT PARALLEL ALGORITHM FOR PLANARITY. Annual Symposium on Foundations of Computer Science (Proceedings). 1986 Jan 1;465u201377.
• Reif JH, Tygar JD. Efficient Parallel Pseudo-Random Number Generation. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1986. p. 433u201346.
• Pan V, Reif J. Extension of the parallel nested dissection algorithm to path algebra problems. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1986. p. 470u201387.
• Ravi Nair, Bruss A, Reif J. LINEAR TIME ALGORITHMS FOR OPTIMAL CMOS LAYOUT. 1985 Dec 1;327u201338.
• Reif JH, Willard DE. PARALLEL INTERPOLATION SEARCH. Proceedings - Annual Allerton Conference on Communication, Control, and Computing. 1985 Dec 1;821u20139.
• Reif JH. Depth-first search is inherently sequential. Information Processing Letters. 1985 Jun 12;20(5):229u201334.
• Miller GL, Reif JH. PARALLEL TREE CONTRACTION AND ITS APPLICATION. Annual Symposium on Foundations of Computer Science (Proceedings). 1985 Jan 1;478u201389.
• Reif J, Sharir M. MOTION PLANNING IN THE PRESENCE OF MOVING OBSTACLES. Annual Symposium on Foundations of Computer Science (Proceedings). 1985 Jan 1;144u201354.
• Reif JH, Spirakis PG. UNBOUNDED SPEED VARIABILITY IN DISTRIBUTED COMMUNICATIONS SYSTEMS. SIAM Journal on Computing. 1985 Jan 1;14(1):75u201392.
• Reif JH, Spirakis PG. k-connectivity in random undirected graphs. Discrete Mathematics. 1985 Jan 1;54(2):181u201391.
• Reif JH. OPTIMAL PARALLEL ALGORITHM FOR INTEGER SORTING. Annual Symposium on Foundations of Computer Science (Proceedings). 1985 Jan 1;496u2013504.
• Reif J, Sistla AP. A multiprocess network logic with temporal and spatial modalities. Journal of Computer and System Sciences. 1985 Jan 1;30(1):41u201353.
• Gacs P, Reif JH. SIMPLE THREE-DIMENSIONAL REAL-TIME RELIABLE CELLULAR ARRAY. Conference Proceedings of the Annual ACM Symposium on Theory of Computing. 1985 Jan 1;388u201395.
• Pan V, Reif J. EFFICIENT PARALLEL SOLUTION OF LINEAR SYSTEMS. Conference Proceedings of the Annual ACM Symposium on Theory of Computing. 1985 Jan 1;143u201352.
• Reif J. Probabilistic algorithms in group theory. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1985. p. 341u201350.
• Reif J. PROBABILISTIC PARALLEL PREFIX COMPUTATION. Proceedings of the International Conference on Parallel Processing. 1984 Dec 1;291u20138.
• Ben-Or M, Kozen D, Reu00edf J. The complexity of elementary algebra and geometry (preliminary version). In: Proceedings of the Annual ACM Symposium on Theory of Computing. 1984. p. 457u201364.
• Reif JH, Spirakis PG. Real-Time Synchronization of Interprocess Communications. ACM Transactions on Programming Languages and Systems (TOPLAS). 1984 Apr 1;6(2):215u201338.
• Reif JH. Symmetric Complementation. Journal of the ACM (JACM). 1984 Mar 30;31(2):401u201321.
• Reif JH. ON SYNCHRONOUS PARALLEL COMPUTATIONS WITH INDEPENDENT PROBABILISTIC CHOICE. SIAM Journal on Computing. 1984 Jan 1;13(1):46u201356.
• Reif JH. The complexity of two-player games of incomplete information. Journal of Computer and System Sciences. 1984 Jan 1;29(2):274u2013301.
• Reif JH, Scherlis WL. Deriving efficient graph algorithms (summary). In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1984. p. 421u201341.
• Kao G, Nikolaou CN, Reif J. ASSIGNING PROCESSES TO PROCESSORS: A FAULT-TOLERANT APPROACH. Digest of Papers - FTCS (Fault-Tolerant Computing Symposium). 1984 Jan 1;306u20139.
• REIF J, SPIRAKIS P. PROBABILISTIC BIDDING GIVES OPTIMAL DISTRIBUTED RESOURCE-ALLOCATION. LECTURE NOTES IN COMPUTER SCIENCE. 1984;172:393u2013402.
• Reif JH, Valiant LG. LOGARITHMIC TIME SORT FOR LINEAR SIZE NETWORKS. Conference Proceedings of the Annual ACM Symposium on Theory of Computing. 1983 Dec 1;10u20136.
• Reif J, Sistla AP. MULTIPROCESS NETWORK LOGIC WITH TEMPORAL AND SPATIAL MODALITIES. Lecture Notes in Computer Science. 1983 Dec 1;628u201339.
• Reif JH. Minimums-tCut of a Planar Undirected Network in $O(n\log ^2 (n))$ Time. SIAM Journal on Computing. 1983 Feb;12(1):71u201381.
• Reif J. LOGARITHMIC DEPTH CIRCUITS FOR ALGEBRAIC FUNCTIONS. Annual Symposium on Foundations of Computer Science (Proceedings). 1983 Jan 1;138u201345.
• Halpern JY, Reif JH. The propositional dynamic logic of deterministic, well-structured programs. Theoretical Computer Science. 1983 Jan 1;27(1u20132):127u201365.
• Reif J, Sistla AP. A multiprocess network logic with temporal and spatial modalities. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1983. p. 629u201339.
• Reif J, Spirakis P. REAL TIME RESOURCE ALLOCATION IN DISTRIBUTED SYSTEMS. 1982 Dec 1;84u201394.
• Reif J, Spirakis P. Real time resource allocation in distributed systems. In: Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. 1982. p. 84u201394.
• Reif JH. Symmetric complementation. In: Proceedings of the Annual ACM Symposium on Theory of Computing. 1982. p. 201u201314.
• Reif JH, Tarjan RE. Symbolic Program Analysis in Almost-Linear Time. SIAM Journal on Computing. 1982 Feb;11(1):81u201393.
• Reif J, Spirakis P. Unbounded speed variability in distributed communication systems. In: Conference Record of the Annual ACM Symposium on Principles of Programming Languages. 1982. p. 46u201356.
• Reif J. PARALLEL TIME O(log N) ACCEPTANCE OF DETERMINISTIC CFLs. Annual Symposium on Foundations of Computer Science - Proceedings. 1982 Jan 1;290u20136.
• Reif JH. On the power of probabilistic choice in synchronous parallel computations. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1982. p. 442u201350.
• Halpern JY, Reif JH. PROPOSITIONAL DYNAMIC LOGIC OF DETERMINISTIC, WELL-STRUCTURED PROGRAM. Annual Symposium on Foundations of Computer Science - Proceedings. 1981 Dec 1;322u201334.
• Reif J, Spirakis P. Distributed algorithms for synchronizing interprocess communication within real time. In: Proceedings of the Annual ACM Symposium on Theory of Computing. 1981. p. 133u201345.
• Reif JH. Minimum s-t cut of a planar undirected network in o(n log²(n)) time. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1981. p. 56u201367.
• Reif JH. Logics for probabilistic programming. Proceedings of the Annual ACM Symposium on Theory of Computing. 1980 Apr 28;1980-April:8u201313.
• Reif JH, Spirakis PG. Random matroids. Proceedings of the Annual ACM Symposium on Theory of Computing. 1980 Apr 28;1980-April:385u201397.
• Reif JH, Peterson GL. A dynamic logic of multiprocessing with incomplete information. Conference Record of the Annual ACM Symposium on Principles of Programming Languages. 1980 Jan 28;193u2013202.
• Reif JH. Universal games of incomplete information. In: Proceedings of the Annual ACM Symposium on Theory of Computing. 1979. p. 288u2013308.
• Filotti IS, Miller GL, Reif J. On determining the genus of a graph in 0(V⁰(^g)) steps. In: Proceedings of the Annual ACM Symposium on Theory of Computing. 1979. p. 27u201337.
• Reif JH. Data flow analysis of communicating processes - Extended abstract. Conference Record of the Annual ACM Symposium on Principles of Programming Languages. 1979 Jan 1;257u201368.
• Peterson GL, Reif JH. MULTIPLE-PERSON ALTERNATION. Annual Symposium on Foundations of Computer Science - Proceedings. 1979 Jan 1;348u201363.
• Reif JH. COMPLEXITY OF THE MOVER'S PROBLEM AND GENERALIZATIONS. Annual Symposium on Foundations of Computer Science - Proceedings. 1979 Jan 1;421u20137.
• Peterson GL, Reif JH. Multiple-person alternation. In: Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS. 1979. p. 348u201363.
• Reif JH. Complexity of the mover's problem and generalizations. In: Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS. 1979. p. 421u20137.
• Reif JH. Symbolic program analysis in almost linear time. In: Conference Record of the Annual ACM Symposium on Principles of Programming Languages. 1978. p. 76u201383.
• Reif J, Barakat R. Numerical solution of the Fokker-Planck equation via chebyschev polynomial approximations with reference to first passage time probability density functions. Journal of Computational Physics. 1977 Jan 1;23(4):425u201345.
• Reif JH, Lewis HR. Symbolic evaluation and the global value graph. In: Conference Record of the Annual ACM Symposium on Principles of Programming Languages. 1977. p. 104u201318.

In The News

• Designing With DNA (Dec 23, 2022 | )
• I.D. Verification, Now for Cancer (Nov 22, 2019 | )
• Tiny Light-Up Barcodes Identify Molecules by Their Twinkling (Apr 11, 2019 | )
• Analog DNA Circuit Does Math in a Test Tube (Aug 23, 2016 | )
• Carolyn McAllaster, Susan S. Reif: Funding fails to keep pace with South's HIV epidemic (Dec 1, 2015 | The News & Observer)