John H. Reif - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

2010

High-Fidelity DNA Hybridization Using Programmable Molecular DNA DevicesNikhil Gopalkrishnan, Harish Chandran, John H. Reif. dna 2011: 59-70 [doi]

Isothermal reactivating Whiplash PCR for locally programmable molecular computationJohn H. Reif, Urmi Majumder. nc, 9(1):183-206, 2010. [doi]

Capabilities and Limits of Compact Error Resilience Methods for Algorithmic Self-AssemblySudheer Sahu, John H. Reif. algorithmica, 56(4):480-504, 2010. [doi]

2009

The Tile Complexity of Linear AssembliesHarish Chandran, Nikhil Gopalkrishnan, John H. Reif. icalp 2009: 235-253 [doi]

Design of a Biomolecular Device That Executes Process AlgebraUrmi Majumder, John H. Reif. dna 2009: 97-105 [doi]

Autonomous programmable DNA nanorobotic devices using DNAzymesJohn H. Reif, Sudheer Sahu. TCS, 410(15):1428-1439, 2009. [doi]

2008

A Framework for Designing Novel Magnetic Tiles Capable of Complex Self-assembliesUrmi Majumder, John H. Reif. uc 2008: 129-145 [doi]

Isothermal Reactivating Whiplash PCR for Locally Programmable Molecular ComputationJohn H. Reif, Urmi Majumder. dna 2009: 41-56 [doi]

Formula dissection: A parallel algorithm for constraint satisfactionJohn H. Reif, Simon Kasif, Deepak Sherlekar. cma, 55(6):1170-1177, 2008. [doi]

2007

Super-Resolution Video Analysis for Forensic InvestigationsAshish Gehani, John H. Reif. ifip11-9 2007: 281-299 [doi]

Activatable Tiles: Compact, Robust Programmable Assembly and Other ApplicationsUrmi Majumder, Thomas H. LaBean, John H. Reif. dna 2008: 15-25 [doi]

Autonomous Programmable Biomolecular Devices Using Self-assembled DNA NanostructuresJohn H. Reif, Thomas H. LaBean. wollic 2007: 297-306 [doi]

Optimal Kinodynamic Motion Planning for 2D Reconfiguration of Self-Reconfigurable RobotsJohn H. Reif, Sam Slee. rss 2008: [doi]

Autonomous programmable biomolecular devices using self-assembled DNA nanostructuresJohn H. Reif, Thomas H. LaBean. CACM, 50(9):46-53, 2007. [doi]

Autonomous Programmable Nanorobotic Devices Using DNAzymesJohn H. Reif, Sudheer Sahu. dna 2008: 66-78 [doi]

Efficient and exact quantum compressionJohn H. Reif, Sukhendu Chakraborty. iandc, 205(7):967-981, 2007. [doi]

On Robotic Optimal Path Planning in Polygonal Regions With Pseudo-Euclidean MetricsZheng Sun, John H. Reif. tsmc, 37(4):925-936, 2007. [doi]

2006

Design and Simulation of Self-repairing DNA LatticesUrmi Majumder, Sudheer Sahu, Thomas H. LaBean, John H. Reif. dna 2006: 195-214 [doi]

On boundaries of highly visible spaces and applicationsJohn H. Reif, Zheng Sun. TCS, 354(3):379-390, 2006. [doi]

Asymptotically Optimal Kinodynamic Motion Planning for Self-reconfigurable RobotsJohn H. Reif, Sam Slee. wafr 2008: 457-472 [doi]

Compact Error-Resilient Computational DNA TilingsJohn H. Reif, Sudheer Sahu, Peng Yin. In Nanotechnology: Science and Computation. 2006: 79-103 [doi]

Capabilities and Limits of Compact Error Resilience Methods for Algorithmic Self-assembly in Two and Three DimensionsSudheer Sahu, John H. Reif. dna 2006: 223-238 [doi]

A Framework for Modeling DNA Based Molecular SystemsSudheer Sahu, Bei Wang, John H. Reif. dna 2006: 250-265 [doi]

On finding approximate optimal paths in weighted regionsZheng Sun, John H. Reif. jal, 58(1):1-32, 2006. [doi]

2005

2004

DNA Computing, 9th International Workshop on DNA Based Computers, DNA9, Madison, WI, USA, June 1-3, 2003, revised PapersJunghuei Chen, John H. Reif, editors, Volume 2943 of Lecture Notes in Computer Science, Springer, 2004.

DNA-based CryptographyAshish Gehani, Thomas H. LaBean, John H. Reif. BIRTHDAY 2004: 167-188 [doi]

Compact Error-Resilient Computational DNA Tiling AssembliesJohn H. Reif, Sudheer Sahu, Peng Yin. dna 2005: 293-307 [doi]

