601 results on '"John H. Reif"'
Search Results
102. The design of autonomous DNA nano-mechanical devices: Walking and rolling DNA.
103. On Frictional Mechanical Systems and Their Computational Power.
104. Prototyping N-Body Simulation in Proteus.
105. The Power of Combining the Techiques of Algebraic and Numerical Computing: Improved Approximate Multipoint Polynomial Evaluation and Improved Multipole Algorithms
106. Optical Techniques for Image Compression.
107. Implementations of Randomized Sorting on Large Parallel Machines.
108. Space and Time Efficient Implementations of Parallel Nested Dissection.
109. Efficient Parallel Algorithms for Computing all Pair Shortest Paths in Directed Graphs.
110. Directed s-t Bumberings, Rubber Bands, and Testing Digraph k-Vertex Connectivity.
111. The Emerging Discipline of Biomolecular Computation in the US.
112. DNA lattices: A method for molecular-scale patterning and computation.
113. How Do We Make Parallel Processing a Reality? Bridging the Gap Between Theory and Practice.
114. An Efficient Algorithm for the Genus Problem with Explicit Construction of Forbidden Subgraphs
115. Image Compression Methods with Distortion Controlled Capabilities.
116. Prototyping parallel and distributed programs in Proteus.
117. Optimal encoding of non-stationary sources.
118. Parallel Output-Sensitive Algorithms for Combinatorial and Linear Algebra Problems.
119. Efficient Parallel Computation of the Characteristic Polynomial of a Sparse, Separable Matrix.
120. Optics-Free Imaging with DNA Microscopy: An Overview
121. Molecular Computation via Polymerase Strand Displacement Reactions
122. On the Bit-Complexity of Discrete Solutions of PDEs: Compact Multigrid.
123. Efficient Parallel Algorithms for Optical Computing with the DFT Primitive.
124. The Computability and Complexity of Optical Beam Tracing
125. An Exact Algorithm for Kinodynamic Planning in the Plane.
126. Randomized Algorithms for Binary Search and Load Balancing with Geometric Applications.
127. A Randomized Parallel Algorithm for Planar Graph Isomorphism.
128. Energy complexity of optical computations.
129. Fast Spatial Decomposition and Closest Pair Computation for Limited Precision Input.
130. On the Impossibility of Interaction-Free Quantum Sensing for Small I/O Bandwidth.
131. Nonuniform Discretization for Kinodynamic Motion Planning and its Applications.
132. Optimal Kinodynamic Motion Planning for 2D Reconfiguration of Self-Reconfigurable Robots.
133. Social potential fields: A distributed behavioral control for autonomous robots.
134. Parallel Biomolecular Computation: Models and Simulations.
135. Synthesizing Efficient Out-of-Core Programs for Block Recursive Algorithms Using Block-Cyclic Data Distributions.
136. Approximate Complex Polynomial Evaluation in Near Constant Work Per Point.
137. Programming DNA-Based Biomolecular Reaction Networks on Cancer Cell Membranes
138. Fast and compact DNA logic circuits based on single-stranded gates using strand-displacing polymerase
139. Nucleic Acid Databases and Molecular-Scale Computing
140. Improved Optical Multiplexing with Temporal DNA Barcodes
141. Renewable DNA Hairpin-Based Logic Circuits
142. A lyophilized colorimetric RT-LAMP test kit for rapid, low-cost, at-home molecular testing of SARS-CoV-2 and other pathogens
143. A Randomized Parallel Algorithm for Planar Graph Isomorphism.
144. Autonomous search by robots and animals: A survey.
145. Efficient Parallel Algorithms for Computing All Pair Shortest Paths in Directed Graphs.
146. On Dynamic Algorithms for Algebraic Problems.
147. Error-Resilient Optimal Data Compression.
148. Models and Resource Metrics for Parallel and Distributed Computation.
149. An Efficient Algorithm for the Complex Roots Problem.
150. Searching in an Unknown Environment: An Optimal Randomized Algorithm for the Cow-Path Problem.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.