default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohn H. Reif
Person information
- affiliation: Duke University, Department of Computer Science
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[i2]Rajiv Teja Nagipogu, John H. Reif:
NeuralCRNs: A Natural Implementation of Learning in Chemical Reaction Networks. CoRR abs/2409.00034 (2024)- 2021
- [j103]Xin Song
, Shalin Shah, John H. Reif:
Multidimensional data organization and random access in large-scale DNA storage systems. Theor. Comput. Sci. 894: 190-202 (2021) - 2020
- [j102]Shalin Shah, Abhishek Kumar Dubey, John H. Reif:
ExTemp: A computational and image-processing suite for extracting temporal barcodes. J. Open Source Softw. 5(46): 2026 (2020) - [d1]Shalin Shah, Abhishek Kumar Dubey, John H. Reif:
ExTemp: A computational and image-processing suite for extracting temporal barcodes. Zenodo, 2020
2010 – 2019
- 2019
- [c144]Shalin Shah, Tianqi Song, Xin Song, Ming Yang, John H. Reif:
Implementing Arbitrary CRNs Using Strand Displacing Polymerase. DNA 2019: 21-36 - [p4]Hieu Bui, John H. Reif:
Localized DNA Computation. From Parallel to Emergent Computing 2019: 407-424 - 2018
- [c143]Shalin Shah, John H. Reif:
Temporal DNA Barcodes: A Time-Based Approach for Single-Molecule Imaging. DNA 2018: 71-86 - 2017
- [i1]Abeer Eshra, Shalin Shah, John H. Reif:
DNA Hairpin Gate: A Renewable DNA Seesaw Motif Using Hairpins. CoRR abs/1704.06371 (2017) - 2016
- [j101]Akhilesh Tyagi, John H. Reif:
Energy Complexity of Optical Computations. Int. J. Unconv. Comput. 12(5-6): 393-412 (2016) - [j100]Urmi Majumder, Sudhanshu Garg, Thomas H. LaBean, John H. Reif:
Activatable tiles for compact robust programmable molecular assembly and other applications. Nat. Comput. 15(4): 611-634 (2016) - 2015
- [j99]Wadee Alhalabi, John H. Reif, Zeineb Elsheikh, Heba Felimban, Majda Fallata, Khalid Thabit, Abdullah Abusorrah:
The co-learning in the design, simulation and optimization of a solar concentrating system. Comput. Hum. Behav. 51: 857-866 (2015) - 2014
- [p3]Hieu Bui, Harish Chandran, Sudhanshu Garg, Nikhil Gopalkrishnan, Reem Mokhtar, John H. Reif, Tianqi Song:
DNA Computing. Computing Handbook, 3rd ed. (1) 2014: 25: 1-42 - 2013
- [j98]Harish Chandran, Nikhil Gopalkrishnan, John H. Reif:
Tile Complexity of Approximate Squares. Algorithmica 66(1): 1-17 (2013) - 2012
- [j97]John H. Reif:
Local Parallel Biomolecular Computation. Int. J. Unconv. Comput. 8(5-6): 459-507 (2012) - [j96]Harish Chandran, Nikhil Gopalkrishnan, John H. Reif:
Tile Complexity of Linear Assemblies. SIAM J. Comput. 41(4): 1051-1073 (2012) - [p2]John H. Reif, Thomas H. LaBean:
Engineering Natural Computation by Autonomous DNA-Based Biomolecular Devices. Handbook of Natural Computing 2012: 1319-1353 - 2011
- [j95]John H. Reif, Sam Slee:
Asymptotically Optimal Kinodynamic Motion Planning for a Class of Modular Self-Reconfigurable Robots. Int. J. Comput. Geom. Appl. 21(2): 131-155 (2011) - [j94]Urmi Majumder, John H. Reif:
Design of a biomolecular device that executes process algebra. Nat. Comput. 10(1): 447-466 (2011) - [j93]John H. Reif, Sudheer Sahu, Peng Yin:
Complexity of graph self-assembly in accretive systems and self-destructible systems. Theor. Comput. Sci. 412(17): 1592-1605 (2011) - [c142]Harish Chandran, Nikhil Gopalkrishnan, Andrew Phillips, John H. Reif:
Localized Hybridization Circuits. DNA 2011: 64-83 - [c141]John H. Reif:
Keynote: DNA-based molecular devices. ICCABS 2011: 3 - 2010
- [j92]Sudheer Sahu, John H. Reif:
Capabilities and Limits of Compact Error Resilience Methods for Algorithmic Self-Assembly. Algorithmica 56(4): 480-504 (2010) - [j91]John H. Reif, Urmi Majumder:
Isothermal reactivating Whiplash PCR for locally programmable molecular computation. Nat. Comput. 9(1): 183-206 (2010) - [c140]Nikhil Gopalkrishnan, Harish Chandran, John H. Reif:
High-Fidelity DNA Hybridization Using Programmable Molecular DNA Devices. DNA 2010: 59-70 - [c139]Sam Slee, John H. Reif:
Robomotion: Scalable, Physically Stable Locomotion for Self-reconfigurable Robots. WAFR 2010: 121-137
2000 – 2009
- 2009
- [j90]John H. Reif, Sudheer Sahu:
Autonomous programmable DNA nanorobotic devices using DNAzymes. Theor. Comput. Sci. 410(15): 1428-1439 (2009) - [c138]Sudheer Sahu, Peng Yin, John H. Reif:
A Self-assembly Model of Time-Dependent Glue Strength. Algorithmic Bioprocesses 2009: 185-204 - [c137]Urmi Majumder, John H. Reif:
Design of a Biomolecular Device That Executes Process Algebra. DNA 2009: 97-105 - [c136]Harish Chandran, Nikhil Gopalkrishnan, John H. Reif:
The Tile Complexity of Linear Assemblies. ICALP (1) 2009: 235-253 - [r1]John H. Reif:
Mechanical Computing: The Computational Complexity of Physical Devices. Encyclopedia of Complexity and Systems Science 2009: 5466-5482 - 2008
- [j89]John H. Reif, Simon Kasif, Deepak Sherlekar:
Formula dissection: A parallel algorithm for constraint satisfaction. Comput. Math. Appl. 55(6): 1170-1177 (2008) - [c135]John H. Reif, Urmi Majumder:
Isothermal Reactivating Whiplash PCR for Locally Programmable Molecular Computation. DNA 2008: 41-56 - [c134]Urmi Majumder, John H. Reif:
A Framework for Designing Novel Magnetic Tiles Capable of Complex Self-assemblies. UC 2008: 129-145 - 2007
- [j88]John H. Reif, Thomas H. LaBean:
Autonomous programmable biomolecular devices using self-assembled DNA nanostructures. Commun. ACM 50(9): 46-53 (2007) - [j87]John H. Reif, Sukhendu Chakraborty:
Efficient and exact quantum compression. Inf. Comput. 205(7): 967-981 (2007) - [j86]Zheng Sun, John H. Reif:
On Robotic Optimal Path Planning in Polygonal Regions With Pseudo-Euclidean Metrics. IEEE Trans. Syst. Man Cybern. Part B 37(4): 925-936 (2007) - [c133]Urmi Majumder, Thomas H. LaBean, John H. Reif:
Activatable Tiles: Compact, Robust Programmable Assembly and Other Applications. DNA 2007: 15-25 - [c132]John H. Reif, Sudheer Sahu:
Autonomous Programmable Nanorobotic Devices Using DNAzymes. DNA 2007: 66-78 - [c131]Ashish Gehani, John H. Reif:
Super-Resolution Video Analysis for Forensic Investigations. IFIP Int. Conf. Digital Forensics 2007: 281-299 - [c130]John H. Reif, Sam Slee:
Optimal Kinodynamic Motion Planning for 2D Reconfiguration of Self-Reconfigurable Robots. Robotics: Science and Systems 2007 - [c129]John H. Reif, Thomas H. LaBean:
Autonomous Programmable Biomolecular Devices Using Self-assembled DNA Nanostructures. WoLLIC 2007: 297-306 - [e5]Sanguthevar Rajasekaran, John H. Reif:
Handbook of Parallel Computing - Models, Algorithms and Applications. Chapman and Hall/CRC 2007, ISBN 978-1-58488-623-5 [contents] - 2006
- [j85]Zheng Sun, John H. Reif:
On finding approximate optimal paths in weighted regions. J. Algorithms 58(1): 1-32 (2006) - [j84]John H. Reif, Zheng Sun:
On boundaries of highly visible spaces and applications. Theor. Comput. Sci. 354(3): 379-390 (2006) - [c128]Urmi Majumder, Sudheer Sahu, Thomas H. LaBean, John H. Reif:
Design and Simulation of Self-repairing DNA Lattices. DNA 2006: 195-214 - [c127]Sudheer Sahu, John H. Reif:
Capabilities and Limits of Compact Error Resilience Methods for Algorithmic Self-assembly in Two and Three Dimensions. DNA 2006: 223-238 - [c126]Sudheer Sahu, Bei Wang, John H. Reif:
A Framework for Modeling DNA Based Molecular Systems. DNA 2006: 250-265 - [c125]John H. Reif, Sudheer Sahu, Peng Yin:
Compact Error-Resilient Computational DNA Tilings. Nanotechnology: Science and Computation 2006: 79-103 - [c124]John H. Reif, Sam Slee:
Asymptotically Optimal Kinodynamic Motion Planning for Self-reconfigurable Robots. WAFR 2006: 457-472 - 2005
- [j83]John H. Reif:
Efficient parallel factorization and solution of structured and unstructured linear systems. J. Comput. Syst. Sci. 71(1): 86-143 (2005) - [j82]Zheng Sun, John H. Reif:
On finding energy-minimizing paths on terrains. IEEE Trans. Robotics 21(1): 102-114 (2005) - [j81]Zheng Sun, David Hsu, Tingting Jiang, Hanna Kurniawati, John H. Reif:
Narrow passage sampling for probabilistic roadmap planning. IEEE Trans. Robotics 21(6): 1105-1115 (2005) - [c123]John H. Reif, Sudheer Sahu, Peng Yin:
Complexity of Graph Self-assembly in Accretive Systems and Self-destructible Systems. DNA 2005: 257-274 - [c122]Sudheer Sahu, Peng Yin, John H. Reif:
A Self-assembly Model of Time-Dependent Glue Strength. DNA 2005: 290-304 - [c121]Peng Yin, Sudheer Sahu, Andrew J. Turberfield, John H. Reif:
Design of Autonomous DNA Cellular Automata. DNA 2005: 399-416 - 2004
- [j80]John H. Reif, Zheng Sun:
Movement Planning in the Presence of Flows. Algorithmica 39(2): 127-153 (2004) - [c120]Ashish Gehani, Thomas H. LaBean, John H. Reif:
DNA-based Cryptography. Aspects of Molecular Computing 2004: 167-188 - [c119]John H. Reif, Sudheer Sahu, Peng Yin:
Compact Error-Resilient Computational DNA Tiling Assemblies. DNA 2004: 293-307 - [c118]Peng Yin, Andrew J. Turberfield, John H. Reif:
Designs of Autonomous Unidirectional Walking DNA Devices. DNA 2004: 410-425 - [c117]Peng Yin, Andrew J. Turberfield, Sudheer Sahu, John H. Reif:
Design of an Autonomous DNA Nanomechanical Device Capable of Universal Computation and Universal Translational Motion. DNA 2004: 426-444 - [c116]John H. Reif, Thomas H. LaBean, Sudheer Sahu, Hao Yan, Peng Yin:
Design, Simulation, and Experimental Demonstration of Self-assembled DNA Nanostructures and Motors. UPP 2004: 173-187 - [e4]Junghuei Chen, John H. Reif:
DNA Computing, 9th International Workshop on DNA Based Computers, DNA9, Madison, WI, USA, June 1-3, 2003, revised Papers. Lecture Notes in Computer Science 2943, Springer 2004, ISBN 3-540-20930-1 [contents] - 2003
- [j79]John H. Reif:
Guest Editor's Foreword. J. Comput. Syst. Sci. 67(2): 211 (2003) - [j78]John H. Reif:
The design of autonomous DNA nano-mechanical devices: Walking and rolling DNA. Nat. Comput. 2(4): 439-461 (2003) - [j77]John H. Reif, Zheng Sun:
On Frictional Mechanical Systems and Their Computational Power. SIAM J. Comput. 32(6): 1449-1474 (2003) - [c115]John H. Reif, William L. Scherlis:
Deriving Effcient Graph Algorithms. Verification: Theory and Practice 2003: 645-681 - [c114]Zheng Sun, John H. Reif:
Adaptive and Compact Discretization for Weighted Region Optimal Path Finding. FCT 2003: 258-270 - [c113]John H. Reif, Zheng Sun:
On Boundaries of Highly Visible Spaces and Applications. FCT 2003: 271-283 - [c112]Zheng Sun, John H. Reif:
On energy-minimizing paths on terrains for a mobile robot. ICRA 2003: 3782-3788 - [c111]David Hsu, Tingting Jiang, John H. Reif, Zheng Sun:
The bridge test for sampling narrow passages with probabilistic roadmap planners. ICRA 2003: 4420-4426 - 2002
- [j76]John H. Reif:
DNA lattices: A method for molecular-scale patterning and computation. Comput. Sci. Eng. 4(1): 32-41 (2002) - [j75]John H. Reif:
The Emerging Discipline of Biomolecular Computation in the US. New Gener. Comput. 20(3): 217-236 (2002) - [c110]Dage Liu, John H. Reif, Thomas H. LaBean:
DNA Nanotubes: Construction and Characterization of Filaments Composed of TX-tile Lattice. DNA 2002: 10-21 - [c109]John H. Reif:
The Design of Autonomous DNA Nanomechanical Devices: Walking and Rolling DNA. DNA 2002: 22-37 - [c108]John H. Reif:
Molecular Assembly and Computation: From Theory to Experimental Demonstrations. ICALP 2002: 1-21 - [e3]John H. Reif:
Proceedings on 34th Annual ACM Symposium on Theory of Computing, May 19-21, 2002, Montréal, Québec, Canada. ACM 2002, ISBN 1-58113-495-9 [contents] - 2001
- [j74]John H. Reif:
Efficient Parallel Computation of the Characteristic Polynomial of a Sparse, Separable Matrix. Algorithmica 29(3): 487-510 (2001) - [j73]John H. Reif, James A. Storer:
Optimal encoding of non-stationary sources. Inf. Sci. 135(1-2): 87-105 (2001) - [j72]John H. Reif:
Parallel Output-Sensitive Algorithms for Combinatorial and Linear Algebra Problems. J. Comput. Syst. Sci. 62(3): 398-412 (2001) - [c107]John H. Reif, Thomas H. LaBean, Michael Pirrung, Vipul S. Rana, Bo Guo, Carl Kingsford, Gene S. Wickham:
Experimental Construction of Very Large Scale DNA Databases with Associative Search Capability. DNA 2001: 231-247 - [c106]John H. Reif, Thomas H. LaBean, Nadrian C. Seeman:
Programmable Assembly at the Molecular Scale: Self-Assembly of DNA Lattices (Invited Paper). ICRA 2001: 966-971 - [c105]Zheng Sun, John H. Reif:
BUSHWHACK: An Approximation Algorithm for Minimal Paths through Pseudo-Euclidean Spaces. ISAAC 2001: 160-171 - [c104]John H. Reif, Zheng Sun:
Movement Planning in the Presence of Flows. WADS 2001: 450-461 - 2000
- [j71]John H. Reif:
Fast Spatial Decomposition and Closest Pair Computation for Limited Precision Input. Algorithmica 28(3): 271-287 (2000) - [j70]John H. Reif:
On the Impossibility of Interaction-Free Quantum Sensing for Small I/O Bandwidth. Inf. Comput. 163(1): 103-122 (2000) - [j69]John H. Reif, Hongyan Wang:
Nonuniform Discretization for Kinodynamic Motion Planning and its Applications. SIAM J. Comput. 30(1): 161-190 (2000) - [c103]John H. Reif, Thomas H. LaBean:
Computationally Inspired Biotechnologies: Improved DNA Synthesis and Associative Search Using Error-Correcting Codes and Vector-Quantization. DNA Computing 2000: 145-172 - [c102]John H. Reif, Thomas H. LaBean, Nadrian C. Seeman:
Challenges and Applications for Self-Assembled DNA Nanostructures. DNA Computing 2000: 173-198 - [p1]John H. Reif, Sandeep Sen:
Parallel Computational Geometry: An Approach using Randomization. Handbook of Computational Geometry 2000: 765-828
1990 – 1999
- 1999
- [j68]John H. Reif:
Parallel Biomolecular Computation: Models and Simulations. Algorithmica 25(2-3): 142-175 (1999) - [j67]John H. Reif, Hongyan Wang:
Social potential fields: A distributed behavioral control for autonomous robots. Robotics Auton. Syst. 27(3): 171-194 (1999) - [j66]John H. Reif:
Approximate Complex Polynomial Evaluation in Near Constant Work Per Point. SIAM J. Comput. 28(6): 2059-2089 (1999) - [j65]Zhiyong Li, John H. Reif, Sandeep K. S. Gupta:
Synthesizing Efficient Out-of-Core Programs for Block Recursive Algorithms Using Block-Cyclic Data Distributions. IEEE Trans. Parallel Distributed Syst. 10(3): 297-315 (1999) - [c101]Thomas H. LaBean, Erik Winfree, John H. Reif:
Experimental progress in computation by self-assembly of DNA tilings. DNA Based Computers 1999: 123-140 - [c100]Ashish Gehani, Thomas H. LaBean, John H. Reif:
DNA-based cryptography. DNA Based Computers 1999: 233-249 - 1998
- [j64]Hillel Gazit, John H. Reif:
A Randomized Parallel Algorithm for Planar Graph Isomorphism. J. Algorithms 28(2): 290-314 (1998) - [c99]John H. Reif, James A. Storer:
Optimal Lossless Compression of a Class of Dynamic Sources. Data Compression Conference 1998: 501-510 - [c98]John H. Reif:
Alternative Computational Models: A Comparison of Biomolecular and Quantum Computation. FSTTCS 1998: 102-121 - 1997
- [j63]Yijie Han, Victor Y. Pan, John H. Reif:
Efficient Parallel Algorithms for Computing All Pair Shortest Paths in Directed Graphs. Algorithmica 17(4): 399-415 (1997) - [j62]John H. Reif, Stephen R. Tate:
On Dynamic Algorithms for Algebraic Problems. J. Algorithms 22(2): 347-371 (1997) - [j61]Erol Gelenbe, Nestor A. Schmajuk, John Staddon, John H. Reif:
Autonomous search by robots and animals: A survey. Robotics Auton. Syst. 22(1): 23-34 (1997) - [j60]James A. Storer, John H. Reif:
Error-Resilient Optimal Data Compression. SIAM J. Comput. 26(4): 934-949 (1997) - [c97]James A. Storer, John H. Reif:
Low-Cost Prevention of Error Propagation for Data Compression with Dynamic Dictionaries. Data Compression Conference 1997: 171-180 - [c96]Sefeng Chen, John H. Reif:
Fast and Compact Volume Rendering in the Compressed Transform Domain. Data Compression Conference 1997: 271-280 - [c95]John H. Reif:
Local parallel biomolecular computation. DNA Based Computers 1997: 217-254 - [c94]John H. Reif:
Approximate Complex Polynomial Evaluation in Near Constant Work Per Point. STOC 1997: 30-39 - 1996
- [j59]Ming-Yang Kao, John H. Reif, Stephen R. Tate:
Searching in an Unknown Environment: An Optimal Randomized Algorithm for the Cow-Path Problem. Inf. Comput. 131(1): 63-79 (1996) - [j58]C. Andrew Neff, John H. Reif:
An Efficient Algorithm for the Complex Roots Problem. J. Complex. 12(2): 81-115 (1996) - [j57]Zhiyong Li, Peter Mills, John H. Reif:
Models and Resource Metrics for Parallel and Distributed Computation. Parallel Algorithms Appl. 8(1): 35-59 (1996) - [c93]Shenfeng Chen, John H. Reif:
Efficient Lossless Compression of Trees and Graphs. Data Compression Conference 1996: 428 - [c92]Lars S. Nyland, Jan F. Prins, Allen Goldberg, Peter Mills, John H. Reif, Robert A. Wagner:
A Refinement Methodology for Developing Data-Parallel Applications. Euro-Par, Vol. I 1996: 145-150 - [c91]Zhiyong Li, John H. Reif, Sandeep K. S. Gupta:
Synthesizing Efficient Out-of-Core Programs for Block Recursive Algorithms Using Block-Cyclic Data Distributions. ICPP, Vol. 2 1996: 142-149 - 1995
- [j56]Ramamohan Paturi, Sanguthevar Rajasekaran, John H. Reif:
The Light Bulb Problem. Inf. Comput. 117(2): 187-192 (1995) - [c90]Shenfeng Chen, John H. Reif:
Fast Pattern Matching for Entropy Bounded Text. Data Compression Conference 1995: 282-291 - [c89]John H. Reif:
Efficient Parallel Solution of Sparse Eigenvalue and Eigenvector Problems. FOCS 1995: 123-132 - [c88]Zhiyong Li, Peter Mills, John H. Reif:
Models and resource metrics for parallel and distributed computation. HICSS (2) 1995: 51-60 - [c87]Sotiris E. Nikoletseas, John H. Reif, Paul G. Spirakis, Moti Yung:
Stochastic Graphs Have Short Memory: Fully Dynamic Connectivity in Poly-Log Expected Time. ICALP 1995: 159-170 - [c86]Sandeep K. S. Gupta, Zhiyong Li, John H. Reif:
Generating Efficient Programs for Two-Level Memories from Tensor-products. Parallel and Distributed Computing and Systems 1995: 510-513 - [c85]John H. Reif:
Parallel Molecular Computation. SPAA 1995: 213-223 - [c84]John H. Reif:
Work efficient parallel solution of Toeplitz systems and polynomial GCD. STOC 1995: 751-761 - [c83]Akitoshi Yoshida, Jannick P. Rolland, John H. Reif:
Design and applications of a high-resolution insert head-mounted-display. VRAIS 1995: 84-93 - 1994
- [j55]Joseph Cheriyan, John H. Reif:
Directed s-t Numberings, Rubber Bands, and Testing Digraph k-Vertex Connectivity. Comb. 14(4): 435-451 (1994) - [j54]John H. Reif, J. D. Tygar, Akitoshi Yoshida:
Computability and Complexity of Ray Tracing. Discret. Comput. Geom. 11: 265-287 (1994) - [j53]John H. Reif, Micha Sharir:
Motion Planning in the Presence of Moving Obstacles. J. ACM 41(4): 764-790 (1994) - [j52]James A. Storer, John H. Reif:
Shortest Paths in the Plane with Polygonal Obstacles. J. ACM 41(5): 982-1012 (1994) - [j51]John H. Reif, James A. Storer:
A Single-Exponential Upper Bound for Finding Shortest Paths in Three Dimensions. J. ACM 41(5): 1013-1019 (1994) - [j50]Vijaya Ramachandran, John H. Reif:
Planarity Testing in Parallel. J. Comput. Syst. Sci. 49(3): 517-561 (1994) - [j49]Akitoshi Yoshida, John H. Reif:
Optical computing techniques for image/video compression. Proc. IEEE 82(6): 948-954 (1994) - [j48]John H. Reif, Sandeep Sen:
Erratum: Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems. SIAM J. Comput. 23(2): 447-448 (1994) - [j47]John H. Reif, Sandeep Sen:
Randomized Algorithms for Binary Search and Load Balancing on Fixed Connection Networks with Geometric Applications. SIAM J. Comput. 23(3): 633-651 (1994) - [c82]Salman Azhar, Greg J. Badros, Arman Glodjo, Ming-Yang Kao, John H. Reif:
Data Compression Techniques for Stock Market Prediction. Data Compression Conference 1994: 72-82 - [c81]Allen Goldberg, Peter Mills, Lars S. Nyland, Jan F. Prins, John H. Reif, James Riely:
Specification and Development of Parallel Algorithms with the Proteus System. Specification of Parallel Algorithms 1994: 383-399 - [c80]C. Andrew Neff, John H. Reif:
An O(n^1+epsilon log b) Algorithm for the Complex Roots Problem. FOCS 1994: 540-547 - [c79]John H. Reif:
Models and Resource Metrics for Parallel and Distributed Computation. IPPS 1994: 404 - [c78]John H. Reif, Stephen R. Tate:
Dynamic Algebraic Algorithms. SODA 1994: 290-301 - [c77]John H. Reif, Stephen R. Tate:
Dynamic Parallel Tree Contraction (Extended Abstract). SPAA 1994: 114-121 - [c76]John H. Reif:
O(log² n) Time Efficient Parallel Factorization of Dense, Sparse Separable, and Banded Matrices. SPAA 1994: 278-289 - 1993
- [j46]John H. Reif, Stephen R. Tate:
Continuous Alternation: The Complexity of Pursuit in Continuous Domains. Algorithmica 10(2-4): 156-181 (1993) - [j45]Bruce Randall Donald, Patrick G. Xavier, John F. Canny, John H. Reif:
Kinodynamic Motion Planning. J. ACM 40(5): 1048-1066 (1993) - [j44]Mark Royals, Tassos Markas, Nick Kanopoulos, John H. Reif, James A. Storer:
On the design and implementation of a lossless data compression and decompression chip. IEEE J. Solid State Circuits 28(9): 948-953 (1993) - [j43]Victor Y. Pan, John H. Reif:
Fast and Efficient Parallel Solution of Sparse Linear Systems. SIAM J. Comput. 22(6): 1227-1250 (1993) - [c75]Tassos Markas, John H. Reif:
Multispectral Image Compression Algorithms. Data Compression Conference 1993: 391-400 - [c74]Shenfeng Chen, John H. Reif:
Using Difficulty of Prediction to Decrease Computation: Fast Sort, Priority Queue and Convex Hull on Entropy Bounded Inputs. FOCS 1993: 104-112 - [c73]John H. Reif:
An O(n log ^3 n) Algorithm for the Real Root Problem. FOCS 1993: 626-635 - [c72]John H. Reif, Stephen R. Tate:
The Complexity of N-body Simulation. ICALP 1993: 162-176 - [c71]Ming-Yang Kao, John H. Reif, Stephen R. Tate:
Searching in an Unknown Environment: An Optimal Randomized Algorithm for the Cow-Path Problem. SODA 1993: 441-447 - [c70]Joseph Cheriyan, John H. Reif:
Parallel and Output Sensitive Algorithms for Combinatorial and Linear Algebra Problems. SPAA 1993: 50-56 - [c69]Deganit Armon, John H. Reif:
A Dynamic Separator Algorithm. WADS 1993: 107-118 - 1992
- [j42]John H. Reif, Sandeep Sen:
Optimal Randomized Parallel Algorithms for Computational Geometry. Algorithmica 7(1): 91-117 (1992) - [j41]John H. Reif, Paul G. Spirakis:
Expected Parallel Time and Sequential Space Complexity of Graph and Digraph Problems. Algorithmica 7(5&6): 597-630 (1992) - [j40]Tassos Markas, John H. Reif:
Quad Tree Structures for Image Compression Applications. Inf. Process. Manag. 28(6): 707-722 (1992) - [j39]John H. Reif, Sandeep Sen:
Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems. SIAM J. Comput. 21(3): 466-485 (1992) - [j38]John H. Reif, Stephen R. Tate:
On Threshold Circuits and Polynomial Computation. SIAM J. Comput. 21(5): 896-908 (1992) - [j37]Victor Y. Pan, John H. Reif:
Compact Multigrid. SIAM J. Sci. Comput. 13(1): 119-127 (1992) - [j36]Sanguthevar Rajasekaran, John H. Reif:
Nested Annealing: A Provable Improvement to Simulated Annealing. Theor. Comput. Sci. 99(1): 157-176 (1992) - [c68]John H. Reif, Akitoshi Yoshida:
Optical Techniques for Image Compression. Data Compression Conference 1992: 32-41 - [c67]Victor Y. Pan, John H. Reif, Stephen R. Tate:
The Power of Combining the Techiques of Algebraic and Numerical Computing: Improved Approximate Multipoint Polynomial Evaluation and Improved Multipole Algorithms. FOCS 1992: 703-713 - [c66]Peter Mills, Lars S. Nyland, Jan F. Prins, John H. Reif:
Prototyping N-Body Simulation in Proteus. IPPS 1992: 476-482 - [c65]Joseph Cheriyan, John H. Reif:
Directed s-t Bumberings, Rubber Bands, and Testing Digraph k-Vertex Connectivity. SODA 1992: 335-344 - [c64]William L. Hightower, Jan F. Prins, John H. Reif:
Implementations of Randomized Sorting on Large Parallel Machines. SPAA 1992: 158-167 - [c63]Deganit Armon, John H. Reif:
Space and Time Efficient Implementations of Parallel Nested Dissection. SPAA 1992: 344-352 - [c62]Yijie Han, Victor Y. Pan, John H. Reif:
Efficient Parallel Algorithms for Computing all Pair Shortest Paths in Directed Graphs. SPAA 1992: 353-362 - 1991
- [j35]John F. Canny, Ashutosh Rege, John H. Reif:
An Exact Algorithm for Kinodynamic Planning in the Plane. Discret. Comput. Geom. 6: 461-484 (1991) - [j34]Victor Y. Pan, John H. Reif:
The Parallel Computation of Minimum Cost Paths in Graphs by Stream Contraction. Inf. Process. Lett. 40(2): 79-83 (1991) - [j33]James A. Storer, John H. Reif:
A Parallel Architecture for High-Speed Data Compression. J. Parallel Distributed Comput. 13(2): 222-227 (1991) - [j32]Gary L. Miller, John H. Reif:
Parallel Tree Contraction, Part 2: Further Applications. SIAM J. Comput. 20(6): 1128-1147 (1991) - [c61]Tassos Markas, John H. Reif:
Image Compression Methods with Distortion Controlled Capabilities. Data Compression Conference 1991: 93-102 - [c60]Alfred Brenner, Richard F. Freund, R. Stockton Gaines, Rob Kelly, Louis Lome, Richard McAndrew, Alexandru Nicolau, Janak H. Patel, Thomas Probert, John H. Reif, Jorge L. C. Sanz, Howard Jay Siegel, Jon A. Webb:
How Do We Make Parallel Processing a Reality? Bridging the Gap Between Theory and Practice. IPPS 1991: 648-653 - [c59]Peter Mills, Lars S. Nyland, Jan F. Prins, John H. Reif, Robert A. Wagner:
Prototyping parallel and distributed programs in Proteus. SPDP 1991: 26-34 - [c58]Hristo N. Djidjev, John H. Reif:
An Efficient Algorithm for the Genus Problem with Explicit Construction of Forbidden Subgraphs. STOC 1991: 337-347 - [e2]James A. Storer, John H. Reif:
Proceedings of the IEEE Data Compression Conference, DCC 1991, Snowbird, Utah, USA, April 8-11, 1991. IEEE Computer Society 1991, ISBN 0-8186-9202-2 [contents] - 1990
- [j31]John H. Reif, Scott A. Smolka:
Data flow analysis of distributed communicating processes. Int. J. Parallel Program. 19(1): 1-30 (1990) - [j30]Donald W. Blevins, Edward W. Davis, Robert A. Heaton, John H. Reif:
BLITZEN: A Highly Integrated Massively Parallel Machine. J. Parallel Distributed Comput. 8(2): 150-160 (1990) - [j29]John H. Reif, Stephen R. Tate:
Optimal Size Integer Division Circuits. SIAM J. Comput. 19(5): 912-924 (1990) - [c57]John F. Canny, Ashutosh Rege, John H. Reif:
An Exact Algorithm for Kinodynamic Planning in the Plane. SCG 1990: 271-280 - [c56]John H. Reif, J. D. Tygar, Akitoshi Yoshida:
The Computability and Complexity of Optical Beam Tracing. FOCS 1990: 106-114 - [c55]John H. Reif, Akhilesh Tyagi:
Efficient Parallel Algorithms for Optical Computing with the DFT Primitive. FSTTCS 1990: 149-160 - [c54]Victor Y. Pan, John H. Reif:
On the Bit-Complexity of Discrete Solutions of PDEs: Compact Multigrid. ICALP 1990: 612-625 - [c53]Hillel Gazit, John H. Reif:
A Randomized Parallel Algorithm for Planar Graph Isomorphism. SPAA 1990: 210-219 - [c52]John H. Reif, Sandeep Sen:
Randomized Algorithms for Binary Search and Load Balancing with Geometric Applications. SPAA 1990: 327-339 - [c51]Akhilesh Tyagi, John H. Reif:
Energy complexity of optical computations. SPDP 1990: 14-21
1980 – 1989
- 1989
- [j28]Gary L. Miller, John H. Reif:
Parallel Tree Contraction Part 1: Fundamentals. Adv. Comput. Res. 5: 47-72 (1989) - [j27]Dan E. Willard, John H. Reif:
Parallel Processing Can Be Harmful: The Unusual Behavior of Interpolation Search. Inf. Comput. 81(3): 364-379 (1989) - [j26]Victor Y. Pan, John H. Reif:
Fast and Efficient Solution of Path Algebra Problems. J. Comput. Syst. Sci. 38(3): 494-510 (1989) - [j25]Sanguthevar Rajasekaran, John H. Reif:
Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms. SIAM J. Comput. 18(3): 594-607 (1989) - [c50]Ramamohan Paturi, Sanguthevar Rajasekaran, John H. Reif:
The Light Bulb Problem. COLT 1989: 261-268 - [c49]Vijaya Ramachandran, John H. Reif:
An Optimal Parallel Algorithm for Graph Planarity (Extended Abstract). FOCS 1989: 282-287 - [c48]John H. Reif, Sandeep Sen:
Randomized Parallel Algorithms. IFIP Congress 1989: 455-458 - [c47]John H. Reif, Sandeep Sen:
Randomization in Parallel Algorithms and its Impact on Computational Geometry. Optimal Algorithms 1989: 1-8 - [c46]John H. Reif, Stephen R. Tate:
Optimal Size Integer Division Circuits. STOC 1989: 264-273 - [c45]John H. Reif, Sandeep Sen:
Polling: A New Randomized Sampling Technique for Computational Geometry. STOC 1989: 394-404 - 1988
- [j24]John H. Reif, Scott A. Smolka:
The Complexity of Reachability in Distributed Communicating Processes. Acta Informatica 25(3): 333-354 (1988) - [j23]Péter Gács, John H. Reif:
A Simple Three-Dimensional Real-Time Reliable Cellular Array. J. Comput. Syst. Sci. 36(2): 125-147 (1988) - [j22]Philip N. Klein, John H. Reif:
An Efficient Parallel Algorithm for Planarity. J. Comput. Syst. Sci. 37(2): 190-246 (1988) - [j21]John H. Reif, J. D. Tygar:
Efficient Parallel Pseudorandom Number Generation. SIAM J. Comput. 17(2): 404-411 (1988) - [j20]Philip N. Klein, John H. Reif:
Parallel Time O(log n) Acceptance of Deterministic CFLs on an Exclusive-Write P-RAM. SIAM J. Comput. 17(3): 463-485 (1988) - [c44]John H. Reif, Sandeep Sen:
An Efficient Output-Sensitive Hidden Surface Removal Algorithm and Its Parallelization. SCG 1988: 193-200 - [c43]John F. Canny, Bruce Randall Donald, John H. Reif, Patrick G. Xavier:
On the Complexity of Kinodynamic Planning. FOCS 1988: 306-316 - [c42]Sanguthevar Rajasekaran, John H. Reif:
Nested Annealing: A Provable Improvement to Simulated Annealing. ICALP 1988: 455-472 - [c41]John H. Reif, James A. Storer:
3-Dimensional Shortest Paths in the Presence of Polyhedral Obstacles. MFCS 1988: 85-92 - [e1]John H. Reif:
VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, AWOC 88, Corfu, Greece, June 28 - July 1, 1988, Proceedings. Lecture Notes in Computer Science 319, Springer 1988, ISBN 3-540-96818-0 [contents] - 1987
- [j19]John H. Reif:
A Topological Approach to Dynamic Graph Connectivity. Inf. Process. Lett. 25(1): 65-70 (1987) - [j18]John H. Reif, Leslie G. Valiant:
A logarithmic time sort for linear size networks. J. ACM 34(1): 60-76 (1987) - [j17]John H. Reif, James A. Storer:
Minimizing turns for discrete movement in the interior of a polygon. IEEE J. Robotics Autom. 3(3): 182-193 (1987) - [c40]John H. Reif:
On threshold circuits and polynomial computation. SCT 1987: 118-123 - [c39]Sanguthevar Rajasekaran, John H. Reif:
Ranomized Parallel Computation. FCT 1987: 364-376 - [c38]John F. Canny, John H. Reif:
New Lower Bound Techniques for Robot Motion Planning Problems. FOCS 1987: 49-60 - [c37]Victor Y. Pan, John H. Reif:
Some Polynomial and Toeplitz Matrix Computations. FOCS 1987: 173-184 - [c36]John H. Reif, Sandeep Sen:
Optimal Randomized Parallel Algorithms for Computational Geometry. ICPP 1987: 270-277 - 1986
- [j16]Steven Homer, John H. Reif:
Arithmetic Theories for Computational Complexity Problems. Inf. Control. 69(1-3): 1-11 (1986) - [j15]Michael Ben-Or, Dexter Kozen, John H. Reif:
The Complexity of Elementary Algebra and Geometry. J. Comput. Syst. Sci. 32(2): 251-264 (1986) - [j14]John H. Reif, Harry R. Lewis:
Efficient Symbolic Analysis of Programs. J. Comput. Syst. Sci. 32(3): 280-314 (1986) - [j13]John H. Reif:
Logarithmic Depth Circuits for Algebraic Functions. SIAM J. Comput. 15(1): 231-242 (1986) - [c35]Victor Y. Pan, John H. Reif:
Fast and Efficient Parallel Linear Programming and Linear Least Squares Computations. Aegean Workshop on Computing 1986: 283-295 - [c34]Philip N. Klein, John H. Reif:
An Efficient Parallel Algorithm for Planarity. FOCS 1986: 465-477 - [c33]Victor Y. Pan, John H. Reif:
Extension of the Parallel Nested Dissection Algorithm to Path Algebra Problems. FSTTCS 1986: 470-487 - [c32]Richard E. Ladner, John H. Reif:
The Logic of Distributed Protocols. TARK 1986: 207-222 - 1985
- [j12]John H. Reif, Paul G. Spirakis:
k-connectivity in random undirected graphs. Discret. Math. 54(2): 181-191 (1985) - [j11]John H. Reif:
Depth-First Search is Inherently Sequential. Inf. Process. Lett. 20(5): 229-234 (1985) - [j10]John H. Reif, A. Prasad Sistla:
A Multiprocess Network Logic with Temporal and Spatial Modalities. J. Comput. Syst. Sci. 30(1): 41-53 (1985) - [j9]John H. Reif, Paul G. Spirakis:
Unbounded Speed Variability in Distributed Communications Systems. SIAM J. Comput. 14(1): 75-92 (1985) - [c31]John H. Reif, J. D. Tygar:
Efficient Parallel Pseudo-Random Number Generation. CRYPTO 1985: 433-446 - [c30]John H. Reif:
Probabilistic algorithms in group theory. FCT 1985: 341-350 - [c29]John H. Reif, Micha Sharir:
Motion Planning in the Presence of Moving Obstacles. FOCS 1985: 144-154 - [c28]Gary L. Miller, John H. Reif:
Parallel Tree Contraction and Its Application. FOCS 1985: 478-489 - [c27]John H. Reif:
An Optimal Parallel Algorithm for Integer Sorting. FOCS 1985: 496-504 - [c26]Victor Y. Pan, John H. Reif:
Efficient Parallel Solution of Linear Systems. STOC 1985: 143-152 - [c25]Péter Gács, John H. Reif:
A Simple Three-Dimensional Real-Time Reliable Cellular Array. STOC 1985: 388-395 - 1984
- [j8]John H. Reif:
Symmetric Complementation. J. ACM 31(2): 401-421 (1984) - [j7]John H. Reif:
The Complexity of Two-Player Games of Incomplete Information. J. Comput. Syst. Sci. 29(2): 274-301 (1984) - [j6]John H. Reif:
On Synchronous Parallel Computations with Independent Probabilistic Choice. SIAM J. Comput. 13(1): 46-56 (1984) - [j5]John H. Reif, Paul G. Spirakis:
Real-Time Synchronization of Interprocess Communications. ACM Trans. Program. Lang. Syst. 6(2): 215-238 (1984) - [c24]John H. Reif, Paul G. Spirakis:
Probabilistic Bidding Gives Optimal Distributed Resource Allocation. ICALP 1984: 391-402 - [c23]Michael Ben-Or, Dexter Kozen, John H. Reif:
The Complexity of Elementary Algebra and Geometry (Preliminary Abstract). STOC 1984: 457-464 - 1983
- [j4]John H. Reif:
Minimum s-t Cut of a Planar Undirected Network in O(n log2(n)) Time. SIAM J. Comput. 12(1): 71-81 (1983) - [j3]Joseph Y. Halpern, John H. Reif:
The Propositional Dynamic Logic of Deterministic, Well-Structured Programs. Theor. Comput. Sci. 27: 127-165 (1983) - [c22]John H. Reif:
Logarithmic Depth Circuits for Algebraic Functions. FOCS 1983: 138-145 - [c21]John H. Reif, A. Prasad Sistla:
A Multiprocess Network Logic with Temporal and Spatial Modalities. ICALP 1983: 629-639 - [c20]John H. Reif, William L. Scherlis:
Deriving Efficient Graph Algorithms (Summary). Logic of Programs 1983: 421-441 - [c19]John H. Reif, Leslie G. Valiant:
A Logarithmic Time Sort for Linear Size Networks. STOC 1983: 10-16 - 1982
- [j2]John H. Reif, Robert Endre Tarjan:
Symbolic Program Analysis in Almost-Linear Time. SIAM J. Comput. 11(1): 81-93 (1982) - [c18]John H. Reif:
Parallel Time O(log N) Acceptance of Deterministic CFLs. FOCS 1982: 290-296 - [c17]John H. Reif:
On the Power of Probabilistic Choice in Synchronous Parallel Computations. ICALP 1982: 442-450 - [c16]John H. Reif, Paul G. Spirakis:
Real Time Resource Allocation in Distributed Systems. PODC 1982: 84-94 - [c15]John H. Reif, Paul G. Spirakis:
Unbounded Speed Variability in Distributed Communication Systems. POPL 1982: 46-56 - [c14]John H. Reif:
Symmetric Complementation. STOC 1982: 201-214 - 1981
- [c13]Joseph Y. Halpern, John H. Reif:
The Propositional Dynamic Logic of Deterministic, Well-Structured Programs (Extended Abstract). FOCS 1981: 322-334 - [c12]John H. Reif:
Minimum S-T Cut of a Planar Undirected Network in O(n log²(n)) Time. ICALP 1981: 56-67 - [c11]John H. Reif, Paul G. Spirakis:
Distributed Algorithms for Synchronizing Interprocess Communication within Real Time. STOC 1981: 133-145 - 1980
- [j1]John H. Reif:
Code Motion. SIAM J. Comput. 9(2): 375-395 (1980) - [c10]John H. Reif, Gary L. Peterson:
A Dynamic Logic of Multiprocessing with Incomplete Information. POPL 1980: 193-202 - [c9]John H. Reif:
Logics for Probabilistic Programming (Extended Abstract). STOC 1980: 8-13 - [c8]John H. Reif, Paul G. Spirakis:
Random Matroids. STOC 1980: 385-397
1970 – 1979
- 1979
- [c7]Gary L. Peterson, John H. Reif:
Multiple-Person Alternation. FOCS 1979: 348-363 - [c6]John H. Reif:
Complexity of the Mover's Problem and Generalizations (Extended Abstract). FOCS 1979: 421-427 - [c5]John H. Reif:
Data Flow Analysis of Communicating Processes. POPL 1979: 257-268 - [c4]I. S. Filotti, Gary L. Miller, John H. Reif:
On Determining the Genus of a Graph in O(v^O(g)) Steps. STOC 1979: 27-37 - [c3]John H. Reif:
Universal Games of Incomplete Information. STOC 1979: 288-308 - 1978
- [c2]John H. Reif:
Symbolic Programming Analysis in Almost Linear Time. POPL 1978: 76-83 - 1977
- [c1]John H. Reif, Harry R. Lewis:
Symbolic Evaluation and the Global Value Graph. POPL 1977: 104-118
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-02-08 00:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
