The following pages link to John H. Reif (Q537850):
Displaying 50 items.
- (Q172566) (redirect page) (← links)
- (Q922663) (redirect page) (← links)
- (Q1058845) (redirect page) (← links)
- Design of a biomolecular device that executes process algebra (Q537851) (← links)
- Complexity of graph self-assembly in accretive systems and self-destructible systems (Q633697) (← links)
- Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem (Q675058) (← links)
- Efficient parallel algorithms for computing all pair shortest paths in directed graphs (Q676269) (← links)
- Continuous alternation: the complexity of pursuit in continuous domains (Q686740) (← links)
- The emerging discipline of biomolecular computation in the US (Q698876) (← links)
- Data flow analysis of distributed communicating processes (Q751233) (← links)
- The complexity of two-player games of incomplete information (Q800838) (← links)
- The propositional dynamic logic of deterministic, well-structured programs (Q801682) (← links)
- Computation of equilibria in noncooperative games (Q815274) (← links)
- Capabilities and limits of compact error resilience methods for algorithmic self-assembly (Q848844) (← links)
- The bit-complexity of discrete solutions of partial differential equations: Compact multigrid (Q922664) (← links)
- Formula dissection: A parallel algorithm for constraint satisfaction (Q931750) (← links)
- Isothermal reactivating whiplash PCR for locally programmable molecular computation (Q968404) (← links)
- Autonomous programmable DNA nanorobotic devices using DNAzymes (Q1008720) (← links)
- A multiprocess network logic with temporal and spatial modalities (Q1058846) (← links)
- k-connectivity in random undirected graphs (Q1059644) (← links)
- Depth-first search is inherently sequential (Q1062456) (← links)
- Efficient symbolic analysis of programs (Q1082800) (← links)
- Parallel nested dissection for path algebra computations (Q1095781) (← links)
- The complexity of elementary algebra and geometry (Q1096620) (← links)
- The complexity of reachability in distributed communicating processes (Q1098622) (← links)
- A simple three-dimensional real-time reliable cellular array (Q1104099) (← links)
- A topological approach to dynamic graph connectivity (Q1108030) (← links)
- An efficient parallel algorithm for planarity (Q1114415) (← links)
- Efficient approximate solution of sparse linear systems (Q1125019) (← links)
- Parallel biomolecular computation: Models and simulations (Q1125440) (← links)
- An exact algorithm for kinodynamic planning in the plane (Q1176323) (← links)
- The parallel computation of minimum cost paths in graphs by stream contraction (Q1183440) (← links)
- Expected parallel time and sequential space complexity of graph and digraph problems (Q1186789) (← links)
- Optimal randomized parallel algorithms for computational geometry (Q1187202) (← links)
- Nested annealing: A provable improvement to simulated annealing (Q1193895) (← links)
- Efficient VLSI fault simulation (Q1203708) (← links)
- Numerical solution of the Fokker-Planck equation via Chebyschev polynomial approximations with reference to first passage time probability density functions (Q1234579) (← links)
- Approximate kinodynamic planning using \(L_ 2\)-norm dynamic bounds (Q1324341) (← links)
- Planarity testing in parallel (Q1342859) (← links)
- Directed \(s\)-\(t\) numberings, rubber bands, and testing digraph \(k\)-vertex connecitivity (Q1343167) (← links)
- Fast spatial decomposition and closest pair computation for limited precision input (Q1587778) (← links)
- Temporal DNA barcodes: a time-based approach for single-molecule imaging (Q1621131) (← links)
- Generalized compact multi-grid (Q1802442) (← links)
- An efficient output-sensitive hidden-surface removal algorithm for polyhedral terrains (Q1804963) (← links)
- Efficient parallel linear programming (Q1821686) (← links)
- Fast and efficient solution of path algebra problems (Q1824392) (← links)
- Fast and efficient parallel solution of dense linear systems (Q1825589) (← links)
- Parallel processing can be harmful: The unusual behavior of interpolation search (Q1825662) (← links)
- On the impossibility of interaction-free quantum sensing for small I/O bandwidth (Q1854387) (← links)
- Movement planning in the presence of flows (Q1882630) (← links)
- The light bulb problem (Q1892873) (← links)
- An algebraic technique for generating optimal CMOS circuitry in linear time (Q1913433) (← links)