Movement Planning in the Presence of FlowsJohn H. Reif, Zheng Sun. algorithmica, 39(2):127-153, 2004. [doi]

Design, Simulation, and Experimental Demonstration of Self-assembled DNA Nanostructures and MotorsJohn H. Reif, Thomas H. LaBean, Sudheer Sahu, Hao Yan, Peng Yin. upp 2005: 173-187 [doi]

Designs of Autonomous Unidirectional Walking DNA DevicesPeng Yin, Andrew J. Turberfield, John H. Reif. dna 2005: 410-425 [doi]

Design of an Autonomous DNA Nanomechanical Device Capable of Universal Computation and Universal Translational MotionPeng Yin, Andrew J. Turberfield, Sudheer Sahu, John H. Reif. dna 2005: 426-444 [doi]

2003

The bridge test for sampling narrow passages with probabilistic roadmap plannersDavid Hsu, Tingting Jiang, John H. Reif, Zheng Sun. icra 2003: 4420-4426

Guest Editor s ForewordJohn H. Reif. jcss, 67(2):211, 2003. [doi]

On Frictional Mechanical Systems and Their Computational PowerJohn H. Reif, Zheng Sun. siamcomp, 32(6):1449-1474, 2003. [doi]

On Boundaries of Highly Visible Spaces and ApplicationsJohn H. Reif, Zheng Sun. fct 2003: 271-283 [doi]

The design of autonomous DNA nano-mechanical devices: Walking and rolling DNAJohn H. Reif. nc, 2(4):439-461, 2003. [doi]

Deriving Effcient Graph AlgorithmsJohn H. Reif, William L. Scherlis. BIRTHDAY 2003: 645-681 [doi]

Adaptive and Compact Discretization for Weighted Region Optimal Path FindingZheng Sun, John H. Reif. fct 2003: 258-270 [doi]

On energy-minimizing paths on terrains for a mobile robotZheng Sun, John H. Reif. icra 2003: 3782-3788

2002

DNA Nanotubes: Construction and Characterization of Filaments Composed of TX-tile LatticeDage Liu, John H. Reif, Thomas H. LaBean. dna 2003: 10-21 [doi]

The Emerging Discipline of Biomolecular Computation in the USJohn H. Reif. ngc, 20(3):217-236, 2002.

Molecular Assembly and Computation: From Theory to Experimental DemonstrationsJohn H. Reif. icalp 2002: 1-21 [doi]

The Design of Autonomous DNA Nanomechanical Devices: Walking and Rolling DNAJohn H. Reif. dna 2003: 22-37 [doi]

2001

Efficient Parallel Computation of the Characteristic Polynomial of a Sparse, Separable MatrixJohn H. Reif. algorithmica, 29(3):487-510, 2001. [doi]

Parallel Output-Sensitive Algorithms for Combinatorial and Linear Algebra ProblemsJohn H. Reif. jcss, 62(3):398-412, 2001.

Experimental Construction of Very Large Scale DNA Databases with Associative Search CapabilityJohn H. Reif, Thomas H. LaBean, Michael Pirrung, Vipul S. Rana, Bo Guo, Carl Kingsford, Gene S. Wickham. dna 2002: 231-247 [doi]

Optimal encoding of non-stationary sourcesJohn H. Reif, James A. Storer. isci, 135(1-2):87-105, 2001.

Movement Planning in the Presence of FlowsJohn H. Reif, Zheng Sun. wads 2001: 450-461 [doi]

Programmable Assembly at the Molecular Scale: Self-Assembly of DNA Lattices (Invited Paper)John H. Reif, Thomas H. LaBean, Nadrian C. Seeman. icra 2001: 966-971

BUSHWHACK: An Approximation Algorithm for Minimal Paths through Pseudo-Euclidean SpacesZheng Sun, John H. Reif. isaac 2001: 160-171 [doi]

2000

1999

Synthesizing Efficient Out-of-Core Programs for Block Recursive Algorithms Using Block-Cyclic Data DistributionsZhiyong Li, John H. Reif, Sandeep K. S. Gupta. tpds, 10(3):297-315, 1999. [doi]

Approximate Complex Polynomial Evaluation in Near Constant Work Per PointJohn H. Reif. siamcomp, 28(6):2059-2089, 1999.

Social potential fields: A distributed behavioral control for autonomous robotsJohn H. Reif, Hongyan Wang. ras, 27(3):171-194, 1999. [doi]

Parallel Biomolecular Computation: Models and SimulationsJohn H. Reif. algorithmica, 25(2-3):142-175, 1999. [doi]

1998

A Randomized Parallel Algorithm for Planar Graph IsomorphismHillel Gazit, John H. Reif. jal, 28(2):290-314, 1998.

