John H. Reif | Scholars@Duke

John H. Reif
A. Hollis Edens Distinguished Professor of Computer Science

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

Current Appointments & Affiliations

A. Hollis Edens Distinguished Professor of Computer Science, Computer Science, Trinity College of Arts & Sciences 2003
Professor of Computer Science, Computer Science, Trinity College of Arts & Sciences 1986
Professor in the Department of Electrical and Computer Engineering, Electrical and Computer Engineering, Pratt School of Engineering 2016

Contact Information

Box 90129, Durham, NC 27708-0129
LSRC D-229, 308 Research Drive, Dept Comp Sci, Duke U, Durham, NC 27708
reif@cs.duke.edu (919) 407-1961
http://www.cs.duke.edu/~reif/

Background
Education, Training, & Certifications
- Ph.D., Harvard University 1977
- M.S., Harvard University 1975
- B.S., Tufts University 1973
Recognition
In the News
- DEC 23, 2022
  
  Designing With DNA
- NOV 22, 2019
  
  I.D. Verification, Now for Cancer
- APR 11, 2019
  
  Tiny Light-Up Barcodes Identify Molecules by Their Twinkling
- AUG 23, 2016
  
  Analog DNA Circuit Does Math in a Test Tube
- DEC 1, 2015 The News & Observer
  
  Carolyn McAllaster, Susan S. Reif: Funding fails to keep pace with South's HIV epidemic
Awards & Honors
Expertise
Subject Headings
Research
Selected Grants
- SHF: Small: High-speed DNA polymerase CRNs for signal amplification, oscillation, consensus, and linear control awarded by National Science Foundation 2021 - 2024
- Support of Twentieth Conference on the Foundations of Nanoscience (FNANO 2023) awarded by Army Research Office 2023
- SHF: Small: Distributed DNA Computations Operating on a Collection of Cell Membranes awarded by National Science Foundation 2019 - 2022
- Seventeenth Conference on the Foundations of Nanoscience (FNANO 2020) awarded by Office of Naval Research 2020 - 2022
- SHF: Small: Hot DNA Computation: Speeding up DNA-based Computation, CRNs, and Robotics using Strand-Displacing Polymerase awarded by National Science Foundation 2018 - 2021
- NSF Student Travel Grant for Sixteenth Conference on the Foundations of Nanoscience (FNANO 2019) awarded by National Science Foundation 2019 - 2020
- Sixteenth Conference on the Foundations of Nanoscience (FNANO 2019) awarded by Army Research Office 2019
- Sixteenth Conference on the Foundations of Nanoscience (FNANO 2019) awarded by Office of Naval Research 2019
- SHF: Small: DNA Circuits for Analog Computations awarded by National Science Foundation 2016 - 2019
- Support for Fifteenth Conference on the Foundations of Nanoscience (FNANO 2018) awarded by National Science Foundation 2018
- Fifteenth Conference on the Foundations of Nanoscience (FNANO 2018) awarded by Office of Naval Research 2018
- Fifteenth Conference on the Foundations of Nanoscience (FNANO 2018) awarded by Army Research Office 2018
- Support of Fourteenth Conference on the Foundations of Nanoscience (FNANO 2017) awarded by National Science Foundation 2017 - 2018
- Support of Fourteenth Conference on the Foundations of Nanoscience (FNANO 2017) awarded by Army Research Office 2017 - 2018
- Support of Fourteenth Conference on the Foundations of Nanoscience (FNANO 2017) awarded by Office of Naval Research 2017
- Support of Thirteenth Conference on the Foundations of Nanoscience (FNANO 2016) awarded by Office of Naval Research 2016
- Support of Thirteenth Conference on the Foundations of Nanoscience (FNANO 2016) awarded by Army Research Office 2016
- SHF: Small: Localized DNA Hybridization Computation awarded by National Science Foundation 2013 - 2016
- Support of Twelfth Conference on the Foundations of Nanoscience (FNANO 2015) awarded by Army Research Office 2015
- SHF: Small: Error Correction for Biomolecular Computations awarded by National Science Foundation 2012 - 2015
- Support of Eleventh Conference on the Foundations of Nanoscience (FNANO 2014) awarded by Office of Naval Research 2014 - 2015
- Support of Eleventh Conference on the Foundations of Nanoscience (FNANO 2014) awarded by Army Research Office 2014 - 2015
- EAGER: Exploratory Software Development & Experiments of Dynamic DNA Nanosystems awarded by National Science Foundation 2011 - 2013
- EMT/NANO: Polymerase-Based Self-Activating and Reactiving DNA Systems awarded by National Science Foundation 2008 - 2012
- EMT/NANO: Autonomous Programmable DNA Devices Using DNAzymes awarded by National Science Foundation 2008 - 2011
- Bio-X AFOSR: Encapsulated DNA-Based Molecular Autonomous Sensing Devices with Photonic I/O awarded by Air Force Office of Scientific Research 2008 - 2009
- EMT: A DNA-Based Autonomous Programmable Molecular Transport Network awarded by National Science Foundation 2005 - 2009
- Support of Conference on Foundations of Nanoscience (FNANO08) awarded by Air Force Office of Scientific Research 2008
- Conference on Foundations of Nanoscience: Self-Assembled Architectures and Devices (FNAN007) awarded by Air Force Office of Scientific Research 2007
- EMT: Error-Resilient DNA Tiling Assemblies awarded by National Science Foundation 2004 - 2007
- ITR: Nanoarchitecture: Balancing Regularity, Complexity, and Defect Tolerance using DNA for Nanoeletronic Integration awarded by National Science Foundation 2003 - 2007
- ITR/RC: Self-Assembly of DNA Nano-Scale Structures for Computation awarded by National Science Foundation 2000 - 2006
- EMT: NSF Workshop on Emerging Opportunities of Nanoscience to Energy Conversion and Storage awarded by National Science Foundation 2005 - 2006
- EMT: NSF Workshop on Programmed Self-Assembly awarded by National Science Foundation 2005
- QuBic: Novel DNA Nanostructures for Targeted Molecular Scale to Micron Scale Interconnects awarded by National Science Foundation 2002 - 2005
- QuBic: Molecular Robotics for DNA Nanostructures awarded by National Science Foundation 2002 - 2005
- SGER: Micro and Nano-Robotics Motion Control and Self-Assembly Algorithms awarded by National Science Foundation 2000 - 2001
- Robust, Adaptive and Dynamic Robotic Motion Planning awarded by National Science Foundation 1997 - 2000
- Prototyping Biomolecular Computations awarded by National Science Foundation 1997 - 1998
- SIMD/MIMD Parallel Computing: Computational Theory, Scientific Applications, and Systems Research awarded by National Science Foundation 1992 - 1998
- Robust, Adaptive, and Dynamic Robotic Motion Planning awarded by National Science Foundation 1997 - 1998
- An Exploratory Study of Parallel Molecular Computation awarded by National Science Foundation 1996 - 1997
- Derivation and Analysis Tools for the Synthesis and Implementation of Parallel Algorithms awarded by Office of Naval Research 1991 - 1995
- Towards Autonomous Robots: Robust, Adaptive and Dynamic Motion Planning awarded by National Science Foundation 1992 - 1995
- Toward Autonomous Robots: Robust, Adaptive, & Dynamic Motion Planning awarded by National Science Foundation 1992 - 1995
- Towards Autonomous Robots: Robust, Adaptive & Dynamic Motion Planning awarded by National Science Foundation 1993 - 1994
- Parallel Algorithm Deviation awarded by Office of Naval Research 1988 - 1992
- Parallel Algorithim Derivation awarded by Office of Naval Research 1988 - 1991
- Parallel Algorithim Derivation awarded by Office of Naval Research 1988 - 1991
- Parallel Algorithm Deviation awarded by Office of Naval Research 1988 - 1991
- Computational Complexity: Efficiency in Electrooptical Computing Systems awarded by Air Force Office of Scientific Research 1987 - 1990
- Very High Speed Holographic Message Routing for Parallel Machines awarded by Army Research Office 1988 - 1990
- Very High Speed Holographic Message Routing for Parallel Machines awarded by Army Research Office 1988 - 1990
- Computational Complexity and Efficiency in Electro-Optical Computing Systems awarded by Air Force Office of Scientific Research 1987 - 1990
- Randomized Parallel Algorithms for Learning awarded by Office of Naval Research 1987 - 1988
- Theoretical Investigations in Parallel Algorithims and Complexity of Motion Planning awarded by National Science Foundation 1985 - 1988
External Relationships
- Domus Diagnostics, Inc.
- Eagle Eyes Research
Publications & Artistic Works
Selected Publications
- Books
  - Rajasekaran, S., and J. Reif. Handbook of parallel computing: Models, algorithms and applications, 2007. https://doi.org/10.1201/9781420011296.
    Full Text
