John H. Reif

	2011
229		Harish Chandran, Nikhil Gopalkrishnan, Andrew Phillips, John H. Reif: Localized Hybridization Circuits. DNA 2011: 64-83
228		John H. Reif: Keynote: DNA-based molecular devices. ICCABS 2011: 3
227		John H. Reif, Sam Slee: Asymptotically Optimal Kinodynamic Motion Planning for a Class of Modular Self-Reconfigurable Robots. Int. J. Comput. Geometry Appl. 21(2): 131-155 (2011)
226		Urmi Majumder, John H. Reif: Design of a biomolecular device that executes process algebra. Natural Computing 10(1): 447-466 (2011)
225		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)
	2010
224		Nikhil Gopalkrishnan, Harish Chandran, John H. Reif: High-Fidelity DNA Hybridization Using Programmable Molecular DNA Devices. DNA 2010: 59-70
223		Sam Slee, John H. Reif: Robomotion: Scalable, Physically Stable Locomotion for Self-reconfigurable Robots. WAFR 2010: 121-137
222		Sudheer Sahu, John H. Reif: Capabilities and Limits of Compact Error Resilience Methods for Algorithmic Self-Assembly. Algorithmica 56(4): 480-504 (2010)
221		John H. Reif, Urmi Majumder: Isothermal reactivating Whiplash PCR for locally programmable molecular computation. Natural Computing 9(1): 183-206 (2010)
	2009
220		Urmi Majumder, John H. Reif: Design of a Biomolecular Device That Executes Process Algebra. DNA 2009: 97-105
219		Harish Chandran, Nikhil Gopalkrishnan, John H. Reif: The Tile Complexity of Linear Assemblies. ICALP (1) 2009: 235-253
218		John H. Reif: Mechanical Computing: The Computational Complexity of Physical Devices. Encyclopedia of Complexity and Systems Science 2009: 5466-5482
217		John H. Reif, Sudheer Sahu: Autonomous programmable DNA nanorobotic devices using DNAzymes. Theor. Comput. Sci. 410(15): 1428-1439 (2009)
	2008
216		John H. Reif, Urmi Majumder: Isothermal Reactivating Whiplash PCR for Locally Programmable Molecular Computation. DNA 2008: 41-56
215		Urmi Majumder, John H. Reif: A Framework for Designing Novel Magnetic Tiles Capable of Complex Self-assemblies. UC 2008: 129-145
214		John H. Reif, Simon Kasif, Deepak Sherlekar: Formula dissection: A parallel algorithm for constraint satisfaction. Computers & Mathematics with Applications 55(6): 1170-1177 (2008)
	2007
213		Urmi Majumder, Thomas H. LaBean, John H. Reif: Activatable Tiles: Compact, Robust Programmable Assembly and Other Applications. DNA 2007: 15-25
212		John H. Reif, Sudheer Sahu: Autonomous Programmable Nanorobotic Devices Using DNAzymes. DNA 2007: 66-78
211		Ashish Gehani, John H. Reif: Super-Resolution Video Analysis for Forensic Investigations. IFIP Int. Conf. Digital Forensics 2007: 281-299
210		John H. Reif, Sam Slee: Optimal Kinodynamic Motion Planning for 2D Reconfiguration of Self-Reconfigurable Robots. Robotics: Science and Systems 2007
209		John H. Reif, Thomas H. LaBean: Autonomous Programmable Biomolecular Devices Using Self-assembled DNA Nanostructures. WoLLIC 2007: 297-306
208		John H. Reif, Thomas H. LaBean: Autonomous programmable biomolecular devices using self-assembled DNA nanostructures. Commun. ACM 50(9): 46-53 (2007)
207		Zheng Sun, John H. Reif: On Robotic Optimal Path Planning in Polygonal Regions With Pseudo-Euclidean Metrics. IEEE Transactions on Systems, Man, and Cybernetics, Part B 37(4): 925-936 (2007)
206		John H. Reif, Sukhendu Chakraborty: Efficient and exact quantum compression. Inf. Comput. 205(7): 967-981 (2007)
	2006
205		Urmi Majumder, Sudheer Sahu, Thomas H. LaBean, John H. Reif: Design and Simulation of Self-repairing DNA Lattices. DNA 2006: 195-214
204		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
203		Sudheer Sahu, Bei Wang, John H. Reif: A Framework for Modeling DNA Based Molecular Systems. DNA 2006: 250-265
202		John H. Reif, Sudheer Sahu, Peng Yin: Compact Error-Resilient Computational DNA Tilings. Nanotechnology: Science and Computation 2006: 79-103
201		John H. Reif, Sam Slee: Asymptotically Optimal Kinodynamic Motion Planning for Self-reconfigurable Robots. WAFR 2006: 457-472
200		Zheng Sun, John H. Reif: On finding approximate optimal paths in weighted regions. J. Algorithms 58(1): 1-32 (2006)
199		John H. Reif, Zheng Sun: On boundaries of highly visible spaces and applications. Theor. Comput. Sci. 354(3): 379-390 (2006)
	2005
