Reif, John H. - Department of Computer Science, Duke University

• A Framework for Modeling DNA Based Molecular Sudheer Sahu, Bei Wang, and John H. Reif
• TileSoft: Sequence Optimization Software for Designing DNA Secondary Structures
• here have been some notable suc-cesses recently in constructing indi-
• Nanomechanical Device A Two-State DNA Lattice Switched by DNA
• Chapter 3: Quantum Computing John H. Reif
• Design and Simulation of Self-Repairing DNA Lattices Urmi Majumder, Sudheer Sahu, Thomas H. LaBean, John H. Reif Department of Computer Science, Duke University
• 376 JOHN H. REIF Original Program P improved Program P'
• Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms 1
• OnLine Navigation Through Weighted Regions John Reif and Hongyan Wang
• Energy Complexity of Optical Computations y (preliminary version)
• ERRORRESILIENT OPTIMAL DATA COMPRESSION # JAMES A. STORER + AND JOHN H. REIF #
• Efficient Parallel Computation of the Characteristic Polynomial of
• (v) (e:a)* ("probabi~istic looping: exe-cute a;(o:a)* with measure o and execute no-
• 16 J.H. REIF to the inputs and so can be unraveled to form an acyclic network. (If required, the circuit can
• Toward Autonomous Robots: Robust, Adaptive and Dynamic Motion
• Paradigms for Biomolecular Computation John H. Reif
• Parallel Output Sensitive Algorithms for Combinatorial and Linear Algebra Problems
• Experimental Construction of Very Large Scale DNA Databases with Associative Search Capability
• Dynamic Parallel Tree Contraction \Lambda (Extended Abstract)
• Energy Complexity of Optical Computations Akhilesh Tyagi John Reif
• Journal of Computer and System Sciences 71 (2005) 86143 www.elsevier.com/locate/jcss
• Journal of Algorithms 58 (2006) 132 www.elsevier.com/locate/jalgor
• An Optical Delay Line Memory Model with Efficient Algorithms \Lambda John H. Reif y Akhilesh Tyagi z
• SPECIFICATION AND DEVELOPMENT OF PARALLEL ALGORITHMS WITH THE PROTEUS SYSTEM
• Supporting Online Material Material and methods
• REIF AND STORER: MINIMIZING TURNS FOR DISCRETE MOVEMENT Fig. 3. Spiral polygon.
• Section 2 reviews a general framework for on-line dynamic lossless compression of a serial data stream that has been developed in the book of Storer [1988]. Section 3 presents a parallel implementations of this
• THE COMPLEXITY OF ELEMENTARY ALGEBRA AND GEOMETRY (preliminary version)
• Computationally Inspired Biotechnologies: Improved DNA Synthesis and Associative Search
• 90 J. H. REIF AND S. SEN A slightly different version is the hidden-line elimination problem, where we are concerned
• Polling : A :New Rand omized Sampling Technique For Computation al Geometry
• Parallel Biomolecular Computation: Models and Simulations
• Challenges and Applications for SelfAssembled DNA Nanostructures ?
• Compact Error Resilient Computational DNA Tiling Assemblies John Reif, Sudheer Sahu, Peng Yin
• 122 THOMAS H. LABEAN, ERIK WINFREE, AND JOHN H. REIF search MAS99, YS99 . However, this approach usually comes at the cost of
• Construction, Analysis, Ligation, and Self-Assembly of DNA Triple Crossover Complexes
• OPTIMAL SIZE INTEGER DIVISION CIRCUITS 913 computation. In 3 (dealing with polynomial reciprocals) we use a circuit model with
• Design of an Autonomous DNA Nanomechanical Device 427 mimics the operation of a universal Turing machine in an autonomous fashion. We call
• diffcrcnt kitids, and the kind of the components chang:t~s in both sparr and time according t(t) a grant1 l)li311 IlOt sllb.jc~rt
• Prototyping Parallel and Distributed Programs in Proteus z Peter H. Mills y , Lars S. Nyland \Lambda , Jan F. Prins \Lambda , John H. Reif y , Robert A. Wagner y
• Parallel Output Sensitive Algorithms for Combinatorial and Linear Algebra Problems
• 488 J. H. Reif Machine Models and Other Preliminary Definitions. The (algebraic) Random Access
• Capabilities and Limits of Compact Error Resilience Methods for Algorithmic Self-assembly in Two and
• The Emergence of the Discipline of Biomolecular Computation in the US 1 The Emergence of the Discipline of Biomolec-
• 2060 JOHN H. REIF to the approximation of a matrix product by a matrix of reduced rank.
• The Complexity of Nbody Simulation ? John H. Reif and Stephen R. Tate
• Compact Self-Repairing DNA Lattices Urmi Majumder, John H. Reif
• FICi 1. Sh@cst paths may not bend at obstxlc J. H. REIF AND J. A. STORER
• HIGH-FIDELITY DNA HYBRIDIZATION USING PROGRAMMABLE MOLECULAR
• 19 APRIL 2002 VOL 296 SCIENCE www.sciencemag.org478 the structure of the liquid could be gained
• 402 JOHN H. RE1F O(logn), then nc~) sequential time will be used) and that a parallel algorithm with
• 162 JOHN H. REIF AND HONGYAN WANG configuration-space representation. On the other hand, these problems bear major
• An In~rnaik~al Journal Available online at:www.sciencedirectcorn__ computers &
• Rate-Control as a Language Construct for Parallel and Distributed Programming
• Formula Dissection: A Parallel Algorithm for Constraint Satisfaction
• Fast Spatial Decomposition and Closest Pair Computation for Limited Precision Input
• 3) Text expression tl is redundant wi th show that the, Kildall algorithn discovers on] respect to text expression t2 if tl occurs in the restri cted c lass of constan t text expressions wk
• Let PRIVATE-PEEKbe the resulting game of incomplete information. By requiring that the
• 958 G. PETERSONet al. 1. INTRODUCTION
• The above applications: Securityr Reliabilityr Distributed Multiprocessing motivate our logic which
• 216 J.H. Reif and P. G. Spirakis 1. INTRODUCTION
• 128 .I.E Halpern, J. H, Reif are deterministic.Indeed, historically, much of the research in logics of programs
• 180 G. PETERSONet al. 1. INTRODUCTION
• PARALLEL COMPUTATIONS WITH PROBABILISTIC CHOICE 47 (1979)], our Theorem 4.1 immediately yields as corollaries O(log n) time probabilistic
• that resource. These priorities can change dynamically. The processes of R use the priori-
• 464 P.N. KLEIN AND J. H. REIF Previously Fortune and Wyllie showed that any language accepted by a determinis-
• Logarithmic Time Sortfor Linear SizeNetworks 61 are capable of generating random bits of information and hence running random-
• 646 John H. Reif and William L. Scherlis 1 Introduction
• 1228 VICTOR PAN AND JOHN REIF and an alternative version of the nested dissection algorithm in [GT]). Many applications to
• 48 GARY L. MILLER and JOHN H. REIF ' constructing planar embeddings, and testing isomorphismof planar
• PARALLEL TREE CONTRACTIONS PART 2 1129 In $3, the tree of 3-connected components (as defined by Hopcroft and Tarjan
• Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms1
• Motion Planning in the Presence of Motling Obstacles 765 trajectories but cannot rotate. This problem has many applications to robot, automobile, and
• 1218 v. PA.~and J. RXXF particular, solving a linear system ~,x = b in the usual sense is a simplification of the LLSP
• 1482 V. PAN and J. RVaF we will assume that the arithmetic operations are performed with infinite precision. In addition,
• Shortest Paths in the Plane with Polygonal Obstacles 983 space, can a given polyhedron (often referred to as a sofa or piano) be moved
• ON THRESHOLD CIRCUITS AND POLYNOMIAL COMPUTATION 897 Papert were among the first investigators to observe the relationship between the lower
• ON THRESHOLD CIRCUITS AND POLYNOMIAL COMPUTATION JOHN H. REIFy AND STEPHEN R. TATEy
• I.58 S. Rqjasekarun, J.H. Reif optimizing the chance of success at intermediate points in the computation. Heuristic
• THE LIGHT BULB PROBLEM 1 Ramamohan Paturi2 Sanguthevar Rajasekaran3 John Reif3
• Efficient parallel algorithms for optical computing with the discrete Fourier transform DFT primitive
• An Efficient Algorithm for the Genus Problem with Explicit Construction of
• 30 J. H. REIF AND S. R. TATE velocity and acceleration. As finding optimal trajectories is computationally intensive, practical
• Optical delay line memory model with efficient John H. Reif
• Optical Expanders with Applications in Optical Computing
• e.g., the PRAM FW78 . Not surprisingly, manydif-ferent languages are currently used to construct par-
• Directed s-t Numberings, Rubber Bands, and Testing Digraph k-Vertex Connectivity
• 2 JOHN H. REIF List of symbols
• An E cient Algorithm for the Real Root and Symmetric Tridiagonal Eigenvalue Problems
• Prototyping N-body Simulation in Proteusz Peter H. Millsy, Lars S. Nyland, Jan F. Prins, John H. Reify
• Prototyping High-Performance Parallel Computing Applications in Proteusz
• 2 4 8 16 32 64 128 256 512 1024 Bitonic Sort
• 1.1 Previous sequential incremental algorithms Incremental algorithms respond to requests to either change
• Stochastic Graphs Have Short Memory: Fully Dynamic Connectivity in Poly-Log Expected Time
• is the calculation of the potential eld due to all other bodies, at the current location of each body. The naive algorithm for this potential computation re-
• 2 MILLS, NYLAND, PRINS, AND REIF Although such low-level notations are needed to provide the detailed access to
• 2 GOLDBERG, MILLS, NYLAND, PRINS, REIF, AND RIELY a wide-spectrum parallel programming notation that allows high-level ex-
• Design and Applications of A High Resolution Insert Head Mounted Display
• High-resolution inset head-mounted display Jannick P. Rolland, Akitoshi Yoshida, Larry D. Davis, and John H. Reif
• Parallel Biomolecular Computation: Models and Simulations 143 We also propose a Recombinant DNA (RDNA) model which is a low-level model that allows operations
• 1. The choice of data distribution has a large influence on the performance of the synthesized programs,
• Analysis and refinement of the design based on fundamental considerations of complexity, communication, locality, and target architecture.
• CZ89 , communication costs such as network latency and bandwidth e.g., the LPRAM ACS89 , Postal
• Fast and Compact Volume Rendering in the Compressed Transform Domain
• Local Parallel Biomolecular Computation John H. Reif
• Massively Parallel Machines. BMC also has the potential to supply massive computational power. General use of BMC is to construct parallel machines where each processor's state is encoded
• A. Gehani, J. Reif / BioSystems 52 (1999) 197216198 Keywords: MEMS; DNA computing; Parallel computation
• Micro Flow Bio-Molecular Computation Ashish Gehani and John Reif
• Information and Computation 205 (2007) 967981 www.elsevier.com/locate/ic
• DNA-based Cryptography Ashish Gehani, Thomas H. LaBean
• ii The query may not be an exact match or even partial match with any data in the database, but since DNA annealing a nity methods work
• Challenges and Applications for Self-Assembled DNA Nanostructures
• Self-Assembled DNA Nanostructures for Molecular Scale Patterning, Computation and Motors
• 28 September 2000 , 493 -496 (2000) Macmillan Publishers Ltd.Nature 407
• Experimental Construction of Very Large Scale DNA Databases with Associative Search Capability
• Experimental Construction of VeryExperimental Construction of Very Large Scale DNA DatabasesLarge Scale DNA Databases
• APPLICATION OF BIOMOLECULAR COMPUTING TO MEDICAL SCIENCE: A BIOMOLECULAR
• DNA nanotubes self-assembled from triple-crossover tiles as templates for conductive nanowires
• IEEE TRANSACTIONS ON ROBOTICS, VOL. 21, NO. 6, DECEMBER 2005 1105 Narrow Passage Sampling for Probabilistic
• Parallel Molecular Computations of pair-wise XOR using DNA "String Tile" Self-Hao Yan*, Liping Feng, Thomas H. LaBean, John H. Reif*
• Supporting Information Angew. Chem. Int. Ed. Z51818
• DNA-Templated Self-Assembly of Protein and Nanoparticle Linear Arrays Hanying Li, Sung Ha Park, John H. Reif, Thomas H. LaBean,* and Hao Yan*
• Compact Error Resilient Computational DNA Tilings John H. Reif
• Designs of Autonomous Unidirectional Walking DNA Devices 411 rotation motion [9, 18]. Furthermore, these motions are not autonomously executed but
• Autonomous DNA Walking Devices Peng Yin*, Andrew J. Turberfield, Hao Yan*, John H. Reif*
• Molecular Devices A Unidirectional DNA Walker That Moves
• A Unidirectional DNA Walker Moving Autonomously Along a Track** Peng Yin, Hao Yan*, Xiaoju G. Daniell, Andrew J. Turberfield*, John H. Reif*
• A Unidirectional DNA Walker Moving Autonomously Along a Track
• Autonomous DNA Nanomechanical Device Capable of Universal Computation and Universal Translational Motion
• A Self-Assembly Model of Time-Dependent Glue Sudheer Sahu
• Programming DNA Tube Circumferences Peng Yin,1,2,3
• Autonomous Programmable Biomolecular Devices Using Self-Assembled DNA Nanostructures1
• DNA Nanotechnology and its Biological Applications1
• Theoretical Computer Science 410 (2009) 14281439 Contents lists available at ScienceDirect
• Isothermal reactivating Whiplash PCR for locally programmable molecular computation
• Isothermal reactivating Whiplash PCR for locally programmable molecular computation
• Subscriber access provided by DUKE UNIV Nano Letters is published by the American Chemical Society. 1155 Sixteenth
• Structural!Optimization!of!Dendritic!DNA!Self"Assembly! Morgan!A.!Bishop1
• The Tile Complexity of Linear Assemblies Harish Chandran, Nikhil Gopalkrishnan, and John Reif
• Design of a Biomolecular Device That Executes Process Algebra
• Design of a Biomolecular Device that Executes Process Urmi Majumder and John H. Reif
• DESIGN OF A BIOMOLECULAR DEVICE THAT EXECUTES
• Self-assembled DNA Nanostructures and DNA Devices John Reif Harish Chandran Nikhil Gopalkrishnan Thomas LaBean
• High-Fidelity DNA Hybridization using Programmable Molecular DNA Devices
• r XXXX American Chemical Society A dx.doi.org/10.1021/ja1108886 |J. Am. Chem. Soc. XXXX, XXX, 000000 COMMUNICATION
• Design and Construction of Double-Decker Tile as a Route to Three-Dimensional Periodic Assembly of DNA
• Design and Applications of A High Resolution Insert Head Mounted Display
• Fast Spatial Decomposition and Closest Pair Computation for Limited Precision Input
• Theoretical Computer Science 354 (2006) 379390 www.elsevier.com/locate/tcs
• A DNA Nanotransport Device Powered by Polymerase 29 Sudheer Sahu1
• 10 V. PAN and J. Rrw and also has a relatively large amount of primary storage. For such a machine, the arithmetic
• Efficient and Exact Quantum Compression John H. Reif a,,1
• OPTIMAL SIZE INTEGER DIVISION CIRCUITS \Lambda JOHN H. REIF y AND STEPHEN R. TATE y
• dunck.doc.6 Chapter 5: The Proteus System for the Development of Parallel Applications 143 The Proteus System for the Development of Parallel
• The Design of Autonomous DNA Nano-mechanical Devices: Walking and Rolling DNA
• Adaptive and Compact Discretization for Weighted Region Optimal Path Finding
• NONUNIFORM DISCRETIZATION FOR KINODYNAMIC MOTION PLANNING AND ITS APPLICATIONS #
• 19 APRIL SCIENCE www.sciencemag.org Experimental elucidation
• Prototyping Nbody Simulation in Proteus z Peter H. Mills y , Lars S. Nyland \Lambda , Jan F. Prins \Lambda , John H. Reif y
• THE LIGHT BULB PROBLEM 1 Ramamohan Paturi 2 Sanguthevar Rajasekaran 3 John Reif 3
• A DNA Nanotransport Device Powered by Polymerase 29: Supporting Information
• OPTIMAL SIZE INTEGER DIVISION CIRCUITS JOHN H. REIFy AND STEPHEN R. TATEy
• E#cient Parallel Factorization and Solution of Structured and Unstructured Linear Systems
• An Efficient Algorithm for the Real Root and Symmetric Tridiagonal Eigenvalue Problems
• Motion Planning in the Presence of Moving Department of Computer Science
• OPTIMAL PARALLEL RANDOMIZED ALGORITHMS 467 In this paper, we confine ourselves to the case where S is a set of points in E2
• Toward Autonomous Robots: Robust, Adaptive and Dynamic Motion
• TheTileComplexity ofLinearAssemblies
• Foundations of Nanoscience Snowbird Cliff Lodge~Snowbird, Utah
• 1 Introduction In alternation as presented by Chandra, Kozen, and Stockmeyer 7 , the state con gurations
• Design, Simulation, and Experimental Demonstration of Self-assembled DNA Nanostructures and Motors
• 128 J. H. Reif and Z. Sun Fig. 1. Composite velocity.
• Presented at the 1993 DAGS/PC Symposium, Dartmouth College, Hanover, NH, June 23, 1993. Copyright 1993 DAGS
• A. Gehani, J. Reif / BioSystems 52 (1999) 197 --216 Keywords: MEMS; DNA computing; Parallel computation
• 4 V. PAN AND J. RIEF which is O(log N) as N ~ oo. It seems that the order of N log N bits are needed for the storage
• SUN AND REIF: ON FINDING ENERGY-MINIMIZING PATHS ON TERRAINS 103 Lanthier et al. [16] developed an approximation algorithm
• A Framework for Modeling DNA based Molecular Sudheer Sahu, Bei Wang, and John H. Reif
• N-body Simulation I: Fast Algorithms for Potential Field Evaluation and Trummer's Problem
• functions f(t) and g(t), the position function, say x(t), satisfies f(t) < x(t) < g(t) for all t. In addition, the
• Self-assembled DNA Structures for Nanoconstruction
• Molecular Computations Using Self-Assembled DNA Nanostructures and Autonomous Motors
• As an aid to our flow analysis, we define in Section 4 a special acyclic directed graph called
• edges are not open segments but ordered finite sets of points. Two points will be called related if
• Alternative Computational Models: A Comparison of Biomolecular and Quantum Computation
• A Framework for Designing Novel Magnetic Tiles Capable of Complex Self-Assemblies
• Autonomous Programmable Nanorobotic Devices Using John H. Reif and Sudheer Sahu
• 440 JOHN H. REIF These prior DNA nanomechanical devices have some key restrictions that
• 2 J. H. REIF AND Z. SUN The first hardness result for a robotic mover's problem was presented by Reif
• The Complexity of the Two Dimensional Curvature-Constrained Shortest-Path Problem
• Conference Record of the Fifth Annual ACM Symposium on Principles of Programming Language? SYMBOLIC PROGRAM ANALYSIS IN ALMOST LINEAR TIME
• 102 J. H. REIF carry-completion testing. The best known constant fan-in circuit for addition [lo] employs a
• Stochastic Analysis of Reversible Self-Assembly Urmi Majumder, Sudheer Sahu, John H. Reif
• TileSoft: Sequence Optimization Software For Designing DNA Secondary Structures
• Nbody Simulation I: Fast Algorithms for Potential Field Evaluation and Trummer's Problem \Lambda
• Efficient Approximate Solution of Sparse Linear Systems John H. Reif z
• ON THRESHOLD CIRCUITS AND POLYNOMIAL COMPUTATION \Lambda JOHN H. REIF y AND STEPHEN R. TATE y
• 2060 JOHN H. REIF to the approximation of a matrix product by a matrix of reduced rank.
• On-Line Navigation Through Weighted Regions John Reif and Hongyan Wang
• Barcoded Magnetic Tiles for Complex Programmable Assemblies
• 182 ZH. Reif, P.G. Spirakis Matula [6] examined certain properties of k,blocks in graphs (number of them,
• Directed nucleation assembly of DNA tile complexes for barcode-patterned lattices
• Micro Flow Bio Molecular Computation (MF-BMC) Ashish Gehani and John Reif
• John Reif and Urmi Majumder Department of Computer Science
• Engineering Natural Computation by Autonomous DNA-Based Biomolecular Devices
• RANDOMIZED PARALLEL SORTING 595 let P denote the processor bound, and T denote the time bound of a parallel algorithm
• Mechanical Computation: its Computational Complexity and Technologies
• Using Learning and Difficulty of Prediction to Decrease Computation
• 1450 JOHN H. REIF AND ZHENG SUN is a sequence of legal movements that will allow the robot to reach the goal config-
• Optical Expanders with Applications in Optical Computing
• Molecular Assembly and Computation: From Theory to Experimental Demonstrations
• 1 Introduction Motivation and Background
• Presented at the 1993 DAGS/PC Symposium, Dartmouth College, Hanover, NH, June 23, 1993. Copyright 1993 DAGS
• Informally, a randomized algorithm (in the sense of [59] and [82]) is one which bases some of its decisions on the outcomes of coin flips. We can think of the algorithm with one possible sequence
• PARALLEL SOLUTION OF SPARSE LINEAR SYSTEMS 1228 1 Introduction
• Complexity of Graph Self-Assembly in Accretive Systems and Self-Destructible Systems
• Supporting Information Angew. Chem. Int. Ed. 200460522
• Application of Biomolecular Computing to Medical Science: A Biomolecular Database System for Storage, Processing & Retrieval of Genetic Information & Material
• 72 JOHN H. REIF Ullman [1]) in time O(QL(n)) for a sparse network with n vertices, and L is the set
• DIMACS Series in Discrete Mathematics and Theoretical Computer Science
• Prototyping HighPerformance Parallel Computing Applications in Proteus z
• beens notables cesUJ recently inconsJDO11OD molecular
• Continuous Alternation: The Complexity of Pursuit in Continuous Domains \Lambda
• Generating Efficient Programs for TwoLevel Memories from TensorProducts y
• design of a systolic architecture (a very practical model of massively paral-lel computation where each processor communicates only with its left and
• UNBOUNDED SPEED VARIABILITY IN DISTRIBUTED COMWIUNICATIQN SYSTEMS* John Reif and Paul Spirakis
• SUPER-RESOLUTION VIDEO ANALYSIS FOR FORENSIC INVESTIGATIONS
• A Dynamic Separator Algorithm Deganit Armon John Reif
• The Kinetic Engineering of Autonomous DNA-Based Robots and Computing
• 106 S. AZHAR AND J. H. REIF See [3-10] for efficient algorithms (and also parallel algorithms [11,12]) for various group theo-
• 272 J. H. Reif and S. R. Tate shows that there exists a randomized algebraic algorithm that has worst-case expected
• A LOGARITHMIC TIME SORT FOR LINEAR SIZE NETWORKS John H. Reif* and Leslie G. Valiant
• 708 T. MARKAS and J. REIF Fig. 1. A typical data compression system.
• 82 J. H. REIF AND R. E. TARJAN Let 0 be the set of function signs occurring in the program. For simplicity, we
• SOFTWARE ISSUES IN HIGHPERFORMANCE COMPUTING FRAMEWORK FOR THE DEVELOPMENT OF HPC
• Supplemental Information for Parallel Molecular Computations of Pair-wise XOR
• A Self-assembly Model of Time-Dependent Glue Sudheer Sahu, Peng Yin, and John H. Reif
• Autonomous Programmable DNA Nanorobotic Devices Using John H. Reif
• ERROR-RESILIENT OPTIMAL DATA COMPRESSION 935 Fig. 1.1. Dynamic dictionary communication.
• Design of Autonomous DNA Cellular Automata , Sudheer Sahu
• Theoretical Computer Science ( ) Contents lists available at ScienceDirect
• Models and Resource Metrics for Parallel and Distributed Computation y
• Directed nucleation assembly of DNA tile complexes for barcodepatterned lattices
• RateControl as a Language Construct for Parallel and Distributed Programming
• Approximate Kinodynamic Planning Using L 2 norm Dynamic Bounds \Lambda
• Journal of Computer and System Sciences 62, 398#412 (2001) Parallel OutputSensitive Algorithms for
• * Department of Computer Science, Duke University, Box 90129, Durham, NC 27708-0129,
• Motion Planning in the Presence of Moving Department of Computer Science
• Autonomous Programmable Biomolecular Devices Using Self-Assembled DNA Nanostructures
• www.sciencemag.org/cgi/content/full/321/5890/824/DC1 Supporting Online Material for
• Journal of Computer and System Sciences 62, 398 412 (2001) Parallel Output-Sensitive Algorithms for
• Efficient Parallel Algorithms for Optical Computing with the DFT Primitive \Lambda
• Computationally Inspired Biotechnologies: Improved DNA Synthesis and Associative
• Algorithmica DOI 10.1007/s00453-008-9187-x
• Localized Hybridization Circuits Harish Chandran1
• DNA Nanorobotics Harish Chandran
• Biomolecular Computing Systems Harish Chandran*, Sudhanshu Garg*, Nikhil Gopalkrishnan*, John Reif*
• Studies on Sequential and Parallel Randomized C. Pandurangan S. Rajasekaran J.H. Reif S. Sen
• Design and Applications of A High Resolution Insert Head Mounted Display
• Design and Applications of A High Resolution Insert Head Mounted Display
• High-resolution inset head-mounted display Jannick P. Rolland, Akitoshi Yoshida, Larry D. Davis, and John H. Reif
• Tile Complexity of Approximate Squares and Lower Bounds for Arbitrary Shapes