Fitzpatrick Institute for Photonics Fitzpatrick Institute for Photonics
Pratt School of Engineering
Duke University
 HOME > pratt > FIP    Search Help Login 

Publications of John H. Reif    :chronological  alphabetical  combined  bibtex listing:

search www.cs.duke.edu.

Journal articles or Book chapters PUBLISHED

  1. Nagipogu, RT; Reif, JH, Neural CRNs: A Natural Implementation of Learning in Chemical Reaction Networks., ACS synthetic biology, vol. 14 no. 10 (October, 2025), pp. 3899-3912 [doi]  [abs]
  2. Fu, D; Reif, J, A biomimetic branching signal-passing tile assembly model with dynamic growth and disassembly., Journal of the Royal Society, Interface, vol. 21 no. 217 (August, 2024), pp. 20230755 [doi]  [abs]
  3. Nagipogu, RT; Reif, JH, Leak-resilient enzyme-free nucleic acid dynamical systems through shadow cancellation, Journal of the Royal Society Interface, vol. 21 no. 215 (June, 2024) [doi]  [abs]
  4. Nagipogu, RT; Fu, D; Reif, JH, A survey on molecular-scale learning systems with relevance to DNA computing., Nanoscale, vol. 15 no. 17 (May, 2023), pp. 7676-7694 [doi]  [abs]
  5. Fu, D; Pradeep Narayanan, R; Prasad, A; Zhang, F; Williams, D; Schreck, JS; Yan, H; Reif, J, Automated design of 3D DNA origami with non-rasterized 2D curvature., Science advances, vol. 8 no. 51 (December, 2022), pp. eade4455 [doi]  [abs]
  6. Song, X; Coulter, FJ; Yang, M; Smith, JL; Tafesse, FG; Messer, WB; Reif, JH, A lyophilized colorimetric RT-LAMP test kit for rapid, low-cost, at-home molecular testing of SARS-CoV-2 and other pathogens., Scientific reports, vol. 12 no. 1 (April, 2022), pp. 7043 [doi]  [abs]
  7. Song, X; Shah, S; Reif, J, Multidimensional data organization and random access in large-scale DNA storage systems, Theoretical Computer Science, vol. 894 (November, 2021), pp. 190-202 [doi]  [abs]
  8. Fu, D; Reif, J, 3d DNA nanostructures: The nanoscale architect, Applied Sciences Switzerland, vol. 11 no. 6 (March, 2021) [doi]  [abs]
  9. 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, vol. 5 no. 6 (June, 2020) [doi]  [abs]
  10. Shah, S; Wee, J; Song, T; Ceze, L; Strauss, K; Chen, Y-J; Reif, J, Using Strand Displacing Polymerase To Program Chemical Reaction Networks., Journal of the American Chemical Society, vol. 142 no. 21 (May, 2020), pp. 9587-9593 [doi]  [abs]
  11. Song, T; Eshra, A; Shah, S; Bui, H; Fu, D; Yang, M; Mokhtar, R; Reif, J, Fast and compact DNA logic circuits based on single-stranded gates using strand-displacing polymerase., Nature nanotechnology, vol. 14 no. 11 (November, 2019), pp. 1075-1081 [doi]  [abs]
  12. Song, T; Shah, S; Bui, H; Garg, S; Eshra, A; Fu, D; Yang, M; Mokhtar, R; Reif, J, Programming DNA-Based Biomolecular Reaction Networks on Cancer Cell Membranes., Journal of the American Chemical Society, vol. 141 no. 42 (October, 2019), pp. 16539-16543 [doi]  [abs]
  13. Song, X; Reif, J, Nucleic Acid Databases and Molecular-Scale Computing., ACS nano, vol. 13 no. 6 (June, 2019), pp. 6256-6268 [doi]  [abs]
  14. Shah, S; Dubey, AK; Reif, J, Improved Optical Multiplexing with Temporal DNA Barcodes., ACS synthetic biology, vol. 8 no. 5 (May, 2019), pp. 1100-1111 [doi]  [abs]
  15. Shah, S; Dubey, AK; Reif, J, Programming Temporal DNA Barcodes for Single-Molecule Fingerprinting., Nano letters, vol. 19 no. 4 (April, 2019), pp. 2668-2673 [doi]  [abs]
  16. Eshra, A; Shah, S; Song, T; Reif, J, Renewable DNA hairpin-based logic circuits, IEEE Transactions on Nanotechnology, vol. 18 (January, 2019), pp. 252-259 [doi]  [abs]
  17. Song, T; Gopalkrishnan, N; Eshra, A; Garg, S; Mokhtar, R; Bui, H; Chandran, H; Reif, J, Improving the Performance of DNA Strand Displacement Circuits by Shadow Cancellation., ACS nano, vol. 12 no. 11 (November, 2018), pp. 11689-11697 [doi]  [abs]
  18. Garg, S; Shah, S; Bui, H; Song, T; Mokhtar, R; Reif, J, Renewable Time-Responsive DNA Circuits., Small (Weinheim an der Bergstrasse, Germany) (July, 2018), pp. e1801470 [doi]  [abs]
  19. Bui, H; Shah, S; Mokhtar, R; Song, T; Garg, S; Reif, J, Localized DNA Hybridization Chain Reactions on DNA Origami., ACS nano, vol. 12 no. 2 (February, 2018), pp. 1146-1155 [doi]  [abs]
  20. Fu, D; Shah, S; Song, T; Reif, J, DNA-Based Analog Computing., Methods in molecular biology (Clifton, N.J.), vol. 1772 (January, 2018), pp. 411-417 [doi]  [abs]
  21. 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, vol. 7 no. 1 (January, 2018), pp. 46-53 [doi]  [abs]
  22. Reif, JH, DNA robots sort as they walk., Science (New York, N.Y.), vol. 357 no. 6356 (September, 2017), pp. 1095-1096 [doi]
  23. Song, X; Eshra, A; Dwyer, C; Reif, J, Renewable DNA seesaw logic circuits enabled by photoregulation of toehold-mediated strand displacement, Rsc Advances, vol. 7 no. 45 (January, 2017), pp. 28130-28144, Royal Society of Chemistry (RSC) [doi]  [abs]
  24. Bui, H; Miao, V; Garg, S; Mokhtar, R; Song, T; Reif, J, Design and Analysis of Localized DNA Hybridization Chain Reactions, Small, vol. 13 no. 12 (2017), pp. 1602983-n/a [doi]  [abs]
  25. 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, vol. 19 no. 1 (2017), pp. 015006-015006, IOP Publishing [doi]  [abs]
  26. Majumder, U; Garg, S; LaBean, TH; Reif, JH, Activatable tiles for compact robust programmable molecular assembly and other applications, Natural Computing, vol. 15 no. 4 (December, 2016), pp. 611-634, Springer Nature [doi]  [abs]
  27. Song, T; Garg, S; Mokhtar, R; Bui, H; Reif, J, Analog Computation by DNA Strand Displacement Circuits., ACS synthetic biology, vol. 5 no. 8 (August, 2016), pp. 898-912 [doi]  [abs]
  28. Tyagi, A; Reif, JH, Energy complexity of optical computations, International Journal of Unconventional Computing, vol. 12 no. 5-6 (January, 2016), pp. 393-412  [abs]
  29. Alhalabi, W; Reif, J; Elsheikh, Z; Felimban, H; Fallata, M; Thabit, K; Abusorrah, A, The co-learning in the design, simulation and optimization of a solar concentrating system, Computers in Human Behavior, vol. 51 (October, 2015), pp. 857-866, Elsevier BV, ISSN 0747-5632 [doi]  [abs]
  30. Dalchau, N; Chandran, H; Gopalkrishnan, N; Phillips, A; Reif, J, Probabilistic Analysis of Localized DNA Hybridization Circuits., ACS synthetic biology, vol. 4 no. 8 (August, 2015), pp. 898-913, ISSN 2161-5063 [doi]  [abs]
  31. Reif, JH; Alhalabi, W, Solar-thermal powered desalination: Its significant challenges and potential, Renewable and Sustainable Energy Reviews, vol. 48 (August, 2015), pp. 152-165, Elsevier BV, ISSN 1364-0321 [doi]  [abs]
  32. Garg, S; Chandran, H; Gopalkrishnan, N; LaBean, TH; Reif, J, Directed enzymatic activation of 1-D DNA tiles., ACS nano, vol. 9 no. 2 (February, 2015), pp. 1072-1079, ISSN 1936-0851 [doi]  [abs]
  33. Chandran, H; Gopalkrishnan, N; Yurke, B; Reif, J, Meta-DNA: A DNA-based approach to synthetic biology (March, 2014), pp. 171-200, Springer Netherlands [doi]  [abs]
  34. Chandran, H; Gopalkrishnan, N; Reif, J, Tile Complexity of Approximate Squares, Algorithmica, vol. 66 no. 1 (May, 2013), pp. 1-17, Springer Nature, ISSN 0178-4617 [doi]  [abs]
  35. 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, vol. 8 no. 2 (February, 2013), pp. 221-227 [22965937], [doi]  [abs]
  36. Chandran, H; Garg, S; Gopalkrishnan, N; Reif, JH, Biomolecular Computing Systems (December, 2012), pp. 199-223, Wiley-VCH Verlag GmbH & Co. KGaA [doi]
  37. Reif, JH, Local parallel biomolecular computation, International Journal of Unconventional Computing, vol. 8 no. 5-6 (December, 2012), pp. 459-507, ISSN 1548-7199  [abs]
  38. Chandran, H; Gopalkrishnan, N; Reif, J, Tile complexity of linear assemblies, SIAM Journal on Computing, vol. 41 no. 4 (September, 2012), pp. 1051-1073, Society for Industrial & Applied Mathematics (SIAM), ISSN 0097-5397 [doi]  [abs]
  39. John H. Reif and Thomas H. LaBean, Engineering Natural Computation by Autonomous DNA-Based Biomolecular Devices, in Invited Chapter, Handbook of Natural Computing, edited by Grzegor Rozenberg, Thomas Bäck, Joost Kok, Springer-Verlag, New York, ISBN: 978-3-540-92910-9, edited by Grzegor Rozenberg, Thomas Bäck, Joost Kok (August, 2012), Springer-Verlag, New York, ISBN-10: 3540929096, ISBN-13: 978-3540929093
  40. Chandran, H; Gopalkrishnan, N; Yurke, B; Reif, J, Meta-DNA: synthetic biology via DNA nanostructures and hybridization reactions., Journal of the Royal Society, Interface, vol. 9 no. 72 (July, 2012), pp. 1637-1653, ISSN 1742-5689 [pdf], [doi]  [abs]
  41. Harish Chandrann Nikhil Gopalkrishnan and John Reif, Tile Complexity of Approximate Squares and Lower Bounds for Arbitrary Shapes, Algorithmica (February, 2012) [pdf], [doi]
  42. J.H. Reif, Perspectives: Biochemistry: Scaling Up DNA Computation, Science, vol. 332 (June 3, 2011), pp. 1156-1157 [doi]
  43. Harish Chandran, Nikhil Gopalkrishnan, Sudhanshu Garg, and John Reif, Biomolecular Computing Systems - From Logic Systems to Smart Sensors and Actuators, Invited Chapter 13, in Molecular and Biomolecular Information Processing, edited by Evgeny Katz (2012), Wiley-VCH [pdf]
  44. John Reif, Harish Chandran, Nikhil Gopalkrishnan, and Thomas LaBean, Self-assembled DNA Nanostructures and DNA Devices, Invited Chapter 14, in Nanofabrication Handbook, edited by Edited by Stefano Cabrini and Kawata (2012), pp. 299-328, CRC Press, Taylor and Francis Group, New York, NY, ISBN13:9781420090529, ISBN10: 1420090526 [pdf]
  45. Chandran, H; Gopalkrishnan, N; Phillips, A; Reif, J, Localized hybridization circuits, in International Conference on DNA Computing and Molecular Programming (DNA17), California Institute of Technology, Pasadina, California, Lecture Notes for Computer Science (LNCS), edited by Luca Cardelli and William Shih, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, vol. 6937 LNCS (September, 2011), pp. 64-83, Springer Berlin Heidelberg, NYC, NY, ISSN 0302-9743 [pdf], [doi]  [abs]
  46. Reif, JH, Biochemistry. Scaling up DNA computation., Science (New York, N.Y.), vol. 332 no. 6034 (June, 2011), pp. 1156-1157 [21636761], [doi]
  47. Reif, JH, Keynote: DNA-based molecular devices, 2011 IEEE 1st International Conference on Computational Advances in Bio and Medical Sciences Iccabs 2011 (April, 2011), pp. 3, IEEE [doi]  [abs]
  48. Reif, JH; Sahu, S; Yin, P, Complexity of graph self-assembly in accretive systems and self-destructible systems, Theoretical Computer Science, vol. 412 no. 17 (April, 2011), pp. 1592-1605, Elsevier BV, ISSN 0304-3975 [pdf], [doi]  [abs]
  49. Reif, J; Slee, S, Asymptotically optimal kinodynamic motion planning for a class of modular self-reconfigurable robots, International Journal of Computational Geometry and Applications, vol. 21 no. 2 (April, 2011), pp. 131-155, World Scientific Pub Co Pte Lt, ISSN 0218-1959 [doi]  [abs]
  50. Majumder, U; Reif, JH, Design of a biomolecular device that executes process algebra, Natural Computing, vol. 10 no. 1 (March, 2011), pp. 447-466, Springer Nature, ISSN 1567-7818 [pdf], [doi]  [abs]
  51. 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, vol. 133 no. 11 (March, 2011), pp. 3843-3845 [21355587], [doi]  [abs]
  52. 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, vol. 6518 LNCS (February, 2011), pp. 59-70, Springer Berlin Heidelberg, ISSN 0302-9743 [doi]  [abs]
  53. John H. Reif and Sam Slee, Asymptotically Optimal Kinodynamic Motion Planning for a Class of Lattice-Style Modular Self-Reconfigurable Robots, Journal of Computational Geometry & Applications (IJCGA), vol. 21 no. 2 (2011), pp. 131-155 [pdf], [doi]
  54. Slee, S; Reif, J, Robomotion: Scalable, physically stable locomotion for self-reconfigurable robots, Springer Tracts in Advanced Robotics, vol. 68 no. STAR (December, 2010), pp. 121-137, Springer Berlin Heidelberg, ISSN 1610-7438 [doi]  [abs]
  55. Sahu, S; Reif, JH, Capabilities and limits of compact error resilience methods for algorithmic self-assembly, Algorithmica New York, vol. 56 no. 4 (April, 2010), pp. 480-504, Springer Nature, ISSN 0178-4617 [doi]  [abs]
  56. Reif, JH; Majumder, U, Isothermal reactivating Whiplash PCR for locally programmable molecular computation, Natural Computing, vol. 9 no. 1 (January, 2010), pp. 183-206, Springer Nature, ISSN 1567-7818 [pdf], [doi]  [abs]
  57. 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, vol. 5877 LNCS (December, 2009), pp. 97-105, Springer Berlin Heidelberg, ISSN 0302-9743 [doi]  [abs]
  58. 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 (December, 2009)
  59. LaBean, TH; Shetty, G; Yan, H; Schultes, EA; Chandran, H; Reif, JH, Target DNA detection by strand displacement and deoxyribozymogen amplification, in FNANO 2009, Snowbird, Utah, Sciencetechnica, pp. 60-61, Extended Abstracts for 6th Annual Conference on Foundations of Nanoscience Self Assembled Architectures and Devices Fnano 2009 (December, 2009), pp. 82-83
  60. 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 (December, 2009), pp. 60-61
  61. 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, vol. 5347 LNCS (November, 2009), pp. 41-56, Springer Berlin Heidelberg [doi]  [abs]
  62. Reif, JH, Quantum Computing (November, 2009), pp. 67-109, JOHN WILEY & SONS INC [doi]  [abs]
  63. Reif, JH; LaBean, TH, DNA Nanotechnology and its Biological Applications (November, 2009), pp. 349-375, JOHN WILEY & SONS INC [doi]  [abs]
  64. 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, vol. 5555 LNCS no. PART 1 (November, 2009), pp. 235-253, Springer Berlin Heidelberg, ISSN 0302-9743 [doi]  [abs]
  65. John H. Reif and Sudheer Sahu, Autonomous Programmable DNA Nanorobotic Devices Using DNAzymes, Special Journal Issue on Self-Assembly, Theoretical Computer Science (TCS), Vol 410, Issue 15, pp. 1428-1439. (April, 2009) [pdf]
  66. Reif, JH; Sahu, S, Autonomous programmable DNA nanorobotic devices using DNAzymes, Theoretical Computer Science, vol. 410 no. 15 (April, 2009), pp. 1428-1439, Elsevier BV, ISSN 0304-3975 [doi]  [abs]
  67. John H. Reif, Quantum Computing. In book “Bio-inspired and Nanoscale Integrated Computing”, Chapter 3, pp. 67-110 (edited by Mary Mehrnoosh Eshaghian-Wilner), Publisher: Wiley, Hoboken, NJ, USA (February, 2009) [pdf]
  68. John H. Reif and Thomas H. LaBean, DNA Nanotechnology and its Biological Applications. In book “Bio-inspired and Nanoscale Integrated Computing”, Chapter 13, pp. 349-375 (edited by Mary Mehrnoosh Eshaghian-Wilner), Publisher: Wiley, Hoboken, NJ, USA (February, 2009) [pdf]
  69. John H. Reif, Mechanical Computation: it’s Computational Complexity and Technologies, invited chapter, Encyclopedia of Complexity and System Science (edited by Robert A. Meyers), Springer (February, 2009) (ISBN: 978-0-387-75888-6.) [pdf]
  70. Sudheer Sahu, Peng Yin and John H. Reif, A Self-Assembly Model of Time-Dependent Glue Strength, Invited Chapter in "Algorithmic Bioprocesses" (edited by A.Condon, D.Harel, J.N.Kok, A.Salomaa, and E.Winfree), Published by Springer-Verlag, ISBN: 978-3-540-88868-0, pp. 185-204 (2009) [pdf]
  71. 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 (December, 2008)
  72. Sahu, S; LaBean, TH; Reif, JH, A DNA nanotransport device powered by polymerase phi29., Nano letters, vol. 8 no. 11 (November, 2008), pp. 3870-3878, ISSN 1530-6984 [18939810], [doi]  [abs]
  73. Sahu, S; Wang, B; Reif, JH, A framework for modeling DNA based molecular systems, Journal of Computational and Theoretical Nanoscience, vol. 5 no. 11 (November, 2008), pp. 2124-2134, American Scientific Publishers, ISSN 1546-1955 [doi]  [abs]
  74. Sudheer Sahu, Bei Wang, John H. Reif, A Framework for Modeling DNA based Molecular Systems. Computational and Theoretical Nanoscience, Volume 5, Number 11, pp. 2124-2134 (November, 2008) [pdf]
  75. Reif, JH; Slee, S, Asymptotically optimal kinodynamic motion planning for self-reconfigurable robots, Springer Tracts in Advanced Robotics, vol. 47 (October, 2008), pp. 457-472, Springer Berlin Heidelberg, ISSN 1610-7438 [doi]  [abs]
  76. Sudheer Sahu, Thom H. LaBean and John H. Reif, A DNA Nanotransport Device Powered by Polymerase, Nano Letters, vol. 8 no. 11 (October, 2008), pp. 3870–3878
  77. 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, vol. 5204 LNCS (September, 2008), pp. 129-145, Springer Berlin Heidelberg, ISSN 0302-9743 [doi]  [abs]
  78. 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, vol. 4848 LNCS (August, 2008), pp. 66-78, Springer Berlin Heidelberg, ISSN 0302-9743 [doi]  [abs]
  79. 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, vol. 4848 LNCS (August, 2008), pp. 15-25, Springer Berlin Heidelberg, ISSN 0302-9743 [doi]  [abs]
  80. Peng Yin, Rizal F. Hariadi, Sudheer Sahu, Harry M.T.Choi, Sung Ha Park, Thomas H. LaBean, John H. Reif, Programming DNA Tube Circumferences, Science, Vol. 321. no. 5890, pp. 824–826 (August 8, 2008) (DOI: 10.1126/science.1157312.) [pdf]
  81. Yin, P; Hariadi, RF; Sahu, S; Choi, HMT; Park, SH; Labean, TH; Reif, JH, Programming DNA tube circumferences., Science (New York, N.Y.), vol. 321 no. 5890 (August, 2008), pp. 824-826, ISSN 0036-8075 [doi]  [abs]
  82. Urmi Majumder, John H. Reif, and Sudheer Sahu, Stochastic Analysis of Reversible Self-Assembly. Journal of Computational and Theoretical Nanoscience, Volume 5, Number 7, pp. 1289-1305 (July, 2008) [pdf]
  83. Reif, JH; Kasif, S; Sherlekar, D, Formula dissection: A parallel algorithm for constraint satisfaction, Computers and Mathematics with Applications, vol. 55 no. 6 (March, 2008), pp. 1170-1177, Elsevier BV, ISSN 0898-1221 [doi]  [abs]
  84. Majumder, U; Sahu, S; Reif, JH, Stochastic analysis of reversible self-assembly, Journal of Computational and Theoretical Nanoscience, vol. 5 no. 7 (January, 2008), pp. 1289-1305, American Scientific Publishers, ISSN 1546-1955 [doi]  [abs]
  85. Sudheer Sahu and John H. Reif, Capabilities and Limits of Compact Error Resilience Methods for Algorithmic Self-Assembly in Two and Three Dimensions, Algorithmica (2008) [pdf]
  86. Gehani, A; Reif, J, Super-resolution video analysis for forensic investigations, IFIP International Federation for Information Processing, vol. 242 (December, 2007), pp. 281-299, Springer New York, ISSN 1571-5736 [doi]  [abs]
  87. Yin, P; Hariadi, RF; Sahu, S; Choi, HMT; Park, SH; Walters, B; LaBean, TH; Reif, JH, 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, 2007), pp. 71-78
  88. 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 (December, 2007), pp. 60-64
  89. 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 (December, 2007), pp. 155-157
  90. John H. Reif and Thomas H. LaBean, Autonomous Programmable Biomolecular Devices Using Self-Assembled DNA Nanostructures, Communications of the ACM (CACM), Special Section entitled “New Computing Paradigms (edited by Toshinori Munakata), Volume 50, Issue 9, pp. 46-53 (September, 2007) [pdf]
  91. Reif, JH; Labean, TH, Autonomous programmable biomolecular devices using self-assembled DNA nanostructures, Communications of the ACM, vol. 50 no. 9 (September, 2007), pp. 46-53, Association for Computing Machinery (ACM), ISSN 0001-0782 [doi]  [abs]
  92. Labean, TH; Gothelf, KV; Reif, JH, Self-Assembling DNA Nanostructures for Patterned Molecular Assembly (February, 2007), pp. 79-97, Wiley-VCH Verlag GmbH & Co. KGaA [doi]
  93. 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, vol. 4576 LNCS (January, 2007), pp. 297-306, Springer Berlin Heidelberg, ISSN 0302-9743 [doi]
  94. Reif, JH; Chakraborty, S, Efficient and exact quantum compression, Information and Computation, vol. 205 no. 7 (January, 2007), pp. 967-981, Elsevier BV, ISSN 0890-5401 [doi]  [abs]
  95. John H. Reif and Sukhendu Chakraborty, Efficient and Exact Quantum Compression, Journal of Information and Computation, Vol. 205, pp. 967-981 (2007) [pdf]
  96. Z. Sun and John H. Reif, BUSHWHACK: An approximation algorithm for minimal paths through pseudo-Euclidean spaces. IEEE Transactions on Systems, Man, and Cybernetics (SMC), Part B: Cybernetics, Vol. 37, No. 4, pp. 925-936 (2007) (2007) [pdf]
  97. Thomas H. LaBean, Kurt V. Gothelf, and John H. Reif, Self-assembling DNA Nanostructures for Patterned Molecular Assembly, invited chapter 5 in textbook Nanobiotechnology, (edited by Chad A. Mirkin and Christof M. Niemeyer), John Wiley & Sons Publishers, pp. 79-97 (2007) [pdf]
  98. Ashish Gehani and John H. Reif, Super-Resolution Video Analysis for Forensic Investigations, Advances in Digital Forensics, Chapter 15, Volume 32007, pp. 228-229 (2007) [pdf]
  99. 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, 2006), pp. iv
  100. 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, vol. 4287 LNCS (December, 2006), pp. 223-238, Springer Berlin Heidelberg, ISSN 0302-9743 [doi]  [abs]
  101. 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, vol. 4287 LNCS (December, 2006), pp. 195-214, Springer Berlin Heidelberg, ISSN 0302-9743 [doi]  [abs]
  102. 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, vol. 4287 LNCS (December, 2006), pp. 250-265, Springer Berlin Heidelberg, ISSN 0302-9743 [doi]  [abs]
  103. 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, vol. 3892 LNCS (July, 2006), pp. 399-416, Springer Berlin Heidelberg, ISSN 0302-9743 [doi]  [abs]
  104. 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, vol. 3892 LNCS (July, 2006), pp. 257-274, Springer Berlin Heidelberg, ISSN 0302-9743 [doi]  [abs]
  105. 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, vol. 3892 LNCS (July, 2006), pp. 290-304, Springer Berlin Heidelberg, ISSN 0302-9743 [doi]  [abs]
  106. Reif, JH; Sun, Z, On boundaries of highly visible spaces and applications, Theoretical Computer Science, vol. 354 no. 3 (April, 2006), pp. 379-390, Elsevier BV, ISSN 0304-3975 [doi]  [abs]
  107. Sung Ha Park, Constantin Pistol, Sang Jung Ahn, John H. Reif, Alvin R. Lebeck, Chris Dwyer, and Thomas H. LaBean, Finite-Size, Fully Addressable DNA Tile Lattices Formed by Hierarchical Assembly Procedures, Angewandte Chemie [International Edition], Volume 45, Issue 5, pp. 735-739 (January 23, 2006) (DOI: 10.1002/anie.200503797.) [pdf]
  108. Sun, Z; Reif, JH, On finding approximate optimal paths in weighted regions, Journal of Algorithms, vol. 58 no. 1 (January, 2006), pp. 1-32, Elsevier BV, ISSN 0196-6774 [pdf], [doi]  [abs]
  109. John H. Reif, Sudheer Sahu, Peng Yin, Compact Error-Resilient Computational DNA Tiling Assemblies, invited chapter in text "Nanotechnology: Science and Computation”, Springer Verlag series in Natural Computing (edited by J. Chen; N. Jonoska and G. Rozenberg), Springer-Verlag Berlin, Germany, pages 79-104 (2006) [pdf]
  110. Park, SH; Pistol, C; Ahn, SJ; Reif, JH; Lebeck, AR; Dwyer, C; LaBean, TH, Finite-size, Fully-Addressable DNA Tile Lattices Formed by Hierarchical Assembly Procedures, Angewandte Chemie, vol. 45 no. 5 (2006), pp. 735-739-735-739, ISSN 1433-7851 [16374784], [doi]
  111. Z. Sun, D. Hsu, T. Jiang, H. Kurniawati, and John H. Reif, Narrow Passage Sampling for Probabilistic Roadmap Planning, Volume 21, No. 6, pp. 1105 – 1115., IEEE Transactions on Robotics (December, 2005) [pdf]
  112. 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 (December, 2005), pp. 178-180
  113. 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 (December, 2005), pp. 193-196
  114. Sun, Z; Hsu, D; Jiang, T; Kurniawati, H; Reif, JH, Narrow passage sampling for probabilistic roadmap planning, IEEE Transactions on Robotics, vol. 21 no. 6 (December, 2005), pp. 1105-1115, Institute of Electrical and Electronics Engineers (IEEE), ISSN 1552-3098 [doi]  [abs]
  115. S. Azhar, A. McLennan and John H. Reif, Computation of Equilibria in Noncooperative Games, Computers & Mathematics with Applications, Volume 50, Issues 5-6, pp. 823-854 (September, 2005) [pdf]
  116. Azhar, S; McLennan, A; Reif, JH, Computation of equilibriain noncooperative games, Computers and Mathematics with Applications, vol. 50 no. 5-6 (September, 2005), pp. 823-854, Elsevier BV, ISSN 0898-1221 [doi]  [abs]
  117. John H. Reif, Efficient Parallel Factorization and Solution of Structured and Unstructured Linear Systems, Journal of Computer and System Sciences, Vol. 71, Issue 1, pp. 86 - 143 (July, 2005) [pdf]
  118. Chen, J; Rozenberg, G, Preface, Natural Computing, vol. 4 no. 2 (June, 2005), pp. 81-82, Springer Nature, ISSN 1567-7818 [doi]
  119. 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, vol. 5 no. 4 (April, 2005), pp. 729-733, ISSN 1530-6984 [15826117], [doi]  [abs]
  120. Park, SH; Barish, R; Li, H; Reif, JH; Finkelstein, G; Yan, H; LaBean, TH, Three-Helix Bundle DNA Tiles Self-Assemble into 2D Lattice or 1D Templates for Silver Nanowires., Nano Letters, vol. 5 no. 4 (March, 2005), pp. 693, ISSN 1530-6984 [15826110], [doi]  [abs]
  121. Z. Sun and John H. Reif, On Finding Energy-minimizing Paths on Terrains for a Mobile Robot, IEEE Transaction on Robotics, Volume: 21, Issue: 1, pp. 102-114 (February, 2005) [pdf]
  122. Sun, Z; Reif, JH, On finding energy-minimizing paths on terrains, IEEE Transactions on Robotics, vol. 21 no. 1 (February, 2005), pp. 102-114, Institute of Electrical and Electronics Engineers (IEEE) [doi]  [abs]
  123. Yin, P; Turberfield, AJ; Reif, JH, Designs of autonomous unidirectional walking DNA devices, Lecture Notes in Computer Science, vol. 3384 (January, 2005), pp. 410-425 [doi]  [abs]
  124. Yin, P; Turberfield, AJ; Sahu, S; Reif, JH, Design of an autonomous DNA nanomechanical device capable of universal computation and universal translational motion, in Tenth International Meeting on DNA Based Computers (DNA10), Milano, Italy, Lecture Notes in Computer Science, vol. 3384 (January, 2005), pp. 426-444, Lecture Notes in Computer Science, Springer-Verlag, New York [pdf], [doi]  [abs]
  125. Reif, JH; Sahu, S; Yin, P, Compact error-resilient computational DNA tiling assemblies, Lecture Notes in Computer Science, vol. 3384 (January, 2005), pp. 293-307 [doi]  [abs]
  126. 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, vol. 3566 (January, 2005), pp. 173-187, ISSN 0302-9743 [doi]  [abs]
  127. Reif, JH, Efficient parallel factorization and solution of structured and unstructured linear systems, Journal of Computer and System Sciences, vol. 71 no. 1 (January, 2005), pp. 86-143, Elsevier BV [doi]  [abs]
  128. John H. Reif, Michael Hauser, Michael Pirrung, and Thomas LaBean, Application of Biomolecular Computing to Medical Science: A Biomedical Database System for Storage and Retrieval of Genetic Information and Material, Chapter 3 of Complex Systems Science in Biomedicine (Edited by Thomas S. Deisboeck and J. Yasha Kresh), International Topics in Biomedical Engineering Series, Springer Publishers, New York, Chapter 3, ISBN: 0-387-30241-7, pp. 701-735 (2005) [pdf]
  129. Sung Ha Park, Peng Yin, Yan Liu, John H. Reif, Thomas LaBean, and Hao Yan, Programmable DNA Self-assemblies for Nanoscale Organization of Ligands and Proteins, Nano Letters (Communication), Volume 5, Number 4, pp. 729-733 (2005) (PubMed PMID: 15826117.) [pdf]
  130. Sung Ha Park, Robert Barish, John H. Reif, Gleb Finkelstein, Hao Yan and Thomas LaBean, Three-Helix Bundle DNA Tiles Self-Assemble into 2D Lattice or 1D Templates for Silver Nanowires, Nano Letters (Communication), Volume 5, Number 4, pp. 693-696 (2005) (PubMed PMID: 15826110.) [pdf]
  131. 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), vol. 43 no. 37 (September, 2004), pp. 4906-4911, ISSN 1433-7851 (PubMed PMID: 15372637.) [15372637], [doi]
  132. Park, SH; Yan, H; Reif, JH; LaBean, TH; Finkelstein, G, Electronic nanostructures templated on self-assembled DNA scaffolds, Nanotechnology, vol. 15 no. 10 (July, 2004), pp. S525-S527, IOP Publishing [doi]  [abs]
  133. John H. Reif and Zheng Sun, On Boundaries of Highly Visible Spaces and Applications, invited Paper, Theoretical Computer Science, Volume 354, Issue 3, pp. 379-390 (April 4, 2004) [pdf]
  134. Reif, JH; Sun, Z, Movement planning in the presence of flows, Algorithmica New York, vol. 39 no. 2 (February, 2004), pp. 127-153, Springer Nature [pdf], [doi]  [abs]
  135. Dage Liu, 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 Science(PNAS), Vol. 101, No. 3, pp. 717-722 (January 20, 2004) (PubMed PMID: 14709674.) [pdf]
  136. Gehani, A; Labean, T; Reif, J, DNA-based cryptography, in Aspects of Molecular Computing - Essays dedicated to Tom Head on the occasion of his 70th birthday, LNCS 2950 Festschrift, Springer, edited by N. Jonoska, Gh. Paun and G. Rozenberg, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, vol. 2950 (Winter, 2004), pp. 167-188, Springer Verlag, ISSN 0302-9743 [pdf]  [abs]
  137. Reif, JH; Scherlis, WL, Deriving efficient graph algorithms, in Verification: Theory and Practice: Essays Dedicated to Zohar Manna on the Occasion of His 64th Birthday (edited by Nachum Dershowitz), Lecture Notes in Computer Science (LNCS) series., edited by Nachum Dershowitz, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, vol. 2772 (Spring, 2004), pp. 645-681, Springer Verlag, ISSN 0302-9743 [pdf]  [abs]
  138. 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, vol. 126 no. 2 (January, 2004), pp. 418-419, ISSN 0002-7863 (PubMed PMID: 14719910.) [14719910], [doi]  [abs]
  139. 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, vol. 101 no. 3 (January, 2004), pp. 717-722, ISSN 0027-8424 [14709674], [doi]  [abs]
  140. Sung Ha Park, Hao Yan, John H. Reif, Electronic nanostructures templated on self-assembled DNA scaffolds, Nanotechnology 15, pp. S525–S527 (2004) [pdf]
  141. 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, vol. 3 no. 3 (December, 2003), pp. 4420-4426 [pdf]  [abs]
  142. Sun, Z; Reif, J, On energy-minimizing paths on terrains for a mobile robot, in 2003 IEEE International Conference on Robotics and Automation(ICRA2003), Proceedings IEEE International Conference on Robotics and Automation, vol. 3 (December, 2003), pp. 3782-3788, IEEE [pdf]  [abs]
  143. Reif, JH, The design of autonomous DNA nano-mechanical devices: Walking and rolling DNA, Natural Computing, vol. 2 no. 4 (Fall, 2003), pp. 439-461, Springer Nature, ISSN 1567-7818 [pdf], [doi]  [abs]
  144. 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, vol. 125 no. 47 (November, 2003), pp. 14246-14247, ISSN 0002-7863 [14624551], [doi]  [abs]
  145. Feng, L; Park, SH; Reif, JH; Yan, H, A two-state DNA lattice switched by DNA nanoactuator., Angew Chem Int Ed Engl, vol. 42 no. 36 (September, 2003), pp. 4342-4346, ISSN 1433-7851 [14502706], [doi]
  146. Liping Feng, Sung Ha Park, John H. Reif, and Hao Yan, A Two-State DNA Lattice Switched by DNA Nanoactuator, Angewandte Chemie [International Edition], Vol. 42, pp. 4342-4346 (September, 2003) (PubMed PMID: 14502706.) [pdf]
  147. Reif, JH, Guest Editor's Foreword, Journal of Computer and System Sciences, vol. 67 no. 2 (September, 2003), pp. 211-211, Elsevier BV [doi]
  148. Reif, JH; Sun, Z, On frictional mechanical systems and their computational power, SIAM Journal on Computing, vol. 32 no. 6 (September, 2003), pp. 1449-1474, Society for Industrial & Applied Mathematics (SIAM), ISSN 0097-5397 [doi]  [abs]
  149. Yan, H; Park, SH; Finkelstein, G; Reif, JH; LaBean, TH, DNA-Templated Self-Assembly of Protein Arrays and Highly Conductive Nanowires, Science, vol. 301 no. 5641 (September, 2003), pp. 1882 (PubMed PMID: 14512621.) [14512621], [doi]  [abs]
  150. 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, vol. 100 no. 14 (July, 2003), pp. 8103-8108, ISSN 0027-8424 [12821776], [doi]  [abs]
  151. Hao Yan, Liping Feng, Thomas H. LaBean, and John H. Reif, Parallel Molecular Computations of Pairwise Exclusive-Or (XOR) Using DNA "String Tile" Self-Assembly in Journal of American Chemistry Society(JACS), Vol. 125, No. 47, pp. 14246-14247 (June, 2003) (PubMed PMID: 14624551.) [pdf]
  152. Reif, JH, The design of autonomous DNA nanomechanical devices: Walking and rolling DNA, in DNA Based Computers (DNA8), Lecture Notes in Computer Science, edited by Masami Hagiya and Azuma Ohuchi, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, vol. 2568 no. 2568 (January, 2003), pp. 22-37, Springer-Verlag, ISSN 0302-9743 [pdf], [doi]  [abs]
  153. Liu, D; Reif, JH; LaBean, TH, DNA nanotubes: Construction and characterization of filaments composed of TX-tile lattice, edited by Masami Hagiya and Azuma Ohuchi, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, vol. 2568 (January, 2003), pp. 10-21, Lecture Notes in Computer Science, No. 2568, Springer-Verlag, New York, (2003), pp. 10-21, ISSN 0302-9743 [pdf], [doi]  [abs]
  154. Sun, Z; Reif, JH, Adaptive and compact discretization for weighted region optimal path finding, in 14th Symposium on Fundamentals of Computation Theory, Malmö Högskola, Sweden, August 12-15, 2003, Springer-Verlag Lecture Notes in Computer Science, Vol. 2751, pp. 258-270, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, vol. 2751 (January, 2003), pp. 258-270, ISSN 0302-9743 [pdf], [doi]  [abs]
  155. Reif, JH; Sun, Z, On boundaries of highly visible spaces and applications, in 14th Symposium on Fundamentals of Computation Theory, Springer-Verlag Lecture Notes in Computer Science, edited by Malmö Högskola, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, vol. 2751 (January, 2003), pp. 271-283, ISSN 0302-9743 [pdf], [doi]  [abs]
  156. John H. Reif and Z. Sun, The Computational Power of Frictional Mechanical Systems, SIAM Journal of Computing(SICOMP), vol. 32 no. 6 (2003), pp. 1449-1474 [pdf]
  157. Hao Yan, Thomas H. LaBean, Liping Feng, and John H. Reif, Directed Nucleation Assembly of Barcode Patterned DNA Lattices, Proceedings of the National Academy of Science (PNAS), vol. 100 no. 14 (July 8, 2003), pp. 8103-8108 (PubMed PMID: 12821776.) [pdf]
  158. D. Liu, J. H. Reif, and T. H. LaBean, DNA nanotubes self-assembled from TX tiles as templates for conductive nanowires, Proceedings of the National Academy of Science(PNAS) (2003) [pdf]
  159. Reif, JH, Computing. Successes and challenges., Science (New York, N.Y.), vol. 296 no. 5567 (April, 2002), pp. 478-479 (PubMed PMID: 11964464.) [11964464], [doi]
  160. J. Reif, DNA Lattices: A Programmable Method for Molecular Scale Patterning and Computation, special issue on Bio-Computation, Computer and Scientific Engineering Magazine, IEEE Computer Society (February, 2002), pp. 32-41 [pdf]
  161. G.L. Peterson, John H. Reif, and S. Azhar, Decision Algorithms for Multiplayer Non-Cooperative Games of Incomplete Information. Computers and Mathematics with Applications, Vol. 43, pp 179-206 (January, 2002) [pdf]
  162. 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, 2002), pp. iii
  163. Reif, JH, The emerging discipline of biomolecular computation in the US, New Generation Computing, vol. 20 no. 3 (January, 2002), pp. 217-236, Springer Nature [doi]  [abs]
  164. Peterson, G; Reif, J; Azhar, S, Decision algorithms for multiplayer noncooperative games of incomplete information, Computers and Mathematics with Applications, vol. 43 no. 1-2 (January, 2002), pp. 179-206, Elsevier BV, ISSN 0898-1221 [doi]  [abs]
  165. Reif, JH, DNA lattices: A method for molecular-scale patterning and computation, Computing in Science and Engineering, vol. 4 no. 1 (January, 2002), pp. 32-41, Institute of Electrical and Electronics Engineers (IEEE), ISSN 1521-9615 [pdf], [doi]  [abs]
  166. 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, vol. 2380 LNCS (January, 2002), pp. 1-21, ISSN 0302-9743 (Lectures Notes in Computer Science, New York, Volume 2380, pages 1-21.) [pdf], [doi]  [abs]
  167. John H. Reif, The Emerging Discipline of Biomolecular Computation in the US, invited paper to the special issue on Biomolecular Computing, New Generation Computing, edited by Masami Hagiya, Masayuki Yamamura, and Tom Head, Vol. 20, No. 3, pp. 217-236 (2002) [pdf]
  168. John H. Reif, The Emergence of Discipline of Biomolecular Computation in the US, edited by Masami Hagiya, Masayuki Yamamura and Tom Head, invited paper to the special issue on Biomolecular Computing, New Generation Computing, vol. 20 no. 3 (2002), pp. 217-236 [pdf]
  169. 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, vol. 2223 LNCS (December, 2001), pp. 160-171, Springer Berlin Heidelberg, ISSN 0302-9743 [pdf], [doi]  [abs]
  170. Reif, JH; Storer, JA, Optimal encoding of non-stationary sources, Information Sciences, vol. 135 no. 1-2 (June, 2001), pp. 87-105, Elsevier BV, ISSN 0020-0255 [pdf], [doi]  [abs]
  171. John H. Reif, Parallel Output Sensitive Algorithms for Combinatorial and Linear Algebra Problems, Journal of Computer and System Sciences, Vol. 62, pp. 398-412 (May, 2001) [pdf]
  172. G.L. Peterson, John H. Reif, and S. Azhar, Lower Bounds for Multiplayer Noncooperative Games of Incomplete Information, Computers and Mathematics with Applications, Volume 41, pp 957-992 (April, 2001) [pdf]
  173. 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, vol. 1 (January, 2001), pp. 966-971  [abs]
  174. Reif, JH, Efficient parallel computation of the characteristic polynomial of a sparse, separable matrix, Algorithmica New York, vol. 29 no. 3 (January, 2001), pp. 487-510, Springer Nature [pdf], [doi]  [abs]
  175. Peterson, G; Reif, J; Azhar, S, Lower bounds for multiplayer noncooperative games of incomplete information, Computers and Mathematics with Applications, vol. 41 no. 7-8 (January, 2001), pp. 957-992, Elsevier BV [doi]  [abs]
  176. Reif, JH, Parallel output-sensitive algorithms for combinatorial and linear algebra problems, Journal of Computer and System Sciences, vol. 62 no. 3 (January, 2001), pp. 398-412, Elsevier BV, ISSN 0022-0000 [doi]  [abs]
  177. 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, vol. 408 no. 6813 (December, 2000), pp. 750 [doi]
  178. Reif, JH; Wang, H, Nonuniform discretization for kinodynamic motion planning and its applications, SIAM Journal on Computing, vol. 30 no. 1 (December, 2000), pp. 161-190, Society for Industrial & Applied Mathematics (SIAM) [doi]  [abs]
  179. Reif, JH; Tate, SR, Fast spatial decomposition and closest pair computation for limited precision input, Algorithmica New York, vol. 28 no. 3 (November, 2000), pp. 271-287, Springer Nature [doi]  [abs]
  180. Mao, C; LaBean, TH; Relf, JH; Seeman, NC, Logical computation using algorithmic self-assembly of DNA triple-crossover molecules., Nature, vol. 407 no. 6803 (September, 2000), pp. 493-496 (Erratum: Nature 408, 750-750(2000).) [pdf], [doi]  [abs]
  181. LaBean, TH; Yan, H; Kopatsch, J; Liu, F; Winfree, E; Reif, JH; Seeman, NC, Construction, analysis, ligation, and self-assembly of DNA triple crossover complexes, Journal of the American Chemical Society, vol. 122 no. 9 (March, 2000), pp. 1848-1860, American Chemical Society (ACS), ISSN 0002-7863 [doi]  [abs]
  182. Reif, J, On the impossibility of interaction-free quantum sensing for small I/O bandwidth, Information and Computation, vol. 163 no. 1 (January, 2000), pp. 103-122, Elsevier BV [pdf], [doi]  [abs]
  183. T. H. LaBean, H. Yan, J. Kopatsch, F. Liu, E. Winfree, John H. Reif and N.C. Seeman, The construction, analysis, litigation and self-assembly of DNA triple crossover complexes, Journal of American Chemistry Society (JACS), vol. 122 (2000), pp. 1848-1860 [pdf]
  184. John H. Reif and H. Wang, Nonuniform Discretization for Kinodynamic motion planning and its applications, SIAM Journal of Computing (SICOMP), Volume 30, No. 1, pages 161-190 (2000) [pdf]
  185. John H. Reif and S. Tate, John H. Reif and S. Tate, Fast spatial decomposition and closest pair computation for limited precision input, Journal of Algorithmica, vol. 28 no. 3 (2000), pp. 271-287 [pdf]
  186. A. Gehani and John H. Reif, Micro Flow Bio-Molecular Computation, special issue of Biosystems, Journal of Biological and Informational Processing Sciences, Vol. 52, Nos. 1-3, (Edited By L. Kari, H. Rubin, and D. H. Wood), pp. 197-216 (October, 1999) [pdf]
  187. Gehani, A; Reif, J, Micro flow bio-molecular computation., Bio Systems, vol. 52 no. 1-3 (October, 1999), pp. 197-216, ISSN 0303-2647 (DNA Based Computers, IV, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, (ed. H. Rubin), American Mathematical Society, 1999.) [pdf], [doi]  [abs]
  188. Reif, JH, Efficient approximate solution of sparse linear systems (vol 36, pg 37, 1998), COMPUTERS & MATHEMATICS WITH APPLICATIONS, vol. 38 no. 2 (July, 1999), pp. 141-141, PERGAMON-ELSEVIER SCIENCE LTD
  189. Reif, JH; Wang, H, Social potential fields: A distributed behavioral control for autonomous robots, Robotics and Autonomous Systems, vol. 27 no. 3 (May, 1999), pp. 171-194, Elsevier BV [doi]  [abs]
  190. S. Azhar and John H. Reif, Efficient Algorithmic Learning of the Structure of Permutation Groups by Examples, Computers & Mathematics with Applications, Volume 37, Issue 10, pp 105-132 (May, 1999) [pdf]
  191. John H. Reif and H. Wang, Social Potential Fields: A Distributed Behavioral Control for Autonomous Robots, Robotics and Autonomous Systems, Vol. 27, no.3, pp.171-194 (May, 1999) [pdf]
  192. S. Gupta, Z. Li, and John H. Reif, Synthesizing Efficient Out-of-Core Programs for Block Recursive Algorithms using Block-Cyclic Data Distributions. IEEE Transactions on Parallel and Distributed Systems, Vol. 10, No. 3, pp. 297-315 (March, 1999) [pdf]
  193. 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, vol. 10 no. 3 (January, 1999), pp. 297-315, Institute of Electrical and Electronics Engineers (IEEE), ISSN 1045-9219 [doi]  [abs]
  194. Reif, JH, Parallel biomolecular computation: Models and simulations, Algorithmica New York, vol. 25 no. 2-3 (January, 1999), pp. 142-175, Springer Nature [doi]  [abs]
  195. Reif, JH, Approximate complex polynomial evaluation in near constant work per point, SIAM Journal on Computing, vol. 28 no. 6 (January, 1999), pp. 2059-2089, Society for Industrial & Applied Mathematics (SIAM) [pdf], [doi]  [abs]
  196. Azhar, S; Reif, JH, Efficient algorithmic learning of the structure of permutation groups by examples, Computers and Mathematics with Applications, vol. 37 no. 10 (January, 1999), pp. 105-132, Elsevier BV [doi]  [abs]
  197. John H. Reif and S. Sen, Parallel Computational Geometry: An approach using randomization, in Handbook of Computational Geometry, edited by Jorge Uttutia and Jorge-Rudiger Sack (1999), pp. 765-828, Elsevier Science Publishing, Amsterdam, the Netherlands [pdf]
  198. John H. Reif, Parallel Biomolecular Computation: Models and Simulations. Algorithmica, special issue on Computational Biology, Vol. 25, No. 2, 142-176 (1999) [pdf]
  199. John H. Reif, Approximate Complex Polynomial Evaluation in Near Constant Work Per Point. SIAM Journal of Computing (SICOMP), Vol. 28 Number 6 pp. 2059-2089 (1999) [pdf]
  200. H. Gazit and John H. Reif, A Randomized Parallel Algorithm for Planar Graph Isomorphism, Journal of Algorithms, Vol. 28, No. 2, pp 290-314 (August, 1998) [pdf]
  201. Rolland, JP; Yoshida, A; Davis, LD; Reif, JH, High-resolution inset head-mounted display., Applied optics, vol. 37 no. 19 (July, 1998), pp. 4183-4193, ISSN 0003-6935 [doi]  [abs]
  202. Reif, JH, Paradigms for biomolecular computation, in Unconventional Models of Computation, edited by Calude, CS; Casti, J; Dinneen, MJ, UNCONVENTIONAL MODELS OF COMPUTATION (January, 1998), pp. 72-93, SPRINGER-VERLAG SINGAPORE PTE LTD [pdf]
  203. Gazit, H; Reif, JH, A Randomized Parallel Algorithm for Planar Graph Isomorphism, Journal of Algorithms, vol. 28 no. 2 (January, 1998), pp. 290-314, Elsevier BV [doi]  [abs]
  204. Reif, JH; Storer, JA, Optimal lossless compression of a class of dynamic sources, edited by James A. Storer, Martin Cohn, Data Compression Conference Proceedings (January, 1998), pp. 501-510, IEEE Comput. Soc [pdf], [doi]  [abs]
  205. Reif, JH, Efficient Approximate Solution of Sparse Linear Systems, Computers and Mathematics with Applications, vol. 36 no. 9 (January, 1998), pp. 37-58, Elsevier BV (Also, see errata, Computers and Mathematics with Applications, Vol. 38, No. 9, 1999, pp. 141-141.) [pdf], [doi]  [abs]
  206. Rolland, J.P., A. Yoshida, L. Davis, and John H. Reif, High resolution inset head-mounted display, Applied Optics: Optical Technology and Biomedical Optics, 37(19), 4183-4193 (1998) [pdf]
  207. Gelenbe, E; Schmajuk, N; Staddon, J; Reif, J, Autonomous search by robots and animals: A survey, Robotics and Autonomous Systems, vol. 22 no. 1 (November, 1997), pp. 23-34, Elsevier BV [doi]  [abs]
  208. E. Gelenbe, N. Schmajuk, J. Staddon, and John H. Reif, Autonomous Search and the Search for Robots and Mines: A Survey, Robotics and Autonomous Systems, vol. 22 (November, 1997), pp. 23-33 [pdf]
  209. Reif, JH; Tyagi, A, Efficient parallel algorithms for optical computing with the discrete Fourier transform (DFT) primitive., Applied optics, vol. 36 no. 29 (October, 1997), pp. 7327-7340, ISSN 0003-6935 [doi]  [abs]
  210. John H. Reif and A. Tyagi, An Optical Delay Line Memory Model with Efficient Algorithms. Optical Engineering, 36(09), pp. 2521-2535 (September, 1997) [pdf]
  211. J. A. Storer and John H. Reif, Error Resilient Optimal Data Compression, SIAM Journal of Computing (SICOMP), Vol 26, Num 4, pp. 934-939 (July, 1997) [pdf]
  212. John H. Reif and S. R. Tate, On Dynamic Algorithms for Algebraic Problems, Journal of Algorithms, Volume 22, Number 2, pp. 347-371 (February, 1997) [pdf]
  213. Han, Y; Pan, VY; Reif, JH, Efficient Parallel Algorithms for Computing All Pair Shortest Paths in Directed Graphs1, Algorithmica New York, vol. 17 no. 4 (January, 1997), pp. 399-415, Springer Nature [doi]  [abs]
  214. Reif, JH; Tyagi, A, Optical delay line memory model with efficient algorithms, Optical Engineering, vol. 36 no. 9 (January, 1997), pp. 2521-2535, SPIE-Intl Soc Optical Eng, ISSN 0091-3286 [doi]  [abs]
  215. Storer, JA; Reif, J, Low-cost prevention of error-propagation for data compression with dynamic dictionaries, edited by James A. Storer, Martin Cohn, Data Compression Conference Proceedings (January, 1997), pp. 171-180, IEEE Computer Society Press [pdf]  [abs]
  216. Reif, JH, Approximate complex polynomial evaluation in near constant work per point, Conference Proceedings of the Annual ACM Symposium on Theory of Computing (January, 1997), pp. 30-39 [pdf], [doi]  [abs]
  217. Chen, S; Reif, JH, Fast and compact volume rendering in the compressed transform domain, Data Compression Conference Proceedings (January, 1997), pp. 271-280, IEEE Comput. Soc. Press [doi]  [abs]
  218. Reif, JH; Tate, SR, On Dynamic Algorithms for Algebraic Problems, Journal of Algorithms, vol. 22 no. 2 (January, 1997), pp. 347-371, Elsevier BV [doi]  [abs]
  219. Storer, JA; Reif, JH, Error-resilient optimal data compression, SIAM Journal on Computing, vol. 26 no. 4 (January, 1997), pp. 934-949, Society for Industrial & Applied Mathematics (SIAM) [doi]  [abs]
  220. John H. Reif and A. Tyagi, Efficient Algorithms for Optical Computing with the discrete Fourier transform (DFT) primitive, Journal of Applied Optics, Vol. 36, pp. 7327-7340 (1997) [pdf]
  221. Y. Han, V. Pan, and John H. Reif, Efficient Parallel Algorithms for Computing All Pair Shortest Paths in Directed Graphs. Algorithmica, Vol 17, pp. 399-415 (1997) [pdf]
  222. Kao, MY; Reif, JH; Tate, SR, Searching in an Unknown Environment: An Optimal Randomized Algorithm for the Cow-Path Problem, Information and Computation, vol. 131 no. 1 (November, 1996), pp. 63-79, Elsevier BV [doi]  [abs]
  223. A. Neff and John H. Reif, An Efficient Algorithm for the Complex Roots Problem, Journal of Complexity, 12(2):81-115 (June, 1996) [pdf]
  224. Neff, AC; Reif, JH, An efficient algorithm for the complex roots problem, Journal of Complexity, vol. 12 no. 2 (January, 1996), pp. 81-115, Elsevier BV [doi]  [abs]
  225. Nyland, LS; Reif, JH, An algebraic technique for generating optimal CMOS circuitry in linear time, Computers and Mathematics with Applications, vol. 31 no. 1 (January, 1996), pp. 85-108, Elsevier BV [pdf], [doi]  [abs]
  226. 134. A. Goldberg, J. Prins, R. Faith, Z. Li, pp. Mills, L. Nyland, D. Palmer, John H. Reif, J. Riely, and S. Westfold, The Proteus System for the Development of Parallel Applications, in Prototyping and Software Development, edited by M.C. Harrison, Lecture Notes in Computer Science (1996), pp. 151-190, Springer-Verlag [pdf]
  227. M. Kao, John H. Reif, and S. Tate, Searching in an Unknown Environment: An Optimal Randomized Algorithm for the Cow-Path Problem, Information and Computation, Vol 131, No. 1, p 63-80 (1996) [pdf]
  228. Z. Li, pp. H. Mills, and John H. Reif, Models and Resource Metrics for Parallel and Distributed Computation, Parallel Algorithms and Applications, Vol. 8, pp. 35-59 (1996) [pdf]
  229. Reif, JH, Efficient parallel solution of sparse eigenvalue and eigenvector problems, Annual Symposium on Foundations of Computer Science Proceedings (December, 1995), pp. 123-132, IEEE Comput. Soc. Press [pdf], [doi]  [abs]
  230. 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, vol. 2537 (December, 1995), pp. 71-82, ISSN 0277-786X  [abs]
  231. R. Paturi, S. Rajasekaran, and John H. Reif, The Light Bulb Problem, Information and Computation, 117(2):187-192 (March, 1995) [pdf]
  232. Paturi, R; Rajasekaran, S; Reif, J, The light bulb problem, Information and Computation, vol. 117 no. 2 (January, 1995), pp. 187-192, Elsevier BV, ISSN 0890-5401 [doi]  [abs]
  233. Chen, S; Reif, JH, Fast pattern matching for entropy bounded text, Data Compression Conference Proceedings (January, 1995), pp. 282-291  [abs]
  234. Reif, JH, Parallel molecular computation, Annual ACM Symposium on Parallel Algorithms and Architectures (January, 1995), pp. 213-223 [doi]  [abs]
  235. Yoshida, A; Rolland, JP; Reif, JH, Design and applications of a high-resolution insert head-mounted-display, Proceedings Virtual Reality Annual International Symposium (January, 1995), pp. 84-93 [pdf]  [abs]
  236. Reif, JH; Sen, S, An efficient output-sensitive hidden-surface removal algorithm for polyhedral terrains, Mathematical and Computer Modelling, vol. 21 no. 5 (January, 1995), pp. 89-104, Elsevier BV, ISSN 0895-7177 [doi]  [abs]
  237. John H. Reif and S. Sen, An Efficient Output-Sensitive Hidden-Surface Removal Algorithm for Polyhedral Terrains, Journal of Mathematical and Computer Modeling, Vol. 21, No. 5, pp. 89-104 (1995) [pdf]
  238. V. Ramachandran and John H. Reif, An Optimal Parallel Algorithm for Graph Planarity. Journal of Computer and System Sciences, 49:3, pp. 517-561 (December, 1994) [pdf]
  239. John H. Reif, D. Tygar, and A. Yoshida, The Computability and Complexity of Ray Tracing in Discrete & Computational Geometry, 11: pp 265-287 (December, 1994) [pdf]
  240. Reif, JH; Tygar, JD; Yoshida, A, Computability and complexity of ray tracing, Discrete Computational Geometry, vol. 11 no. 1 (December, 1994), pp. 265-288, Springer Nature, ISSN 0179-5376 [doi]  [abs]
  241. Cheriyan, J; Reif, JH, Directed s-t numberings, Rubber bands, and testing digraph k-vertex connectivity, Combinatorica, vol. 14 no. 4 (December, 1994), pp. 435-451, Springer Nature, ISSN 0209-9683 [doi]  [abs]
  242. John H. Reif and J.A. Storer, Shortest Paths in the plane with polygonal obstacles, Journal of the ACM(JACM) 41:5, pp. 982-1012 (September, 1994) [pdf]
  243. John H. Reif and M. Sharir, Motion Planning in the Presence of Moving Obstacles, Journal of the ACM (JACM), 41:4, pp. 764-790 (July, 1994) [pdf]
  244. John H. Reif and S. Sen, Randomized Algorithms for Binary Search and Load Balancing on Fixed Connection Networks with Geometric Applications. SIAM Journal of Computing 23:3, pp.633-651 (June, 1994) [pdf]
  245. John H. Reif and A. Yoshida, Optical Computing Techniques for Image/Video Compression, in Proceedings of the IEEE, 82:6, June 1994, pp. 948-954 (June, 1994) [pdf]
  246. Reif, JH; Sen, S, Erratum: Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems, SIAM Journal on Computing, vol. 23 no. 2 (April, 1994), pp. 447-448, Society for Industrial & Applied Mathematics (SIAM) [doi]
  247. John H. Reif and S. Tate, Approximate Kinodynamic Planning Using L2-norm Dynamic Bounds, Computers and Mathematics with Applications, Vol. 27, No.5, pp. 29-44 (March, 1994) [pdf]
  248. Storer, JA; Reif, JH, Shortest Paths in the Plane with Polygonal Obstacles, Journal of the ACM Jacm, vol. 41 no. 5 (January, 1994), pp. 982-1012, Association for Computing Machinery (ACM) [doi]  [abs]
  249. Reif, JH; Storer, JA, A Single-Exponential Upper Bound for Finding Shortest Paths in Three Dimensions, Journal of the ACM Jacm, vol. 41 no. 5 (January, 1994), pp. 1013-1019, Association for Computing Machinery (ACM) [pdf], [doi]  [abs]
  250. Reif, J; Sharir, M, Motion Planning in the Presence of Moving Obstacles, Journal of the ACM Jacm, vol. 41 no. 4 (January, 1994), pp. 764-790, Association for Computing Machinery (ACM) [doi]  [abs]
  251. Ramachandran, V; Reif, J, Planarity testing in parallel, Journal of Computer and System Sciences, vol. 49 no. 3 (January, 1994), pp. 517-561, Elsevier BV, ISSN 0022-0000 [doi]  [abs]
  252. Azhar, S; Badros, GJ; Glodjo, A; Kao, MY; Reif, JH, Data compression techniques for stock market prediction, edited by James A. Storer, Martin Cohn, Proceedings of the Data Compression Conference (January, 1994), pp. 72-82 [pdf]  [abs]
  253. Reif, JH, Models and resource metrics for parallel and distributed computation, Proceedings of the International Conference on Parallel Processing, vol. 2 (January, 1994), pp. 404, ISBN 0818669306 [pdf], [doi]  [abs]
  254. Reif, JH; Tate, SR, Dynamic algebraic algorithms, Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms (January, 1994), pp. 290-301 [pdf]  [abs]
  255. Reif, JH; Tate, SR, Approximate kinodynamic planning using L2-norm dynamic bounds, Computers and Mathematics with Applications, vol. 27 no. 5 (January, 1994), pp. 29-44, Elsevier BV, ISSN 0898-1221 [doi]  [abs]
  256. Reif, JH; Sen, S, Randomized algorithms for binary search and load balancing on fixed connection networks with geometric applications, SIAM Journal on Computing, vol. 23 no. 3 (January, 1994), pp. 633-651, Society for Industrial & Applied Mathematics (SIAM) [doi]  [abs]
  257. Yoshida, A; Reif, JH, Optical Computing Techniques for Image/Video Compression, Proceedings of the IEEE, vol. 82 no. 6 (January, 1994), pp. 948-954, Institute of Electrical and Electronics Engineers (IEEE) [doi]  [abs]
  258. P.H. Mills, L.S., Nyland, J.F. Prins, and John H. Reif, Software Issues in High-Performance Computing and a Framework for the Development of HPC Applications, in Developing a Computer Science Agenda for High Performance Computing, edited by U. Vishkin (1994), pp. 110-117, ACM [pdf]
  259. A. Goldberg, P.H. Mills, L.S. Nyland, J.F. Prins, J.ohn H. Reif, Specification and Development of Parallel Algorithms with the Proteus System, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 18 (1994), pp. 383-399, AMS Press [pdf]
  260. J. Cheriyan and John H. Reif, Directed s-t Numberings, Rubber Bands, and Testing Digraph k-Vertex Connectivity, in Combinatorica 14(4) 435-451 (1994) [pdf]
  261. John H. Reif, D. Tygar, and A. Yoshida, The Computability and Complexity of Ray Tracing, Discrete & Computational Geometry, 11: pp 265-287 (1994) [pdf]
  262. V. Pan and John H. Reif, Fast and Efficient Parallel Solution of Sparse Linear Systems. SIAM Journal on Computing, Vol 22, No. 6, pp. 1227-1250 (December, 1993) [pdf]
  263. 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 (December, 1993), pp. 104-112  [abs]
  264. Reif, JH, O(n log3 n) algorithm for the real root problem, Annual Symposium on Foundatons of Computer Science Proceedings (December, 1993), pp. 626-635  [abs]
  265. J. Canny, B. Donald, John H. Reif and P. Xavier, Kinodynamic Motion Planning, Journal of the ACM, Vol 40(5), pp. 1048-1066 (November, 1993) [pdf]
  266. Reif, JH; Tate, SR, Continuous alternation: The complexity of pursuit in continuous domains, Algorithmica, vol. 10 no. 2-4 (October, 1993), pp. 156-181, Springer Nature, ISSN 0178-4617 [pdf], [doi]  [abs]
  267. John H. Reif, Probabilistic Parallel Prefix Computation, Computers and Mathematics with Applications, Vol. 26, Number 1, pp. 101-110 (July, 1993) [pdf]
  268. Donald, B; Xavier, P; Canny, J; Reif, J, Kinodynamic Motion Planning, Journal of the ACM Jacm, vol. 40 no. 5 (January, 1993), pp. 1048-1066, Association for Computing Machinery (ACM) [doi]  [abs]
  269. Pan, V; Reif, J, Generalized compact multi-grid, Computers and Mathematics with Applications, vol. 25 no. 9 (January, 1993), pp. 3-5, Elsevier BV, ISSN 0898-1221 [pdf], [doi]  [abs]
  270. 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 (January, 1993), pp. 441-447 [pdf]  [abs]
  271. Reif, JH, Efficient VLSI fault simulation, Computers and Mathematics with Applications, vol. 25 no. 2 (January, 1993), pp. 15-32, Elsevier BV, ISSN 0898-1221 [pdf], [doi]  [abs]
  272. Reif, JH; Yoshida, A, Optical expanders with applications in optical computing., Applied optics, vol. 32 no. 2 (January, 1993), pp. 159-165, ISSN 1559-128X [pdf], [doi]  [abs]
  273. 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, vol. 28 no. 9 (January, 1993), pp. 948-953, Institute of Electrical and Electronics Engineers (IEEE) [pdf], [doi]  [abs]
  274. Reif, JH, Probabilistic parallel prefix computation, Computers and Mathematics with Applications, vol. 26 no. 1 (January, 1993), pp. 101-110, Elsevier BV, ISSN 0898-1221 [doi]  [abs]
  275. Pan, V; Reif, J, Fast and efficient parallel solution of sparse linear systems, SIAM Journal on Computing, vol. 22 no. 6 (January, 1993), pp. 1227-1250, Society for Industrial & Applied Mathematics (SIAM) [doi]  [abs]
  276. Parallel Algorithm Derivation and Program Transformation, edited by R. Paige, J. Reif, and R. Wachter (1993), Kluwer Academic Publishers
  277. Mills, PH; Nyland, LS; Prins, JF; Reif, JH, Prototyping N-body simulation in Proteus, Proceedings of the International Conference on Parallel Processing (December, 1992), pp. 476-482 [pdf]  [abs]
  278. John H. Reif and S. Tate, On Threshold Circuits and Polynomial Computation. SIAM Journal on Computing, Vol.21, No. 5, 896-908 (October, 1992) [pdf]
  279. S. Rajasekaran and John H. Reif, Nested Annealing: A Provable Improvement to Simulated Annealing. Journal of Theoretical Computer Science, 99(1):157-176 (June, 1992) [pdf]
  280. John H. Reif and S. Sen, Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems, SIAM Journal on Computing, Vol. 21, No. 3, pp. 466-485 (June, 1992) (see also Erratum: Optimal parallel randomized algorithms for three-dimensional convex hulls and related problems. SIAM Journal on Computing, 23(2):447-448, April 1994.) [pdf]
  281. Reif, JH; Sen, S, Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems, SIAM Journal on Computing, vol. 21 no. 3 (June, 1992), pp. 466-485, Society for Industrial & Applied Mathematics (SIAM) [doi]
  282. Rajasekaran, S; Reif, JH, Nested annealing: a provable improvement to simulated annealing, Theoretical Computer Science, vol. 99 no. 1 (June, 1992), pp. 157-176, Elsevier BV, ISSN 0304-3975 [doi]  [abs]
  283. Reif, JH; Sen, S, Optimal randomized parallel algorithms for computational geometry, Algorithmica, vol. 7 no. 1-6 (June, 1992), pp. 91-117, Springer Nature, ISSN 0178-4617 [pdf], [doi]  [abs]
  284. Pan, V; Reif, J, Compact Multigrid, SIAM Journal on Scientific and Statistical Computing, vol. 13 no. 1 (January, 1992), pp. 119-127, Society for Industrial & Applied Mathematics (SIAM) [doi]
  285. Markas, T; Reif, J, Quad tree structures for image compression applications, Information Processing and Management, vol. 28 no. 6 (January, 1992), pp. 707-721, Elsevier BV, ISSN 0306-4573 [doi]  [abs]
  286. Armon, D; Reif, J, Space and time efficient implementations of parallel nested dissection, 4th Annual ACM Symposium on Parallel Algorithms and Architectures (January, 1992), pp. 344-352 [doi]  [abs]
  287. Hightower, WL; Prins, JF; Reif, JH, Implementations of randomized sorting on large parallel machines, 4th Annual ACM Symposium on Parallel Algorithms and Architectures (January, 1992), pp. 158-167 [pdf], [doi]  [abs]
  288. 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 (January, 1992), pp. 353-362 [pdf], [doi]  [abs]
  289. Reif, JH; Tate, SR, On threshold circuits and polynomial computation, SIAM Journal on Computing, vol. 21 no. 5 (January, 1992), pp. 896-908, Society for Industrial & Applied Mathematics (SIAM) [doi]  [abs]
  290. V. Pan and John H. Reif, Compact Multigrid, SIAM Journal of Scientific and Statistical Computing, Vol. 13, No. 1, pp. 119-127 (1992) [pdf]
  291. Reif, J; Spirakis, P, Expected parallel time and sequential space complexity of graph and digraph problems, Algorithmica (New York), vol. 7 no. 5-6 (1992), pp. 597-630, Springer Nature, ISSN 0178-4617 [pdf], [doi]  [abs]
  292. G. Miller and John H. Reif, Parallel Tree Contraction Part II: Further Applications, SIAM Journal on Computing, Vol. 20, No. 6, pp. 1128-1147 (December, 1991) [pdf]
  293. Canny, J; Rege, A; Reif, J, An exact algorithm for kinodynamic planning in the plane, Discrete Computational Geometry, vol. 6 no. 1 (December, 1991), pp. 461-484, Springer Nature, ISSN 0179-5376 [pdf], [doi]  [abs]
  294. Pan, V; Reif, J, The parallel computation of minimum cost paths in graphs by stream contraction, Information Processing Letters, vol. 40 no. 2 (October, 1991), pp. 79-83, Elsevier BV, ISSN 0020-0190 [pdf], [doi]  [abs]
  295. Tassos Markas and John H. Reif, Quad Tree Structures for Image Compression Applications, special issue of Journal of Information Processing and Management, pp. 707-721 (April, 1991) [pdf]
  296. Reif, JH; Tygar, JD; Yoshida, A, The computability and complexity of optical beam tracing, IEEE Transactions on Industry Applications, vol. 27 no. 1 pt 1 (January, 1991), pp. 106-114 [pdf]  [abs]
  297. Storer, JA; Reif, JH, A parallel architecture for high-speed data compression, Journal of Parallel and Distributed Computing, vol. 13 no. 2 (January, 1991), pp. 222-227, Elsevier BV, ISSN 0743-7315 [doi]  [abs]
  298. Miller, GL; Reif, JH, Parallel tree contraction. Part 2. Further applications, SIAM Journal on Computing, vol. 20 no. 6 (January, 1991), pp. 1128-1147, Society for Industrial & Applied Mathematics (SIAM) [doi]  [abs]
  299. J.A. Storer and John H. Reif, A Parallel Architecture for High Speed Data Compression, Journal of Parallel and Distributed Computation, No. 13, pp 222-227 (1991) [pdf]
  300. J. Canny, A. Rege, and John H. Reif, An Exact Algorithm for Kinodynamic Planning in the Plane. Discrete and Computational Geometry, Vol. 6, pp. 461-484 (1991) [pdf]
  301. Storer, JA; Reif, JH, A parallel architecture for high speed data compression, undefined (December, 1990), pp. 238-243  [abs]
  302. Reif, JH; Sen, S, Randomized algorithms for binary search and load balancing on fixed connection networks with geometric applications, Algorithms and Architectures (December, 1990), pp. 327-337 [pdf]  [abs]
  303. Gazit, H; Reif, JH, Randomized parallel algorithm for planar graph isomorphism, Algorithms and Architectures (December, 1990), pp. 210-219  [abs]
  304. John H. Reif and S. Tate, Optimal Size Integer Division Circuits. SIAM Journal on Computing, Vol. 19, No. 5, pp. 912-924 (October, 1990) [pdf]
  305. P. Gacs and John H. Reif, A Simple Three-dimensional Real-time Reliable Cellular Array. Journal of Computer and System Sciences, Vol. 36, No. 2, pp. 125-147 (April, 1990) [pdf]
  306. John H. Reif and S. Smolka, Data Flow Analysis of Communicating Processes, International Journal of Parallel Programming, vol. 19 no. 1 (February, 1990) [pdf]
  307. D.W. Blevins, E.W. Davis, R.A. Heaton and John H. Reif, BLITZEN: A Highly Integrated Massively Parallel Machine. Journal of Parallel and Distributed Computing, Vol. 8, pp. 150-160 (February, 1990) [pdf]
  308. Reif, JH; Smolka, SA, Data flow analysis of distributed communicating processes, International Journal of Parallel Programming, vol. 19 no. 1 (February, 1990), pp. 1-30, Springer Nature, ISSN 0885-7458 [doi]  [abs]
  309. Canny, J; Rege, A; Reif, J, Exact algorithm for kinodynamic planning in the plane, undefined (January, 1990), pp. 271-280 [doi]  [abs]
  310. Pan, V; Reif, J, The bit-complexity of discrete solutions of partial differential equations: Compact multigrid, Computers and Mathematics with Applications, vol. 20 no. 2 (January, 1990), pp. 9-16, Elsevier BV, ISSN 0898-1221 [doi]  [abs]
  311. Blevins, DW; Dams, EW; Heaton, RA; Reif, JH, BLITZEN: A highly integrated massively parallel machine, Journal of Parallel and Distributed Computing, vol. 8 no. 2 (January, 1990), pp. 150-160, Elsevier BV, ISSN 0743-7315 [doi]  [abs]
  312. Reif, JH; Tate, SR, Optimal size integer division circuits, SIAM Journal on Computing, vol. 19 no. 5 (January, 1990), pp. 912-924, Society for Industrial & Applied Mathematics (SIAM) (Presented at meeting on Efficient Algorithms, Mathematisches Forschungsinstitut, W. Germany, September 1989.) [pdf], [doi]  [abs]
  313. V. Pan and John H. Reif, The Bit-Complexity of Discrete Solutions of Partial Differential Equations: Compact Multigrid, Computers and Mathematics with Applications, Vol. 20, No. 2, pp. 9-16 (1990) [pdf]
  314. J.A. Storer, T. Markas and John H. Reif, A Massively Parallel VLSI Design for Data Compression Using a Compact Dictionary, VLSI Signal Processing, No. 4, (edited by H.S. Moscovitz and K. Yao and R. Jain), Chapter 32, IEEE Press, New York, NY, pp. 329-338 (1990) [pdf]
  315. S. Rajasekaran and John H. Reif, Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms, SIAM Journal on Computing, Vol. 18, No. 3, pp. 594-607 (June, 1989) [pdf]
  316. D.E. Willard and John H. Reif, Parallel Processing can be Harmful: the Unusual Behavior of Interpolation Search, Journal of Information and Computation, Vol. 81, No. 3, pp. 364-379 (June, 1989) [pdf]
  317. V. Pan and John H. Reif, Fast and Efficient Solution of Path Algebra Problems, Journal of Computer and Systems Sciences, Vol. 38, No. 3, pp. 494-510 (June, 1989) [pdf]
  318. John H. Reif, S. Kasif, and D. Sherlekar, Formula Dissection: A Parallel Algorithm for Constraint Satisfaction. Computers and Mathematics with Applications, Vol. 5, pp. 1170-1177 (June, 1989) [pdf]
  319. Ramachandran, V; Reif, J, Optimal parallel algorithm for graph planarity, Annual Symposium on Foundations of Computer Science Proceedings (January, 1989), pp. 282-287 [doi]  [abs]
  320. Pan, V; Reif, J, Fast and efficient parallel solution of dense linear systems, Computers and Mathematics with Applications, vol. 17 no. 11 (January, 1989), pp. 1481-1491, Elsevier BV, ISSN 0898-1221 [pdf], [doi]  [abs]
  321. Reif, JH; Sen, S, Polling: A new randomized sampling technique for computational geometry, undefined (January, 1989), pp. 394-404 [pdf], [doi]  [abs]
  322. Willard, DE; Reif, JH, Parallel processing can be harmful: The unusual behavior of interpolation search, Information and Computation, vol. 81 no. 3 (January, 1989), pp. 364-379, Elsevier BV, ISSN 0890-5401 [doi]  [abs]
  323. Rajasekaran, S; Reif, JH, Optimal and sublogarithmic time randomized parallel sorting algorithms, SIAM Journal on Computing, vol. 18 no. 3 (January, 1989), pp. 594-607, Society for Industrial & Applied Mathematics (SIAM) [doi]  [abs]
  324. Pan, V; Reif, J, Fast and efficient solution of path algebra problems, Journal of Computer and System Sciences, vol. 38 no. 3 (January, 1989), pp. 494-510, Elsevier BV, ISSN 0022-0000 [doi]  [abs]
  325. Reif, JH; Tate, SR, Optimal size integer division circuits, undefined (January, 1989), pp. 264-273 [doi]  [abs]
  326. 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, vol. 401 LNCS (January, 1989), pp. 1-8, Springer Berlin Heidelberg [doi]  [abs]
  327. G. Miller and John H. Reif, Parallel Tree Contraction Part I: Fundamentals, Parallel Tree Contraction Part 1: Fundamentals. In Randomness and Computation, (Advances in Computing Research, Vol. 5., Silvio Micali, editor), pp. 47–72, JAI Press, Greenwich, Connecticut (1989) [pdf]
  328. John H. Reif and S. Sen, A Case for Randomized Parallel Algorithms. In Opportunities and Constraints of Parallel Computing, J.L.C. Sanz (ed.), Springer-Verlag New York, pp. 101-105 (1989) [pdf]
  329. Blevins, DW; Davis, EW; Heaton, RA; Reif, JH, BLITZEN: A highly integrated massively parallel machine, undefined (December, 1988), pp. 399-406 [pdf]  [abs]
  330. P. Klein and John H. Reif, An Efficient Parallel Algorithm for Planarity. Journal of Computer and System Sciences, Vol. 37, No. 2, pp. 190-246 (October, 1988) [pdf]
  331. P. Klein and John H. Reif, Parallel Time 0(log n) Time Acceptance of Deterministic CFLs on an Exclusive-Write P-RAM, SIAM Journal on Computing, Vol. 17, No. 3, pp. 463-485 (June, 1988) [pdf]
  332. John H. Reif and J.D. Tygar, Efficient Parallel Pseudo-random Number Generation, SIAM Journal on Computing, Vol. 17, No. 2, pp. 404-411 (April, 1988) [pdf]
  333. Gács, P; Reif, J, A simple three-dimensional real-time reliable cellular array, Journal of Computer and System Sciences, vol. 36 no. 2 (January, 1988), pp. 125-147, Elsevier BV, ISSN 0022-0000 [doi]  [abs]
  334. RAJASEKARAN, S; REIF, JH, NESTED ANNEALING - A PROVABLE IMPROVEMENT TO SIMULATED ANNEALING, LECTURE NOTES IN COMPUTER SCIENCE, vol. 317 (January, 1988), pp. 455-472, SPRINGER VERLAG (Also Presented at Workshop on Applications of Combinatorics and Graph Theory to Computer Science, Institute for Mathematics and its Applications, University of Minnesota, December 1987.) [pdf]
  335. Reif, JH; Tygar, JD, Efficient parallel pseudorandom number generation, SIAM Journal on Computing, vol. 17 no. 2 (January, 1988), pp. 404-411, Society for Industrial & Applied Mathematics (SIAM) [doi]  [abs]
  336. Reif, JH; Smolka, SA, The complexity of reachability in distributed communicating processes, Acta Informatica, vol. 25 no. 3 (January, 1988), pp. 333-354, Springer Nature America, Inc, ISSN 0001-5903 [pdf], [doi]  [abs]
  337. Klein, PN; Reif, JH, Parallel time O(log n) acceptance of deterministic CFLs on an exclusive-write P-RAM, SIAM Journal on Computing, vol. 17 no. 3 (January, 1988), pp. 463-485, Society for Industrial & Applied Mathematics (SIAM) [doi]  [abs]
  338. Klein, PN; Reif, JH, An efficient parallel algorithm for planarity, Journal of Computer and System Sciences, vol. 37 no. 2 (January, 1988), pp. 190-246, Elsevier BV, ISSN 0022-0000 [doi]  [abs]
  339. Canny, J; Reif, J; Donald, B; Xavier, P, On the complexity of kinodynamic planning, Annual Symposium on Foundations of Computer Science Proceedings (January, 1988), pp. 306-316 [doi]  [abs]
  340. 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, vol. 324 LNCS (January, 1988), pp. 85-92, Springer Verlag [doi]  [abs]
  341. S. Rajasekaran and John H. Reif, Randomized Parallel Computation. Chapter 11 of Concurrent Computations: Algorithms, Architecture and Technology, S.K. Tewksbury, B.W. Dickinson and S.C. Schwartz, ed., pp. 181-202 (1988) [pdf]
  342. Kasif, S; Reif, JH; Sherlekar, DD, FORMULA DISSECTION: A PARALLEL ALGORITHM FOR CONSTRAINT SATISFACTION., undefined (December, 1987), pp. 51-58, Seattle, WA [pdf]  [abs]
  343. Reif, JH; Sen, S, OPTIMAL RANDOMIZED PARALLEL ALGORITHMS FOR COMPUTATIONAL GEOMETRY., Proceedings of the International Conference on Parallel Processing (December, 1987), pp. 270-277  [abs]
  344. Opsahl, T; Reif, J, SOLVING VERY LARGE, SPARSE LINEAR SYSTEMS ON MESH-CONNECTED PARALLEL COMPUTERS., NASA Conference Publication (December, 1987), pp. 249-256, NASA, Goodard Space Flight Center, Greenbelt, MD [pdf]  [abs]
  345. Barakat, R; Reif, J, Polynomial convolution algorithm for matrix multiplication with application for optical computing., Applied optics, vol. 26 no. 14 (July, 1987), pp. 2707-2711, The Optical Society [doi]  [abs]
  346. Reif, JH, A topological approach to dynamic graph connectivity, Information Processing Letters, vol. 25 no. 1 (April, 1987), pp. 65-70, Elsevier BV, ISSN 0020-0190 [pdf], [doi]  [abs]
  347. Pan, V; Reif, JH, Response:solving linear equations., Science (New York, N.Y.), vol. 236 no. 4800 (April, 1987), pp. 462-463, ISSN 0036-8075 [doi]
  348. Barakat, R; Reif, J, Lower bounds on the computational efficiency of optical computing systems., Applied optics, vol. 26 no. 6 (March, 1987), pp. 1015-1018, The Optical Society [pdf], [doi]  [abs]
  349. L.G. Valiant and John H. Reif, A Logarithmic Time Sort for Linear Size Networks, Journal of the ACM(JACM), Vol. 34, No. 1, pp. 60-76 (January, 1987) [pdf]
  350. Reif, JH; Valiant, LG, A logarithmic time sort for linear size networks, Journal of the ACM Jacm, vol. 34 no. 1 (January, 1987), pp. 60-76, Association for Computing Machinery (ACM) [doi]  [abs]
  351. Reif, JH, ON THRESHOLD CIRCUITS AND POLYNOMIAL COMPUTATION., undefined (January, 1987), pp. 118-123 [pdf]  [abs]
  352. Canny, J; Reif, J, NEW LOWER BOUND TECHNIQUES FOR ROBOT MOTION PLANNING PROBLEMS., Annual Symposium on Foundations of Computer Science Proceedings (January, 1987), pp. 49-60, Los Angeles, CA [pdf], [doi]  [abs]
  353. Pan, V; Reif, J, SOME POLYNOMIAL AND TOEPLITZ MATRIX COMPUTATIONS., Annual Symposium on Foundations of Computer Science Proceedings (January, 1987), pp. 173-184 [doi]  [abs]
  354. Rajasekaran, S; Reif, JH, Randomized parallel computation, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, vol. 278 LNCS (January, 1987), pp. 364-376, Springer Berlin Heidelberg (Lecture Notes in Computer Science, Vol. 278, 1987, pp. 364-376.) [pdf], [doi]  [abs]
  355. Reif, JH; Storer, JA, Minimizing Turns for Discrete Movement in the Interior of a Polygon, IEEE Journal on Robotics and Automation, vol. 3 no. 3 (January, 1987), pp. 182-193 [doi]  [abs]
  356. R. Barakat and John H. Reif, Polynominal Convolution Algorithm for Matrix Multiplication with Application for Optical Computing, Journal of Applied Optics, vol. 26 no. 14 (July 15, 1987), pp. 2707-2711 [pdf]
  357. John H. Reif, Complexity of the Generalized Mover's Problem, Chapter 11 in Planning, Geometry and Complexity of Robot Motion, Jacob Schwartz, ed., Ablex Pub., Norwood, NJ, pp. 267-281 (1987) [pdf]
  358. Reif, JH; Storer, JA, MINIMIZING TURNS FOR DISCRETE MOVEMENT IN THE INTERIOR OF A POLYGON., IEEE journal of robotics and automation, vol. RA-3 no. 3 (1987), pp. 182-193, Institute of Electrical and Electronics Engineers (IEEE) [doi]  [abs]
  359. Reif, JH, SURVEY ON ADVANCES IN THE THEORY OF COMPUTATIONAL ROBOTICS., undefined (December, 1986), pp. 331-337  [abs]
  360. V. Pan and John H. Reif, Parallel Nested Dissection for Path Algebra Computations, Operations Research Letters, Vol. 5, No. 4, pp. 177-184 (October, 1986) [pdf]
  361. V. Pan and John H. Reif, Efficient Parallel Linear Programming, Operations Research Letters, Vol. 5, No. 3, pp. 127-135 (August, 1986) [pdf]
  362. John H. Reif and H.R. Lewis, Efficient Symbolic Analysis of Programs, in Journal of Computer and System Sciences, Vol. 32, No. 3, pp. 280-314 (June, 1986) [pdf]
  363. M. Ben-Or, D. Kozen, and John H. Reif, The Complexity of Elementary Algebra and Geometry, Journal of Computer and Systems Sciences, Vol. 32, No. 2, pp. 251-264 (April, 1986) [pdf]
  364. John H. Reif, Logarithmic Depth Circuits for Algebraic Functions, SIAM Journal on Computing, Vol. 15, No. 1, pp. 231-242 (February, 1986) [pdf]
  365. Ben-Or, M; Kozen, D; Reif, J, The complexity of elementary algebra and geometry, Journal of Computer and System Sciences, vol. 32 no. 2 (January, 1986), pp. 251-264, Elsevier BV, ISSN 0022-0000 [doi]  [abs]
  366. Pan, V; Reif, J, Efficient parallel linear programming, Operations Research Letters, vol. 5 no. 3 (January, 1986), pp. 127-135, Elsevier BV, ISSN 0167-6377 [doi]  [abs]
  367. Klein, PN; Reif, JH, EFFICIENT PARALLEL ALGORITHM FOR PLANARITY., Annual Symposium on Foundations of Computer Science Proceedings (January, 1986), pp. 465-477 [doi]  [abs]
  368. Homer, S; Reif, J, Arithmetic theories for computational complexity problems, Information and Control, vol. 69 no. 1-3 (January, 1986), pp. 1-11, Elsevier BV, ISSN 0019-9958 [pdf], [doi]  [abs]
  369. Reif, JH, LOGARITHMIC DEPTH CIRCUITS FOR ALGEBRAIC FUNCTIONS., SIAM Journal on Computing, vol. 15 no. 1 (January, 1986), pp. 231-242, Society for Industrial & Applied Mathematics (SIAM) [doi]  [abs]
  370. Reif, JH; Lewis, HR, Efficient symbolic analysis of programs, Journal of Computer and System Sciences, vol. 32 no. 3 (January, 1986), pp. 280-314, Elsevier BV, ISSN 0022-0000 [doi]  [abs]
  371. Pan, V; Reif, J, Parallel nested dissection for path algebra computations, Operations Research Letters, vol. 5 no. 4 (January, 1986), pp. 177-184, Elsevier BV, ISSN 0167-6377 [doi]  [abs]
  372. Pan, V; Reif, J, Fast and efficient linear programming and linear least-squares computations, Computers and Mathematics with Applications, vol. 12 no. 12 PART A (January, 1986), pp. 1217-1227, Elsevier BV, ISSN 0898-1221 [doi]  [abs]
  373. V. Pan and John H. Reif, Fast and Efficient Linear Programming and Linear Least-Squares Computations, Computers and Mathematics with Applications, Vol. 12A, No. 12, pp. 1217-1227 (1986) [pdf]
  374. Reif, JH; Willard, DE, PARALLEL INTERPOLATION SEARCH., Proceedings Annual Allerton Conference on Communication Control and Computing (December, 1985), pp. 821-829  [abs]
  375. Ravi Nair; Bruss, A; Reif, J, LINEAR TIME ALGORITHMS FOR OPTIMAL CMOS LAYOUT., undefined (December, 1985), pp. 327-338 (VLSI: Algorithms and Architectures, North-Holland Pub., pp. 327-338.) [pdf]  [abs]
  376. Reif, JH, Depth-first search is inherently sequential, Information Processing Letters, vol. 20 no. 5 (June, 1985), pp. 229-234, Elsevier BV, ISSN 0020-0190 [pdf], [doi]  [abs]
  377. John H. Reif and P. Spirakis, Unbounded Speed Variability in Distributed Communication Systems, SIAM Journal on Computing, Vol. 14, No. 1, pp. 75-92 (February, 1985) [pdf]
  378. John H. Reif and A.P. Sistla, A Multiprocess Network Logic with Temporal and Spatial Modalities, Journal of Computer and System Sciences, Vol. 30, No. 1, pp. 41-53 (February, 1985) [pdf]
  379. Gacs, P; Reif, JH, SIMPLE THREE-DIMENSIONAL REAL-TIME RELIABLE CELLULAR ARRAY., Conference Proceedings of the Annual ACM Symposium on Theory of Computing (January, 1985), pp. 388-395  [abs]
  380. Pan, V; Reif, J, EFFICIENT PARALLEL SOLUTION OF LINEAR SYSTEMS., Conference Proceedings of the Annual ACM Symposium on Theory of Computing (January, 1985), pp. 143-152, ACM Press, New York (Presented at the meeting on Efficient Algorithms, Mathematisches Forschungsinstitut, Oberwolfach, W. Germany, November 1984. Presented at 2nd SIAM Conference on Applied Linear Algebra, Raleigh, NC, April 1985.) [pdf], [doi]  [abs]
  381. Reif, J; Sharir, M, MOTION PLANNING IN THE PRESENCE OF MOVING OBSTACLES., Annual Symposium on Foundations of Computer Science Proceedings (January, 1985), pp. 144-154 [pdf], [doi]  [abs]
  382. Miller, GL; Reif, JH, PARALLEL TREE CONTRACTION AND ITS APPLICATION., Annual Symposium on Foundations of Computer Science Proceedings (January, 1985), pp. 478-489, Portland, OR (Harvard University TR-18-85.) [pdf], [doi]  [abs]
  383. Reif, JH, OPTIMAL PARALLEL ALGORITHM FOR INTEGER SORTING., Annual Symposium on Foundations of Computer Science Proceedings (January, 1985), pp. 496-504 [doi]  [abs]
  384. Reif, JH; Spirakis, PG, UNBOUNDED SPEED VARIABILITY IN DISTRIBUTED COMMUNICATIONS SYSTEMS., SIAM Journal on Computing, vol. 14 no. 1 (January, 1985), pp. 75-92, Society for Industrial & Applied Mathematics (SIAM) [doi]  [abs]
  385. Reif, J; Sistla, AP, A multiprocess network logic with temporal and spatial modalities, Journal of Computer and System Sciences, vol. 30 no. 1 (January, 1985), pp. 41-53, Elsevier BV, ISSN 0022-0000 [doi]  [abs]
  386. Reif, JH; Spirakis, PG, k-connectivity in random undirected graphs, Discrete Mathematics, vol. 54 no. 2 (January, 1985), pp. 181-191, Elsevier BV, ISSN 0012-365X [pdf], [doi]  [abs]
  387. Reif, J, PROBABILISTIC PARALLEL PREFIX COMPUTATION., Proceedings of the International Conference on Parallel Processing (December, 1984), pp. 291-298 [pdf]  [abs]
  388. John H. Reif, The Complexity of Two-Player Games of Incomplete Information. Journal of Computer and System Sciences, Vol. 29, No. 2, pp. 274-301 (October, 1984) [pdf]
  389. John H. Reif and P. Spirakis, Real-Time Synchronization of Interprocess Communications: ACM Journal of Transactions on Programming Languages and Systems, Vol. 6, No. 2, pp. 215-238 (April, 1984) [pdf]
  390. John H. Reif, Symmetric Complementation, Journal of the ACM(JACM), Vol. 31, No. 2, pp. 401-421 (April, 1984) [pdf]
  391. Reif, JH; Spirakis, PG, Real-Time Synchronization of Interprocess Communications, ACM Transactions on Programming Languages and Systems Toplas, vol. 6 no. 2 (April, 1984), pp. 215-238, Association for Computing Machinery (ACM) [doi]  [abs]
  392. Reif, JH, Symmetric Complementation, Journal of the ACM Jacm, vol. 31 no. 2 (March, 1984), pp. 401-421, Association for Computing Machinery (ACM) [doi]  [abs]
  393. John H. Reif, On Synchronous Parallel Computations with Independent Probabilistic Choice in SIAM Journal on Computing, Vol. 13, No. 1, pp. 46-56 (February, 1984) [pdf]
  394. Kao, G; Nikolaou, CN; Reif, J, ASSIGNING PROCESSES TO PROCESSORS: A FAULT-TOLERANT APPROACH., Digest of Papers Ftcs Fault Tolerant Computing Symposium (January, 1984), pp. 306-309, Kissimmee, FL [pdf]
  395. Reif, JH, ON SYNCHRONOUS PARALLEL COMPUTATIONS WITH INDEPENDENT PROBABILISTIC CHOICE., SIAM Journal on Computing, vol. 13 no. 1 (January, 1984), pp. 46-56, Society for Industrial & Applied Mathematics (SIAM) [doi]  [abs]
  396. Reif, JH, The complexity of two-player games of incomplete information, Journal of Computer and System Sciences, vol. 29 no. 2 (January, 1984), pp. 274-301, Elsevier BV, ISSN 0022-0000 [doi]  [abs]
  397. REIF, J; SPIRAKIS, P, PROBABILISTIC BIDDING GIVES OPTIMAL DISTRIBUTED RESOURCE-ALLOCATION, LECTURE NOTES IN COMPUTER SCIENCE, vol. 172 (1984), pp. 393-402 (Published in Lecture Notes in Computer Science, Vol. 172, pp. 391-402.) [pdf]
  398. Reif, J; Sistla, AP, MULTIPROCESS NETWORK LOGIC WITH TEMPORAL AND SPATIAL MODALITIES., Lecture Notes in Computer Science (December, 1983), pp. 628-639
  399. Reif, JH; Valiant, LG, LOGARITHMIC TIME SORT FOR LINEAR SIZE NETWORKS., Conference Proceedings of the Annual ACM Symposium on Theory of Computing (December, 1983), pp. 10-16
  400. John H. Reif, Minimum s-t Cut of Planar Undirected Network in 0 (n log^2n) Time, SIAM Journal on Computing, Vol. 12, No. 1, pp. 71-81 (February, 1983) [pdf]
  401. Reif, JH, Minimums-tCut of a Planar Undirected Network in $O(n\log ^2 (n))$ Time, SIAM Journal on Computing, vol. 12 no. 1 (February, 1983), pp. 71-81, Society for Industrial & Applied Mathematics (SIAM) [doi]
  402. Halpern, JY; Reif, JH, The propositional dynamic logic of deterministic, well-structured programs, Theoretical Computer Science, vol. 27 no. 1-2 (January, 1983), pp. 127-165, Elsevier BV, ISSN 0304-3975 [doi]  [abs]
  403. Reif, J, LOGARITHMIC DEPTH CIRCUITS FOR ALGEBRAIC FUNCTIONS., Annual Symposium on Foundations of Computer Science Proceedings (January, 1983), pp. 138-145 [pdf], [doi]
  404. J.Y. Halpern and John H. Reif, The Propositional Dynamic Logic of Deterministic, Well-Structured Programs, Journal of Theoretical Computer Science, Vol. 27, pp. 127-165 (1983) [pdf]
  405. Reif, J; Spirakis, P, REAL TIME RESOURCE ALLOCATION IN DISTRIBUTED SYSTEMS., undefined (December, 1982), pp. 84-94, ACM Press, ISBN 0897910818 [pdf], [doi]
  406. Reif, JH; Tarjan, RE, Symbolic Program Analysis in Almost-Linear Time, SIAM Journal on Computing, vol. 11 no. 1 (February, 1982), pp. 81-93, Society for Industrial & Applied Mathematics (SIAM) [pdf], [doi]
  407. Reif, J, PARALLEL TIME O(log N) ACCEPTANCE OF DETERMINISTIC CFLs., Annual Symposium on Foundations of Computer Science Proceedings (January, 1982), pp. 290-296 [doi]
  408. Halpern, JY; Reif, JH, PROPOSITIONAL DYNAMIC LOGIC OF DETERMINISTIC, WELL-STRUCTURED PROGRAM., Annual Symposium on Foundations of Computer Science Proceedings (December, 1981), pp. 322-334
  409. John H. Reif, Code Motion, SIAM Journal on Computing, vol. 9 no. 2 (May, 1980), pp. 375-395 [pdf]
  410. Reif, JH; Spirakis, PG, Random matroids, Proceedings of the Annual ACM Symposium on Theory of Computing, vol. 1980-April (April, 1980), pp. 385-397, ACM Press, ISSN 0737-8017 (Revised as Harvard University TR-28-81, Probabilistic Analysis of Random Extension-Rotation Algorithms.) [pdf], [doi]  [abs]
  411. Reif, JH, Logics for probabilistic programming, Proceedings of the Annual ACM Symposium on Theory of Computing, vol. 1980-April (April, 1980), pp. 8-13, ACM Press, ISSN 0737-8017 [pdf], [doi]  [abs]
  412. Reif, JH; Peterson, GL, A dynamic logic of multiprocessing with incomplete information, Conference Record of the Annual ACM Symposium on Principles of Programming Languages (January, 1980), pp. 193-202, ACM Press [doi]  [abs]
  413. Reif, JH, Data flow analysis of communicating processes - Extended abstract, Conference Record of the Annual ACM Symposium on Principles of Programming Languages (January, 1979), pp. 257-268, ACM Press [pdf], [doi]  [abs]
  414. Peterson, GL; Reif, JH, MULTIPLE-PERSON ALTERNATION., Annual Symposium on Foundations of Computer Science Proceedings (January, 1979), pp. 348-363 [pdf], [doi]  [abs]
  415. Reif, JH, COMPLEXITY OF THE MOVER'S PROBLEM AND GENERALIZATIONS., Annual Symposium on Foundations of Computer Science Proceedings (January, 1979), pp. 421-427 [pdf], [doi]  [abs]
  416. John H. Reif, Combinatorial Aspects of Symbolic Program Analysis. Ph.D. Thesis, Harvard University (July, 1977) [pdf]
  417. 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, vol. 23 no. 4 (January, 1977), pp. 425-445, Elsevier BV, ISSN 0021-9991 [pdf], [doi]  [abs]