198		John H. Reif, Sudheer Sahu, Peng Yin: Complexity of Graph Self-assembly in Accretive Systems and Self-destructible Systems. DNA 2005: 257-274
197		Sudheer Sahu, Peng Yin, John H. Reif: A Self-assembly Model of Time-Dependent Glue Strength. DNA 2005: 290-304
196		Peng Yin, Sudheer Sahu, Andrew J. Turberfield, John H. Reif: Design of Autonomous DNA Cellular Automata. DNA 2005: 399-416
195		Zheng Sun, John H. Reif: On finding energy-minimizing paths on terrains. IEEE Transactions on Robotics 21(1): 102-114 (2005)
194		Zheng Sun, David Hsu, Tingting Jiang, Hanna Kurniawati, John H. Reif: Narrow passage sampling for probabilistic roadmap planning. IEEE Transactions on Robotics 21(6): 1105-1115 (2005)
193		John H. Reif: Efficient parallel factorization and solution of structured and unstructured linear systems. J. Comput. Syst. Sci. 71(1): 86-143 (2005)
	2004
192		Junghuei Chen, John H. Reif: DNA Computing, 9th International Workshop on DNA Based Computers, DNA9, Madison, WI, USA, June 1-3, 2003, revised Papers Springer 2004
191		Ashish Gehani, Thomas H. LaBean, John H. Reif: DNA-based Cryptography. Aspects of Molecular Computing 2004: 167-188
190		John H. Reif, Sudheer Sahu, Peng Yin: Compact Error-Resilient Computational DNA Tiling Assemblies. DNA 2004: 293-307
189		Peng Yin, Andrew J. Turberfield, John H. Reif: Designs of Autonomous Unidirectional Walking DNA Devices. DNA 2004: 410-425
188		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
187		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
186		John H. Reif, Zheng Sun: Movement Planning in the Presence of Flows. Algorithmica 39(2): 127-153 (2004)
	2003
185		Zheng Sun, John H. Reif: Adaptive and Compact Discretization for Weighted Region Optimal Path Finding. FCT 2003: 258-270
184		John H. Reif, Zheng Sun: On Boundaries of Highly Visible Spaces and Applications. FCT 2003: 271-283
183		Zheng Sun, John H. Reif: On energy-minimizing paths on terrains for a mobile robot. ICRA 2003: 3782-3788
182		David Hsu, Tingting Jiang, John H. Reif, Zheng Sun: The bridge test for sampling narrow passages with probabilistic roadmap planners. ICRA 2003: 4420-4426
181		John H. Reif, William L. Scherlis: Deriving Effcient Graph Algorithms. Verification: Theory and Practice 2003: 645-681
180		John H. Reif: Guest Editor's Foreword. J. Comput. Syst. Sci. 67(2): 211 (2003)
179		John H. Reif: The design of autonomous DNA nano-mechanical devices: Walking and rolling DNA. Natural Computing 2(4): 439-461 (2003)
178		John H. Reif, Zheng Sun: On Frictional Mechanical Systems and Their Computational Power. SIAM J. Comput. 32(6): 1449-1474 (2003)
	2002
177		John H. Reif: Proceedings on 34th Annual ACM Symposium on Theory of Computing, May 19-21, 2002, Montréal, Québec, Canada ACM 2002
176		Dage Liu, John H. Reif, Thomas H. LaBean: DNA Nanotubes: Construction and Characterization of Filaments Composed of TX-tile Lattice. DNA 2002: 10-21
175		John H. Reif: The Design of Autonomous DNA Nanomechanical Devices: Walking and Rolling DNA. DNA 2002: 22-37
174		John H. Reif: Molecular Assembly and Computation: From Theory to Experimental Demonstrations. ICALP 2002: 1-21
173		John H. Reif: The Emerging Discipline of Biomolecular Computation in the US. New Generation Comput. 20(3): 217-236 (2002)
	2001
172		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
171		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
170		Zheng Sun, John H. Reif: BUSHWHACK: An Approximation Algorithm for Minimal Paths through Pseudo-Euclidean Spaces. ISAAC 2001: 160-171
169		John H. Reif, Zheng Sun: Movement Planning in the Presence of Flows. WADS 2001: 450-461
168		John H. Reif: Efficient Parallel Computation of the Characteristic Polynomial of a Sparse, Separable Matrix. Algorithmica 29(3): 487-510 (2001)
167		John H. Reif, James A. Storer: Optimal encoding of non-stationary sources. Inf. Sci. 135(1-2): 87-105 (2001)
166		John H. Reif: Parallel Output-Sensitive Algorithms for Combinatorial and Linear Algebra Problems. J. Comput. Syst. Sci. 62(3): 398-412 (2001)
	2000
