John H. Reif - RankMe

259 papers A* 58B 50C 4Journal 105Unranked 35

Year	Rank	Type	Title / Venue / Authors
2024	J	`jnl`	NeuralCRNs: A Natural Implementation of Learning in Chemical Reaction Networks. CoRR Rajiv Teja Nagipogu, John H. Reif
2021	J	`jnl`	Multidimensional data organization and random access in large-scale DNA storage systems. Theor. Comput. Sci. Xin Song, Shalin Shah, John H. Reif
2020	J	`jnl`	ExTemp: A computational and image-processing suite for extracting temporal barcodes. J. Open Source Softw. Shalin Shah, Abhishek Kumar Dubey, John H. Reif
2019	B	`conf`	Implementing Arbitrary CRNs Using Strand Displacing Polymerase. DNA Shalin Shah, Tianqi Song, Xin Song, Ming Yang, John H. Reif
2019	—	`ch.`	Localized DNA Computation. From Parallel to Emergent Computing Hieu Bui, John H. Reif
2018	B	`conf`	Temporal DNA Barcodes: A Time-Based Approach for Single-Molecule Imaging. DNA Shalin Shah, John H. Reif
2017	J	`jnl`	DNA Hairpin Gate: A Renewable DNA Seesaw Motif Using Hairpins. CoRR Abeer Eshra, Shalin Shah, John H. Reif
2016	J	`jnl`	Activatable tiles for compact robust programmable molecular assembly and other applications. Nat. Comput. Urmi Majumder, Sudhanshu Garg, Thomas H. LaBean, John H. Reif
2016	J	`jnl`	Energy Complexity of Optical Computations. Int. J. Unconv. Comput. Akhilesh Tyagi, John H. Reif
2015	J	`jnl`	The co-learning in the design, simulation and optimization of a solar concentrating system. Comput. Hum. Behav. Wadee Alhalabi, John H. Reif, Zeineb Elsheikh, Heba Felimban, Majda Fallata, Khalid Thabit, Abdullah Abusorrah
2014	—	`ch.`	DNA Computing. Computing Handbook, 3rd ed. (1) Hieu Bui, Harish Chandran, Sudhanshu Garg, Nikhil Gopalkrishnan, Reem Mokhtar, John H. Reif, Tianqi Song
2013	J	`jnl`	Tile Complexity of Approximate Squares. Algorithmica Harish Chandran, Nikhil Gopalkrishnan, John H. Reif
2012	—	`ch.`	Engineering Natural Computation by Autonomous DNA-Based Biomolecular Devices. Handbook of Natural Computing John H. Reif, Thomas H. LaBean
2012	J	`jnl`	Local Parallel Biomolecular Computation. Int. J. Unconv. Comput. John H. Reif
2012	J	`jnl`	Tile Complexity of Linear Assemblies. SIAM J. Comput. Harish Chandran, Nikhil Gopalkrishnan, John H. Reif
2011	J	`jnl`	Asymptotically Optimal Kinodynamic Motion Planning for a Class of Modular Self-Reconfigurable Robots. Int. J. Comput. Geom. Appl. John H. Reif, Sam Slee
2011	J	`jnl`	Complexity of graph self-assembly in accretive systems and self-destructible systems. Theor. Comput. Sci. John H. Reif, Sudheer Sahu, Peng Yin
2011	J	`jnl`	Design of a biomolecular device that executes process algebra. Nat. Comput. Urmi Majumder, John H. Reif
2011	—	`conf`	Keynote: DNA-based molecular devices. ICCABS John H. Reif
2011	B	`conf`	Localized Hybridization Circuits. DNA Harish Chandran, Nikhil Gopalkrishnan, Andrew Phillips, John H. Reif
2010	J	`jnl`	Capabilities and Limits of Compact Error Resilience Methods for Algorithmic Self-Assembly. Algorithmica Sudheer Sahu, John H. Reif
2010	B	`conf`	High-Fidelity DNA Hybridization Using Programmable Molecular DNA Devices. DNA Nikhil Gopalkrishnan, Harish Chandran, John H. Reif
2010	J	`jnl`	Isothermal reactivating Whiplash PCR for locally programmable molecular computation. Nat. Comput. John H. Reif, Urmi Majumder
2010	C	`conf`	Robomotion: Scalable, Physically Stable Locomotion for Self-reconfigurable Robots. WAFR Sam Slee, John H. Reif
2009	—	`conf`	A Self-assembly Model of Time-Dependent Glue Strength. Algorithmic Bioprocesses Sudheer Sahu, Peng Yin, John H. Reif
2009	J	`jnl`	Autonomous programmable DNA nanorobotic devices using DNAzymes. Theor. Comput. Sci. John H. Reif, Sudheer Sahu
2009	B	`conf`	Design of a Biomolecular Device That Executes Process Algebra. DNA Urmi Majumder, John H. Reif
2009	—	`ch.`	Mechanical Computing: The Computational Complexity of Physical Devices. Encyclopedia of Complexity and Systems Science John H. Reif
2009	—	`conf`	The Tile Complexity of Linear Assemblies. ICALP (1) Harish Chandran, Nikhil Gopalkrishnan, John H. Reif
2008	C	`conf`	A Framework for Designing Novel Magnetic Tiles Capable of Complex Self-assemblies. UC Urmi Majumder, John H. Reif
2008	J	`jnl`	Formula dissection: A parallel algorithm for constraint satisfaction. Comput. Math. Appl. John H. Reif, Simon Kasif, Deepak Sherlekar
2008	B	`conf`	Isothermal Reactivating Whiplash PCR for Locally Programmable Molecular Computation. DNA John H. Reif, Urmi Majumder
2007	B	`conf`	Activatable Tiles: Compact, Robust Programmable Assembly and Other Applications. DNA Urmi Majumder, Thomas H. LaBean, John H. Reif
2007	C	`conf`	Autonomous Programmable Biomolecular Devices Using Self-assembled DNA Nanostructures. WoLLIC John H. Reif, Thomas H. LaBean
2007	B	`conf`	Autonomous Programmable Nanorobotic Devices Using DNAzymes. DNA John H. Reif, Sudheer Sahu
2007	J	`jnl`	Autonomous programmable biomolecular devices using self-assembled DNA nanostructures. Commun. ACM John H. Reif, Thomas H. LaBean
2007	J	`jnl`	Efficient and exact quantum compression. Inf. Comput. John H. Reif, Sukhendu Chakraborty
2007	—	`book`	Handbook of Parallel Computing - Models, Algorithms and Applications. Sanguthevar Rajasekaran, John H. Reif
2007	J	`jnl`	On Robotic Optimal Path Planning in Polygonal Regions With Pseudo-Euclidean Metrics. IEEE Trans. Syst. Man Cybern. Part B Zheng Sun, John H. Reif
2007	—	`conf`	Optimal Kinodynamic Motion Planning for 2D Reconfiguration of Self-Reconfigurable Robots. Robotics: Science and Systems John H. Reif, Sam Slee
2007	—	`conf`	Super-Resolution Video Analysis for Forensic Investigations. IFIP Int. Conf. Digital Forensics Ashish Gehani, John H. Reif
2006	B	`conf`	A Framework for Modeling DNA Based Molecular Systems. DNA Sudheer Sahu, Bei Wang, John H. Reif
2006	C	`conf`	Asymptotically Optimal Kinodynamic Motion Planning for Self-reconfigurable Robots. WAFR John H. Reif, Sam Slee
2006	B	`conf`	Capabilities and Limits of Compact Error Resilience Methods for Algorithmic Self-assembly in Two and Three Dimensions. DNA Sudheer Sahu, John H. Reif
2006	—	`conf`	Compact Error-Resilient Computational DNA Tilings. Nanotechnology: Science and Computation John H. Reif, Sudheer Sahu, Peng Yin
2006	B	`conf`	Design and Simulation of Self-repairing DNA Lattices. DNA Urmi Majumder, Sudheer Sahu, Thomas H. LaBean, John H. Reif
2006	J	`jnl`	On boundaries of highly visible spaces and applications. Theor. Comput. Sci. John H. Reif, Zheng Sun
2006	J	`jnl`	On finding approximate optimal paths in weighted regions. J. Algorithms Zheng Sun, John H. Reif
2005	B	`conf`	A Self-assembly Model of Time-Dependent Glue Strength. DNA Sudheer Sahu, Peng Yin, John H. Reif
2005	B	`conf`	Complexity of Graph Self-assembly in Accretive Systems and Self-destructible Systems. DNA John H. Reif, Sudheer Sahu, Peng Yin
2005	B	`conf`	Design of Autonomous DNA Cellular Automata. DNA Peng Yin, Sudheer Sahu, Andrew J. Turberfield, John H. Reif
2005	J	`jnl`	Efficient parallel factorization and solution of structured and unstructured linear systems. J. Comput. Syst. Sci. John H. Reif
2005	J	`jnl`	Narrow passage sampling for probabilistic roadmap planning. IEEE Trans. Robotics Zheng Sun, David Hsu, Tingting Jiang, Hanna Kurniawati, John H. Reif
2005	J	`jnl`	On finding energy-minimizing paths on terrains. IEEE Trans. Robotics Zheng Sun, John H. Reif
2004	B	`conf`	Compact Error-Resilient Computational DNA Tiling Assemblies. DNA John H. Reif, Sudheer Sahu, Peng Yin
2004	B	`ed.`	DNA Computing, 9th International Workshop on DNA Based Computers, DNA 2003, Madison, WI, USA, June 1-3, 2003, revised Papers DNA Junghuei Chen, John H. Reif
2004	—	`conf`	DNA-based Cryptography. Aspects of Molecular Computing Ashish Gehani, Thomas H. LaBean, John H. Reif
2004	B	`conf`	Design of an Autonomous DNA Nanomechanical Device Capable of Universal Computation and Universal Translational Motion. DNA Peng Yin, Andrew J. Turberfield, Sudheer Sahu, John H. Reif
2004	—	`conf`	Design, Simulation, and Experimental Demonstration of Self-assembled DNA Nanostructures and Motors. UPP John H. Reif, Thomas H. LaBean, Sudheer Sahu, Hao Yan, Peng Yin
2004	B	`conf`	Designs of Autonomous Unidirectional Walking DNA Devices. DNA Peng Yin, Andrew J. Turberfield, John H. Reif
2004	J	`jnl`	Movement Planning in the Presence of Flows. Algorithmica John H. Reif, Zheng Sun
2003	B	`conf`	Adaptive and Compact Discretization for Weighted Region Optimal Path Finding. FCT Zheng Sun, John H. Reif
2003	—	`conf`	Deriving Effcient Graph Algorithms. Verification: Theory and Practice John H. Reif, William L. Scherlis
2003	J	`jnl`	Guest Editor's Foreword. J. Comput. Syst. Sci. John H. Reif
2003	B	`conf`	On Boundaries of Highly Visible Spaces and Applications. FCT John H. Reif, Zheng Sun
2003	J	`jnl`	On Frictional Mechanical Systems and Their Computational Power. SIAM J. Comput. John H. Reif, Zheng Sun
2003	A*	`conf`	On energy-minimizing paths on terrains for a mobile robot. ICRA Zheng Sun, John H. Reif
2003	A*	`conf`	The bridge test for sampling narrow passages with probabilistic roadmap planners. ICRA David Hsu, Tingting Jiang, John H. Reif, Zheng Sun
2003	J	`jnl`	The design of autonomous DNA nano-mechanical devices: Walking and rolling DNA. Nat. Comput. John H. Reif
2002	B	`conf`	DNA Nanotubes: Construction and Characterization of Filaments Composed of TX-tile Lattice. DNA Dage Liu, John H. Reif, Thomas H. LaBean
2002	J	`jnl`	DNA lattices: A method for molecular-scale patterning and computation. Comput. Sci. Eng. John H. Reif
2002	A*	`conf`	Molecular Assembly and Computation: From Theory to Experimental Demonstrations. ICALP John H. Reif
2002	A*	`ed.`	Proceedings on 34th Annual ACM Symposium on Theory of Computing, May 19-21, 2002, Montréal, Québec, Canada STOC John H. Reif
2002	B	`conf`	The Design of Autonomous DNA Nanomechanical Devices: Walking and Rolling DNA. DNA John H. Reif
2002	J	`jnl`	The Emerging Discipline of Biomolecular Computation in the US. New Gener. Comput. John H. Reif
2001	B	`conf`	BUSHWHACK: An Approximation Algorithm for Minimal Paths through Pseudo-Euclidean Spaces. ISAAC Zheng Sun, John H. Reif
2001	J	`jnl`	Efficient Parallel Computation of the Characteristic Polynomial of a Sparse, Separable Matrix. Algorithmica John H. Reif
2001	B	`conf`	Experimental Construction of Very Large Scale DNA Databases with Associative Search Capability. DNA John H. Reif, Thomas H. LaBean, Michael Pirrung, Vipul S. Rana, Bo Guo, Carl Kingsford, Gene S. Wickham
2001	B	`conf`	Movement Planning in the Presence of Flows. WADS John H. Reif, Zheng Sun
2001	J	`jnl`	Optimal encoding of non-stationary sources. Inf. Sci. John H. Reif, James A. Storer
2001	J	`jnl`	Parallel Output-Sensitive Algorithms for Combinatorial and Linear Algebra Problems. J. Comput. Syst. Sci. John H. Reif
2001	A*	`conf`	Programmable Assembly at the Molecular Scale: Self-Assembly of DNA Lattices (Invited Paper). ICRA John H. Reif, Thomas H. LaBean, Nadrian C. Seeman
2000	—	`conf`	Challenges and Applications for Self-Assembled DNA Nanostructures. DNA Computing John H. Reif, Thomas H. LaBean, Nadrian C. Seeman
2000	—	`conf`	Computationally Inspired Biotechnologies: Improved DNA Synthesis and Associative Search Using Error-Correcting Codes and Vector-Quantization. DNA Computing John H. Reif, Thomas H. LaBean
2000	J	`jnl`	Fast Spatial Decomposition and Closest Pair Computation for Limited Precision Input. Algorithmica John H. Reif
2000	J	`jnl`	Nonuniform Discretization for Kinodynamic Motion Planning and its Applications. SIAM J. Comput. John H. Reif, Hongyan Wang
2000	J	`jnl`	On the Impossibility of Interaction-Free Quantum Sensing for Small I/O Bandwidth. Inf. Comput. John H. Reif
2000	—	`ch.`	Parallel Computational Geometry: An Approach using Randomization. Handbook of Computational Geometry John H. Reif, Sandeep Sen
1999	J	`jnl`	Approximate Complex Polynomial Evaluation in Near Constant Work Per Point. SIAM J. Comput. John H. Reif
1999	—	`conf`	DNA-based cryptography. DNA Based Computers Ashish Gehani, Thomas H. LaBean, John H. Reif
1999	—	`conf`	Experimental progress in computation by self-assembly of DNA tilings. DNA Based Computers Thomas H. LaBean, Erik Winfree, John H. Reif
1999	J	`jnl`	Parallel Biomolecular Computation: Models and Simulations. Algorithmica John H. Reif
1999	J	`jnl`	Social potential fields: A distributed behavioral control for autonomous robots. Robotics Auton. Syst. John H. Reif, Hongyan Wang
1999	J	`jnl`	Synthesizing Efficient Out-of-Core Programs for Block Recursive Algorithms Using Block-Cyclic Data Distributions. IEEE Trans. Parallel Distributed Syst. Zhiyong Li, John H. Reif, Sandeep K. S. Gupta
1998	J	`jnl`	A Randomized Parallel Algorithm for Planar Graph Isomorphism. J. Algorithms Hillel Gazit, John H. Reif
1998	—	`conf`	Alternative Computational Models: A Comparison of Biomolecular and Quantum Computation. FSTTCS John H. Reif
1998	B	`conf`	Optimal Lossless Compression of a Class of Dynamic Sources. Data Compression Conference John H. Reif, James A. Storer
1997	A*	`conf`	Approximate Complex Polynomial Evaluation in Near Constant Work Per Point. STOC John H. Reif
1997	J	`jnl`	Autonomous search by robots and animals: A survey. Robotics Auton. Syst. Erol Gelenbe, Nestor A. Schmajuk, John Staddon, John H. Reif
1997	J	`jnl`	Efficient Parallel Algorithms for Computing All Pair Shortest Paths in Directed Graphs. Algorithmica Yijie Han, Victor Y. Pan, John H. Reif
1997	J	`jnl`	Error-Resilient Optimal Data Compression. SIAM J. Comput. James A. Storer, John H. Reif
1997	B	`conf`	Fast and Compact Volume Rendering in the Compressed Transform Domain. Data Compression Conference Sefeng Chen, John H. Reif
1997	—	`conf`	Local parallel biomolecular computation. DNA Based Computers John H. Reif
1997	B	`conf`	Low-Cost Prevention of Error Propagation for Data Compression with Dynamic Dictionaries. Data Compression Conference James A. Storer, John H. Reif
1997	J	`jnl`	On Dynamic Algorithms for Algebraic Problems. J. Algorithms John H. Reif, Stephen R. Tate
1996	—	`conf`	A Refinement Methodology for Developing Data-Parallel Applications. Euro-Par, Vol. I Lars S. Nyland, Jan F. Prins, Allen Goldberg, Peter Mills, John H. Reif, Robert A. Wagner
1996	J	`jnl`	An Efficient Algorithm for the Complex Roots Problem. J. Complex. C. Andrew Neff, John H. Reif
1996	B	`conf`	Efficient Lossless Compression of Trees and Graphs. Data Compression Conference Shenfeng Chen, John H. Reif
1996	J	`jnl`	Models and Resource Metrics for Parallel and Distributed Computation. Parallel Algorithms Appl. Zhiyong Li, Peter Mills, John H. Reif
1996	J	`jnl`	Searching in an Unknown Environment: An Optimal Randomized Algorithm for the Cow-Path Problem. Inf. Comput. Ming-Yang Kao, John H. Reif, Stephen R. Tate
1996	—	`conf`	Synthesizing Efficient Out-of-Core Programs for Block Recursive Algorithms Using Block-Cyclic Data Distributions. ICPP, Vol. 2 Zhiyong Li, John H. Reif, Sandeep K. S. Gupta
1995	—	`conf`	Design and applications of a high-resolution insert head-mounted-display. VRAIS Akitoshi Yoshida, Jannick P. Rolland, John H. Reif
1995	A*	`conf`	Efficient Parallel Solution of Sparse Eigenvalue and Eigenvector Problems. FOCS John H. Reif
1995	B	`conf`	Fast Pattern Matching for Entropy Bounded Text. Data Compression Conference Shenfeng Chen, John H. Reif
1995	—	`conf`	Generating Efficient Programs for Two-Level Memories from Tensor-products. Parallel and Distributed Computing and Systems Sandeep K. S. Gupta, Zhiyong Li, John H. Reif
1995	—	`conf`	Models and resource metrics for parallel and distributed computation. HICSS (2) Zhiyong Li, Peter Mills, John H. Reif
1995	B	`conf`	Parallel Molecular Computation. SPAA John H. Reif
1995	A*	`conf`	Stochastic Graphs Have Short Memory: Fully Dynamic Connectivity in Poly-Log Expected Time. ICALP Sotiris E. Nikoletseas, John H. Reif, Paul G. Spirakis, Moti Yung
1995	J	`jnl`	The Light Bulb Problem Inf. Comput. Ramamohan Paturi, Sanguthevar Rajasekaran, John H. Reif
1995	A*	`conf`	Work efficient parallel solution of Toeplitz systems and polynomial GCD. STOC John H. Reif
1994	J	`jnl`	A Single-Exponential Upper Bound for Finding Shortest Paths in Three Dimensions. J. ACM John H. Reif, James A. Storer
1994	A*	`conf`	An O(n^1+epsilon log b) Algorithm for the Complex Roots Problem FOCS C. Andrew Neff, John H. Reif
1994	J	`jnl`	Computability and Complexity of Ray Tracing. Discret. Comput. Geom. John H. Reif, J. D. Tygar, Akitoshi Yoshida
1994	B	`conf`	Data Compression Techniques for Stock Market Prediction. Data Compression Conference Salman Azhar, Greg J. Badros, Arman Glodjo, Ming-Yang Kao, John H. Reif
1994	J	`jnl`	Directed Comb. Joseph Cheriyan, John H. Reif
1994	A*	`conf`	Dynamic Algebraic Algorithms. SODA John H. Reif, Stephen R. Tate
1994	B	`conf`	Dynamic Parallel Tree Contraction (Extended Abstract). SPAA John H. Reif, Stephen R. Tate
1994	J	`jnl`	Erratum: Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems. SIAM J. Comput. John H. Reif, Sandeep Sen
1994	—	`conf`	Models and Resource Metrics for Parallel and Distributed Computation. IPPS John H. Reif
1994	J	`jnl`	Motion Planning in the Presence of Moving Obstacles. J. ACM John H. Reif, Micha Sharir
1994	B	`conf`	O(log² n) Time Efficient Parallel Factorization of Dense, Sparse Separable, and Banded Matrices. SPAA John H. Reif
1994	J	`jnl`	Optical computing techniques for image/video compression. Proc. IEEE Akitoshi Yoshida, John H. Reif
1994	J	`jnl`	Planarity Testing in Parallel. J. Comput. Syst. Sci. Vijaya Ramachandran, John H. Reif
1994	J	`jnl`	Randomized Algorithms for Binary Search and Load Balancing on Fixed Connection Networks with Geometric Applications. SIAM J. Comput. John H. Reif, Sandeep Sen
1994	J	`jnl`	Shortest Paths in the Plane with Polygonal Obstacles. J. ACM James A. Storer, John H. Reif
1994	—	`conf`	Specification and Development of Parallel Algorithms with the Proteus System. Specification of Parallel Algorithms Allen Goldberg, Peter Mills, Lars S. Nyland, Jan F. Prins, John H. Reif, James Riely
1993	B	`conf`	A Dynamic Separator Algorithm. WADS Deganit Armon, John H. Reif
1993	A*	`conf`	An O(n log ^3 n) Algorithm for the Real Root Problem FOCS John H. Reif
1993	J	`jnl`	Continuous Alternation: The Complexity of Pursuit in Continuous Domains. Algorithmica John H. Reif, Stephen R. Tate
1993	J	`jnl`	Fast and Efficient Parallel Solution of Sparse Linear Systems. SIAM J. Comput. Victor Y. Pan, John H. Reif
1993	J	`jnl`	Kinodynamic Motion Planning. J. ACM Bruce Randall Donald, Patrick G. Xavier, John F. Canny, John H. Reif
1993	B	`conf`	Multispectral Image Compression Algorithms. Data Compression Conference Tassos Markas, John H. Reif
1993	J	`jnl`	On the design and implementation of a lossless data compression and decompression chip. IEEE J. Solid State Circuits Mark Royals, Tassos Markas, Nick Kanopoulos, John H. Reif, James A. Storer
1993	B	`conf`	Parallel and Output Sensitive Algorithms for Combinatorial and Linear Algebra Problems. SPAA Joseph Cheriyan, John H. Reif
1993	A*	`conf`	Searching in an Unknown Environment: An Optimal Randomized Algorithm for the Cow-Path Problem. SODA Ming-Yang Kao, John H. Reif, Stephen R. Tate
1993	A*	`conf`	The Complexity of N-body Simulation. ICALP John H. Reif, Stephen R. Tate
1993	A*	`conf`	Using Difficulty of Prediction to Decrease Computation: Fast Sort, Priority Queue and Convex Hull on Entropy Bounded Inputs FOCS Shenfeng Chen, John H. Reif
1992	J	`jnl`	Compact Multigrid. SIAM J. Sci. Comput. Victor Y. Pan, John H. Reif
1992	A*	`conf`	Directed SODA Joseph Cheriyan, John H. Reif
1992	B	`conf`	Efficient Parallel Algorithms for Computing all Pair Shortest Paths in Directed Graphs. SPAA Yijie Han, Victor Y. Pan, John H. Reif
1992	J	`jnl`	Expected Parallel Time and Sequential Space Complexity of Graph and Digraph Problems. Algorithmica John H. Reif, Paul G. Spirakis
1992	B	`conf`	Implementations of Randomized Sorting on Large Parallel Machines. SPAA William L. Hightower, Jan F. Prins, John H. Reif
1992	J	`jnl`	Nested Annealing: A Provable Improvement to Simulated Annealing. Theor. Comput. Sci. Sanguthevar Rajasekaran, John H. Reif
1992	J	`jnl`	On Threshold Circuits and Polynomial Computation. SIAM J. Comput. John H. Reif, Stephen R. Tate
1992	B	`conf`	Optical Techniques for Image Compression. Data Compression Conference John H. Reif, Akitoshi Yoshida
1992	J	`jnl`	Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems. SIAM J. Comput. John H. Reif, Sandeep Sen
1992	J	`jnl`	Optimal Randomized Parallel Algorithms for Computational Geometry. Algorithmica John H. Reif, Sandeep Sen
1992	—	`conf`	Prototyping N-Body Simulation in Proteus. IPPS Peter Mills, Lars S. Nyland, Jan F. Prins, John H. Reif
1992	J	`jnl`	Quad Tree Structures for Image Compression Applications. Inf. Process. Manag. Tassos Markas, John H. Reif
1992	B	`conf`	Space and Time Efficient Implementations of Parallel Nested Dissection. SPAA Deganit Armon, John H. Reif
1992	A*	`conf`	The Power of Combining the Techiques of Algebraic and Numerical Computing: Improved Approximate Multipoint Polynomial Evaluation and Improved Multipole Algorithms FOCS Victor Y. Pan, John H. Reif, Stephen R. Tate
1991	J	`jnl`	A Parallel Architecture for High-Speed Data Compression. J. Parallel Distributed Comput. James A. Storer, John H. Reif
1991	A*	`conf`	An Efficient Algorithm for the Genus Problem with Explicit Construction of Forbidden Subgraphs STOC Hristo N. Djidjev, John H. Reif
1991	J	`jnl`	An Exact Algorithm for Kinodynamic Planning in the Plane. Discret. Comput. Geom. John F. Canny, Ashutosh Rege, John H. Reif
1991	—	`conf`	How Do We Make Parallel Processing a Reality? Bridging the Gap Between Theory and Practice. IPPS 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
1991	B	`conf`	Image Compression Methods with Distortion Controlled Capabilities. Data Compression Conference Tassos Markas, John H. Reif
1991	J	`jnl`	Parallel Tree Contraction, Part 2: Further Applications. SIAM J. Comput. Gary L. Miller, John H. Reif
1991	B	`ed.`	Proceedings of the IEEE Data Compression Conference, DCC 1991, Snowbird, Utah, USA, April 8-11, 1991. DCC James A. Storer, John H. Reif
1991	—	`conf`	Prototyping parallel and distributed programs in Proteus. SPDP Peter Mills, Lars S. Nyland, Jan F. Prins, John H. Reif, Robert A. Wagner
1991	J	`jnl`	The Parallel Computation of Minimum Cost Paths in Graphs by Stream Contraction. Inf. Process. Lett. Victor Y. Pan, John H. Reif
1990	B	`conf`	A Randomized Parallel Algorithm for Planar Graph Isomorphism. SPAA Hillel Gazit, John H. Reif
1990	—	`conf`	An Exact Algorithm for Kinodynamic Planning in the Plane. SCG John F. Canny, Ashutosh Rege, John H. Reif
1990	J	`jnl`	BLITZEN: A Highly Integrated Massively Parallel Machine. J. Parallel Distributed Comput. Donald W. Blevins, Edward W. Davis, Robert A. Heaton, John H. Reif
1990	J	`jnl`	Data flow analysis of distributed communicating processes. Int. J. Parallel Program. John H. Reif, Scott A. Smolka
1990	—	`conf`	Efficient Parallel Algorithms for Optical Computing with the DFT Primitive. FSTTCS John H. Reif, Akhilesh Tyagi
1990	—	`conf`	Energy complexity of optical computations. SPDP Akhilesh Tyagi, John H. Reif
1990	A*	`conf`	On the Bit-Complexity of Discrete Solutions of PDEs: Compact Multigrid. ICALP Victor Y. Pan, John H. Reif
1990	J	`jnl`	Optimal Size Integer Division Circuits. SIAM J. Comput. John H. Reif, Stephen R. Tate
1990	B	`conf`	Randomized Algorithms for Binary Search and Load Balancing with Geometric Applications. SPAA John H. Reif, Sandeep Sen
1990	A*	`conf`	The Computability and Complexity of Optical Beam Tracing FOCS John H. Reif, J. D. Tygar, Akitoshi Yoshida
1989	A*	`conf`	An Optimal Parallel Algorithm for Graph Planarity (Extended Abstract) FOCS Vijaya Ramachandran, John H. Reif
1989	J	`jnl`	Fast and Efficient Solution of Path Algebra Problems. J. Comput. Syst. Sci. Victor Y. Pan, John H. Reif
1989	A*	`conf`	Optimal Size Integer Division Circuits STOC John H. Reif, Stephen R. Tate
1989	J	`jnl`	Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms. SIAM J. Comput. Sanguthevar Rajasekaran, John H. Reif
1989	J	`jnl`	Parallel Processing Can Be Harmful: The Unusual Behavior of Interpolation Search Inf. Comput. Dan E. Willard, John H. Reif
1989	J	`jnl`	Parallel Tree Contraction Part 1: Fundamentals. Adv. Comput. Res. Gary L. Miller, John H. Reif
1989	A*	`conf`	Polling: A New Randomized Sampling Technique for Computational Geometry STOC John H. Reif, Sandeep Sen
1989	—	`conf`	Randomization in Parallel Algorithms and its Impact on Computational Geometry. Optimal Algorithms John H. Reif, Sandeep Sen
1989	—	`conf`	Randomized Parallel Algorithms. IFIP Congress John H. Reif, Sandeep Sen
1989	A*	`conf`	The Light Bulb Problem. COLT Ramamohan Paturi, Sanguthevar Rajasekaran, John H. Reif
1988	B	`conf`	3-Dimensional Shortest Paths in the Presence of Polyhedral Obstacles. MFCS John H. Reif, James A. Storer
1988	J	`jnl`	A Simple Three-Dimensional Real-Time Reliable Cellular Array. J. Comput. Syst. Sci. Péter Gács, John H. Reif
1988	—	`conf`	An Efficient Output-Sensitive Hidden Surface Removal Algorithm and Its Parallelization. SCG John H. Reif, Sandeep Sen
1988	J	`jnl`	An Efficient Parallel Algorithm for Planarity. J. Comput. Syst. Sci. Philip N. Klein, John H. Reif
1988	J	`jnl`	Efficient Parallel Pseudorandom Number Generation. SIAM J. Comput. John H. Reif, J. D. Tygar
1988	A*	`conf`	Nested Annealing: A Provable Improvement to Simulated Annealing. ICALP Sanguthevar Rajasekaran, John H. Reif
1988	A*	`conf`	On the Complexity of Kinodynamic Planning FOCS John F. Canny, Bruce Randall Donald, John H. Reif, Patrick G. Xavier
1988	J	`jnl`	Parallel Time O(log n) Acceptance of Deterministic CFLs on an Exclusive-Write P-RAM. SIAM J. Comput. Philip N. Klein, John H. Reif
1988	J	`jnl`	The Complexity of Reachability in Distributed Communicating Processes. Acta Informatica John H. Reif, Scott A. Smolka
1988	—	`ed.`	VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, AWOC 88, Corfu, Greece, June 28 - July 1, 1988, Proceedings AWOC John H. Reif
1987	J	`jnl`	A Topological Approach to Dynamic Graph Connectivity. Inf. Process. Lett. John H. Reif
1987	J	`jnl`	A logarithmic time sort for linear size networks. J. ACM John H. Reif, Leslie G. Valiant
1987	J	`jnl`	Minimizing turns for discrete movement in the interior of a polygon. IEEE J. Robotics Autom. John H. Reif, James A. Storer
1987	A*	`conf`	New Lower Bound Techniques for Robot Motion Planning Problems FOCS John F. Canny, John H. Reif
1987	—	`conf`	On threshold circuits and polynomial computation. SCT John H. Reif
1987	B	`conf`	Optimal Randomized Parallel Algorithms for Computational Geometry. ICPP John H. Reif, Sandeep Sen
1987	B	`conf`	Ranomized Parallel Computation. FCT Sanguthevar Rajasekaran, John H. Reif
1987	A*	`conf`	Some Polynomial and Toeplitz Matrix Computations FOCS Victor Y. Pan, John H. Reif
1986	A*	`conf`	An Efficient Parallel Algorithm for Planarity FOCS Philip N. Klein, John H. Reif
1986	J	`jnl`	Arithmetic Theories for Computational Complexity Problems Inf. Control. Steven Homer, John H. Reif
1986	J	`jnl`	Efficient Symbolic Analysis of Programs. J. Comput. Syst. Sci. John H. Reif, Harry R. Lewis
1986	—	`conf`	Extension of the Parallel Nested Dissection Algorithm to Path Algebra Problems. FSTTCS Victor Y. Pan, John H. Reif
1986	—	`conf`	Fast and Efficient Parallel Linear Programming and Linear Least Squares Computations. Aegean Workshop on Computing Victor Y. Pan, John H. Reif
1986	J	`jnl`	Logarithmic Depth Circuits for Algebraic Functions. SIAM J. Comput. John H. Reif
1986	J	`jnl`	The Complexity of Elementary Algebra and Geometry. J. Comput. Syst. Sci. Michael Ben-Or, Dexter Kozen, John H. Reif
1986	B	`conf`	The Logic of Distributed Protocols. TARK Richard E. Ladner, John H. Reif
1985	J	`jnl`	A Multiprocess Network Logic with Temporal and Spatial Modalities. J. Comput. Syst. Sci. John H. Reif, A. Prasad Sistla
1985	A*	`conf`	A Simple Three-Dimensional Real-Time Reliable Cellular Array STOC Péter Gács, John H. Reif
1985	A*	`conf`	An Optimal Parallel Algorithm for Integer Sorting FOCS John H. Reif
1985	J	`jnl`	Depth-First Search is Inherently Sequential. Inf. Process. Lett. John H. Reif
1985	A*	`conf`	Efficient Parallel Pseudo-Random Number Generation. CRYPTO John H. Reif, J. D. Tygar
1985	A*	`conf`	Efficient Parallel Solution of Linear Systems STOC Victor Y. Pan, John H. Reif
1985	A*	`conf`	Motion Planning in the Presence of Moving Obstacles FOCS John H. Reif, Micha Sharir
1985	A*	`conf`	Parallel Tree Contraction and Its Application FOCS Gary L. Miller, John H. Reif
1985	B	`conf`	Probabilistic algorithms in group theory. FCT John H. Reif
1985	J	`jnl`	Unbounded Speed Variability in Distributed Communications Systems. SIAM J. Comput. John H. Reif, Paul G. Spirakis
1985	J	`jnl`	k-connectivity in random undirected graphs. Discret. Math. John H. Reif, Paul G. Spirakis
1984	J	`jnl`	On Synchronous Parallel Computations with Independent Probabilistic Choice. SIAM J. Comput. John H. Reif
1984	A*	`conf`	Probabilistic Bidding Gives Optimal Distributed Resource Allocation. ICALP John H. Reif, Paul G. Spirakis
1984	J	`jnl`	Real-Time Synchronization of Interprocess Communications. ACM Trans. Program. Lang. Syst. John H. Reif, Paul G. Spirakis
1984	J	`jnl`	Symmetric Complementation. J. ACM John H. Reif
1984	A*	`conf`	The Complexity of Elementary Algebra and Geometry (Preliminary Abstract) STOC Michael Ben-Or, Dexter Kozen, John H. Reif
1984	J	`jnl`	The Complexity of Two-Player Games of Incomplete Information. J. Comput. Syst. Sci. John H. Reif
1983	A*	`conf`	A Logarithmic Time Sort for Linear Size Networks STOC John H. Reif, Leslie G. Valiant
1983	A*	`conf`	A Multiprocess Network Logic with Temporal and Spatial Modalities. ICALP John H. Reif, A. Prasad Sistla
1983	—	`conf`	Deriving Efficient Graph Algorithms (Summary). Logic of Programs John H. Reif, William L. Scherlis
1983	A*	`conf`	Logarithmic Depth Circuits for Algebraic Functions FOCS John H. Reif
1983	J	`jnl`	Minimum s-t Cut of a Planar Undirected Network in O(n log SIAM J. Comput. John H. Reif
1983	J	`jnl`	The Propositional Dynamic Logic of Deterministic, Well-Structured Programs. Theor. Comput. Sci. Joseph Y. Halpern, John H. Reif
1982	A*	`conf`	On the Power of Probabilistic Choice in Synchronous Parallel Computations. ICALP John H. Reif
1982	A*	`conf`	Parallel Time O(log N) Acceptance of Deterministic CFLs FOCS John H. Reif
1982	A*	`conf`	Real Time Resource Allocation in Distributed Systems. PODC John H. Reif, Paul G. Spirakis
1982	J	`jnl`	Symbolic Program Analysis in Almost-Linear Time. SIAM J. Comput. John H. Reif, Robert Endre Tarjan
1982	A*	`conf`	Symmetric Complementation STOC John H. Reif
1982	A*	`conf`	Unbounded Speed Variability in Distributed Communication Systems. POPL John H. Reif, Paul G. Spirakis
1981	A*	`conf`	Distributed Algorithms for Synchronizing Interprocess Communication within Real Time STOC John H. Reif, Paul G. Spirakis
1981	A*	`conf`	Minimum S-T Cut of a Planar Undirected Network in O(n log²(n)) Time. ICALP John H. Reif
1981	A*	`conf`	The Propositional Dynamic Logic of Deterministic, Well-Structured Programs (Extended Abstract) FOCS Joseph Y. Halpern, John H. Reif
1980	A*	`conf`	A Dynamic Logic of Multiprocessing with Incomplete Information. POPL John H. Reif, Gary L. Peterson
1980	J	`jnl`	Code Motion. SIAM J. Comput. John H. Reif
1980	A*	`conf`	Logics for Probabilistic Programming (Extended Abstract) STOC John H. Reif
1980	A*	`conf`	Random Matroids STOC John H. Reif, Paul G. Spirakis
1979	A*	`conf`	Complexity of the Mover's Problem and Generalizations (Extended Abstract) FOCS John H. Reif
1979	A*	`conf`	Data Flow Analysis of Communicating Processes. POPL John H. Reif
1979	A*	`conf`	Multiple-Person Alternation FOCS Gary L. Peterson, John H. Reif
1979	A*	`conf`	On Determining the Genus of a Graph in O(v^O(g)) Steps STOC I. S. Filotti, Gary L. Miller, John H. Reif
1979	A*	`conf`	Universal Games of Incomplete Information STOC John H. Reif
1978	A*	`conf`	Symbolic Programming Analysis in Almost Linear Time. POPL John H. Reif
1977	A*	`conf`	Symbolic Evaluation and the Global Value Graph. POPL John H. Reif, Harry R. Lewis