- Academic Articles
  - Fu, Daniel, Raghu Pradeep Narayanan, Abhay Prasad, Fei Zhang, Dewight Williams, John S. Schreck, Hao Yan, and John Reif. “Automated design of 3D DNA origami with non-rasterized 2D curvature.” Science Advances 8, no. 51 (December 2022): eade4455. https://doi.org/10.1126/sciadv.ade4455.
    Full Text
  - Song, Xin, Felicity J. Coulter, Ming Yang, Jessica L. Smith, Fikadu G. Tafesse, William B. Messer, and John H. Reif. “A lyophilized colorimetric RT-LAMP test kit for rapid, low-cost, at-home molecular testing of SARS-CoV-2 and other pathogens.” Scientific Reports 12, no. 1 (April 2022): 7043. https://doi.org/10.1038/s41598-022-11144-5.
    Full Text
  - Song, X., S. Shah, and J. Reif. “Multidimensional data organization and random access in large-scale DNA storage systems.” Theoretical Computer Science 894 (November 26, 2021): 190–202. https://doi.org/10.1016/j.tcs.2021.09.021.
    Full Text
  - Fu, D., and J. Reif. “3d DNA nanostructures: The nanoscale architect.” Applied Sciences (Switzerland) 11, no. 6 (March 2, 2021). https://doi.org/10.3390/app11062624.
    Full Text
  - Song, X., D. Fu, S. Shah, and J. Reif. “UV-Micropatterned Miniaturization: Rapid In Situ Photopatterning and Miniaturization of Microscale Features on Shrinkable Thermoplastics.” Advanced Materials Technologies 5, no. 6 (June 1, 2020). https://doi.org/10.1002/admt.202000146.
    Full Text
  - Shah, Shalin, Jasmine Wee, Tianqi Song, Luis Ceze, Karin Strauss, Yuan-Jyue Chen, and John Reif. “Using Strand Displacing Polymerase To Program Chemical Reaction Networks.” Journal of the American Chemical Society 142, no. 21 (May 2020): 9587–93. https://doi.org/10.1021/jacs.0c02240.
    Full Text
  - Song, Tianqi, Abeer Eshra, Shalin Shah, Hieu Bui, Daniel Fu, Ming Yang, Reem Mokhtar, and John Reif. “Fast and compact DNA logic circuits based on single-stranded gates using strand-displacing polymerase.” Nature Nanotechnology 14, no. 11 (November 2019): 1075–81. https://doi.org/10.1038/s41565-019-0544-5.
    Full Text
  - Song, Tianqi, Shalin Shah, Hieu Bui, Sudhanshu Garg, Abeer Eshra, Daniel Fu, Ming Yang, Reem Mokhtar, and John Reif. “Programming DNA-Based Biomolecular Reaction Networks on Cancer Cell Membranes.” Journal of the American Chemical Society 141, no. 42 (October 2019): 16539–43. https://doi.org/10.1021/jacs.9b05598.
    Full Text
  - Song, Xin, and John Reif. “Nucleic Acid Databases and Molecular-Scale Computing.” Acs Nano 13, no. 6 (June 2019): 6256–68. https://doi.org/10.1021/acsnano.9b02562.
    Full Text
  - Garg, Sudhanshu, Shalin Shah, Hieu Bui, Tianqi Song, Reem Mokhtar, and John Reif. “Renewable Time-Responsive DNA Circuits.” Small (Weinheim an Der Bergstrasse, Germany), July 2018, e1801470. https://doi.org/10.1002/smll.201801470.
    Full Text
  - Bui, Hieu, Shalin Shah, Reem Mokhtar, Tianqi Song, Sudhanshu Garg, and John Reif. “Localized DNA Hybridization Chain Reactions on DNA Origami.” Acs Nano 12, no. 2 (February 2018): 1146–55. https://doi.org/10.1021/acsnano.7b06699.
    Full Text
  - Fu, Daniel, Shalin Shah, Tianqi Song, and John Reif. “DNA-Based Analog Computing.” Methods in Molecular Biology (Clifton, N.J.) 1772 (January 2018): 411–17. https://doi.org/10.1007/978-1-4939-7795-6_23.
    Full Text
  - Song, Tianqi, Sudhanshu Garg, Reem Mokhtar, Hieu Bui, and John Reif. “Design and Analysis of Compact DNA Strand Displacement Circuits for Analog Computation Using Autocatalytic Amplifiers.” Acs Synthetic Biology 7, no. 1 (January 2018): 46–53. https://doi.org/10.1021/acssynbio.6b00390.
    Full Text
  - Reif, John H. “DNA robots sort as they walk.” Science (New York, N.Y.) 357, no. 6356 (September 2017): 1095–96. https://doi.org/10.1126/science.aao5125.
    Full Text
  - Bui, Hieu, Vincent Miao, Sudhanshu Garg, Reem Mokhtar, Tianqi Song, and John Reif. “Design and Analysis of Localized DNA Hybridization Chain Reactions.” Small, 2017, 1602983-n/a. https://doi.org/10.1002/smll.201602983.
    Full Text
  - Song, X., A. Eshra, C. Dwyer, and J. Reif. “Renewable DNA seesaw logic circuits enabled by photoregulation of toehold-mediated strand displacement.” Rsc Advances 7, no. 45 (January 1, 2017): 28130–44. https://doi.org/10.1039/c7ra02607b.
    Full Text
  - Bui, Hieu, Sudhanshu Garg, Vincent Miao, Tianqi Song, Reem Mokhtar, and John Reif. “Design and analysis of linear cascade DNA hybridization chain reactions using DNA hairpins.” New Journal of Physics 19 (2017): 015006–015006.
  - Majumder, U., S. Garg, T. H. LaBean, and J. H. Reif. “Activatable tiles for compact robust programmable molecular assembly and other applications.” Natural Computing 15, no. 4 (December 1, 2016): 611–34. https://doi.org/10.1007/s11047-015-9532-3.
    Full Text
  - Song, Tianqi, Sudhanshu Garg, Reem Mokhtar, Hieu Bui, and John Reif. “Analog Computation by DNA Strand Displacement Circuits.” Acs Synthetic Biology 5, no. 8 (August 2016): 898–912. https://doi.org/10.1021/acssynbio.6b00144.
    Full Text
  - Tyagi, A., and J. H. Reif. “Energy complexity of optical computations.” International Journal of Unconventional Computing 12, no. 5–6 (January 1, 2016): 393–412.
  - Alhalabi, W., J. Reif, Z. Elsheikh, H. Felimban, M. Fallata, K. Thabit, and A. Abusorrah. “The co-learning in the design, simulation and optimization of a solar concentrating system.” Computers in Human Behavior 51 (October 1, 2015): 857–66. https://doi.org/10.1016/j.chb.2014.10.043.
    Full Text
  - Dalchau, Neil, Harish Chandran, Nikhil Gopalkrishnan, Andrew Phillips, and John Reif. “Probabilistic Analysis of Localized DNA Hybridization Circuits.” Acs Synthetic Biology 4, no. 8 (August 2015): 898–913. https://doi.org/10.1021/acssynbio.5b00044.
    Full Text
  - Reif, J. H., and W. Alhalabi. “Solar-thermal powered desalination: Its significant challenges and potential.” Renewable and Sustainable Energy Reviews 48 (August 1, 2015): 152–65. https://doi.org/10.1016/j.rser.2015.03.065.
    Full Text
  - Garg, Sudhanshu, Harish Chandran, Nikhil Gopalkrishnan, Thomas H. LaBean, and John Reif. “Directed enzymatic activation of 1-D DNA tiles.” Acs Nano 9, no. 2 (February 2015): 1072–79. https://doi.org/10.1021/nn504556v.
    Full Text
  - Chandran, H., N. Gopalkrishnan, B. Yurke, and J. Reif. “Meta-DNA: A DNA-based approach to synthetic biology,” March 1, 2014, 171–200. https://doi.org/10.1007/978-94-017-9047-5_7.
    Full Text
  - Chandran, H., N. Gopalkrishnan, and J. Reif. “Tile Complexity of Approximate Squares.” Algorithmica 66, no. 1 (May 1, 2013): 1–17. https://doi.org/10.1007/s00453-012-9620-z.
    Full Text
  - Chandran, Harish, Abhijit Rangnekar, Geetha Shetty, Erik A. Schultes, John H. Reif, and Thomas H. LaBean. “An autonomously self-assembling dendritic DNA nanostructure for target DNA detection.” Biotechnology Journal 8, no. 2 (February 2013): 221–27. https://doi.org/10.1002/biot.201100499.
    Full Text
  - Chandran, H., S. Garg, N. Gopalkrishnan, and J. H. Reif. “Biomolecular Computing Systems,” December 21, 2012, 199–223. https://doi.org/10.1002/9783527645480.ch11.
    Full Text
  - Reif, J. H. “Local parallel biomolecular computation.” International Journal of Unconventional Computing 8, no. 5–6 (December 1, 2012): 459–507.
  - Chandran, H., N. Gopalkrishnan, and J. Reif. “Tile complexity of linear assemblies.” Siam Journal on Computing 41, no. 4 (September 24, 2012): 1051–73. https://doi.org/10.1137/110822487.
    Full Text
  - Chandran, Harish, Nikhil Gopalkrishnan, Bernard Yurke, and John Reif. “Meta-DNA: synthetic biology via DNA nanostructures and hybridization reactions.” Journal of the Royal Society, Interface 9, no. 72 (July 2012): 1637–53. https://doi.org/10.1098/rsif.2011.0819.
    Full Text
  - Chandran, H., N. Gopalkrishnan, A. Phillips, and J. Reif. “Localized hybridization circuits.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 6937 LNCS (September 29, 2011): 64–83. https://doi.org/10.1007/978-3-642-23638-9_8.
    Full Text
  - Reif, John H. “Biochemistry. Scaling up DNA computation.” Science (New York, N.Y.) 332, no. 6034 (June 2011): 1156–57. https://doi.org/10.1126/science.1208068.
    Full Text
  - Reif, J. H. “Keynote: DNA-based molecular devices.” 2011 Ieee 1st International Conference on Computational Advances in Bio and Medical Sciences, Iccabs 2011, April 14, 2011, 3. https://doi.org/10.1109/ICCABS.2011.5729934.
    Full Text
  - Reif, J. H., S. Sahu, and P. Yin. “Complexity of graph self-assembly in accretive systems and self-destructible systems.” Theoretical Computer Science 412, no. 17 (April 8, 2011): 1592–1605. https://doi.org/10.1016/j.tcs.2010.10.034.
    Full Text
  - Reif, J., and S. Slee. “Asymptotically optimal kinodynamic motion planning for a class of modular self-reconfigurable robots.” International Journal of Computational Geometry and Applications 21, no. 2 (April 1, 2011): 131–55. https://doi.org/10.1142/S0218195911003585.
    Full Text
  - Majumder, U., and J. H. Reif. “Design of a biomolecular device that executes process algebra.” Natural Computing 10, no. 1 (March 1, 2011): 447–66. https://doi.org/10.1007/s11047-010-9235-8.
    Full Text
  - Majumder, Urmi, Abhijit Rangnekar, Kurt V. Gothelf, John H. Reif, and Thomas H. LaBean. “Design and construction of double-decker tile as a route to three-dimensional periodic assembly of DNA.” Journal of the American Chemical Society 133, no. 11 (March 2011): 3843–45. https://doi.org/10.1021/ja1108886.
    Full Text
  - Gopalkrishnan, N., H. Chandran, and J. Reif. “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) 6518 LNCS (February 1, 2011): 59–70. https://doi.org/10.1007/978-3-642-18305-8_6.
    Full Text
  - Slee, S., and J. Reif. “Robomotion: Scalable, physically stable locomotion for self-reconfigurable robots.” Springer Tracts in Advanced Robotics 68, no. STAR (December 20, 2010): 121–37. https://doi.org/10.1007/978-3-642-17452-0_8.
    Full Text
  - Sahu, S., and J. H. Reif. “Capabilities and limits of compact error resilience methods for algorithmic self-assembly.” Algorithmica (New York) 56, no. 4 (April 1, 2010): 480–504. https://doi.org/10.1007/s00453-008-9187-x.
    Full Text
  - Reif, J. H., and U. Majumder. “Isothermal reactivating Whiplash PCR for locally programmable molecular computation.” Natural Computing 9, no. 1 (January 1, 2010): 183–206. https://doi.org/10.1007/s11047-009-9148-6.
    Full Text
  - Majumder, U., and J. H. Reif. “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) 5877 LNCS (December 11, 2009): 97–105. https://doi.org/10.1007/978-3-642-10604-0_10.
    Full Text
  - LaBean, T. H., G. Shetty, H. Yan, E. A. Schultes, H. Chandran, and J. H. Reif. “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, December 1, 2009, 82–83.
  - LaBean, T. H., G. Shetty, P. Yin, E. A. Schultes, H. Chandran, and J. H. Reif. “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, December 1, 2009, 60–61.
  - Reif, J., and M. Lieberman. “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, December 1, 2009.
  - Reif, J. H., and U. Majumder. “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) 5347 LNCS (November 27, 2009): 41–56. https://doi.org/10.1007/978-3-642-03076-5_5.
    Full Text
  - Reif, J. H. “Quantum Computing,” November 24, 2009, 67–109. https://doi.org/10.1002/9780470429983.ch3.
    Full Text
  - Reif, J. H., and T. H. LaBean. “DNA Nanotechnology and its Biological Applications,” November 24, 2009, 349–75. https://doi.org/10.1002/9780470429983.ch14.
    Full Text
  - Chandran, H., N. Gopalkrishnan, and J. Reif. “The tile complexity of linear assemblies.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 5555 LNCS, no. PART 1 (November 12, 2009): 235–53. https://doi.org/10.1007/978-3-642-02927-1_21.
    Full Text
  - Reif, J. H., and S. Sahu. “Autonomous programmable DNA nanorobotic devices using DNAzymes.” Theoretical Computer Science 410, no. 15 (April 1, 2009): 1428–39. https://doi.org/10.1016/j.tcs.2008.12.003.
    Full Text
  - Reif, J., and P. Weiss. “Conference motivation: The challenge of self-assembly of molecular scale structures.” 5th Conference on Foundations of Nanoscience: Self Assembled Architectures and Devices, Fnano 2008, December 1, 2008.
  - Sahu, S., B. Wang, and J. H. Reif. “A framework for modeling DNA based molecular systems.” Journal of Computational and Theoretical Nanoscience 5, no. 11 (November 1, 2008): 2124–34. https://doi.org/10.1166/jctn.2008.1108.
    Full Text
  - Sahu, Sudheer, Thomas H. LaBean, and John H. Reif. “A DNA nanotransport device powered by polymerase phi29.” Nano Letters 8, no. 11 (November 2008): 3870–78. https://doi.org/10.1021/nl802294d.
    Full Text
  - Reif, J. H., and S. Slee. “Asymptotically optimal kinodynamic motion planning for self-reconfigurable robots.” Springer Tracts in Advanced Robotics 47 (October 20, 2008): 457–72. https://doi.org/10.1007/978-3-540-68405-3_29.
    Full Text
  - Majumder, U., and J. H. Reif. “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) 5204 LNCS (September 25, 2008): 129–45. https://doi.org/10.1007/978-3-540-85194-3_12.
    Full Text
  - Majumder, U., T. H. LaBean, and J. H. Reif. “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) 4848 LNCS (August 27, 2008): 15–25. https://doi.org/10.1007/978-3-540-77962-9_2.
    Full Text
  - Reif, J. H., and S. Sahu. “Autonomous programmable nanorobotic devices using DNAzymes.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 4848 LNCS (August 27, 2008): 66–78. https://doi.org/10.1007/978-3-540-77962-9_7.
    Full Text
  - Yin, Peng, Rizal F. Hariadi, Sudheer Sahu, Harry M. T. Choi, Sung Ha Park, Thomas H. Labean, and John H. Reif. “Programming DNA tube circumferences.” Science (New York, N.Y.) 321, no. 5890 (August 2008): 824–26. https://doi.org/10.1126/science.1157312.
    Full Text
  - Reif, J. H., S. Kasif, and D. Sherlekar. “Formula dissection: A parallel algorithm for constraint satisfaction.” Computers and Mathematics With Applications 55, no. 6 (March 1, 2008): 1170–77. https://doi.org/10.1016/j.camwa.2007.07.002.
    Full Text
  - Majumder, U., S. Sahu, and J. H. Reif. “Stochastic analysis of reversible self-assembly.” Journal of Computational and Theoretical Nanoscience 5, no. 7 (January 1, 2008): 1289–1305. https://doi.org/10.1166/jctn.2008.2565.
    Full Text
  - Gehani, A., and J. Reif. “Super-resolution video analysis for forensic investigations.” Ifip International Federation for Information Processing 242 (December 3, 2007): 281–99. https://doi.org/10.1007/978-0-387-73742-3_20.
    Full Text
  - Majumder, U., S. Sahu, and J. Reif. “Reversible self-assembly of squares as a rapidly mixing Markov Chain.” 4th Conference on Foundations of Nanoscience: Self Assembled Architectures and Devices, Fnano 2007, December 1, 2007, 155–57.
  - Majumder, U., T. H. LaBean, and J. H. Reif. “Activatable DNA tiles for compact error-resilient directional assembly.” 4th Conference on Foundations of Nanoscience: Self Assembled Architectures and Devices, Fnano 2007, December 1, 2007, 60–64.
  - Yin, P., R. F. Hariadi, S. Sahu, H. M. T. Choi, S. H. Park, B. Walters, T. H. LaBean, and J. H. Reif. “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, December 1, 2007, 71–78.
  - Reif, J. H., and T. H. Labean. “Autonomous programmable biomolecular devices using self-assembled DNA nanostructures.” Communications of the Acm 50, no. 9 (September 1, 2007): 46–53. https://doi.org/10.1145/1284621.1284647.
    Full Text
  - Labean, T. H., K. V. Gothelf, and J. H. Reif. “Self-Assembling DNA Nanostructures for Patterned Molecular Assembly,” February 19, 2007, 79–97. https://doi.org/10.1002/9783527610389.ch5.
    Full Text
  - Reif, J. H., and S. Chakraborty. “Efficient and exact quantum compression.” Information and Computation 205, no. 7 (January 1, 2007): 967–81. https://doi.org/10.1016/j.ic.2007.01.005.
    Full Text
  - Reif, J. H., and T. H. Labean. “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) 4576 LNCS (January 1, 2007): 297–306. https://doi.org/10.1007/978-3-540-73445-1_21.
    Full Text
  - Majumder, U., S. Sahu, T. H. LaBean, and J. H. Reif. “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) 4287 LNCS (December 1, 2006): 195–214. https://doi.org/10.1007/11925903_15.
    Full Text
  - 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, December 1, 2006.
  - Sahu, S., B. Wang, and J. H. Reif. “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) 4287 LNCS (December 1, 2006): 250–65. https://doi.org/10.1007/11925903_19.
    Full Text
  - Sahu, S., and J. H. Reif. “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) 4287 LNCS (December 1, 2006): 223–38. https://doi.org/10.1007/11925903_17.
    Full Text
  - Reif, J. H., S. Sahu, and P. Yin. “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) 3892 LNCS (July 13, 2006): 257–74. https://doi.org/10.1007/11753681_21.
    Full Text
  - Sahu, S., P. Yin, and J. H. Reif. “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) 3892 LNCS (July 13, 2006): 290–304. https://doi.org/10.1007/11753681_23.
    Full Text
  - Yin, P., S. Sahu, A. J. Turberfield, and J. H. Reif. “Design of autonomous DNA cellular automata.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 3892 LNCS (July 13, 2006): 399–416. https://doi.org/10.1007/11753681_32.
    Full Text
  - Reif, J. H., and Z. Sun. “On boundaries of highly visible spaces and applications.” Theoretical Computer Science 354, no. 3 (April 4, 2006): 379–90. https://doi.org/10.1016/j.tcs.2005.11.027.
    Full Text
  - Park, S. H., C. Pistol, S. J. Ahn, J. H. Reif, A. R. Lebeck, C. Dwyer, and T. H. LaBean. “Finite-size, Fully-Addressable DNA Tile Lattices Formed by Hierarchical Assembly Procedures.” Angewandte Chemie 45 (2006): 735-739-735–39.
  - Sun, Z., and J. H. Reif. “On finding approximate optimal paths in weighted regions.” Journal of Algorithms 58, no. 1 (January 1, 2006): 1–32. https://doi.org/10.1016/j.jalgor.2004.07.004.
    Full Text
  - LaBean, T. H., S. H. Park, S. J. Ahn, and J. H. Reif. “Stepwise DNA self-assembly of fixed-size nanostructures.” 2nd Conference on Foundations of Nanoscience: Self Assembled Architectures and Devices, Fnano 2005, December 1, 2005, 178–80.
  - Sun, Z., D. Hsu, T. Jiang, H. Kurniawati, and J. H. Reif. “Narrow passage sampling for probabilistic roadmap planning.” Ieee Transactions on Robotics 21, no. 6 (December 1, 2005): 1105–15. https://doi.org/10.1109/TRO.2005.853485.
    Full Text
  - Park, S. H., H. Li, H. Yan, J. H. Reif, G. Finkelstein, and T. H. LaBean. “Self-assembled 1D DNA nanostructures as templates for silver nanowires.” 2nd Conference on Foundations of Nanoscience: Self Assembled Architectures and Devices, Fnano 2005, December 1, 2005, 193–96.
  - Azhar, S., A. McLennan, and J. H. Reif. “Computation of equilibriain noncooperative games.” Computers and Mathematics With Applications 50, no. 5–6 (September 1, 2005): 823–54. https://doi.org/10.1016/j.camwa.2005.02.015.
    Full Text
  - Chen, J., and G. Rozenberg. “Preface.” Natural Computing 4, no. 2 (June 1, 2005): 81–82. https://doi.org/10.1007/s11047-004-4001-4.
    Full Text
  - Park, Sung Ha, Peng Yin, Yan Liu, John H. Reif, Thomas H. LaBean, and Hao Yan. “Programmable DNA self-assemblies for nanoscale organization of ligands and proteins.” Nano Letters 5, no. 4 (April 2005): 729–33. https://doi.org/10.1021/nl050175c.
    Full Text
  - Park, S. H., R. Barish, H. Li, J. H. Reif, G. Finkelstein, H. Yan, and T. H. LaBean. “Three-Helix Bundle DNA Tiles Self-Assemble into 2D Lattice or 1D Templates for Silver Nanowires.” Nano Letters 5 (March 2005): 693.
  - Sun, Z., and J. H. Reif. “On finding energy-minimizing paths on terrains.” Ieee Transactions on Robotics 21, no. 1 (February 1, 2005): 102–14. https://doi.org/10.1109/TRO.2004.837232.
    Full Text
  - Reif, J. H., S. Sahu, and P. Yin. “Compact error-resilient computational DNA tiling assemblies.” Lecture Notes in Computer Science 3384 (January 1, 2005): 293–307. https://doi.org/10.1007/11493785_26.
    Full Text
  - Reif, J. H., T. H. LaBean, S. Sahu, H. Yan, and P. Yin. “Design, simulation, and experimental demonstration of self-assembled DNA nanostructures and motors.” Lecture Notes in Computer Science 3566 (January 1, 2005): 173–87. https://doi.org/10.1007/11527800_14.
    Full Text
  - Yin, P., A. J. Turberfield, S. Sahu, and J. H. Reif. “Design of an autonomous DNA nanomechanical device capable of universal computation and universal translational motion.” Lecture Notes in Computer Science 3384 (January 1, 2005): 426–44. https://doi.org/10.1007/11493785_37.
    Full Text
  - Yin, P., A. J. Turberfield, and J. H. Reif. “Designs of autonomous unidirectional walking DNA devices.” Lecture Notes in Computer Science 3384 (January 1, 2005): 410–25. https://doi.org/10.1007/11493785_36.
    Full Text
  - Reif, J. H. “Efficient parallel factorization and solution of structured and unstructured linear systems.” Journal of Computer and System Sciences 71, no. 1 (January 1, 2005): 86–143. https://doi.org/10.1016/j.jcss.2004.12.010.
    Full Text
  - Yin, Peng, Hao Yan, Xiaoju G. Daniell, Andrew J. Turberfield, and John H. Reif. “A unidirectional DNA walker that moves autonomously along a track.” Angewandte Chemie (International Ed. in English) 43, no. 37 (September 2004): 4906–11. https://doi.org/10.1002/anie.200460522.
    Full Text
  - Park, S. H., H. Yan, J. H. Reif, T. H. LaBean, and G. Finkelstein. “Electronic nanostructures templated on self-assembled DNA scaffolds.” Nanotechnology 15 (July 2004): S525–27.
    Link to Item
  - Reif, J. H., and Z. Sun. “Movement planning in the presence of flows.” Algorithmica (New York) 39, no. 2 (February 1, 2004): 127–53. https://doi.org/10.1007/s00453-003-1079-5.
    Full Text
  - Li, Hanying, Sung Ha Park, John H. Reif, Thomas H. LaBean, and Hao Yan. “DNA-templated self-assembly of protein and nanoparticle linear arrays.” Journal of the American Chemical Society 126, no. 2 (January 2004): 418–19. https://doi.org/10.1021/ja0383367.
    Full Text
  - Gehani, A., T. Labean, and J. Reif. “DNA-based cryptography.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2950 (January 1, 2004): 167–88.
  - Liu, Dage, Sung Ha Park, John H. Reif, and Thomas H. LaBean. “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 101, no. 3 (January 2004): 717–22. https://doi.org/10.1073/pnas.0305860101.
    Full Text
  - Reif, J. H., and W. L. Scherlis. “Deriving efficient graph algorithms.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2772 (January 1, 2004): 645–81.
  - Hsu, D., T. Jiang, J. Reif, and Z. Sun. “The bridge test for sampling narrow passages with probabilistic roadmap planners.” Proceedings Ieee International Conference on Robotics and Automation 3 (December 9, 2003): 4420–26.
  - Sun, Z., and J. Reif. “On energy-minimizing paths on terrains for a mobile robot.” Proceedings Ieee International Conference on Robotics and Automation 3 (December 9, 2003): 3782–88.
  - Reif, J. H. “The design of autonomous DNA nano-mechanical devices: Walking and rolling DNA.” Natural Computing 2, no. 4 (December 1, 2003): 439–61. https://doi.org/10.1023/B:NACO.0000006775.03534.92.
    Full Text
  - Yan, Hao, Liping Feng, Thomas H. LaBean, and John H. Reif. “Parallel molecular computations of pairwise exclusive-or (XOR) using DNA "string tile" self-assembly.” J Am Chem Soc 125, no. 47 (November 26, 2003): 14246–47. https://doi.org/10.1021/ja036676m.
    Full Text Link to Item
  - Feng, Liping, Sung Ha Park, John H. Reif, and Hao Yan. “A two-state DNA lattice switched by DNA nanoactuator.” Angew Chem Int Ed Engl 42, no. 36 (September 22, 2003): 4342–46. https://doi.org/10.1002/anie.200351818.
    Full Text Link to Item
  - Reif, J. H., and Z. Sun. “On frictional mechanical systems and their computational power.” Siam Journal on Computing 32, no. 6 (September 1, 2003): 1449–74. https://doi.org/10.1137/S0097539798346652.
    Full Text
  - Reif, John H. “Guest Editor's Foreword.” Journal of Computer and System Sciences 67, no. 2 (September 2003): 211–211. https://doi.org/10.1016/s0022-0000(03)00007-2.
    Full Text
  - Yan, Hao, Sung Ha Park, Gleb Finkelstein, John H. Reif, and Thomas H. LaBean. “DNA-Templated Self-Assembly of Protein Arrays and Highly Conductive Nanowires.” Science 301 (September 2003): 1882.
  - Yan, Hao, Thomas H. LaBean, Liping Feng, and John H. Reif. “Directed nucleation assembly of DNA tile complexes for barcode-patterned lattices.” Proc Natl Acad Sci U S A 100, no. 14 (July 8, 2003): 8103–8. https://doi.org/10.1073/pnas.1032954100.
    Full Text Link to Item
  - Liu, D., J. H. Reif, and T. H. LaBean. “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) 2568 (January 1, 2003): 10–21. https://doi.org/10.1007/3-540-36440-4_2.
    Full Text
  - Reif, J. H. “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) 2568 (January 1, 2003): 22–37. https://doi.org/10.1007/3-540-36440-4_3.
    Full Text
  - Reif, J. H., and Z. Sun. “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) 2751 (January 1, 2003): 271–83. https://doi.org/10.1007/978-3-540-45077-1_25.
    Full Text
  - Sun, Z., and J. H. Reif. “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) 2751 (January 1, 2003): 258–70. https://doi.org/10.1007/978-3-540-45077-1_24.
    Full Text
  - Reif, John H. “Computing. Successes and challenges.” Science (New York, N.Y.) 296, no. 5567 (April 2002): 478–79. https://doi.org/10.1126/science.1070978.
    Full Text
  - Peterson, G., J. Reif, and S. Azhar. “Decision algorithms for multiplayer noncooperative games of incomplete information.” Computers and Mathematics With Applications 43, no. 1–2 (January 1, 2002): 179–206. https://doi.org/10.1016/S0898-1221(01)00282-6.
    Full Text
  - Reif, J. H. “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) 2380 LNCS (January 1, 2002): 1–21. https://doi.org/10.1007/3-540-45465-9_1.
    Full Text
  - Reif, J. H. “DNA lattices: A method for molecular-scale patterning and computation.” Computing in Science and Engineering 4, no. 1 (January 1, 2002): 32–41. https://doi.org/10.1109/5992.976435.
    Full Text
  - Reif, J. H. “The emerging discipline of biomolecular computation in the US.” New Generation Computing 20, no. 3 (January 1, 2002): 217–36. https://doi.org/10.1007/BF03037357.
    Full Text
  - 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, January 1, 2002.
  - Sun, Z., and J. Reif. “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) 2223 LNCS (December 1, 2001): 160–71. https://doi.org/10.1007/3-540-45678-3_15.
    Full Text
  - Reif, J. H., and J. A. Storer. “Optimal encoding of non-stationary sources.” Information Sciences 135, no. 1–2 (June 1, 2001): 87–105. https://doi.org/10.1016/S0020-0255(01)00103-7.
    Full Text
  - Peterson, G., J. Reif, and S. Azhar. “Lower bounds for multiplayer noncooperative games of incomplete information.” Computers and Mathematics With Applications 41, no. 7–8 (January 1, 2001): 957–92. https://doi.org/10.1016/S0898-1221(00)00333-3.
    Full Text
  - Reif, J. H. “Parallel output-sensitive algorithms for combinatorial and linear algebra problems.” Journal of Computer and System Sciences 62, no. 3 (January 1, 2001): 398–412. https://doi.org/10.1006/jcss.2000.1740.
    Full Text
  - Reif, J. H. “Efficient parallel computation of the characteristic polynomial of a sparse, separable matrix.” Algorithmica (New York) 29, no. 3 (January 1, 2001): 487–510. https://doi.org/10.1007/s004530010068.
    Full Text
  - Reif, J. H., T. H. LaBean, and N. C. Seeman. “Programmable assembly at the molecular scale: Self-assembly of DNA lattices (invited paper).” Proceedings Ieee International Conference on Robotics and Automation 1 (January 1, 2001): 966–71.
  - Reif, J. H., and H. Wang. “Nonuniform discretization for kinodynamic motion planning and its applications.” Siam Journal on Computing 30, no. 1 (December 1, 2000): 161–90. https://doi.org/10.1137/S0097539798331975.
    Full Text
  - Reif, J. H., and S. R. Tate. “Fast spatial decomposition and closest pair computation for limited precision input.” Algorithmica (New York) 28, no. 3 (November 1, 2000): 271–87. https://doi.org/10.1007/s004530010040.
    Full Text
  - Mao, C., T. H. LaBean, J. H. Relf, and N. C. Seeman. “Logical computation using algorithmic self-assembly of DNA triple-crossover molecules.” Nature 407, no. 6803 (September 2000): 493–96. https://doi.org/10.1038/35035038.
    Full Text
  - LaBean, T. H., H. Yan, J. Kopatsch, F. Liu, E. Winfree, J. H. Reif, and N. C. Seeman. “Construction, analysis, ligation, and self-assembly of DNA triple crossover complexes.” Journal of the American Chemical Society 122, no. 9 (March 8, 2000): 1848–60. https://doi.org/10.1021/ja993393e.
    Full Text
  - Reif, J. “On the impossibility of interaction-free quantum sensing for small I/O bandwidth.” Information and Computation 163, no. 1 (January 1, 2000): 103–22. https://doi.org/10.1006/inco.2000.2880.
    Full Text
  - Gehani, A., and J. Reif. “Micro flow bio-molecular computation.” Bio Systems 52, no. 1–3 (October 1999): 197–216. https://doi.org/10.1016/s0303-2647(99)00048-9.
    Full Text
  - Reif, J. H., and H. Wang. “Social potential fields: A distributed behavioral control for autonomous robots.” Robotics and Autonomous Systems 27, no. 3 (May 31, 1999): 171–94. https://doi.org/10.1016/S0921-8890(99)00004-4.
    Full Text
  - Azhar, S., and J. H. Reif. “Efficient algorithmic learning of the structure of permutation groups by examples.” Computers and Mathematics With Applications 37, no. 10 (January 1, 1999): 105–32. https://doi.org/10.1016/S0898-1221(99)00129-7.
    Full Text
  - Li, Z., J. H. Reif, and S. K. S. Gupta. “Synthesizing efficient out-of-core programs for block recursive algorithms using block-cyclic data distributions.” Ieee Transactions on Parallel and Distributed Systems 10, no. 3 (January 1, 1999): 297–315. https://doi.org/10.1109/71.755830.
    Full Text
  - Reif, J. H. “Approximate complex polynomial evaluation in near constant work per point.” Siam Journal on Computing 28, no. 6 (January 1, 1999): 2059–89. https://doi.org/10.1137/S0097539797324291.
    Full Text
  - Reif, J. H. “Parallel biomolecular computation: Models and simulations.” Algorithmica (New York) 25, no. 2–3 (January 1, 1999): 142–75. https://doi.org/10.1007/PL00008272.
    Full Text
  - Rolland, J. P., A. Yoshida, L. D. Davis, and J. H. Reif. “High-resolution inset head-mounted display.” Applied Optics 37, no. 19 (July 1998): 4183–93. https://doi.org/10.1364/ao.37.004183.
    Full Text
  - Gazit, H., and J. H. Reif. “A Randomized Parallel Algorithm for Planar Graph Isomorphism.” Journal of Algorithms 28, no. 2 (January 1, 1998): 290–314. https://doi.org/10.1006/jagm.1998.0943.
    Full Text
  - Reif, J. H. “Efficient Approximate Solution of Sparse Linear Systems.” Computers and Mathematics With Applications 36, no. 9 (January 1, 1998): 37–58. https://doi.org/10.1016/S0898-1221(98)00191-6.
    Full Text
  - Reif, J. H., and J. A. Storer. “Optimal lossless compression of a class of dynamic sources.” Data Compression Conference Proceedings, January 1, 1998, 501–10.
  - Gelenbe, E., N. Schmajuk, J. Staddon, and J. Reif. “Autonomous search by robots and animals: A survey.” Robotics and Autonomous Systems 22, no. 1 (November 10, 1997): 23–34. https://doi.org/10.1016/S0921-8890(97)00014-6.
    Full Text
  - Reif, J. H., and A. Tyagi. “Efficient parallel algorithms for optical computing with the discrete Fourier transform (DFT) primitive.” Applied Optics 36, no. 29 (October 1997): 7327–40. https://doi.org/10.1364/ao.36.007327.
    Full Text
  - Chen, S., and J. H. Reif. “Fast and compact volume rendering in the compressed transform domain.” Data Compression Conference Proceedings, January 1, 1997, 271–80.
  - Han, Y., V. Y. Pan, and J. H. Reif. “Efficient Parallel Algorithms for Computing All Pair Shortest Paths in Directed Graphs1.” Algorithmica (New York) 17, no. 4 (January 1, 1997): 399–415. https://doi.org/10.1007/BF02523680.
    Full Text
  - Reif, J. H. “Approximate complex polynomial evaluation in near constant work per point.” Conference Proceedings of the Annual Acm Symposium on Theory of Computing, January 1, 1997, 30–39. https://doi.org/10.1145/258533.258543.
    Full Text
  - Reif, J. H., and A. Tyagi. “Optical delay line memory model with efficient algorithms.” Optical Engineering 36, no. 9 (January 1, 1997): 2521–35. https://doi.org/10.1117/1.601478.
    Full Text
  - Reif, J. H., and S. R. Tate. “On Dynamic Algorithms for Algebraic Problems.” Journal of Algorithms 22, no. 2 (January 1, 1997): 347–71. https://doi.org/10.1006/jagm.1995.0807.
    Full Text
  - Storer, J. A., and J. H. Reif. “Error-resilient optimal data compression.” Siam Journal on Computing 26, no. 4 (January 1, 1997): 934–49. https://doi.org/10.1137/S0097539792240789.
    Full Text
  - Storer, J. A., and J. Reif. “Low-cost prevention of error-propagation for data compression with dynamic dictionaries.” Data Compression Conference Proceedings, January 1, 1997, 171–80.
  - Kao, M. Y., J. H. Reif, and S. R. Tate. “Searching in an Unknown Environment: An Optimal Randomized Algorithm for the Cow-Path Problem.” Information and Computation 131, no. 1 (November 25, 1996): 63–79. https://doi.org/10.1006/inco.1996.0092.
    Full Text
  - Neff, A. C., and J. H. Reif. “An efficient algorithm for the complex roots problem.” Journal of Complexity 12, no. 2 (January 1, 1996): 81–115. https://doi.org/10.1006/jcom.1996.0008.
    Full Text
  - Nyland, L. S., and J. H. Reif. “An algebraic technique for generating optimal CMOS circuitry in linear time.” Computers and Mathematics With Applications 31, no. 1 (January 1, 1996): 85–108. https://doi.org/10.1016/0898-1221(95)00184-Z.
    Full Text
  - Reif, J. H. “Efficient parallel solution of sparse eigenvalue and eigenvector problems.” Annual Symposium on Foundations of Computer Science Proceedings, December 1, 1995, 123–32.
  - Yoshida, A., J. P. Rolland, and J. H. Reif. “Optical design and analysis of a head-mounted display with a high-resolution insert.” Proceedings of Spie the International Society for Optical Engineering 2537 (December 1, 1995): 71–82.
  - Chen, S., and J. H. Reif. “Fast pattern matching for entropy bounded text.” Data Compression Conference Proceedings, January 1, 1995, 282–91.
  - Paturi, R., S. Rajasekaran, and J. Reif. “The light bulb problem.” Information and Computation 117, no. 2 (January 1, 1995): 187–92. https://doi.org/10.1006/inco.1995.1038.
    Full Text
  - Reif, J. H. “Parallel molecular computation.” Annual Acm Symposium on Parallel Algorithms and Architectures, January 1, 1995, 213–23. https://doi.org/10.1145/215399.215446.
    Full Text
  - Reif, J. H., and S. Sen. “An efficient output-sensitive hidden-surface removal algorithm for polyhedral terrains.” Mathematical and Computer Modelling 21, no. 5 (January 1, 1995): 89–104. https://doi.org/10.1016/0895-7177(95)00016-U.
    Full Text
  - Yoshida, A., J. P. Rolland, and J. H. Reif. “Design and applications of a high-resolution insert head-mounted-display.” Proceedings Virtual Reality Annual International Symposium, January 1, 1995, 84–93.
  - Cheriyan, J., and J. H. Reif. “Directed s-t numberings, Rubber bands, and testing digraph k-vertex connectivity.” Combinatorica 14, no. 4 (December 1, 1994): 435–51. https://doi.org/10.1007/BF01302965.
    Full Text
  - Reif, J. H., J. D. Tygar, and A. Yoshida. “Computability and complexity of ray tracing.” Discrete &Amp; Computational Geometry 11, no. 1 (December 1, 1994): 265–88. https://doi.org/10.1007/BF02574009.
    Full Text
  - Reif, J. H., and J. A. Storer. “A Single-Exponential Upper Bound for Finding Shortest Paths in Three Dimensions.” Journal of the Acm (Jacm) 41, no. 5 (January 9, 1994): 1013–19. https://doi.org/10.1145/185675.185811.
    Full Text
  - Storer, J. A., and J. H. Reif. “Shortest Paths in the Plane with Polygonal Obstacles.” Journal of the Acm (Jacm) 41, no. 5 (January 9, 1994): 982–1012. https://doi.org/10.1145/185675.185795.
    Full Text
  - Reif, J., and M. Sharir. “Motion Planning in the Presence of Moving Obstacles.” Journal of the Acm (Jacm) 41, no. 4 (January 7, 1994): 764–90. https://doi.org/10.1145/179812.179911.
    Full Text
  - Azhar, S., G. J. Badros, A. Glodjo, M. Y. Kao, and J. H. Reif. “Data compression techniques for stock market prediction.” Proceedings of the Data Compression Conference, January 1, 1994, 72–82.
  - Ramachandran, V., and J. Reif. “Planarity testing in parallel.” Journal of Computer and System Sciences 49, no. 3 (January 1, 1994): 517–61. https://doi.org/10.1016/S0022-0000(05)80070-4.
    Full Text
  - Reif, J. H. “Models and resource metrics for parallel and distributed computation.” Proceedings of the International Conference on Parallel Processing, January 1, 1994, 404.
  - Reif, J. H., and S. R. Tate. “Approximate kinodynamic planning using L2-norm dynamic bounds.” Computers and Mathematics With Applications 27, no. 5 (January 1, 1994): 29–44. https://doi.org/10.1016/0898-1221(94)90074-4.
    Full Text
  - Reif, J. H., and S. R. Tate. “Dynamic algebraic algorithms.” Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, January 1, 1994, 290–301.
  - Reif, J. H., and S. Sen. “Randomized algorithms for binary search and load balancing on fixed connection networks with geometric applications.” Siam Journal on Computing 23, no. 3 (January 1, 1994): 633–51. https://doi.org/10.1137/S0097539790184298.
    Full Text
  - Yoshida, A., and J. H. Reif. “Optical Computing Techniques for Image/Video Compression.” Proceedings of the Ieee 82, no. 6 (January 1, 1994): 948–54. https://doi.org/10.1109/5.286198.
    Full Text
  - Chen, S., and J. H. Reif. “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), December 1, 1993, 104–12.
  - Reif, J. H. “O(n log³ n) algorithm for the real root problem.” Annual Symposium on Foundatons of Computer Science (Proceedings), December 1, 1993, 626–35.
  - Reif, J. H., and S. R. Tate. “Continuous alternation: The complexity of pursuit in continuous domains.” Algorithmica 10, no. 2–4 (October 1, 1993): 156–81. https://doi.org/10.1007/BF01891838.
    Full Text
  - Donald, B., P. Xavier, J. Canny, and J. Reif. “Kinodynamic Motion Planning.” Journal of the Acm (Jacm) 40, no. 5 (January 11, 1993): 1048–66. https://doi.org/10.1145/174147.174150.
    Full Text
  - Kao, M. Y., J. H. Reif, and S. R. Tate. “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, January 1, 1993, 441–47.
  - Pan, V., and J. Reif. “Fast and efficient parallel solution of sparse linear systems.” Siam Journal on Computing 22, no. 6 (January 1, 1993): 1227–50. https://doi.org/10.1137/0222073.
    Full Text
  - Pan, V., and J. Reif. “Generalized compact multi-grid.” Computers and Mathematics With Applications 25, no. 9 (January 1, 1993): 3–5. https://doi.org/10.1016/0898-1221(93)90126-G.
    Full Text
  - Reif, J. H. “Probabilistic parallel prefix computation.” Computers and Mathematics With Applications 26, no. 1 (January 1, 1993): 101–10. https://doi.org/10.1016/0898-1221(93)90089-E.
    Full Text
  - Reif, J. H. “Efficient VLSI fault simulation.” Computers and Mathematics With Applications 25, no. 2 (January 1, 1993): 15–32. https://doi.org/10.1016/0898-1221(93)90219-L.
    Full Text
  - Reif, J. H., and A. Yoshida. “Optical expanders with applications in optical computing.” Applied Optics 32, no. 2 (January 1993): 159–65. https://doi.org/10.1364/ao.32.000159.
    Full Text
  - Storer, J. A., T. Markas, M. Royals, N. Kanopoulos, and J. H. Reif. “On the Design and Implementation of a Lossless Data Compression and Decompression Chip.” Ieee Journal of Solid State Circuits 28, no. 9 (January 1, 1993): 948–53. https://doi.org/10.1109/4.236174.
    Full Text
  - Mills, P. H., L. S. Nyland, J. F. Prins, and J. H. Reif. “Prototyping N-body simulation in Proteus.” Proceedings of the International Conference on Parallel Processing, December 1, 1992, 476–82.
  - Rajasekaran, S., and J. H. Reif. “Nested annealing: a provable improvement to simulated annealing.” Theoretical Computer Science 99, no. 1 (June 1, 1992): 157–76. https://doi.org/10.1016/0304-3975(92)90177-H.
    Full Text
  - Reif, J. H., and S. Sen. “Optimal randomized parallel algorithms for computational geometry.” Algorithmica 7, no. 1–6 (June 1, 1992): 91–117. https://doi.org/10.1007/BF01758753.
    Full Text
  - Armon, D., and J. Reif. “Space and time efficient implementations of parallel nested dissection.” 4th Annual Acm Symposium on Parallel Algorithms and Architectures, January 1, 1992, 344–52. https://doi.org/10.1145/140901.141912.
    Full Text
  - Han, Y., V. Pan, and J. Reif. “Efficient parallel algorithms for computing all pair shortest paths in directed graphs.” 4th Annual Acm Symposium on Parallel Algorithms and Architectures, January 1, 1992, 353–62. https://doi.org/10.1145/140901.141913.
    Full Text
  - Hightower, W. L., J. F. Prins, and J. H. Reif. “Implementations of randomized sorting on large parallel machines.” 4th Annual Acm Symposium on Parallel Algorithms and Architectures, January 1, 1992, 158–67. https://doi.org/10.1145/140901.140918.
    Full Text
  - Markas, T., and J. Reif. “Quad tree structures for image compression applications.” Information Processing and Management 28, no. 6 (January 1, 1992): 707–21. https://doi.org/10.1016/0306-4573(92)90063-6.
    Full Text
  - Reif, J. H., and S. R. Tate. “On threshold circuits and polynomial computation.” Siam Journal on Computing 21, no. 5 (January 1, 1992): 896–908. https://doi.org/10.1137/0221053.
    Full Text
  - Reif, J., and P. Spirakis. “Expected parallel time and sequential space complexity of graph and digraph problems.” Algorithmica (New York) 7, no. 5–6 (1992): 597–630.
  - Canny, J., A. Rege, and J. Reif. “An exact algorithm for kinodynamic planning in the plane.” Discrete &Amp; Computational Geometry 6, no. 1 (December 1, 1991): 461–84. https://doi.org/10.1007/BF02574702.
    Full Text
  - Pan, V., and J. Reif. “The parallel computation of minimum cost paths in graphs by stream contraction.” Information Processing Letters 40, no. 2 (October 25, 1991): 79–83. https://doi.org/10.1016/0020-0190(91)90013-8.
    Full Text
  - Miller, G. L., and J. H. Reif. “Parallel tree contraction. Part 2. Further applications.” Siam Journal on Computing 20, no. 6 (January 1, 1991): 1128–47. https://doi.org/10.1137/0220070.
    Full Text
  - Reif, J. H., J. D. Tygar, and A. Yoshida. “The computability and complexity of optical beam tracing.” Ieee Transactions on Industry Applications 27, no. 1 pt 1 (January 1, 1991): 106–14.
  - Storer, J. A., and J. H. Reif. “A parallel architecture for high-speed data compression.” Journal of Parallel and Distributed Computing 13, no. 2 (January 1, 1991): 222–27. https://doi.org/10.1016/0743-7315(91)90091-M.
    Full Text
  - Gazit, H., and J. H. Reif. “Randomized parallel algorithm for planar graph isomorphism.” Algorithms and Architectures, December 1, 1990, 210–19.
  - Reif, J. H., and S. Sen. “Randomized algorithms for binary search and load balancing on fixed connection networks with geometric applications.” Algorithms and Architectures, December 1, 1990, 327–37.
  - Storer, J. A., and J. H. Reif. “A parallel architecture for high speed data compression,” December 1, 1990, 238–43.
  - Reif, J. H., and S. A. Smolka. “Data flow analysis of distributed communicating processes.” International Journal of Parallel Programming 19, no. 1 (February 1, 1990): 1–30. https://doi.org/10.1007/BF01407862.
    Full Text
  - Blevins, D. W., E. W. Dams, R. A. Heaton, and J. H. Reif. “BLITZEN: A highly integrated massively parallel machine.” Journal of Parallel and Distributed Computing 8, no. 2 (January 1, 1990): 150–60. https://doi.org/10.1016/0743-7315(90)90089-8.
    Full Text
  - Canny, J., A. Rege, and J. Reif. “Exact algorithm for kinodynamic planning in the plane,” January 1, 1990, 271–80. https://doi.org/10.1145/98524.98584.
    Full Text
  - Pan, V., and J. Reif. “The bit-complexity of discrete solutions of partial differential equations: Compact multigrid.” Computers and Mathematics With Applications 20, no. 2 (January 1, 1990): 9–16. https://doi.org/10.1016/0898-1221(90)90235-C.
    Full Text
  - Reif, J. H., and S. R. Tate. “Optimal size integer division circuits.” Siam Journal on Computing 19, no. 5 (January 1, 1990): 912–24. https://doi.org/10.1137/0219064.
    Full Text
  - Pan, V., and J. Reif. “Fast and efficient solution of path algebra problems.” Journal of Computer and System Sciences 38, no. 3 (January 1, 1989): 494–510. https://doi.org/10.1016/0022-0000(89)90013-5.
    Full Text
  - Pan, V., and J. Reif. “Fast and efficient parallel solution of dense linear systems.” Computers and Mathematics With Applications 17, no. 11 (January 1, 1989): 1481–91. https://doi.org/10.1016/0898-1221(89)90081-3.
    Full Text
  - Rajasekaran, S., and J. H. Reif. “Optimal and sublogarithmic time randomized parallel sorting algorithms.” Siam Journal on Computing 18, no. 3 (January 1, 1989): 594–607. https://doi.org/10.1137/0218041.
    Full Text
  - Ramachandran, V., and J. Reif. “Optimal parallel algorithm for graph planarity.” Annual Symposium on Foundations of Computer Science (Proceedings), January 1, 1989, 282–87. https://doi.org/10.1109/sfcs.1989.63491.
    Full Text
  - Reif, J. H., and S. R. Tate. “Optimal size integer division circuits,” January 1, 1989, 264–73. https://doi.org/10.1145/73007.73032.
    Full Text
  - Reif, J. H., and S. Sen. “Polling: A new randomized sampling technique for computational geometry,” January 1, 1989, 394–404. https://doi.org/10.1145/73007.73045.
    Full Text
  - Reif, J. H., and S. Sen. “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) 401 LNCS (January 1, 1989): 1–8. https://doi.org/10.1007/3-540-51859-2_1.
    Full Text
  - Willard, D. E., and J. H. Reif. “Parallel processing can be harmful: The unusual behavior of interpolation search.” Information and Computation 81, no. 3 (January 1, 1989): 364–79. https://doi.org/10.1016/0890-5401(89)90038-2.
    Full Text
  - Blevins, D. W., E. W. Davis, R. A. Heaton, and J. H. Reif. “BLITZEN: A highly integrated massively parallel machine,” December 1, 1988, 399–406.
  - Reif, J. H., and S. A. Smolka. “The complexity of reachability in distributed communicating processes.” Acta Informatica 25, no. 4 (May 1, 1988): 333–54. https://doi.org/10.1007/BF02737107.
    Full Text
  - Reif, J. H., and S. A. Smolka. “The complexity of reachability in distributed communicating processes.” Acta Informatica 25, no. 3 (April 1, 1988): 333–54. https://doi.org/10.1007/BF00283332.
    Full Text
  - Gács, P., and J. Reif. “A simple three-dimensional real-time reliable cellular array.” Journal of Computer and System Sciences 36, no. 2 (January 1, 1988): 125–47. https://doi.org/10.1016/0022-0000(88)90024-4.
    Full Text
  - Klein, P. N., and J. H. Reif. “An efficient parallel algorithm for planarity.” Journal of Computer and System Sciences 37, no. 2 (January 1, 1988): 190–246. https://doi.org/10.1016/0022-0000(88)90006-2.
    Full Text
  - Klein, P. N., and J. H. Reif. “Parallel time O(log n) acceptance of deterministic CFLs on an exclusive-write P-RAM.” Siam Journal on Computing 17, no. 3 (January 1, 1988): 463–85. https://doi.org/10.1137/0217027.
    Full Text
  - Reif, J. H., and J. A. Storer. “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) 324 LNCS (January 1, 1988): 85–92. https://doi.org/10.1007/BFb0017133.
    Full Text
  - Reif, J. H., and J. D. Tygar. “Efficient parallel pseudorandom number generation.” Siam Journal on Computing 17, no. 2 (January 1, 1988): 404–11. https://doi.org/10.1137/0217024.
    Full Text
  - Canny, J., J. Reif, B. Donald, and P. Xavier. “On the complexity of kinodynamic planning.” Annual Symposium on Foundations of Computer Science (Proceedings), January 1, 1988, 306–16. https://doi.org/10.1109/sfcs.1988.21947.
    Full Text
  - Kasif, S., J. H. Reif, and D. D. Sherlekar. “FORMULA DISSECTION: A PARALLEL ALGORITHM FOR CONSTRAINT SATISFACTION.,” December 1, 1987, 51–58.
  - Opsahl, T., and J. Reif. “SOLVING VERY LARGE, SPARSE LINEAR SYSTEMS ON MESH-CONNECTED PARALLEL COMPUTERS.” Nasa Conference Publication, December 1, 1987, 249–56.
  - Reif, J. H., and S. Sen. “OPTIMAL RANDOMIZED PARALLEL ALGORITHMS FOR COMPUTATIONAL GEOMETRY.” Proceedings of the International Conference on Parallel Processing, December 1, 1987, 270–77.
  - Barakat, R., and J. Reif. “Polynomial convolution algorithm for matrix multiplication with application for optical computing.” Applied Optics 26, no. 14 (July 15, 1987): 2707–11. https://doi.org/10.1364/AO.26.002707.
    Full Text
  - Reif, J. H. “A topological approach to dynamic graph connectivity.” Information Processing Letters 25, no. 1 (April 20, 1987): 65–70. https://doi.org/10.1016/0020-0190(87)90095-0.
    Full Text
  - Pan, V., and J. H. Reif. “Response:solving linear equations.” Science (New York, N.Y.) 236, no. 4800 (April 1987): 462–63. https://doi.org/10.1126/science.236.4800.462.
    Full Text
  - Barakat, R., and J. Reif. “Lower bounds on the computational efficiency of optical computing systems.” Applied Optics 26, no. 6 (March 15, 1987): 1015–18. https://doi.org/10.1364/AO.26.001015.
    Full Text
  - Canny, J., and J. Reif. “NEW LOWER BOUND TECHNIQUES FOR ROBOT MOTION PLANNING PROBLEMS.” Annual Symposium on Foundations of Computer Science (Proceedings), January 1, 1987, 49–60. https://doi.org/10.1109/sfcs.1987.42.
    Full Text
  - Pan, V., and J. Reif. “SOME POLYNOMIAL AND TOEPLITZ MATRIX COMPUTATIONS.” Annual Symposium on Foundations of Computer Science (Proceedings), January 1, 1987, 173–84. https://doi.org/10.1109/sfcs.1987.52.
    Full Text
  - Rajasekaran, S., and J. H. Reif. “Randomized parallel computation.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 278 LNCS (January 1, 1987): 364–76. https://doi.org/10.1007/3-540-18740-5_79.
    Full Text
  - Reif, J. H. “ON THRESHOLD CIRCUITS AND POLYNOMIAL COMPUTATION.,” January 1, 1987, 118–23.
  - Reif, J. H., and J. A. Storer. “Minimizing Turns for Discrete Movement in the Interior of a Polygon.” Ieee Journal on Robotics and Automation 3, no. 3 (January 1, 1987): 182–93. https://doi.org/10.1109/JRA.1987.1087092.
    Full Text
  - Reif, J. H., and J. A. Storer. “MINIMIZING TURNS FOR DISCRETE MOVEMENT IN THE INTERIOR OF A POLYGON.” Ieee Journal of Robotics and Automation RA-3, no. 3 (1987): 182–93.
  - Reif, J. H., and L. G. Valiant. “A logarithmic time sort for linear size networks.” Journal of the Acm (Jacm) 34, no. 1 (January 1, 1987): 60–76. https://doi.org/10.1145/7531.7532.
    Full Text
  - Reif, J. H. “SURVEY ON ADVANCES IN THE THEORY OF COMPUTATIONAL ROBOTICS.,” December 1, 1986, 331–37.
  - Ben-Or, M., D. Kozen, and J. Reif. “The complexity of elementary algebra and geometry.” Journal of Computer and System Sciences 32, no. 2 (January 1, 1986): 251–64. https://doi.org/10.1016/0022-0000(86)90029-2.
    Full Text
  - Homer, S., and J. Reif. “Arithmetic theories for computational complexity problems.” Information and Control 69, no. 1–3 (January 1, 1986): 1–11. https://doi.org/10.1016/S0019-9958(86)80041-9.
    Full Text
  - Klein, P. N., and J. H. Reif. “EFFICIENT PARALLEL ALGORITHM FOR PLANARITY.” Annual Symposium on Foundations of Computer Science (Proceedings), January 1, 1986, 465–77. https://doi.org/10.1109/sfcs.1986.6.
    Full Text
  - Pan, V., and J. Reif. “Fast and efficient linear programming and linear least-squares computations.” Computers and Mathematics With Applications 12, no. 12 PART A (January 1, 1986): 1217–27. https://doi.org/10.1016/0898-1221(86)90006-4.
    Full Text
  - Pan, V., and J. Reif. “Parallel nested dissection for path algebra computations.” Operations Research Letters 5, no. 4 (January 1, 1986): 177–84. https://doi.org/10.1016/0167-6377(86)90074-X.
    Full Text
  - Pan, V., and J. Reif. “Efficient parallel linear programming.” Operations Research Letters 5, no. 3 (January 1, 1986): 127–35. https://doi.org/10.1016/0167-6377(86)90085-4.
    Full Text
  - Reif, J. H. “LOGARITHMIC DEPTH CIRCUITS FOR ALGEBRAIC FUNCTIONS.” Siam Journal on Computing 15, no. 1 (January 1, 1986): 231–42. https://doi.org/10.1137/0215017.
    Full Text
  - Reif, J. H., and H. R. Lewis. “Efficient symbolic analysis of programs.” Journal of Computer and System Sciences 32, no. 3 (January 1, 1986): 280–314. https://doi.org/10.1016/0022-0000(86)90031-0.
    Full Text
  - Reif, J. H., and D. E. Willard. “PARALLEL INTERPOLATION SEARCH.” Proceedings Annual Allerton Conference on Communication, Control, and Computing, December 1, 1985, 821–29.
  - Ravi Nair, W. C., A. Bruss, and J. Reif. “LINEAR TIME ALGORITHMS FOR OPTIMAL CMOS LAYOUT.,” December 1, 1985, 327–38.
  - Reif, J. H. “Depth-first search is inherently sequential.” Information Processing Letters 20, no. 5 (June 12, 1985): 229–34. https://doi.org/10.1016/0020-0190(85)90024-9.
    Full Text
  - Gacs, P., and J. H. Reif. “SIMPLE THREE-DIMENSIONAL REAL-TIME RELIABLE CELLULAR ARRAY.” Conference Proceedings of the Annual Acm Symposium on Theory of Computing, January 1, 1985, 388–95.
  - Miller, G. L., and J. H. Reif. “PARALLEL TREE CONTRACTION AND ITS APPLICATION.” Annual Symposium on Foundations of Computer Science (Proceedings), January 1, 1985, 478–89. https://doi.org/10.1109/sfcs.1985.43.
    Full Text
  - Pan, V., and J. Reif. “EFFICIENT PARALLEL SOLUTION OF LINEAR SYSTEMS.” Conference Proceedings of the Annual Acm Symposium on Theory of Computing, January 1, 1985, 143–52. https://doi.org/10.1145/22145.22161.
    Full Text
  - Reif, J. H. “OPTIMAL PARALLEL ALGORITHM FOR INTEGER SORTING.” Annual Symposium on Foundations of Computer Science (Proceedings), January 1, 1985, 496–504. https://doi.org/10.1109/sfcs.1985.9.
    Full Text
  - Reif, J. H., and P. G. Spirakis. “k-connectivity in random undirected graphs.” Discrete Mathematics 54, no. 2 (January 1, 1985): 181–91. https://doi.org/10.1016/0012-365X(85)90079-2.
    Full Text
  - Reif, J. H., and P. G. Spirakis. “UNBOUNDED SPEED VARIABILITY IN DISTRIBUTED COMMUNICATIONS SYSTEMS.” Siam Journal on Computing 14, no. 1 (January 1, 1985): 75–92. https://doi.org/10.1137/0214005.
    Full Text
  - Reif, J., and A. P. Sistla. “A multiprocess network logic with temporal and spatial modalities.” Journal of Computer and System Sciences 30, no. 1 (January 1, 1985): 41–53. https://doi.org/10.1016/0022-0000(85)90003-0.
    Full Text
  - Reif, J., and M. Sharir. “MOTION PLANNING IN THE PRESENCE OF MOVING OBSTACLES.” Annual Symposium on Foundations of Computer Science (Proceedings), January 1, 1985, 144–54. https://doi.org/10.1109/sfcs.1985.36.
    Full Text
  - Reif, J. “PROBABILISTIC PARALLEL PREFIX COMPUTATION.” Proceedings of the International Conference on Parallel Processing, December 1, 1984, 291–98.
  - Reif, J. H., and P. G. Spirakis. “Real-Time Synchronization of Interprocess Communications.” Acm Transactions on Programming Languages and Systems (Toplas) 6, no. 2 (April 1, 1984): 215–38. https://doi.org/10.1145/2993.357244.
    Full Text
  - Reif, J. H. “Symmetric Complementation.” Journal of the Acm (Jacm) 31, no. 2 (March 30, 1984): 401–21. https://doi.org/10.1145/62.322436.
    Full Text
  - Kao, G., C. N. Nikolaou, and J. Reif. “ASSIGNING PROCESSES TO PROCESSORS: A FAULT-TOLERANT APPROACH.” Digest of Papers Ftcs (Fault Tolerant Computing Symposium), January 1, 1984, 306–9.
  - Reif, J. H. “The complexity of two-player games of incomplete information.” Journal of Computer and System Sciences 29, no. 2 (January 1, 1984): 274–301. https://doi.org/10.1016/0022-0000(84)90034-5.
    Full Text
  - Reif, J. H. “ON SYNCHRONOUS PARALLEL COMPUTATIONS WITH INDEPENDENT PROBABILISTIC CHOICE.” Siam Journal on Computing 13, no. 1 (January 1, 1984): 46–56. https://doi.org/10.1137/0213004.
    Full Text
  - Reif, J. H., and L. G. Valiant. “LOGARITHMIC TIME SORT FOR LINEAR SIZE NETWORKS.” Conference Proceedings of the Annual Acm Symposium on Theory of Computing, December 1, 1983, 10–16.
  - Reif, J., and A. P. Sistla. “MULTIPROCESS NETWORK LOGIC WITH TEMPORAL AND SPATIAL MODALITIES.” Lecture Notes in Computer Science, December 1, 1983, 628–39.
  - Halpern, J. Y., and J. H. Reif. “The propositional dynamic logic of deterministic, well-structured programs.” Theoretical Computer Science 27, no. 1–2 (January 1, 1983): 127–65. https://doi.org/10.1016/0304-3975(83)90097-X.
    Full Text
  - Reif, J. “LOGARITHMIC DEPTH CIRCUITS FOR ALGEBRAIC FUNCTIONS.” Annual Symposium on Foundations of Computer Science (Proceedings), January 1, 1983, 138–45. https://doi.org/10.1109/sfcs.1983.29.
    Full Text
  - Reif, J., and P. Spirakis. “REAL TIME RESOURCE ALLOCATION IN DISTRIBUTED SYSTEMS.,” December 1, 1982, 84–94.
  - Reif, J. “PARALLEL TIME O(log N) ACCEPTANCE OF DETERMINISTIC CFLs.” Annual Symposium on Foundations of Computer Science Proceedings, January 1, 1982, 290–96. https://doi.org/10.1109/sfcs.1982.84.
    Full Text
  - Halpern, J. Y., and J. H. Reif. “PROPOSITIONAL DYNAMIC LOGIC OF DETERMINISTIC, WELL-STRUCTURED PROGRAM.” Annual Symposium on Foundations of Computer Science Proceedings, December 1, 1981, 322–34.
  - Reif, J. H. “Logics for probabilistic programming.” Proceedings of the Annual Acm Symposium on Theory of Computing 1980-April (April 28, 1980): 8–13. https://doi.org/10.1145/800141.804647.
    Full Text
  - Reif, J. H., and P. G. Spirakis. “Random matroids.” Proceedings of the Annual Acm Symposium on Theory of Computing 1980-April (April 28, 1980): 385–97. https://doi.org/10.1145/800141.804688.
    Full Text
  - Reif, J. H., and G. L. Peterson. “A dynamic logic of multiprocessing with incomplete information.” Conference Record of the Annual Acm Symposium on Principles of Programming Languages, January 28, 1980, 193–202. https://doi.org/10.1145/567446.567465.
    Full Text
  - Peterson, G. L., and J. H. Reif. “MULTIPLE-PERSON ALTERNATION.” Annual Symposium on Foundations of Computer Science Proceedings, January 1, 1979, 348–63.
  - Reif, J. H. “COMPLEXITY OF THE MOVER'S PROBLEM AND GENERALIZATIONS.” Annual Symposium on Foundations of Computer Science Proceedings, January 1, 1979, 421–27.
  - Reif, J. H. “Data flow analysis of communicating processes - Extended abstract.” Conference Record of the Annual Acm Symposium on Principles of Programming Languages, January 1, 1979, 257–68. https://doi.org/10.1145/567752.567777.
    Full Text
  - Reif, J., and R. Barakat. “Numerical solution of the Fokker-Planck equation via chebyschev polynomial approximations with reference to first passage time probability density functions.” Journal of Computational Physics 23, no. 4 (January 1, 1977): 425–45. https://doi.org/10.1016/0021-9991(77)90072-9.
    Full Text