165		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
164		John H. Reif, Thomas H. LaBean, Nadrian C. Seeman: Challenges and Applications for Self-Assembled DNA Nanostructures. DNA Computing 2000: 173-198
163		John H. Reif: Fast Spatial Decomposition and Closest Pair Computation for Limited Precision Input. Algorithmica 28(3): 271-287 (2000)
162		John H. Reif: On the Impossibility of Interaction-Free Quantum Sensing for Small I/O Bandwidth. Inf. Comput. 163(1): 103-122 (2000)
161		John H. Reif, Hongyan Wang: Nonuniform Discretization for Kinodynamic Motion Planning and its Applications. SIAM J. Comput. 30(1): 161-190 (2000)
	1999
160		John H. Reif: Parallel Biomolecular Computation: Models and Simulations. Algorithmica 25(2-3): 142-175 (1999)
159		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 Distrib. Syst. 10(3): 297-315 (1999)
158		John H. Reif, Hongyan Wang: Social potential fields: A distributed behavioral control for autonomous robots. Robotics and Autonomous Systems 27(3): 171-194 (1999)
157		John H. Reif: Approximate Complex Polynomial Evaluation in Near Constant Work Per Point. SIAM J. Comput. 28(6): 2059-2089 (1999)
	1998
156		John H. Reif, James A. Storer: Optimal Lossless Compression of a Class of Dynamic Sources. Data Compression Conference 1998: 501-510
155		John H. Reif: Alternative Computational Models: A Comparison of Biomolecular and Quantum Computation. FSTTCS 1998: 102-121
154		Hillel Gazit, John H. Reif: A Randomized Parallel Algorithm for Planar Graph Isomorphism. J. Algorithms 28(2): 290-314 (1998)
	1997
153		James A. Storer, John H. Reif: Low-Cost Prevention of Error Propagation for Data Compression with Dynamic Dictionaries. Data Compression Conference 1997: 171-180
152		Sefeng Chen, John H. Reif: Fast and Compact Volume Rendering in the Compressed Transform Domain. Data Compression Conference 1997: 271-280
151		John H. Reif: Approximate Complex Polynomial Evaluation in Near Constant Work Per Point. STOC 1997: 30-39
150		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)
149		John H. Reif, Stephen R. Tate: On Dynamic Algorithms for Algebraic Problems. J. Algorithms 22(2): 347-371 (1997)
148		Erol Gelenbe, Nestor A. Schmajuk, John Staddon, John H. Reif: Autonomous search by robots and animals: A survey. Robotics and Autonomous Systems 22(1): 23-34 (1997)
147		James A. Storer, John H. Reif: Error-Resilient Optimal Data Compression. SIAM J. Comput. 26(4): 934-949 (1997)
	1996
146		Shenfeng Chen, John H. Reif: Efficient Lossless Compression of Trees and Graphs. Data Compression Conference 1996: 428
145		Lars S. Nyland, Jan 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
144		Zhiyong Li, John H. Reif, Sandeep K. Gupta: Synthesizing Efficient Out-of-Core Programs for Block Recursive Algorithms Using Block-Cyclic Data Distributions. ICPP, Vol. 2 1996: 142-149
143		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)
142		C. Andrew Neff, John H. Reif: An Efficient Algorithm for the Complex Roots Problem. J. Complexity 12(2): 81-115 (1996)
141		Zhiyong Li, Peter Mills, John H. Reif: Models and Resource Metrics for Parallel and Distributed Computation. Parallel Algorithms Appl. 8(1): 35-59 (1996)
	1995
140		Shenfeng Chen, John H. Reif: Fast Pattern Matching for Entropy Bounded Text. Data Compression Conference 1995: 282-291
139		John H. Reif: Efficient Parallel Solution of Sparse Eigenvalue and Eigenvector Problems. FOCS 1995: 123-132
138		Zhiyong Li, Peter Mills, John H. Reif: Models and resource metrics for parallel and distributed computation. HICSS (2) 1995: 51-60
137		Sotiris E. Nikoletseas, John H. Reif, Paul G. Spirakis, Moti Yung: Stocastic Graphs Have Short Memory: Fully Dynamic Connectivity in Poly-Log Expected Time. ICALP 1995: 159-170
136		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
135		John H. Reif: Parallel Molecular Computation. SPAA 1995: 213-223
134		John H. Reif: Work efficient parallel solution of Toeplitz systems and polynomial GCD. STOC 1995: 751-761
133		Ramamohan Paturi, Sanguthevar Rajasekaran, John H. Reif: The Light Bulb Problem Inf. Comput. 117(2): 187-192 (1995)
	1994