Alternative Computational Models: A Comparison of Biomolecular and Quantum ComputationJohn H. Reif. fsttcs 1998: 102-121

Optimal Lossless Compression of a Class of Dynamic SourcesJohn H. Reif, James A. Storer. dcc 1998: 501-510 [doi]

1997

Fast and Compact Volume Rendering in the Compressed Transform DomainSefeng Chen, John H. Reif. dcc 1997: 271-280

Autonomous search by robots and animals: A surveyErol Gelenbe, Nestor A. Schmajuk, John Staddon, John H. Reif. ras, 22(1):23-34, 1997. [doi]

Efficient Parallel Algorithms for Computing All Pair Shortest Paths in Directed GraphsYijie Han, Victor Y. Pan, John H. Reif. algorithmica, 17(4):399-415, 1997.

Approximate Complex Polynomial Evaluation in Near Constant Work Per PointJohn H. Reif. stoc 1997: 30-39 [doi]

On Dynamic Algorithms for Algebraic ProblemsJohn H. Reif, Stephen R. Tate. jal, 22(2):347-371, 1997.

Error-Resilient Optimal Data CompressionJames A. Storer, John H. Reif. siamcomp, 26(4):934-949, 1997.

Low-Cost Prevention of Error Propagation for Data Compression with Dynamic DictionariesJames A. Storer, John H. Reif. dcc 1997: 171-180

1996

Efficient Lossless Compression of Trees and GraphsShenfeng Chen, John H. Reif. dcc 1996: 428

Searching in an Unknown Environment: An Optimal Randomized Algorithm for the Cow-Path ProblemMing-Yang Kao, John H. Reif, Stephen R. Tate. iandc, 131(1):63-79, 1996.

Models and Resource Metrics for Parallel and Distributed ComputationZhiyong Li, Peter Mills, John H. Reif. paapp, 8(1):35-59, 1996. [doi]

Synthesizing Efficient Out-of-Core Programs for Block Recursive Algorithms Using Block-Cyclic Data DistributionsZhiyong Li, John H. Reif, Sandeep K. Gupta. icpp 1996: 142-149

An Efficient Algorithm for the Complex Roots ProblemC. Andrew Neff, John H. Reif. jc, 12(2):81-115, 1996. [doi]

A Refinement Methodology for Developing Data-Parallel ApplicationsLars S. Nyland, Jan Prins, Allen Goldberg, Peter Mills, John H. Reif, Robert A. Wagner. europar 1996: 145-150

1995

Fast Pattern Matching for Entropy Bounded TextShenfeng Chen, John H. Reif. dcc 1995: 282-291

Generating Efficient Programs for Two-Level Memories from Tensor-productsSandeep K. S. Gupta, Zhiyong Li, John H. Reif. pdpcs 1995: 510-513

Models and resource metrics for parallel and distributed computationZhiyong Li, Peter Mills, John H. Reif. hicss 1995: 51-60 [doi]

Stocastic Graphs Have Short Memory: Fully Dynamic Connectivity in Poly-Log Expected TimeSotiris E. Nikoletseas, John H. Reif, Paul G. Spirakis, Moti Yung. icalp 1995: 159-170

The Light Bulb ProblemRamamohan Paturi, Sanguthevar Rajasekaran, John H. Reif. iandc, 117(2):187-192, March 1995.

Parallel Molecular ComputationJohn H. Reif. spaa 1995: 213-223 [doi]

Work efficient parallel solution of Toeplitz systems and polynomial GCDJohn H. Reif. stoc 1995: 751-761 [doi]

Efficient Parallel Solution of Sparse Eigenvalue and Eigenvector ProblemsJohn H. Reif. focs 1995: 123-132

1994

A Single-Exponential Upper Bound for Finding Shortest Paths in Three DimensionsJohn H. Reif, James A. Storer. JACM, 41(5):1013-1019, 1994. [doi]

Motion Planning in the Presence of Moving ObstaclesJohn H. Reif, Micha Sharir. JACM, 41(4):764-790, 1994. [doi]

O(log² n) Time Efficient Parallel Factorization of Dense, Sparse Separable, and Banded MatricesJohn H. Reif. spaa 1994: 278-289 [doi]

Dynamic Parallel Tree Contraction (Extended Abstract)John H. Reif, Stephen R. Tate. spaa 1994: 114-121 [doi]

Computability and Complexity of Ray TracingJohn H. Reif, J. D. Tygar, Akitoshi Yoshida. dcg, 11:265-287, 1994.

Erratum: Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related ProblemsJohn H. Reif, Sandeep Sen. siamcomp, 23(2):447-448, 1994.

Shortest Paths in the Plane with Polygonal ObstaclesJames A. Storer, John H. Reif. JACM, 41(5):982-1012, 1994. [doi]

PreviousNext