- Book Sections
  - Bui, H., H. Chandran, S. Garg, N. Gopalkrishnan, R. Mokhtar, J. Reif, and T. Song. “DNA computing.” In Computing Handbook: Two-Volume Set, 1–42, 2022. https://doi.org/10.1201/b16812-28.
    Full Text
  - Bui, H., H. Chandran, S. Garg, N. Gopalkrishnan, R. Mokhtar, J. Reif, and T. Song. “DNA computing.” In Computing Handbook, Third Edition: Computer Science and Software Engineering, 25-1-25–42, 2014. https://doi.org/10.1201/b16812.
    Full Text
  - Chandran, H., N. Gopalkrishnan, and J. Reif. “DNA nanorobotics.” In Nanorobotics: Current Approaches and Techniques, 355–82, 2013. https://doi.org/10.1007/978-1-4614-2119-1_18.
    Full Text
  - Reif, J. H. “Mechanical computing: The computational complexity of physical devices.” In Computational Complexity: Theory, Techniques, and Applications, 9781461418009:1821–36, 2012. https://doi.org/10.1007/978-1-4614-1800-9_118.
    Full Text
  - Reif, J. H., H. Chandran, N. Gopalkrishnan, and T. LaBean. “Self-Assembled DNA Nanostructures and DNA Devices.” In Nanofabrication Handbook, 299–328, 2012. https://doi.org/10.1201/b11626.
    Full Text
  - Reif, J. H., and T. H. LaBean. “Engineering natural computation by autonomous DNA-based biomolecular devices.” In Handbook of Natural Computing, 3–4:1320–53, 2012. https://doi.org/10.1007/978-3-540-92910-9_39.
    Full Text