132		S. Azhar, Greg J. Badros, A. Glodjo, Ming-Yang Kao, John H. Reif: Data Compression Techniques for Stock Market Prediction. Data Compression Conference 1994: 72-82
131		C. Andrew Neff, John H. Reif: An O(n^1+epsilon log b) Algorithm for the Complex Roots Problem FOCS 1994: 540-547
130		John H. Reif: Models and Resource Metrics for Parallel and Distributed Computation. IPPS 1994: 404
129		John H. Reif, Stephen R. Tate: Dynamic Algebraic Algorithms. SODA 1994: 290-301
128		John H. Reif, Stephen R. Tate: Dynamic Parallel Tree Contraction (Extended Abstract). SPAA 1994: 114-121
127		John H. Reif: O(log² n) Time Efficient Parallel Factorization of Dense, Sparse Separable, and Banded Matrices. SPAA 1994: 278-289
126		Joseph Cheriyan, John H. Reif: Directed s-t Numberings, Rubber Bands, and Testing Digraph k-Vertex Connectivity. Combinatorica 14(4): 435-451 (1994)
125		John H. Reif, J. D. Tygar, Akitoshi Yoshida: Computability and Complexity of Ray Tracing. Discrete & Computational Geometry 11: 265-287 (1994)
124		John H. Reif, Micha Sharir: Motion Planning in the Presence of Moving Obstacles. J. ACM 41(4): 764-790 (1994)
123		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)
122		James A. Storer, John H. Reif: Shortest Paths in the Plane with Polygonal Obstacles. J. ACM 41(5): 982-1012 (1994)
121		Vijaya Ramachandran, John H. Reif: Planarity Testing in Parallel. J. Comput. Syst. Sci. 49(3): 517-561 (1994)
120		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)
119		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)
	1993
118		Tassos Markas, John H. Reif: Multispectral Image Compression Algorithms. Data Compression Conference 1993: 391-400
117		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
116		John H. Reif: An O(n log ^3 n) Algorithm for the Real Root Problem FOCS 1993: 626-635
115		John H. Reif, Stephen R. Tate: The Complexity of N-body Simulation. ICALP 1993: 162-176
114		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
113		Joseph Cheriyan, John H. Reif: Parallel and Output Sensitive Algorithms for Combinatorial and Linear Algebra Problems. SPAA 1993: 50-56
112		Deganit Armon, John H. Reif: A Dynamic Separator Algorithm. WADS 1993: 107-118
111		John H. Reif, Stephen R. Tate: Continuous Alternation: The Complexity of Pursuit in Continuous Domains. Algorithmica 10(2-4): 156-181 (1993)
110		Bruce Randall Donald, Patrick G. Xavier, John F. Canny, John H. Reif: Kinodynamic Motion Planning. J. ACM 40(5): 1048-1066 (1993)
109		Victor Y. Pan, John H. Reif: Fast and Efficient Parallel Solution of Sparse Linear Systems. SIAM J. Comput. 22(6): 1227-1250 (1993)
	1992
108		John H. Reif, Akitoshi Yoshida: Optical Techniques for Image Compression. Data Compression Conference 1992: 32-41
107		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
106		Peter Mills, Lars S. Nyland, Jan Prins, John H. Reif: Prototyping N-Body Simulation in Proteus. IPPS 1992: 476-482
105		Joseph Cheriyan, John H. Reif: Directed s-t Bumberings, Rubber Bands, and Testing Digraph k-Vertex Connectivity. SODA 1992: 335-344
104		William L. Hightower, Jan Prins, John H. Reif: Implementations of Randomized Sorting on Large Parallel Machines. SPAA 1992: 158-167
103		Deganit Armon, John H. Reif: Space and Time Efficient Implementations of Parallel Nested Dissection. SPAA 1992: 344-352
102		Yijie Han, Victor Y. Pan, John H. Reif: Efficient Parallel Algorithms for Computing all Pair Shortest Paths in Directed Graphs. SPAA 1992: 353-362
101		John H. Reif, Sandeep Sen: Optimal Randomized Parallel Algorithms for Computational Geometry. Algorithmica 7(1): 91-117 (1992)
100		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)
99		Tassos Markas, John H. Reif: Quad Tree Structures for Image Compression Applications. Inf. Process. Manage. 28(6): 707-722 (1992)
98		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)
97		John H. Reif, Stephen R. Tate: On Threshold Circuits and Polynomial Computation. SIAM J. Comput. 21(5): 896-908 (1992)
96		Sanguthevar Rajasekaran, John H. Reif: Nested Annealing: A Provable Improvement to Simulated Annealing. Theor. Comput. Sci. 99(1): 157-176 (1992)
	1991