Journal or Book articles OFFICIALLY ACCEPTED

  1. 66. Harish Chandran, Nikhil Gopalkrishnan, Bernard Yurke, John Reif, Meta-DNA: A DNA-Based Approach to Synthetic Biology, Chapter in, in Systems and Synthetic Biology: A Systematic Approach, edited by K. Raman, G.B. Stan and V. Kulkarni (2013), Springer
  2. 68. Hieu Bui, Harish Chandran, Sudhanshu Garg, Nikhil Gopalkrishnan, Nikhil Gopalkrishnan, Reem Mokhtar, Tianqi Song and John H Reif, DNA Computing, Chapter in, in Computing Handbook, Volume I: Computer Science and Software Engineering, Section 3: Architecture and Organization, edited by Teofilo F. Gonzalez (2013), Taylor & Francis Group
  3. Harish Chandran, Nikhil Gopalkrishnan, and John Reif, DNA NanoRobotics, Chapter, in Nanorobotics: Current Approaches and Techniques, edited by Constantinos Mavroidis and Antoine Ferreira (December, 2012), Springer-Verlag, New York, NY, ISBN 13: 9781461421184, ISBN 10: 1461421187
  4. Harish Chandran, Nikhil Gopalkrishnan, John Reif, The Tile Complexity of Linear Assemblies, SIAM Journal of Computation (SICOMP) (2012) [pdf]