- Conference Papers
  - Shah, S., and J. Reif. “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), 11145 LNCS:71–86, 2018. https://doi.org/10.1007/978-3-030-00030-1_5.
    Full Text
  - Sahu, S., P. Yin, and J. H. Reif. “A self-assembly model of time-dependent glue strength.” In Natural Computing Series, 185–204, 2009. https://doi.org/10.1007/978-3-540-88869-7_11.
    Full Text
  - Reif, J., and S. Slee. “Optimal kinodynamic motion planning for 2D reconfiguration of self-reconfigurable robots.” In Robotics: Science and Systems, 3:153–60, 2008. https://doi.org/10.15607/rss.2007.iii.020.
    Full Text
  - Sun, Zheng, and John H. Reif. “On robotic optimal path planning in polygonal regions with pseudo-Euclidean metrics.” In Ieee Transactions on Systems, Man, and Cybernetics. Part B, Cybernetics : A Publication of the Ieee Systems, Man, and Cybernetics Society, 37:925–36, 2007. https://doi.org/10.1109/tsmcb.2007.896021.
    Full Text
  - Reif, J. H., T. H. LaBean, M. Pirrung, V. S. Rana, B. Guo, C. Kingsford, and G. S. Wickham. “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), 2340:231–47, 2002. https://doi.org/10.1007/3-540-48017-x_22.
    Full Text
  - Reif, J. H., T. H. LaBean, and N. C. Seeman. “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), 2054:173–98, 2001. https://doi.org/10.1007/3-540-44992-2_12.
    Full Text
  - Reif, J. H., and T. H. LaBean. “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), 2054:145–72, 2001. https://doi.org/10.1007/3-540-44992-2_11.
    Full Text
  - Reif, J., and Z. Sun. “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), 2125:450–61, 2001. https://doi.org/10.1007/3-540-44634-6_41.
    Full Text
  - Reif, J. H. “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), 1530 LNCS:102–26, 1998. https://doi.org/10.1007/978-3-540-49382-2_10.
    Full Text
  - Li, Z., J. H. Reif, and K. S. Gupta. “Synthesizing efficient out-of-core programs for block recursive algorithms using block-cyclic data distributions.” In Proceedings of the International Conference on Parallel Processing, 2:II142–49, 1996. https://doi.org/10.1109/ICPP.1996.537393.
    Full Text
  - Nyland, L., J. Prins, A. Goldberg, P. Mills, J. Reif, and R. Wagner. “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), 1123:145–50, 1996. https://doi.org/10.1007/3-540-61626-8_18.
    Full Text
  - Li, Z., P. H. Mills, and J. H. Reif. “Models and resource metrics for parallel and distributed computation.” In Proceedings of the Annual Hawaii International Conference on System Sciences, 2:51–60, 1995. https://doi.org/10.1109/HICSS.1995.375477.
    Full Text
  - Nikoletseas, S., J. Reif, P. Spirakis, and M. Yung. “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), 944:160–70, 1995. https://doi.org/10.1007/3-540-60084-1_71.
    Full Text
  - Reif, J. H. “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, 278–89, 1994. https://doi.org/10.1145/181014.181408.
    Full Text
  - Reif, J. H., and S. R. Tate. “Dynamic parallel tree contraction (extended abstract).” In Proceedings of the 6th Annual Acm Symposium on Parallel Algorithms and Architectures, Spaa 1994, 114–21, 1994. https://doi.org/10.1145/181014.181050.
    Full Text
  - Reif, J. H., and A. Yoshida. “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, 37–44, 1994. https://doi.org/10.1109/MPPOI.1994.336640.
    Full Text
  - Neff, C. A., and J. H. Reif. “An O(n^1+ε log B) algorithm for the complex roots problem.” In Proceedings Annual Ieee Symposium on Foundations of Computer Science, Focs, 540–47, 1994. https://doi.org/10.1109/SFCS.1994.365737.
    Full Text
  - Cheriyan, J., and J. H. Reif. “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, 50–56, 1993. https://doi.org/10.1145/165231.165238.
    Full Text
  - Armon, D., and J. Reif. “A dynamic separator algorithm.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 709 LNCS:108–18, 1993. https://doi.org/10.1007/3-540-57155-8_240.
    Full Text
  - Markas, T., and J. Reif. “Multispectral image compression algorithms.” In Data Compression Conference Proceedings, 391–400, 1993. https://doi.org/10.1109/DCC.1993.253110.
    Full Text
  - Reif, J. H., and S. R. Tate. “The complexity of N-body simulation.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 700 LNCS:162–76, 1993. https://doi.org/10.1007/3-540-56939-1_70.
    Full Text
  - Pan, V. Y., J. H. Reif, and S. R. Tate. “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-October:703–13, 1992. https://doi.org/10.1109/SFCS.1992.267780.
    Full Text
  - Reif, J. H., and A. Yoshida. “Optical techniques for image compression.” In Data Compression Conference Proceedings, 1992-March:32–41, 1992. https://doi.org/10.1109/DCC.1992.227478.
    Full Text
  - Markas, T., and J. Reif. “Image compression methods with distortion controlled capabilities.” In Data Compression Conference Proceedings, 1991-April:93–102, 1991. https://doi.org/10.1109/DCC.1991.213376.
    Full Text
  - Mills, P. H., L. S. Nyland, J. F. Prins, J. H. Reif, and R. A. Wagner. “Prototyping parallel and distributed programs in Proteus.” In Proceedings of the 3rd Ieee Symposium on Parallel and Distributed Processing 1991, 26–34, 1991. https://doi.org/10.1109/SPDP.1991.218300.
    Full Text
  - Pan, V., and J. Reif. “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), 443 LNCS:612–25, 1990. https://doi.org/10.1007/bfb0032062.
    Full Text
  - Reif, J., and A. Tyagi. “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), 472 LNCS:149–60, 1990. https://doi.org/10.1007/3-540-53487-3_41.
    Full Text
  - Tyagi, A., and J. Reif. “Energy complexity of optical computations.” In Proceedings of the 2nd Ieee Symposium on Parallel and Distributed Processing 1990, Spdp 1990, 14–21, 1990. https://doi.org/10.1109/SPDP.1990.143499.
    Full Text
  - Paturi, R., S. Rajasekaran, and J. Reif. “The light bulb problem.” In Proceedings of the 2nd Annual Workshop on Computational Learning Theory, Colt 1989, 261–68, 1989. https://doi.org/10.1016/b978-0-08-094829-4.50021-0.
    Full Text
  - Maniloff, E. S., K. M. Johnson, and J. Reif. “Holographic routing network for parallel processing machines.” In Proceedings of Spie the International Society for Optical Engineering, 1136:283–89, 1989. https://doi.org/10.1117/12.961699.
    Full Text
  - Reif, J. H., and S. Sen. “An efficient output-sensitive hidden-surface removal algorithm and its parallelization.” In Proceedings of the 4th Annual Symposium on Computational Geometry, Scg 1988, 193–200, 1988. https://doi.org/10.1145/73393.73413.
    Full Text
  - Pan, V., and J. Reif. “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), 227 LNCS:283–95, 1986. https://doi.org/10.1007/3-540-16766-8_26.
    Full Text
  - Pan, V., and J. Reif. “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), 241 LNCS:470–87, 1986. https://doi.org/10.1007/3-540-17179-7_29.
    Full Text
  - Reif, J. H., and J. D. Tygar. “Efficient Parallel Pseudo-Random Number Generation.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 218 LNCS:433–46, 1986. https://doi.org/10.1007/3-540-39799-X_33.
    Full Text
  - 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), 199 LNCS:341–50, 1985. https://doi.org/10.1007/BFb0028818.
    Full Text
  - Ben-Or, M., D. Kozen, and J. Reíf. “The complexity of elementary algebra and geometry (preliminary version).” In Proceedings of the Annual Acm Symposium on Theory of Computing, Part F130362:457–64, 1984. https://doi.org/10.1145/800057.808712.
    Full Text
  - Reif, J. H., and W. L. Scherlis. “Deriving efficient graph algorithms (summary).” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 164 LNCS:421–41, 1984. https://doi.org/10.1007/3-540-12896-4_378.
    Full Text
  - Reif, J., and A. P. Sistla. “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), 154 LNCS:629–39, 1983. https://doi.org/10.1007/BFb0036943.
    Full Text
  - Reif, J., and P. Spirakis. “Real time resource allocation in distributed systems.” In Proceedings of the Annual Acm Symposium on Principles of Distributed Computing, 84–94, 1982. https://doi.org/10.1145/800220.806685.
    Full Text
  - Reif, J. H. “Symmetric complementation.” In Proceedings of the Annual Acm Symposium on Theory of Computing, 201–14, 1982. https://doi.org/10.1145/800070.802193.
    Full Text
  - Reif, J., and P. Spirakis. “Unbounded speed variability in distributed communication systems.” In Conference Record of the Annual Acm Symposium on Principles of Programming Languages, 46–56, 1982. https://doi.org/10.1145/582153.582159.
    Full Text
  - Reif, J. H. “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), 140 LNCS:442–50, 1982. https://doi.org/10.1007/BFb0012790.
    Full Text
  - Reif, J., and P. Spirakis. “Distributed algorithms for synchronizing interprocess communication within real time.” In Proceedings of the Annual Acm Symposium on Theory of Computing, 133–45, 1981. https://doi.org/10.1145/800076.802467.
    Full Text
  - Reif, J. H. “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), 115 LNCS:56–67, 1981. https://doi.org/10.1007/3-540-10843-2_5.
    Full Text
  - Filotti, I. S., G. L. Miller, and J. Reif. “On determining the genus of a graph in 0(V⁰(^g)) steps.” In Proceedings of the Annual Acm Symposium on Theory of Computing, 27–37, 1979. https://doi.org/10.1145/800135.804395.
    Full Text
  - Reif, J. H. “Universal games of incomplete information.” In Proceedings of the Annual Acm Symposium on Theory of Computing, 288–308, 1979. https://doi.org/10.1145/800135.804422.
    Full Text
  - Peterson, G. L., and J. H. Reif. “Multiple-person alternation.” In Proceedings Annual Ieee Symposium on Foundations of Computer Science, Focs, 348–63, 1979. https://doi.org/10.1109/SFCS.1979.25.
    Full Text
  - Reif, J. H. “Complexity of the mover's problem and generalizations.” In Proceedings Annual Ieee Symposium on Foundations of Computer Science, Focs, 421–27, 1979. https://doi.org/10.1109/SFCS.1979.10.
    Full Text
  - Reif, J. H. “Symbolic program analysis in almost linear time.” In Conference Record of the Annual Acm Symposium on Principles of Programming Languages, 76–83, 1978. https://doi.org/10.1145/512760.512769.
    Full Text
  - Reif, J. H., and H. R. Lewis. “Symbolic evaluation and the global value graph.” In Conference Record of the Annual Acm Symposium on Principles of Programming Languages, 104–18, 1977. https://doi.org/10.1145/512950.512961.
    Full Text
- Datasets
  - Reif, John, Daniel Fu, Dewight Williams, Hao Yan, Fei Zhang, and Abhay Prasad. “Data from: Automated design of 3D DNA origami with non-rasterized 2D curvature,” November 22, 2022. https://doi.org/10.7924/r4d223179.
    Data Access
Teaching & Mentoring
Recent Courses
Scholarly, Clinical, & Service Activities
Presentations & Appearances
Service to the Profession

Some information on this profile has been compiled automatically from Duke databases and external sources. (Our About page explains how this works.) If you see a problem with the information, please write to Scholars@Duke and let us know. We will reply promptly.

Education, Training, & Certifications

In the News

Awards & Honors

Subject Headings

Selected Grants

External Relationships

Selected Publications

Books

Academic Articles

Book Sections

Conference Papers

Datasets

Recent Courses

Presentations & Appearances

Service to the Profession