95		James A. Storer, John H. Reif: Proceedings of the IEEE Data Compression Conference, DCC 1991, Snowbird, Utah, April 8-11, 1991. IEEE Computer Society 1991
94		Tassos Markas, John H. Reif: Image Compression Methods with Distortion Controlled Capabilities. Data Compression Conference 1991: 93-102
93		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
92		Peter Mills, Lars S. Nyland, Jan Prins, John H. Reif, Robert A. Wagner: Prototyping parallel and distributed programs in Proteus. SPDP 1991: 26-34
91		Hristo Djidjev, John H. Reif: An Efficient Algorithm for the Genus Problem with Explicit Construction of Forbidden Subgraphs STOC 1991: 337-347
90		John F. Canny, Ashutosh Rege, John H. Reif: An Exact Algorithm for Kinodynamic Planning in the Plane. Discrete & Computational Geometry 6: 461-484 (1991)
89		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)
88		James A. Storer, John H. Reif: A Parallel Architecture for High-Speed Data Compression. J. Parallel Distrib. Comput. 13(2): 222-227 (1991)
87		Gary L. Miller, John H. Reif: Parallel Tree Contraction, Part 2: Further Applications. SIAM J. Comput. 20(6): 1128-1147 (1991)
	1990
86		John H. Reif, J. D. Tygar, Akitoshi Yoshida: The Computability and Complexity of Optical Beam Tracing FOCS 1990: 106-114
85		John H. Reif, Akhilesh Tyagi: Efficient Parallel Algorithms for Optical Computing with the DFT Primitive. FSTTCS 1990: 149-160
84		Victor Y. Pan, John H. Reif: On the Bit-Complexity of Discrete Solutions of PDEs: Compact Multigrid. ICALP 1990: 612-625
83		Hillel Gazit, John H. Reif: A Randomized Parallel Algorithm for Planar Graph Isomorphism. SPAA 1990: 210-219
82		John H. Reif, Sandeep Sen: Randomized Algorithms for Binary Search and Load Balancing with Geometric Applications. SPAA 1990: 327-339
81		Akhilesh Tyagi, John H. Reif: Energy complexity of optical computations. SPDP 1990: 14-21
80		John F. Canny, Ashutosh Rege, John H. Reif: An Exact Algorithm for Kinodynamic Planning in the Plane. Symposium on Computational Geometry 1990: 271-280
79		John H. Reif, Scott A. Smolka: Data flow analysis of distributed communicating processes. International Journal of Parallel Programming 19(1): 1-30 (1990)
78		Donald W. Blevins, Edward W. Davis, Robert A. Heaton, John H. Reif: BLITZEN: A Highly Integrated Massively Parallel Machine. J. Parallel Distrib. Comput. 8(2): 150-160 (1990)
77		John H. Reif, Stephen R. Tate: Optimal Size Integer Division Circuits. SIAM J. Comput. 19(5): 912-924 (1990)
	1989
76		Ramamohan Paturi, Sanguthevar Rajasekaran, John H. Reif: The Light Bulb Problem. COLT 1989: 261-268
75		Vijaya Ramachandran, John H. Reif: An Optimal Parallel Algorithm for Graph Planarity (Extended Abstract) FOCS 1989: 282-287
74		John H. Reif, Sandeep Sen: Randomized Parallel Algorithms. IFIP Congress 1989: 455-458
73		John H. Reif, Sandeep Sen: Randomization in Parallel Algorithms and its Impact on Computational Geometry. Optimal Algorithms 1989: 1-8
72		John H. Reif, Stephen R. Tate: Optimal Size Integer Division Circuits STOC 1989: 264-273
71		John H. Reif, Sandeep Sen: Polling: A New Randomized Sampling Technique for Computational Geometry STOC 1989: 394-404
70		Dan E. Willard, John H. Reif: Parallel Processing Can Be Harmful: The Unusual Behavior of Interpolation Search Inf. Comput. 81(3): 364-379 (1989)
69		Victor Y. Pan, John H. Reif: Fast and Efficient Solution of Path Algebra Problems. J. Comput. Syst. Sci. 38(3): 494-510 (1989)
68		Sanguthevar Rajasekaran, John H. Reif: Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms. SIAM J. Comput. 18(3): 594-607 (1989)
	1988