Journal or Book articles being REFEREED

  1. Nikhil Gopalkrishnan, Harish Chandran and John Reif, 2D and 3D DNA Lattices Via Staggered Assembly of the Double-Decker Tile, Nano Letters (2012)
  2. Urmi Majumder and John H. Reif, Barcoded Magnetic Tiles for Complex Programmable Assemblies (2010)

Conference articles PUBLISHED

  1. Narayanan, RP; Fu, D; Zhang, F; Williams, D; Schreck, J; Reif, J; Yan, H, Autonomous Design of Biomimetic 3D DNA Origami Capsules, 17th Annual Conference on Foundations of Nanoscience Fnano 2020 Self Assembled Architectures and Devices (January, 2020), pp. 164-165
  2. Shah, S; Song, T; Song, X; Yang, M; Reif, J, Implementing Arbitrary CRNs Using Strand Displacing Polymerase, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, vol. 11648 LNCS (January, 2019), pp. 21-36, ISBN 9783030268060 [doi]  [abs]
  3. Shah, S; Reif, J, Temporal DNA barcodes: A time-based approach for single-molecule imaging, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, vol. 11145 LNCS (January, 2018), pp. 71-86, Springer International Publishing, ISBN 9783030000295 [doi]  [abs]
  4. Nikhil Gopalkrishnan, Harish Chandran and John Reif, High-Fidelity DNA Hybridization using Programmable Molecular DNA Devices, International Conference on DNA Computing and Molecular Programming, (DNA16), Hong Kong University of Science and Technology. Hong Kong, China, edited by Yasubumi Sakakibara and Mi Yongli, Lecture Notes for Computer Science (LNCS), NYC, NY, (edited by Yasubumi Sakakibara and Lloyd Smith), Springer-Verlag, New York, vol. 6516 (February, 2012), pp. 59-70, Springer-Verlag, LNCS 6518, New York [pdf]
  5. Sam Slee and John H. Reif, Robomotion: Scalable, Physically Stable Locomotion for Self-Reconfigurable Robots, Workshop on the Algorithmic Foundations of Robotics(WAFR 2010), Singapore, Springer (December, 2010)
  6. John H. Reif and Urmi Majumder, 234. John H. Reif and Urmi Majumder, Design of a Biomolecular Device that Executes Process Algebra, Fifteenth International Meeting on DNA Computing and Molecular Programming (DNA15), Fayetteville, Arkansas (June 8-11, 2009). Lecture Notes for Computer Science (LNCS), Vol 5877, NYC, NY, (edited by Russell Deaton and Jin-Woo Kim), Springer-Verlag, New York, pp 107-105 (June, 2009)
  7. Sahu, S; Yin, P; Reif, JH, A self-assembly model of time-dependent glue strength, Natural Computing Series no. 9783540888680 (January, 2009), pp. 185-204, Springer Berlin Heidelberg, ISBN 9783540888680 [doi]  [abs]
  8. John H. Reif and Urmi Majumder, Isothermal Reactivating Whiplash PCR for Locally Programmable Molecular Computation, Fourteenth International Meeting on DNA Based Computers (DNA14), Prague, Czech Republic (June, 2008). Lecture Notes for Computer Science (LNCS), NYC, NY, (edited by Ashish Goel and Friedrich C. Simmel), Springer-Verlag, New York (2009) [pdf]
  9. Yin, P; Hariadi, RF; Sahu, S; Choi, HMT; Park, S; LaBean, TH; Winfree, E; Reif, JH, BIOT 349-Programming molecular tube circumferences, ABSTRACTS OF PAPERS OF THE AMERICAN CHEMICAL SOCIETY, vol. 236 (August, 2008), pp. 1 pages, AMER CHEMICAL SOC
  10. John H. Reif and Sam Slee, Asymptotically Optimal Kinodynamic Motion Planning for Self-Reconfigurable Robots, Seventh International Workshop on the Algorithmic Foundations of Robotics (WAFR2006), NYC, New York, July 16-18, 2006, in Algorithmic Foundation of Robotics VII, Springer Tracts in Advanced Robotics (Edited by S. Akella, N.M. Amato, W.H. Huang, B. Mishra), Volume 47, Springer-Verlag Berlin, pp. 457–472 (August, 2008) [pdf]
  11. Reif, J; Slee, S, Optimal kinodynamic motion planning for 2D reconfiguration of self-reconfigurable robots, Robotics Science and Systems, vol. 3 (January, 2008), pp. 153-160, ISBN 9780262524841 [doi]  [abs]
  12. Urmi Majumder and John H. Reif, A Framework for Designing Novel Magnetic Tiles Capable of Complex Self-Assemblies, Conference on Unconventional Computation, Vienna, Austria, Aug 25-26, 2008. Published in Unconventional Computing, Lecture Notes in Computer Science number 105633, Springer, Berlin Heidelberg (2008) [pdf]
  13. Urmi Majumder, Thomas H LaBean, and John H. Reif, Activatable Tiles for Compact Error-Resilient Directional Assembly. 13th International Meeting on DNA Computing (DNA 13), Memphis, Tennessee, June 4-8, 2007. Published as Activatable Tiles: Compact, Robust Programmable Assembly and Other Applications, in DNA Computing: DNA13 (edited by Max Garzon and Hao Yan), Springer-Verlag Lecture Notes for Computer Science (LNCS), Springer, Berlin Heidelberg, Volume 4848, pp. 15-25 (2008) [pdf]
  14. Sun, Z; Reif, JH, On robotic optimal path planning in polygonal regions with pseudo-Euclidean metrics., IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society, vol. 37 no. 4 (August, 2007), pp. 925-936, Institute of Electrical and Electronics Engineers (IEEE), ISSN 1083-4419 [doi]  [abs]
  15. John H. Reif and Sam Slee, Optimal Kinodynamic Motion Planning for Self-Reconfigurable Robots Between Arbitrary 2D Configurations, Robotics: Science and Systems Conference, Georgia Institute of Technology, Atlanta, GA (June 27-30, 2007) [pdf]
  16. Ashish Gehani and John H. Reif, Ashish Gehani and John H. Reif, Parameterizing Super-resolution Forensic Analysis of Video, 3rd IFIP International Conference on Digital Forensics, Orlando, FL (January 28-31, 2007) [pdf]
  17. John H. Reif and Thomas H. LaBean, Autonomous Programmable Biomolecular Devices Using Self-Assembled DNA Nanostructures, invited paper, Fourteenth Workshop on Logic, Language, Information and Computation (WoLLIC'2007), Rio de Janeiro, Brazil, July 2-5, 2007, Springer-Verlag Lecture Notes for Computer Science (LNCS), Volume 4576-0297, pp. 297-306 (2007) [pdf]
  18. John H. Reif and Sudheer Sahu, Autonomous Programmable DNA Nanorobotic Devices Using DNAzymes, 13th International Meeting on DNA Computing (DNA 13), Memphis, Tennessee, June 4-8, 2007. In DNA Computing: DNA13 (edited by Max Garzon and Hao Yan), Springer-Verlag Lecture Notes for Computer Science (LNCS), Springer, Berlin Heidelberg, Volume 4848, pp. 66-78 (2007) [pdf]
  19. John H. Reif, Sudheer Sahu, and Peng Yin, Complexity of Graph Self-Assembly in Accretive Systems and Self-Destructible Systems, Eleventh International Meeting on DNA Based Computers (DNA11), London, Ontario, Canada (June, 2005). Springer-Verlag Lecture Notes for Computer Science (LNCS), NYC, NY, (edited by Alessandra Carbone and Niles Pierce), Vol. 3892, Springer-Verlag, New York, pp. 257-274 (2006) [pdf]
  20. Peng Yin, Andrew J. Turberfield, John H. Reif, Design of Autonomous DNA Cellular Automata, Eleventh International Meeting on DNA Based Computers (DNA11), London, Ontario, Canada (June, 2005). Springer-Verlag Lecture Notes for Computer Science (LNCS), NYC, NY, (edited by Alessandra Carbone and Niles Pierce), Vol. 3892, Springer-Verlag, New York, pp. 399-416 (2006) [pdf]
  21. Sudheer Sahu, Peng Yin and John H. Reif, A Self-Assembly Model of Time-Dependent Glue Strength, Eleventh International Meeting on DNA Based Computers (DNA11), London, Ontario, Canada (June, 2005). Springer-Verlag Lecture Notes for Computer Science (LNCS), NYC, NY, (edited by Alessandra Carbone and Niles Pierce), Vol. 3892, Springer-Verlag, New York, pp. 290-304 (2006) [pdf]
  22. Sudheer Sahu and John H. Reif, Capabilities and Limits of Compact Error Resilience Methods for Algorithmic Self-Assembly in Two and Three Dimensions, 12th International Meeting on DNA Computing (DNA 12), Seoul, Korea, June 5-9, 2006. Published in DNA Computing: DNA12, Springer-Verlag Lecture Notes for Computer Science (LNCS), Volume 4287 (edited by Chengde Mao and Takashi Yokomori), Springer, Berlin Heidelberg, pp. 223-238 (2006) [pdf]
  23. Sudheer Sahu, Bei Wang, Peng Yin, John H. Reif, A Framework for Modeling DNA based Molecular Systems, 12th International Meeting on DNA Computing (DNA 12), Seoul, Korea, June 5-9, 2006. Published in DNA Computing: DNA12, Springer-Verlag Lecture Notes for Computer Science (LNCS), Volume 4287 (edited by Chengde Mao and Takashi Yokomori), Springer, Berlin Heidelberg, pp. 250-265 (2006) [pdf]
  24. Urmi Majumder, Sudheer Sahu, Thomas LaBean, and John H. Reif, Design and Simulation of Self-Repairing DNA Lattices, 12th International Meeting on DNA Computing (DNA 12), Seoul, Korea, June 5-9, 2006. Published in DNA Computing: DNA12, Springer-Verlag Lecture Notes for Computer Science (LNCS), Volume 4287 (edited by Chengde Mao and Takashi Yokomori), Springer, Berlin Heidelberg, pp. 195–214 (2006) [pdf]
  25. Reif, JH; Sahu, S; Yin, P, Compact Error-Resilient Computational DNA Tilings., edited by Chen, J; Jonoska, N; Rozenberg, G, Nanotechnology: Science and Computation (2006), pp. 79-103, Springer, ISBN 978-3-540-30295-7
  26. John H. Reif, Thomas LaBean, Sudheer Sahu, Hao Yan, Peng Yin, Design, Simulation, and Experimental Demonstration of Self-Assembled DNA Nanostructures and DNA Motors, in Unconventional Programming Paradigms: International Workshop UPP 2004, Le Mont Saint Michel, France, September 15-17, 2004, Lecture Notes for Computer Science (LNCS) 3566, pp. 173-187 (2005), Published by Springer-Verlag Berlin Heidelberg, edited by Jean-Pierre Banâtre, Pascal Fradet, Jean-Louis Giavitto, Olivier Michel [pdf]
  27. John H. Reif, Sudheer Sahu, Peng Yin, Compact Error-Resilient Computational DNA Tiling Assemblies, Tenth International Meeting on DNA Based Computers (DNA10), Milano, Italy, June 7-10, 2004. Lecture Notes in Computer Science (Edited by C Ferretti, G. Mauri and C. Zandron), Vol. 3384, Springer-Verlag, New York, (2005), pp 293-307., Tenth International Meeting on DNA Based Computers (DNA10), Milano, Italy, June 7-10, 2004. Lecture Notes in Computer Science (Edited by C Ferretti, G. Mauri and C. Zandron), Vol. 3384, Springer-Verlag, New York, pp. 293-307 (June 7-10, 2004) [pdf]
  28. Hao Yan, Peng Yin, Sung Ha Park, Hanying Li, Liping Feng, Xiaoju Guan, Dage Liu, John H. Reif, & Thomas H. LaBean, Self-Assembled DNA Structures for Nanoconstruction. International Symposium on DNA-Based Molecular Electronics, Jena, Germany. Fritzsche, W. eds. AIP Conference Proceedings, 725, American Institute of Physics. pp. 43-52. (May, 2004) [pdf]
  29. Yan, H; Yin, P; Park, SH; Li, HY; Feng, LP; Guan, XJ; Liu, DG; Reif, JH; LaBean, TH, Self-assembled DNA structures for nanoconstruction, edited by Fritzsche, W, DNA-BASED MOLECULAR ELECTRONICS, vol. 725 (January, 2004), pp. 43-52, AMER INST PHYSICS, ISBN 0-7354-0206-X
  30. Peng Yin, Andrew J. Turberfield, Sudheer Sahu, John H. Reif, Designs for Autonomous Unidirectional Walking DNA Devices, Tenth International Meeting on DNA Based Computers (DNA10), Milano, Italy, June 7-10, 2004. Lecture Notes in Computer Science (Edited by C Ferretti, G. Mauri and C. Zandron), Vol. 3384, Springer-Verlag, New York, pp 410-425 (June 7-10, 2004) [pdf]
  31. Ahn, SJ; Park, SH; Yan, H; Reif, JH; LaBean, TH, Step-wise assembly of DNA tilings and their applications., ABSTRACTS OF PAPERS OF THE AMERICAN CHEMICAL SOCIETY, vol. 226 (September, 2003), pp. U437-U437, AMER CHEMICAL SOC
  32. Hao Yan, Sung Ha Park, Liping Feng, John Reif, and Thomas H. LaBean, Self-Assembly and Metallization of a Novel DNA Nanostructure Motif, in Ninth International Meeting on DNA Based Computers (DNA9), Lecture Notes in Computer Science, edited by Junghuei Chen and John Reif (June, 2003), Springer-Verlag [pdf]
  33. LaBean, TH; Yan, H; Park, SH; Feng, LP; Yin, P; Li, HY; Ahn, SJ; Liu, D; Guan, XJ; Reif, JH, Overview of new structures for DNA-Based nanofabrication and computation, edited by Chen, SH; Cheng, HD; Chiu, DKY; Das, S; Duro, R; Kerre, EE; Leong, HV; Li, Q; Lu, M; Romay, MG; Ventura, D; Wu, J, PROCEEDINGS OF THE 7TH JOINT CONFERENCE ON INFORMATION SCIENCES (January, 2003), pp. 1475-1478, ASSOC INTELLIGENT MACHINERY, ISBN 0-9707890-2-5
  34. Junghuei Chen and John Reif, Ninth International Meeting on DNA Based Computers (DNA9), Madison, Wisconsin, June 2-4, 2003, Lecture Notes in Computer Science Vol. 2943, Springer-Verlag, New York, Lecture Notes in Computer Science (2003), Springer-Verlag
  35. Hao Yan, Liping Feng, Thomas H. LaBean, and John H. Reif, DNA Nanotubes, Parallel Molecular Computation of Pair-Wise XOR Using DNA String Tile, edited by Junghuei Chen and John Reif, Ninth International Meeting on DNA Based Computers (DNA9), Madison, Wisconsin (June 2-4, 2003) (Abstract to appear in Lecture Notes in Computer Science, Springer-Verlag, New York.)
  36. D. Hsu, T. Jiang, John H. Reif, and Z. Sun, The Bridge Test for Sampling Narrow Passages with Probabilistic Roadmap Planners, 2003 IEEE International Conference on Robotics and Automation(ICRA2003), Taipei, Taiwan, Vol.3, pp. 4420 – 4426 (Sept. 14-19, 2003) [pdf]
  37. Reif, JH; LaBean, TH; Pirrung, M; Rana, VS; Guo, B; Kingsford, C; Wickham, GS, Experimental construction of very large scale DNA databases with associative search capability, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, vol. 2340 (January, 2002), pp. 231-247, ISSN 0302-9743, ISBN 3540437754 [pdf], [doi]  [abs]
  38. Z. Sun and John H. Reif, BUSHWHACK: An approximation algorithm for minimal paths through pseudo-Euclidean spaces, Proceedings of the 12th Annual International Symposium on Algorithms and Computation (ISAAC01), Christchurch, New Zealand (December, 2001)
  39. John H. Reif and Z. Sun, Movement planning in the presence of flows, Proceedings of the 7th International Workshop on Algorithms and Data Structures (WADS2001) of Lecture Notes in Computer Science, vol. 2125 (August, 2001), pp. 450-461 [pdf]
  40. Seeman, NC; Mao, CD; LaBean, T; Reif, JH, XOR operations by algorithmic assembly of DNA tiles, BIOPHYSICAL JOURNAL, vol. 80 no. 1 (January, 2001), pp. 10A-10A, BIOPHYSICAL SOCIETY
  41. Reif, J; Sun, Z, An efficient approximation for weighted region shortest path problem, edited by Donald, BR; Lynch, KM; Rus, D, ALGORITHMIC AND COMPUTATIONAL ROBOTICS: NEW DIRECTIONS (January, 2001), pp. 191-203, A K PETERS, LTD, ISBN 1-56881-125-X
  42. Reif, JH; LaBean, TH; Seeman, NC, Challenges and applications for self-assembled DNA nanostructures, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, vol. 2054 (January, 2001), pp. 173-198, Springer Berlin Heidelberg, ISBN 9783540420767 [pdf], [doi]  [abs]
  43. Reif, JH; LaBean, TH, Computationally inspired biotechnologies: Improved DNA synthesis and associative search using error-correcting codes and vector-quantization, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, vol. 2054 (January, 2001), pp. 145-172, Springer Berlin Heidelberg, ISBN 9783540420767 [pdf], [doi]  [abs]
  44. Reif, J; Sun, Z, Movement planning in the presence of flows, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, vol. 2125 (January, 2001), pp. 450-461, Springer Berlin Heidelberg, ISBN 9783540424239 [doi]  [abs]
  45. John H. Reif, T.J. LaBean, M. Pirrung, V. Rana, B. Guo, K. Kingsford, and G. Wickham, Experimental Construction of Very Large Scale DNA Databases with Associative Search Capability, Seventh International Meeting on DNA Based Computers (DNA7), Tampa, FL (June 11-13, 2001) (Lecture Notes in Computer Science, Springer-Verlag, New York, Volume 2340, pages 231-247, (2002).) [pdf]
  46. John H. Reif and T.H. LaBean, and N.C. Seeman, Programmable Assembly at the Molecular Scale: Self-Assembly of DNA Lattices, edited by Lee Beom, Invited paper, 2001 IEEE International Conference on Robotics and Automation (ICRA2001), Seoul, Korea (May 2001) [pdf]
  47. John H. Reif and Z. Sun, An efficient approximation algorithm for weighted region shortest path problem, Proceedings of the 4th Workshop on Algorithmic Foundations of Robotics (WAFR1000) (March 16-18, 2000), pp. 191-203, A.K. Peters Ltd., Hanover, New Hampshire [pdf]
  48. T. H. LaBean, E. Winfree, and John H. Reif, Experimental Progress in Computation by Self-Assembly of DNA Tilings, Proceeding of DNA Based Computers V: Cambridge, MA, June 14-16, 1999. Published in DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Volume 54, edited by E. Winfree and D.K. Gifford, American Mathematical Society, Providence, RI, pp. 123-140 (2000) [pdf]
  49. John H. Reif, Local Parallel Biomolecular Computation, edited by H. Rubin and D.H. Wood, American Mathematical Society, Providence, RI, Proc. DNA-Based Computers, III: University of Pennsylvania, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 48 (1999), pp. 217-254 [pdf]
  50. Gehani, A., T.H. LaBean, and John H. Reif, DNA-based Cryptography, Proc. DNA Based Computers V: Cambridge, MA (June 14-16, 1999) (Published in DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Volume 54, edited by E. Winfree and D.K. Gifford, American Mathematical Society, Providence, RI, pp. 233-249, (2000).) [pdf]
  51. John Fischer and John H. Reif, Nonparametric Multiscale Multimodal Model for Detection/Recognition, Multi-Modality Image Fusion Conference, Rochester, NY (October 6-7, 1999) [pdf]
  52. John H. Reif, Alternative Computational Models: A Comparison of Biomolecular and Quantum Computation, Invited paper, 18th International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS1998), Chennai, India (December, 1998) [pdf]
  53. Reif, JH, Alternative computational models: A comparison of biomolecular and quantum computation extended abstract, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, vol. 1530 LNCS (December, 1998), pp. 102-126, Springer Berlin Heidelberg, ISSN 0302-9743, ISBN 9783540653844 [Gateway.cgi], [doi]  [abs]
  54. John H. Reif and Z. Sun, The Computational Power of Frictional Mechanical Systems, Third International Workshop on Algorithmic Foundaitons of Robotics, (WAFR98) (March 5-7, 1998), pp. 223-236, A.K. Peters Ltd., Houston, Texas [pdf]
  55. John H. Reif, Robust, Adaptive and Dynamic Robotic Motion Planning, 19th NSF Design and Manufacturing Grantees Conference, Monterrey, Mexico (January, 1998) [pdf]
  56. Reif, J; Sun, Z, The computational power of frictional mechanical systems, edited by Agarwal, PK; Kavraki, LE; Mason, MT, ROBOTICS: THE ALGORITHMIC PERSPECTIVE (January, 1998), pp. 223-236, A K PETERS, LTD, ISBN 1-56881-081-4
  57. Reif, J; Wang, H, The complexity of the two dimensional curvature-constrained shortest-path problem, ROBOTICS: THE ALGORITHMIC PERSPECTIVE (1998), pp. 49-57, A.K. Peters Ltd., Houston, Texas, ISBN 1-56881-081-4 [pdf]
  58. John H. Reif, Approximate Complex Polynomial Evaluation in Near Constant Work Per Point. Proc. 29th ACM Symposium on Theory of Computing (STOC97), El Paso, Texas, pp. 30-39 (May, 1997) [pdf]
  59. S. Chen and John H. Reif, Fast and Compact Fast and Compact Volume Rendering in the Compressed Transform, Proceedings: IEEE Data Compression Conference (DCC'97) Snowbird, UT, James A. Storer, Martin Cohn (Eds.), IEEE Computer Society Press, pp. 271-280 (March, 1997) [pdf]
  60. Reif, J; Wang, HY, Non-uniform discretization approximations for kinodynamic motion planning and its applications, ALGORITHMS FOR ROBOTIC MOTION AND MANIPULATION (1997), pp. 97-112, ISBN 1-56881-067-9
  61. S. Gupta, Z. Li, and John H. Reif, Synthesizing Efficient Out-of-Core Programs for Block Recursive Algorithms using Block-Cyclic Data Distributions, Proceedings of the 1996 International Conference on Parallel Processing, vol. II (August, 1996), pp. 142-149 [pdf]
  62. John H. Reif and H. Wang, Nonuniform Discretization for Kinodynamic motion planning and its applications, Workshop on Foundations of Robotics, Toulouse, France, pp. 97-112 (July, 1996) [pdf]
  63. Nyland, L; Prins, J; Goldberg, A; Mills, P; Reif, J; Wagner, R, A refinement methodology for developing Data-Parallel applications, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, vol. 1123 (January, 1996), pp. 145-150, Springer-Verlag, ISBN 9783540616269 (Lecture Notes in Computer Science.) [pdf], [doi]  [abs]
  64. Li, Z; Reif, JH; Gupta, KS, Synthesizing efficient out-of-core programs for block recursive algorithms using block-cyclic data distributions, Proceedings of the International Conference on Parallel Processing, vol. 2 (January, 1996), pp. II142-II149, ISBN 081867623X [doi]  [abs]
  65. S. Chen and John H. Reif, Compression of Trees and Digraphs, Abstract, edited by James A. Storer, Martin Cohn, Proceedings: IEEE Data Compression Conference (DCC'96), Snowbird, UT (March 1996), IEEE Computer Society Press [pdf]
  66. J. Rolland and A. Yoshida, and John H. Reif, Optical design and analysis of a head-mounted display with a high-resolution insert, (Novel Optical Systems Design and Optimization, Jose M. Sasian; Ed.), Proc. SPIE Vol. 2537, pp. 71-82 (August, 1995) [pdf]
  67. John H. Reif, Parallel Molecular Computation: Models and Simulations, Proceedings: 7th Annual ACM Symposium on Parallel Algorithms and Architectures 9SPAA'95) Santa Barbara, CA (July, 1995), pp. 213-223 [pdf]
  68. S. Chen and John H. Reif, Pattern Matching for Entropy Bounded Text, edited by James A. Storer, Martin Cohn, Proceedings: IEEE Data Compression Conference (DCC'95), Snowbird, UT (March, 1995), pp. 282-301 [pdf]
  69. REIF, JH; WANG, HY, Social potential fields: A distributed behavioral control for autonomous robots, edited by Goldberg, K; Halperin, D; Latombe, JC; Wilson, R, ALGORITHMIC FOUNDATIONS OF ROBOTICS (January, 1995), pp. 331-345, A K PETERS, LTD, ISBN 1-56881-045-8
  70. Nikoletseas, S; Reif, J; Spirakis, P; Yung, M, Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, vol. 944 (January, 1995), pp. 160-170, Springer Berlin Heidelberg, ISBN 9783540600848 [doi]  [abs]
  71. John H. Reif, Work Efficient Parallel Solution of Toeplitz Systems and Polynomial GCD, Proc. of the 27th ACM Symposium on Theory of Computing (STOC 95), Las Vegas, NV (May 29-June 1, 1995), pp. 751-761, ACM Press, New York [pdf]
  72. S. Gupta, Z. Li, and John H. Reif, Generating Efficient Programs for Two-Level Memories from Tensor-Products, Proceedings of the 7th IASTED/ISMM International Conference on Parallel and Distributed Computing and Systems, Washington, D.C. (October 1995), pp. 510-513 [pdf]
  73. Neff, A. and John H. Reif, An 0(n^{1+epsilon} logb) Algorithm for the Complex Roots Problem, 35th Annual IEEE Conference on Foundations of Computer Science (FOCS'94) Proceedings, Santa Fe, NM (November, 1994), pp. 540-547 [pdf]
  74. Reif, JH; Tate, SR, Dynamic parallel tree contraction (extended abstract), Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures Spaa 1994 (August, 1994), pp. 114-121, ACM Press, ISBN 9780897916714 [doi]  [abs]
  75. Reif, JH, O(log2n) time efficient parallel factorization of dense, sparse separable, and banded matrices, Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures Spaa 1994 (August, 1994), pp. 278-289, ACM Press, ISBN 9780897916714 [doi]  [abs]
  76. John H. Reif, 0(log² n) Time Efficient Parallel Factorization of Dense, Sparse Separable, and Banded Matrices, 5th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'94), Cape May, NJ (June, 1994), pp. 114-121 [pdf]
  77. John H. Reif and S.R. Tate, Dynamic Parallel Tree Contraction, 5th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'94), Cape May, NJ (June, 1994), pp. 114-121 [pdf]
  78. John H. Reif and H. Wang, Social Potential Fields: A Distributed Behavioral Control for Autonomous Robots, Workshop on Algorithmic Foundations of Robotics (WAFR'94), San Francisco, California, February, 1994; The Algorithmic Foundations of Robotics, pp. 431-459, A.K.Peters, Boston, MA. 1995 (February, 1994) [pdf]
  79. Reif, JH; Yoshida, A, Free space optical message routing for high performance parallel computers, Proceedings of the 1st International Workshop on Massively Parallel Processing Using Optical Interconnections MPPOI 1994 (January, 1994), pp. 37-44, ISBN 9780818658327 [doi]  [abs]
  80. Neff, CA; Reif, JH, An O(n1+ε log B) algorithm for the complex roots problem, Proceedings Annual IEEE Symposium on Foundations of Computer Science Focs (January, 1994), pp. 540-547 [doi]  [abs]
  81. S. Chen and John H. Reif, Using Difficulty of Prediction to Decrease Computation: Fast Sort, Priority Queue and Convex Full on Entropy Bounded Inputs, 34th Annual IEEE Conference on Foundations of Computer Science (FOCS'93) Proceedings, Palo Alto, CA (November, 1993), pp. 104-112 [pdf]
  82. John H. Reif and H. Wang, On Line Navigation Through Regions of Variable Densities, ARO Computational Geometry Workshop, Raleigh, North Carolina (October, 1993) (Rewritten as On-Line Navigation Through Weighted Regions.) [pdf]
  83. Cheriyan, J; Reif, JH, Parallel and output sensitive algorithms for combinatorial and linear algebra problems, Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures Spaa 1993 (August, 1993), pp. 50-56, ACM Press, ISBN 9780897915991 [doi]  [abs]
  84. J. Cheriyan and John H. Reif, Parallel and Output Sensitive Algorithms for Combinational and Linear Algebra Problems, 4th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'93), Velon, Germany (July, 1993), pp. 50-56 [pdf]
  85. S. Nikoletseas, John H. Reif, P.G. Spirakis, and M. Yung, Stochastic Graphs Have Short Memory: Fully Dynamic Connectivity in Poly-Log Expected Time, Proceedings of the 22nd Annual Colloquium on Automata, Languages and Programming (ICALP'95), Szeged, Hungary, pp. 159-170 (July, 1993) [pdf]
  86. S.R. Tate and John H. Reif, The Complexity of N-body Simulation, Proceedings of the 20th Annual Colloquium on Automata, Languages and Programming (ICALP'93), Lund, Sweden (July, 1993), pp. 162-176 [pdf]
  87. Reif, JH; Tate, SR, The complexity of N-body simulation, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, vol. 700 LNCS (January, 1993), pp. 162-176, ISBN 9783540569398 [doi]  [abs]
  88. Armon, D; Reif, J, A dynamic separator algorithm, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, vol. 709 LNCS (January, 1993), pp. 108-118, ISBN 9783540571551 [doi]  [abs]
  89. Markas, T; Reif, J, Multispectral image compression algorithms, edited by James A. Storer, Martin Cohn, Data Compression Conference Proceedings (January, 1993), pp. 391-400, IEEE Computer Society Press, ISBN 0818633921 [pdf], [doi]  [abs]
  90. P. Mills, J. Prins, and John H. Reif, Rate Control as a Language Construct for Parallel and Distributed Programming, Proc. IEEE Workshop on Parallel and Distributed Real-Time Systems (IPPS'93) (1993), pp. 164-170 [pdf]
  91. L.S. Nyland, J.F. Prins, and John H. Reif, A Data Parallel Implementation of the Adaptive Fast Multipole Algorithm. Dartmouth Institute for Advanced Graduate Studies (DAGS '93), Hanover, NH, pp. 111-123 (June 1993) [pdf]
  92. D. Armon and John H. Reif, A Dynamic Separator Algorithm with Applications to Computational Geometry and Nested Dissection, 3rd Annual Workshop on Algorithms and Data Structures (WADS'93), Montreal, Quebec (August 1993), pp. 107-118 [pdf]
  93. REIF, JH, AN O(N LOG3N) ALGORITHM FOR THE REAL ROOT PROBLEM, 34TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE: PROCEEDINGS (1993), pp. 626-635, ISBN 0-8186-4370-6 (Revised as An Efficient Algorithm for the Real Root and Symmetric Tridiagonal Eigenvalue Problems, 1994.) [pdf]
  94. S. Azhar, A. McLennan and John H. Reif, Computation of Equilibria in Noncooperative Games, Proc. Workshop for Computable Economics (December, 1992) [pdf]
  95. V. Pan, John H. Reif, S. Tate, The Power of Combining the Techniques of Algebraic and Numerical Computing: Improved Approximate Multipoint Polynomial Evaluation and Improved Multipole Algorithms, 32th Annual IEEE Symposium on Foundations of Computer Science (FOCS'92), Pittsburgh, PA (October, 1992), pp. 703-713 (Rewritten as John H. Reif and S. Tate, "N-body simulation I: Fast algorithms for potential field evaluation and Trummer's problem. Tech. Report. #N-96-001, University of North Texas, Department of Computer Science (1996).) [pdf]
  96. John H. Reif and A. Yoshida, Optical Techniques for Image Compression, edited by James A. Storer, Martin Cohn, 2nd Annual IEEE Data Compression Conference (DCC 92), Snhowbird, UT (March, 1992), pp. 32-41, IEEE Computer Society Press (Also in Image and Text Compression, edited by J.A. Storer, Kluwer Academic Publishers, 1992.) [pdf]
  97. John H. Reif and S. Sen, Optimal Parallel Algorithms for Computational Geometry, Algorithmica, Vol. 7, No. 1, pp. 91-117 (January, 1992) [pdf]
  98. 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, Proceedings Annual IEEE Symposium on Foundations of Computer Science Focs, vol. 1992-October (January, 1992), pp. 703-713, ISBN 0818629002 [doi]  [abs]
  99. Reif, JH; Yoshida, A, Optical techniques for image compression, Data Compression Conference Proceedings, vol. 1992-March (January, 1992), pp. 32-41, ISBN 0818627174 [doi]  [abs]
  100. J. Cheriyan and John H. Reif, Algebraic Methods for Testing the k-Vertex Connectivity of Directed Graphs, 3rd Annual ACM-SIAM Symposium on Discrete Algorithms, Orlando, Florida, 3rd Annual ACM-SIAM Symposium on Discrete Algorithms, Orlando, Florida (1992) [pdf]
  101. D. Armon and John H. Reif, An Optimal Space and Efficient Parallel Nested Dissection Algorithm, 4th Annual ACM Symposium on Parallel Algorithms and Architectures, San Diego, CA (July 1992) [pdf]
  102. V. Pan and John H. Reif, Decreasing the Precision of Linear Algebra Computations by Using Compact Multigrid and Backward Interval Analysis, 4th SIAM Conference in Applied Linear Algebra, Minneapolis, MN (September, 1991) [pdf]
  103. Tassos Markas and John H. Reif, Image Compression Methods with Distortion Controlled Capabilities, IEEE Data Compression Conference (DCC 91), Snowbird, UT (April, 1991), pp. 93-102, IEEE Computer Society Press [pdf]
  104. John H. Reif and A. Tyagi, An Optical Delay Line Memory Model with Efficient Algorithms, Advanced Research in VLSI Conference, Santa Cruz, CA (March, 1991), MIT Press [pdf]
  105. Mills, PH; Nyland, LS; Prins, JF; Reif, JH; Wagner, RA, Prototyping parallel and distributed programs in Proteus, Proceedings of the 3rd IEEE Symposium on Parallel and Distributed Processing 1991 (January, 1991), pp. 26-34, IEEE, ISBN 9780818623103 [pdf], [doi]  [abs]
  106. Markas, T; Reif, J, Image compression methods with distortion controlled capabilities, Data Compression Conference Proceedings, vol. 1991-April (January, 1991), pp. 93-102, ISBN 0818692022 [doi]  [abs]
  107. H. Djidjev and John H. Reif, An Efficient Algorithm for the Genus Problem with Explicit Construction of Forbidden Subgraphs, 23rd Annual ACM Symposium on Theory of Computing, New Orleans, LA (May 1991), pp. 337-347 [pdf]
  108. John H. Reif and A. Tyagi, Efficient Algorithms for Optical Computing with the DFT Primitive, 10th Conference on Foundations of Software Technology and Theoretical Computer Science, Bangalore, India (December, 1990) (Lecture Notes in Computer Science. pp 149-160.) [pdf]
  109. John H. Reif and A. Tyagi, Energy Complexity of Optical Computations, 2nd IEEE Symposium on Parallel and Distributed Processing (December, 1990), pp. 14-21, Dallas, TX [pdf]
  110. J.A. Storer and John H. Reif, A Parallel Architecture for High Speed Data Compression, 3rd Symposium on the Frontiers of Massively Parallel Computation, College Park, MD, pp. 238-243 (October, 1990) [pdf]
  111. V. Pan and John H. Reif, On the Bit-Complexity of Discrete Approximations to PDEs, International Colloquium on Automata, Languages, and Programming (ICALP 90), Warwich, England, Springer Lecture Notes in Computer Science 443 (July, 1990), pp. 612-625 [pdf]
  112. Pan, V; Reif, J, On the bit-complexity of discrete solutions of PDEs: Compact multigrid, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, vol. 443 LNCS (January, 1990), pp. 612-625, ISBN 9783540528265 [doi]  [abs]
  113. Reif, J; Tyagi, A, Efficient parallel algorithms for optical computing with the DFT primitive, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, vol. 472 LNCS (January, 1990), pp. 149-160, Springer Berlin Heidelberg, ISBN 9783540534877 [doi]  [abs]
  114. Tyagi, A; Reif, J, Energy complexity of optical computations, Proceedings of the 2nd IEEE Symposium on Parallel and Distributed Processing 1990 Spdp 1990 (January, 1990), pp. 14-21, ISBN 9780818620874 [doi]  [abs]
  115. H. Gazit and John H. Reif, A Randomized Parallel Algorithm for Planar Graph Isomorphism, 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, Crete, Greece (July 1990), pp. 210-219 [pdf]
  116. J.A. Storer, T. Markas aJ.A. Storer, T. Markas and John H. Reif, A Massively Parallel VLSI Compression System using a Compact Dictionary, IEEE Workshops on VLSI & Signal Processing, San Diego, CA (1990) [pdf]
  117. Paturi, R; Rajasekaran, S; Reif, J, The light bulb problem, Proceedings of the 2nd Annual Workshop on Computational Learning Theory Colt 1989 (December, 1989), pp. 261-268, ISBN 9781558600867 [doi]
  118. V. Ramachandran and John H. Reif, An Optimal Parallel Algorithm for Graph Planarity, 30th Annual IEEE Symposium on Foundations of Computer Science, Research Triangle Park, NC (October, 1989), pp. 282-287 [pdf]
  119. J.E.S. Maniloff, K. Johnson, and John H. Reif, Holographic Routing Network for Parallel Processing Machines Holographic Optics II: Principals and Applications, G. Michael Morris; Ed. SPIE Proceedings Series, Vol. 1136, EPS/EUROPTICA/SPIE International Congress on Optical Science and Engineering, Paris, France, pp. 283-289 (April, 1989) [pdf]
  120. REIF, JH; SEN, S, RANDOMIZATION IN PARALLEL ALGORITHMS AND ITS IMPACT ON COMPUTATIONAL GEOMETRY, edited by DJIDJEV, H, OPTIMAL ALGORITHMS, vol. 401 (January, 1989), pp. 1-8, SPRINGER-VERLAG BERLIN, ISBN 3-540-51859-2
  121. Maniloff, ES; Johnson, KM; Reif, J, Holographic routing network for parallel processing machines, in Holographic Optics II: Principals and Applications, EPS/EUROPTICA/SPIE International Congress on Optical Science and Engineering, edited by G. Michael Morris, Proceedings of SPIE the International Society for Optical Engineering, vol. 1136 (January, 1989), pp. 283-289, Paris, France [pdf], [doi]  [abs]
  122. R. Paturi, S. Rajasekaran, and John H. Reif, Efficient and Robust Learning Using Statistical Bootstrap, Proceedings of the 2nd Annual Workshop on Computational Learning Theory, Santa Cruz, CA (August 1989) [pdf]
  123. John H. Reif and S. Sen, Randomization in Parallel Algorithms and its Impact on Computational Geometry, in Optimal Algorithms;Lecture Notes in Computer Science, Vol. 401, pp. 1-8 (1989) [pdf]
  124. John H. Reif and S. Sen, Randomized Parallel Algorithms, IBM Workshop on Capabilities and Limitations of Parallel Computing, San Jose, CA (December, 1988), Information Processing 89, G. Ritter ed., Elsevier Science Publishers, North Holland, 1989, pp. 455-458 [pdf]
  125. J. Canny, B. Donald, John H. Reif and P. Xavier, On the Complexity of Kinodynamic Planning. 29th Annual IEEE Symposium on Foundations of Computer Science, White Plains, NY, pp. 306-316 (October, 1988) [pdf]
  126. John H. Reif and J.A. Storer, Shortest Paths in Euclidean Space with Polyhedral Obstacles, Symposium on Mathematical Foundations of Computer Science, Czechoslovakia (August, 1988) [pdf]
  127. John H. Reif and S. Sen, An Efficient Output-Sensitive Hidden-Surface Removal Algorithm and its Parallelization, 4th Annual ACM Symposium on Computational Geometry, Urbana, IL (June, 1988), pp. 193-200 [pdf]
  128. J.A. Storer and John H. Reif, Real-time Compression of Video on a Grid-connected Parallel Computer, 3rd International Conference on Supercomputing (May, 1988), Boston, MA [pdf]
  129. Reif, JH; Sen, S, An efficient output-sensitive hidden-surface removal algorithm and its parallelization, Proceedings of the 4th Annual Symposium on Computational Geometry Scg 1988 (January, 1988), pp. 193-200, ACM Press, ISBN 9780897912709 [doi]  [abs]
  130. E.W. Davis and John H. Reif, Architecture and Operation of the BLITZEN Processing Element, 3rd International Conference on Computing on Supercomputing (May 1988), Boston, MA (Also as D.W. Blevin, E.W. Davis and John H. Reif, Processing Element and Custom Chip Architecture for the BLITZEN Massively Parallel Processor, MCNC Technical Report TR87-22, October 1987, revised June 1988.) [pdf]
  131. V. Pan and John H. Reif, Some Polynomial and Toeplitz Matrix Computations. 28th Annual IEEE Symposium on Foundations of Computer Science, Los Angeles, CA, (IEEE Computer Society Press) pp. 173-184 (October, 1987) [pdf]
  132. John H. Reif and S. Sen, Optimal Randomized Parallel Algorithms for Computational Geometry. 16th International Conference on Parallel Processing, St. Charles, IL, pp. 270-276 (August, 1987) [pdf]
  133. P. Klein and John H. Reif, An Efficient Parallel Algorithm for Planarity, 27th Annual IEEE Symposium on Foundations of Computer Science, Toronto, Canada, vol. 37 (October, 1986), pp. 465-477 [pdf]
  134. C.E. Leiserson, J.P. Mesirov, L. Nekludova, S.M. Omohundro, John H. Reif, and W. Taylor, Solving Sparse Systems of Linear Equations on the Connection Machine, Annual SIAM Conference (July, 1986), Boston, MA [pdf]
  135. V. Pan and John H. Reif, Fast and Efficient Parallel Linear Programming and Least Squares Computations, Aegean Workshop on Computing, Loutraki, Greece, July 1986; Lecture Notes in Computer Science, Spreinger-Verlag, Vol. 227, pp. 283-295 (July, 1986), MIT, Cambridge, MA [pdf]
  136. Reif, JH; Tygar, JD, Efficient Parallel Pseudo-Random Number Generation, edited by H. Williams and E. Brickell, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, vol. 218 LNCS (January, 1986), pp. 433-446, Springer Berlin Heidelberg, ISBN 9783540164630 (Presented at the Mathematical Theory of Security, Boston, MA, 1985.) [pdf], [doi]  [abs]
  137. Pan, V; Reif, J, Fast and efficient parallel linear programming and linear least squares computations, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, vol. 227 LNCS (January, 1986), pp. 283-295, Springer Berlin Heidelberg, ISBN 9783540167662 [doi]  [abs]
  138. Pan, V; Reif, J, Extension of the parallel nested dissection algorithm to path algebra problems, in Lecture Notes in Computer Science, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, vol. 241 LNCS (January, 1986), pp. 470-487, Springer Berlin Heidelberg, ISBN 9783540171799 [pdf], [doi]  [abs]
  139. John H. Reif, A Survey on Advances in the Theory of Computational Robotics, in Proceedings of the Fourth Workshop of Adaptive Systems Control Theory as Adaptive and Learning Systems: Theory and Applications, edited by K.S. Narendra (1986), Plenum Press, New York, NY [pdf]
  140. R.E. Ladner and John H. Reif, The Logic of Distributed Protocols, Conference on Theoretical Aspects of Reasoning about Knowledge (March 1986), pp. 207-223, Los Altos, CA [pdf]
  141. S. Rajasekaran and John H. Reif, An Optimal Parallel Algorithm for Integer Sorting, 26th Annual IEEE Symposium on Foundations of Computer Science, Portland, OR (October, 1985), pp. 496-503 [pdf]
  142. John H. Reif, The Very Unusual Behavior of Parallel Interpolation Search, 23rd Annual Allerton Conference on Communication, Control and Computing, Monticello, IL (October, 1985) [pdf]
  143. John H. Reif, Probabilistic Algorithms in Group Theory, Foundations of Computation Theory (FCT85), Cottbus, Democratic Republic of Germany (September, 1985) (Lecture Notes in Computer Science, Vol. 199, pp. 341-350.) [pdf]
  144. V. Pan and John H. Reif, Fast and Efficient Algorithms for Linear Programming and for the Linear Least Squares Problem, 12th International Symposium on Mathematical Programming, MIT, Cambridge, MA, pp. 283-295 (August, 1985), MIT, Cambridge, MA [pdf]
  145. P. Gacs and John H. Reif, A Simple Three-dimensional Real-time Reliable Cellular Array, 17th Annual ACM Symposium on Theory of Computing, Providence, RI (May, 1985), pp. 388-395 [pdf]
  146. Reif, J, Probabilistic algorithms in group theory, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, vol. 199 LNCS (January, 1985), pp. 341-350, Springer Verlag, ISBN 9783540156895 [doi]  [abs]
  147. Ben-Or, M; Kozen, D; Reíf, J, The complexity of elementary algebra and geometry (preliminary version), Proceedings of the Annual ACM Symposium on Theory of Computing, vol. Part F130362 (December, 1984), pp. 457-464, ACM Press, ISBN 0897911334 [doi]
  148. M. Ben-Or, D. Kozen, and John H. Reif, The Complexity of Elementary Algebra and Geometry, 16th Annual Symposium on Theory of Computing, Washington, D.C. (May, 1984), pp. 457-464 [pdf]
  149. Reif, JH; Scherlis, WL, Deriving efficient graph algorithms (summary), Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, vol. 164 LNCS (January, 1984), pp. 421-441, Springer Berlin Heidelberg, ISBN 9783540128960 [doi]  [abs]
  150. John H. Reif and A.P. Sistla, A Multiprocess Network Logic with Temporal and Spatial Modalities, 10th International Colloquium on Automata, Languages and Programming, Barcelona, Spain, July 1983; Lecture Notes in Computer Science, Vol. 154, pp. 629-639 (July, 1983) [pdf]
  151. John H. Reif and W.L. Scherlis, Deriving Efficient Graph Algorithms, Logics of Programs Workshop, Carnegie-Mellon University, Pittsburgh, PA (June, 1983) [pdf]
  152. John H. Reif, An n^(1+epsilon) Processor, 0(logn) Time Probabilistic Sorting Algorithm, SIAM Conference on the Applications of Discrete Mathematics (June, 1983), pp. 27-29, Cambridge, MA [pdf]
  153. L.G. Valiant and John H. Reif, A Logarithmic Time Sort for Linear Size Networks, 15th Annual ACM Symposium on Theory of Computing, Boston, MA (April, 1983), pp. 10-16 [pdf]
  154. Reif, J; Sistla, AP, A multiprocess network logic with temporal and spatial modalities, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, vol. 154 LNCS (January, 1983), pp. 629-639, Springer Verlag, ISBN 9783540123170 [doi]  [abs]
  155. John H. Reif, Parallel Time 0(log n) Time Acceptance of Deterministic CFLs, 23rd Annual IEEE Symposium on Foundations of Computer Science, Chicago, IL (November, 1982), pp. 290-296 [pdf]
  156. Reif, J; Spirakis, P, Real time resource allocation in distributed systems, Proceedings of the Annual ACM Symposium on Principles of Distributed Computing (August, 1982), pp. 84-94, ISBN 0897910818 [doi]  [abs]
  157. Reif, JH, Symmetric complementation, Proceedings of the Annual ACM Symposium on Theory of Computing (May, 1982), pp. 201-214, ACM Press, ISBN 0897910702 (Presented at the NSF/AMS on Probabilistic Computational Complexity, Durham, NH, June 1982.) [pdf], [doi]  [abs]
  158. Reif, J; Spirakis, P, Unbounded speed variability in distributed communication systems, Conference Record of the Annual ACM Symposium on Principles of Programming Languages (January, 1982), pp. 46-56, ACM Press, ISBN 0897910656 [pdf], [doi]  [abs]
  159. Reif, JH, On the power of probabilistic choice in synchronous parallel computations, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, vol. 140 LNCS (January, 1982), pp. 442-450, Springer Verlag, ISBN 9783540115762 [doi]  [abs]
  160. John H. Reif, On the Power of Probabilistic Choice in Synchronous Parallel Machines, 9th International Colloquium on Automata, Languages and Programming, Aarthus, Denmark (1982), pp. 442-450 [pdf]
  161. J.Y. Halpern and John H. Reif, The Propositional Dynamic Logic of Deterministic, Well-Structured Programs, 22nd Annual IEEE Symposium on Foundations of Computer Science, Nashville, TN (October, 1981), pp. 322-334 [pdf]
  162. Reif, J; Spirakis, P, Distributed algorithms for synchronizing interprocess communication within real time, Proceedings of the Annual ACM Symposium on Theory of Computing (May, 1981), pp. 133-145, ACM Press, ISBN 0897910419 [pdf], [doi]  [abs]
  163. Reif, JH, Minimum s-t cut of a planar undirected network in o(n log2(n)) time, edited by Shimon Even and Oded Kariv, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, vol. 115 LNCS (January, 1981), pp. 56-67, Springer Berlin Heidelberg, ISBN 9783540108436 [pdf], [doi]  [abs]
  164. G. L. Peterson and John H. Reif, A Dynamic Logic of Multiprocessing with Incomplete Information, 7th Annual ACM Symposium on Principals of Programming Languages, Las Vegas, NV (Janauary 1980), pp. 193-202 [pdf]
  165. Filotti, IS; Miller, GL; Reif, J, On determining the genus of a graph in 0(V0(g)) steps, Proceedings of the Annual ACM Symposium on Theory of Computing (April, 1979), pp. 27-37, ACM Press [pdf], [doi]  [abs]
  166. Reif, JH, Universal games of incomplete information, Proceedings of the Annual ACM Symposium on Theory of Computing (April, 1979), pp. 288-308, ACM Press (also Harvard University TR-35-81.) [pdf], [doi]  [abs]
  167. Reif, JH, Complexity of the mover's problem and generalizations, Proceedings Annual IEEE Symposium on Foundations of Computer Science Focs (January, 1979), pp. 421-427 [doi]  [abs]
  168. Peterson, GL; Reif, JH, Multiple-person alternation, Proceedings Annual IEEE Symposium on Foundations of Computer Science Focs (January, 1979), pp. 348-363 [doi]  [abs]
  169. Reif, JH, Symbolic program analysis in almost linear time, Conference Record of the Annual ACM Symposium on Principles of Programming Languages, vol. Part F130706 (January, 1978), pp. 76-83, ACM Press [pdf], [doi]  [abs]
  170. John H. Reif and H.R. Lewis, Symbolic Evaluation and the Global Value Graph, 4th ACM Symposium on Principals of Programming Languages, Los Angeles, CA, pp. 104-118 (January, 1977) [pdf]
  171. Reif, JH; Lewis, HR, Symbolic evaluation and the global value graph, Conference Record of the Annual ACM Symposium on Principles of Programming Languages, vol. Part F130756 (January, 1977), pp. 104-118, ACM Press [pdf], [doi]  [abs]
  172. John H. Reif, Code Motion, Conference on Theoretical Computer Science, University of Waterloo, Canada (1977) [pdf]

Workshop abstract or talk (no official publication)

  1. Bishop M, Thiem C, Renz T, Schultes EA, Chandran H, Reif JH, Structural Optimization of Dendritic DNA Self-Assembly, in abstract, FNANO 2009, Snowbird, Utah, Sciencetechnica, pp. 147-148 (April, 2009)
  2. Thomas H. LaBean, Geetha Shetty, Peng Yin, Erik A. Schultes, Harish Chandran, John H. Reif, A Dendritic Nanostructure for DNA Detection, in abstract, FNANO 2009, Snowbird, Utah,Sciencetechnica, pp. 82-83 (April, 2009)
  3. Peng Yin, Rizal Hariadi, Sudheer Sahu, Harry M. T. Choi, Sung Ha Park, Bethany Walters, Thomas H. LaBean, John H. Reif, On Constructing Tile-less DNA Ribbons and Tubes, Abstract, in Preliminary Proceedings, 12th International Meeting on DNA Computing (DNA12), Seoul, Korea (June 5-9, 2006) [pdf]
  4. Peng Yin, Bo Guo, Christina Belmore, Will Palmeri, Erik Winfree, Thomas H. LaBean, John H. Reif, TileSoft: Sequence Optimization Software For Designing DNA Secondary Structures, Abstract, in Preliminary Proceedings, Tenth International Meeting on DNA Based Computers (DNA10), Milano, Italy, vol. 3384 (June 7-10, 2004) [pdf]
  5. John H. Reif, DNA-Based Nano-Engineering: DNA and its Enzymes as the Engines of Creation at the Molecular Scale, Abstract, in Preliminary Proceedings, Tenth International Meeting on DNA Based Computers (DNA10), Milano, Italy, (June 7-10, 2004) (June 7-10, 2004) [pdf]
  6. Hao Yan, Sung Ha Park, Liping Feng, John Reif, and Thomas H. LaBean, 4x4 DNA Tile and Lattices: Characterization, Self-Assembly and Metallization of a Novel DNA Nanostructure Motif, Abstract, Preliminary Proceedings, Ninth International Meeting on DNA Based Computers (DNA9), Madison, Wisconsin (June 2-4, 2003) [pdf]
  7. John H. Reif and Zheng Sun, Nano-Robotics Motion Planning and Its Applications in Nanotechnology and Biomolecular Computing, NSF Design and Manufacturing Grantees Conference (January 5-8, 1999) [html]
  8. T. Markas and John H. Reif, Memory-Shared Parallel Architectures for Vector Quantization Algorithms, Picture Coding Symposium, Lusanne Switzerland (March 1993)
  9. P. Mills, L. Nyland, J. Prins, and John H. Reif, Prototyping High-Performance Parallel Computing Applications in Proteus, DARPA Software Technology Conference (May 1992)
  10. John H. Reif, Efficient Parallel Algorithms: Theory and Practice, XI World Computer Congress, IFIP 89, San Francisco, CA (1989)
  11. John H. Reif, Efficient Parallel Algorithms: Theory and Practice, in SIAM 35th Anniversary Meeting, Denver, CO (October, 1987)

Books PUBLISHED

  1. Sudheer Sahu and John H. Reif, DNA-Based Self-Assembly and Nanorobotics, Published by VDM Verlag Dr. Mueller e.K., Saarbrücken, Germany, 128 pages, (November 10, 2008) ISBN-10: 363909770X, ISBN-13: 978-3639097702 (November, 2008)
  2. Sanguthevar Rajasekaran and John H. Reif, Handbook of Parallel Computing: Models, Algorithms and Applications, Published by Taylor & Francis, Boca Raton, FL. ISBN 978-1584886235 (December, 2007)
  3. S. Rajasekaran, P.M. Pardalos, John H. Reif and J. Rolim, Handbook of Randomized Computing (2001), Kluwer Volume I and II, Academic Press, London
  4. John H Reif, Synthesis of Parallel Algorithms (1993), Morgan Kaufman, San Mateo, California
  5. Robert Paige, John Reif, and Ralph Wachter, Parallel Algorithm Derivation and Program Transformation, 228 pages. Published by Kluwer Academic Publishers (1993)

Edited journal or collection PUBLISHED

  1. to appear: John H. Reif and Marya Lieberman, editors, Proceedings of the Eighth Conference on Foundations of Nanoscience: Self-Assembled Architectures and Devices(FNANO11), Snowbird, Utah, Published by Sciencetechnica (April, 2011)
  2. John H. Reif and Marya Lieberman, editors, Proceedings of the Seventh Conference on Foundations of Nanoscience: Self-Assembled Architectures and Devices(FNANO10), Snowbird, Utah, Published by Sciencetechnica (April, 2010)
  3. John H. Reif and Marya Lieberman, editors, Proceedings of the Sixth Conference on Foundations of Nanoscience: Self-Assembled Architectures and Devices(FNANO09), Snowbird, Utah, Published by Sciencetechnica (April, 2009)
  4. John H. Reif and Marya Lieberman, editors, Proceedings of the Fifth Conference on Foundations of Nanoscience: Self-Assembled Architectures and Devices(FNANO08), Snowbird, Utah, Published by Sciencetechnica (April, 2008)
  5. John H. Reif, editor, Proceedings of the Fourth Conference on Foundations of Nanoscience: Self-Assembled Architectures and Devices(FNANO07), Snowbird, Utah, Published by Sciencetechnica (April, 2007)
  6. John H. Reif, editor, Proceedings of the Third Conference on Foundations of Nanoscience: Self-Assembled Architectures and Devices(FNANO06), Snowbird, Utah, Published by Sciencetechnica (April, 2006)
  7. John H. Reif, editor, Proceedings of the Second Conference on Foundations of Nanoscience: Self-Assembled Architectures and Devices(FNANO05), Snowbird, Utah, Published by Sciencetechnica (April, 2005)
  8. John H. Reif, editor, Proceedings of the First Conference on Foundations of Nanoscience: Self-Assembled Architectures and Devices(FNANO04), Snowbird, Utah, (April 21-23, 2004), Published by Sciencetechnica (April, 2004)
  9. Junghuei Chen and John H Reif, editors, Proceedings of the Ninth International Meeting on DNA Based Computers (DNA9), Madison, Wisconsin, June 1-3, 2003, 225 pages, Lecture Notes in Computer Science Vol. 2943, Springer-Verlag, New York (2004)
  10. John H. Reif, editor, Special Issue on STOC2003, Journal of Computer and System Sciences (JCSS), vol. 67 no. 2 (September, 2003), pp. 211-471 [pdf]
  11. John H. Reif, Guest Editor, Special Issue of Selected Papers from Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing (STOC2002) Journal of Computer and System Sciences(JCSS), Volume 67, Issue 2, Page 211- (September, 2003)
  12. John H. Reif, editor, Proceedings of the 34th ACM Symposium on Theory of Computing (STOC2002), Montréal, Québec, Canada (May, 2002)
  13. John H. Reif, editor, VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, AWOC 88, Corfu, Greece, June 28 - July 1 1988, 476 pages, Springer-Verlag Lecture Notes in Computer Science, Vol. 319. (July, 1988)

Other

  1. Tinging Jiang and John H. Reif, Efficient Methods for Stochastic Simulations of Biomolecular Motions (July, 2003) [pdf]
  2. S. Krishan and John H. Reif, Towards Randomized Strongly Polynomial Algorithms for Linear Programming, Duke University Technical Report CS-1991-18 (2000) [pdf]
  3. S. Azhar and John H. Reif, Crypto-Complexity Based Models of Efficiency in Capital Markets (1994) [pdf]
  4. R. Barakat and John H. Reif, Diffraction Realization of an Optical Expander (1993) [pdf]
  5. S. Krishan and J.H. Reif, Towards Randomized Strongly Polynomial Algorithms for Linear Programming, Duke University Technical Report CS-1991-18 (1991) [pdf]
  6. T. Markas and John H. Reif, Fast Computations of Vector Quantization Algorithms, NASA Technical Report TR-91-58 (1991)
  7. M. Karr, S. Krishnan, John H. Reif, Derivation of the Ellipsoid Algorithm, Duke University Technical Report CS-1991-17 (1990) [pdf]
  8. John H. Reif and D. Yen, Derivation of Parallel Graph Connectivity Algorithms via Stream Contraction, Duke University Technical Report (1989) [pdf]
  9. John H. Reif, Optical expanders give constant time holographic routing using O(N log N) switches, Technical Memo (1988) [pdf]
  10. G.L. Peterson and John H. Reif, Decision Algorithms for Multiplayer Games of Incomplete Information (1981), Harvard University, TR-34-81 [pdf]
  11. John H. Reif and P. Spirakis, Strong k-connectivity in Digraphs and Random Digraphs (1981), Harvard University TR-25-81 [pdf]
  12. John H. Reif, The Complexity of Extending a Graph Imbedding (October 1978), Computer Science Department, University of Rochester, TR-42 [pdf]
Duke University * Pratt * Reload * Login
x