67		John H. Reif: VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, AWOC 88, Corfu, Greece, June 28 - July 1, 1988, Proceedings Springer 1988
66		John F. Canny, Bruce Randall Donald, John H. Reif, Patrick G. Xavier: On the Complexity of Kinodynamic Planning FOCS 1988: 306-316
65		Sanguthevar Rajasekaran, John H. Reif: Nested Annealing: A Provable Improvement to Simulated Annealing. ICALP 1988: 455-472
64		John H. Reif, James A. Storer: 3-Dimensional Shortest Paths in the Presence of Polyhedral Obstacles. MFCS 1988: 85-92
63		John H. Reif, Sandeep Sen: An Efficient Output-Sensitive Hidden Surface Removal Algorithm and Its Parallelization. Symposium on Computational Geometry 1988: 193-200
62		John H. Reif, Scott A. Smolka: The Complexity of Reachability in Distributed Communicating Processes. Acta Inf. 25(3): 333-354 (1988)
61		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)
60		Philip N. Klein, John H. Reif: An Efficient Parallel Algorithm for Planarity. J. Comput. Syst. Sci. 37(2): 190-246 (1988)
59		John H. Reif, J. D. Tygar: Efficient Parallel Pseudorandom Number Generation. SIAM J. Comput. 17(2): 404-411 (1988)
58		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)
	1987
57		Sanguthevar Rajasekaran, John H. Reif: Ranomized Parallel Computation. FCT 1987: 364-376
56		Victor Y. Pan, John H. Reif: Some Polynomial and Toeplitz Matrix Computations FOCS 1987: 173-184
55		John F. Canny, John H. Reif: New Lower Bound Techniques for Robot Motion Planning Problems FOCS 1987: 49-60
54		John H. Reif, Sandeep Sen: Optimal Randomized Parallel Algorithms for Computational Geometry. ICPP 1987: 270-277
53		John H. Reif: A Topological Approach to Dynamic Graph Connectivity. Inf. Process. Lett. 25(1): 65-70 (1987)
52		John H. Reif, Leslie G. Valiant: A logarithmic time sort for linear size networks. J. ACM 34(1): 60-76 (1987)
	1986
51		Victor Y. Pan, John H. Reif: Fast and Efficient Parallel Linear Programming and Linear Least Squares Computations. Aegean Workshop on Computing 1986: 283-295
50		Philip N. Klein, John H. Reif: An Efficient Parallel Algorithm for Planarity FOCS 1986: 465-477
49		Victor Y. Pan, John H. Reif: Extension of the Parallel Nested Dissection Algorithm to Path Algebra Problems. FSTTCS 1986: 470-487
48		Richard E. Ladner, John H. Reif: The Logic of Distributed Protocols. TARK 1986: 207-222
47		Steven Homer, John H. Reif: Arithmetic Theories for Computational Complexity Problems Information and Control 69(1-3): 1-11 (1986)
46		Michael Ben-Or, Dexter Kozen, John H. Reif: The Complexity of Elementary Algebra and Geometry. J. Comput. Syst. Sci. 32(2): 251-264 (1986)
45		John H. Reif, Harry R. Lewis: Efficient Symbolic Analysis of Programs. J. Comput. Syst. Sci. 32(3): 280-314 (1986)
44		John H. Reif: Logarithmic Depth Circuits for Algebraic Functions. SIAM J. Comput. 15(1): 231-242 (1986)
	1985
43		John H. Reif, J. D. Tygar: Efficient Parallel Pseudo-Random Number Generation. CRYPTO 1985: 433-446
42		John H. Reif: Probabilistic algorithms in group theory. FCT 1985: 341-350
41		John H. Reif, Micha Sharir: Motion Planning in the Presence of Moving Obstacles FOCS 1985: 144-154
40		Gary L. Miller, John H. Reif: Parallel Tree Contraction and Its Application FOCS 1985: 478-489
39		John H. Reif: An Optimal Parallel Algorithm for Integer Sorting FOCS 1985: 496-504
38		Victor Y. Pan, John H. Reif: Efficient Parallel Solution of Linear Systems STOC 1985: 143-152
37		Péter Gács, John H. Reif: A Simple Three-Dimensional Real-Time Reliable Cellular Array STOC 1985: 388-395
36		John H. Reif, Paul G. Spirakis: k-connectivity in random undirected graphs. Discrete Mathematics 54(2): 181-191 (1985)
35		John H. Reif: Depth-First Search is Inherently Sequential. Inf. Process. Lett. 20(5): 229-234 (1985)
34		John H. Reif, A. Prasad Sistla: A Multiprocess Network Logic with Temporal and Spatial Modalities. J. Comput. Syst. Sci. 30(1): 41-53 (1985)
33		John H. Reif, Paul G. Spirakis: Unbounded Speed Variability in Distributed Communications Systems. SIAM J. Comput. 14(1): 75-92 (1985)
	1984
32		John H. Reif, Paul G. Spirakis: Probabilistic Bidding Gives Optimal Distributed Resource Allocation. ICALP 1984: 391-402
31		Michael Ben-Or, Dexter Kozen, John H. Reif: The Complexity of Elementary Algebra and Geometry (Preliminary Abstract) STOC 1984: 457-464
30		John H. Reif, Paul G. Spirakis: Real-Time Synchronization of Interprocess Communications. ACM Trans. Program. Lang. Syst. 6(2): 215-238 (1984)
29		John H. Reif: Symmetric Complementation. J. ACM 31(2): 401-421 (1984)
28		John H. Reif: The Complexity of Two-Player Games of Incomplete Information. J. Comput. Syst. Sci. 29(2): 274-301 (1984)
27		John H. Reif: On Synchronous Parallel Computations with Independent Probabilistic Choice. SIAM J. Comput. 13(1): 46-56 (1984)
	1983
26		John H. Reif: Logarithmic Depth Circuits for Algebraic Functions FOCS 1983: 138-145
25		John H. Reif, A. Prasad Sistla: A Multiprocess Network Logic with Temporal and Spatial Modalities. ICALP 1983: 629-639
24		John H. Reif, William L. Scherlis: Deriving Efficient Graph Algorithms (Summary). Logic of Programs 1983: 421-441
23		John H. Reif, Leslie G. Valiant: A Logarithmic Time Sort for Linear Size Networks STOC 1983: 10-16
22		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)
21		Joseph Y. Halpern, John H. Reif: The Propositional Dynamic Logic of Deterministic, Well-Structured Programs. Theor. Comput. Sci. 27: 127-165 (1983)
	1982
20		John H. Reif: Parallel Time O(log N) Acceptance of Deterministic CFLs FOCS 1982: 290-296
19		John H. Reif: On the Power of Probabilistic Choice in Synchronous Parallel Computations. ICALP 1982: 442-450
18		John H. Reif, Paul G. Spirakis: Real Time Resource Allocation in Distributed Systems. PODC 1982: 84-94
17		John H. Reif, Paul G. Spirakis: Unbounded Speed Variability in Distributed Communication Systems. POPL 1982: 46-56
16		John H. Reif: Symmetric Complementation STOC 1982: 201-214
15		John H. Reif, Robert Endre Tarjan: Symbolic Program Analysis in Almost-Linear Time. SIAM J. Comput. 11(1): 81-93 (1982)
	1981
14		Joseph Y. Halpern, John H. Reif: The Propositional Dynamic Logic of Deterministic, Well-Structured Programs (Extended Abstract) FOCS 1981: 322-334
13		John H. Reif: Minimum S-T Cut of a Planar Undirected Network in O(n log²(n)) Time. ICALP 1981: 56-67
12		John H. Reif, Paul G. Spirakis: Distributed Algorithms for Synchronizing Interprocess Communication within Real Time STOC 1981: 133-145
	1980
11		John H. Reif, Gary L. Peterson: A Dynamic Logic of Multiprocessing with Incomplete Information. POPL 1980: 193-202
10		John H. Reif, Paul G. Spirakis: Random Matroids STOC 1980: 385-397
9		John H. Reif: Logics for Probabilistic Programming (Extended Abstract) STOC 1980: 8-13
8		John H. Reif: Code Motion. SIAM J. Comput. 9(2): 375-395 (1980)
	1979
7		Gary L. Peterson, John H. Reif: Multiple-Person Alternation FOCS 1979: 348-363
6		John H. Reif: Complexity of the Mover's Problem and Generalizations (Extended Abstract) FOCS 1979: 421-427
5		John H. Reif: Data Flow Analysis of Communicating Processes. POPL 1979: 257-268
4		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
3		John H. Reif: Universal Games of Incomplete Information STOC 1979: 288-308
	1978
2		John H. Reif: Symbolic Programming Analysis in Almost Linear Time. POPL 1978: 76-83
	1977
1		John H. Reif, Harry R. Lewis: Symbolic Evaluation and the Global Value Graph. POPL 1977: 104-118

Coauthor Index

1	Deganit Armon	[103] [112]
2	S. Azhar	[132]
3	Greg J. Badros	[132]
4	Michael Ben-Or	[31] [46]
5	Donald W. Blevins	[78]
6	Alfred Brenner	[93]
7	John F. Canny (John Canny)	[55] [66] [80] [90] [110]
8	Sukhendu Chakraborty	[206]
9	Harish Chandran	[219] [224] [229]
10	Junghuei Chen	[192]
11	Sefeng Chen	[152]
12	Shenfeng Chen	[117] [140] [146]
13	Joseph Cheriyan	[105] [113] [126]
14	Edward W. Davis	[78]
15	Hristo Djidjev	[91]
16	Bruce Randall Donald	[66] [110]
17	I. S. Filotti	[4]
18	Richard F. Freund	[93]
19	Péter Gács	[37] [61]
20	R. Stockton Gaines	[93]
21	Hillel Gazit	[83] [154]
22	Ashish Gehani	[191] [211]
23	Erol Gelenbe	[148]
24	A. Glodjo	[132]
25	Allen Goldberg	[145]
26	Nikhil Gopalkrishnan	[219] [224] [229]
27	Bo Guo	[172]
28	Sandeep K. Gupta	[144]
29	Sandeep K. S. Gupta	[136] [159]
30	Joseph Y. Halpern	[14] [21]
31	Yijie Han	[102] [150]
32	Robert A. Heaton	[78]
33	William L. Hightower	[104]
34	Steven Homer	[47]
35	David Hsu	[182] [194]
36	Tingting Jiang	[182] [194]
37	Ming-Yang Kao	[114] [132] [143]
38	Simon Kasif	[214]
39	Rob Kelly	[93]
40	Carl Kingsford	[172]
41	Philip N. Klein	[50] [58] [60]
42	Dexter Kozen	[31] [46]
43	Hanna Kurniawati	[194]
44	Thomas H. LaBean	[164] [165] [171] [172] [176] [187] [191] [205] [208] [209] [213]
45	Richard E. Ladner	[48]
46	Harry R. Lewis	[1] [45]
47	Zhiyong Li	[136] [138] [141] [144] [159]
48	Dage Liu	[176]
49	Louis Lome	[93]
50	Urmi Majumder	[205] [213] [215] [216] [220] [221] [226]
51	Tassos Markas	[94] [99] [118]
52	Richard McAndrew	[93]
53	Gary L. Miller	[4] [40] [87]
54	Peter Mills	[92] [106] [138] [141] [145]
55	C. Andrew Neff	[131] [142]
56	Alexandru Nicolau (Alex Nicolau)	[93]
57	Sotiris E. Nikoletseas	[137]
58	Lars S. Nyland	[92] [106] [145]
59	Victor Y. Pan	[38] [49] [51] [56] [69] [84] [89] [102] [107] [109] [150]
60	Janak H. Patel	[93]
61	Ramamohan Paturi	[76] [133]
62	Gary L. Peterson	[7] [11]
63	Andrew Phillips	[229]
64	Michael Pirrung	[172]
65	Jan Prins (Jan F. Prins)	[92] [104] [106] [145]
66	Thomas Probert	[93]
67	Sanguthevar Rajasekaran	[57] [65] [68] [76] [96] [133]
68	Vijaya Ramachandran	[75] [121]
69	Vipul S. Rana	[172]
70	Ashutosh Rege	[80] [90]
71	Sudheer Sahu	[187] [188] [190] [196] [197] [198] [202] [203] [204] [205] [212] [217] [222] [225]
72	Jorge L. C. Sanz	[93]
73	William L. Scherlis (Bill Scherlis)	[24] [181]
74	Nestor A. Schmajuk	[148]
75	Nadrian C. Seeman	[164] [171]
76	Sandeep Sen	[54] [63] [71] [73] [74] [82] [98] [101] [119] [120]
77	Micha Sharir	[41] [124]
78	Deepak Sherlekar	[214]
79	Howard Jay Siegel	[93]
80	A. Prasad Sistla	[25] [34]
81	Sam Slee	[201] [210] [223] [227]
82	Scott A. Smolka	[62] [79]
83	Paul G. Spirakis	[10] [12] [17] [18] [30] [32] [33] [36] [100] [137]
84	John Staddon	[148]
85	James A. Storer	[64] [88] [95] [122] [123] [147] [153] [156] [167]
86	Zheng Sun	[169] [170] [178] [182] [183] [184] [185] [186] [194] [195] [199] [200] [207]
87	Robert Endre Tarjan	[15]
88	Stephen R. Tate (Steve R. Tate)	[72] [77] [97] [107] [111] [114] [115] [128] [129] [143] [149]
89	Andrew J. Turberfield	[188] [189] [196]
90	Akhilesh Tyagi	[81] [85]
91	J. Doug Tygar (J. D. Tygar)	[43] [59] [86] [125]
92	Leslie G. Valiant	[23] [52]
93	Robert A. Wagner	[92] [145]
94	Bei Wang	[203]
95	Hongyan Wang	[158] [161]
96	Jon A. Webb	[93]
97	Gene S. Wickham	[172]
98	Dan E. Willard	[70]
99	Patrick G. Xavier	[66] [110]
100	Hao Yan	[187]
101	Peng Yin	[187] [188] [189] [190] [196] [197] [198] [202] [225]
102	Akitoshi Yoshida	[86] [108] [125]
103	Moti Yung (Mordechai M. Yung)	[137]

Colors in the list of coauthors

Last update Sat May 26 02:31:23 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page