| Publication | Date of Publication | Type |
|---|
| A dynamic separator algorithm | 2023-01-18 | Paper |
| Multidimensional data organization and random access in large-scale DNA storage systems | 2021-11-11 | Paper |
| Activatable tiles for compact robust programmable molecular assembly and other applications | 2019-07-10 | Paper |
| The complexity of N-body simulation | 2019-03-29 | Paper |
| Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time | 2019-01-10 | Paper |
| Temporal DNA barcodes: a time-based approach for single-molecule imaging | 2018-11-08 | Paper |
| Tile complexity of approximate squares | 2013-05-16 | Paper |
| Tile Complexity of Linear Assemblies | 2012-11-29 | Paper |
| Localized Hybridization Circuits | 2011-09-16 | Paper |
| Robomotion: Scalable, Physically Stable Locomotion for Self-reconfigurable Robots | 2011-08-04 | Paper |
| Design of a biomolecular device that executes process algebra | 2011-05-23 | Paper |
| ASYMPTOTICALLY OPTIMAL KINODYNAMIC MOTION PLANNING FOR A CLASS OF MODULAR SELF-RECONFIGURABLE ROBOTS | 2011-05-11 | Paper |
| Complexity of graph self-assembly in accretive systems and self-destructible systems | 2011-03-29 | Paper |
| High-Fidelity DNA Hybridization Using Programmable Molecular DNA Devices | 2011-01-28 | Paper |
| Asymptotically Optimal Kinodynamic Motion Planning for Self-reconfigurable Robots | 2010-06-02 | Paper |
| Isothermal reactivating whiplash PCR for locally programmable molecular computation | 2010-05-05 | Paper |
| Fundamentals of Computation Theory | 2010-04-20 | Paper |
| Fundamentals of Computation Theory | 2010-04-20 | Paper |
| Verification: Theory and Practice | 2010-03-23 | Paper |
| Capabilities and limits of compact error resilience methods for algorithmic self-assembly | 2010-02-23 | Paper |
| Design of a Biomolecular Device That Executes Process Algebra | 2010-01-07 | Paper |
| The Tile Complexity of Linear Assemblies | 2009-07-14 | Paper |
| Aspects of Molecular Computing | 2009-05-14 | Paper |
| Complexity of Graph Self-assembly in Accretive Systems and Self-destructible Systems | 2009-04-02 | Paper |
| A Self-assembly Model of Time-Dependent Glue Strength | 2009-04-02 | Paper |
| Autonomous programmable DNA nanorobotic devices using DNAzymes | 2009-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3598933 | 2009-02-03 | Paper |
| Formula dissection: A parallel algorithm for constraint satisfaction | 2008-06-26 | Paper |
| Design and Simulation of Self-repairing DNA Lattices | 2008-04-04 | Paper |
| Capabilities and Limits of Compact Error Resilience Methods for Algorithmic Self-assembly in Two and Three Dimensions | 2008-04-04 | Paper |
| A Framework for Modeling DNA Based Molecular Systems | 2008-04-04 | Paper |
| Activatable Tiles: Compact, Robust Programmable Assembly and Other Applications | 2008-04-04 | Paper |
| Autonomous Programmable Nanorobotic Devices Using DNAzymes | 2008-04-04 | Paper |
| Efficient and exact quantum compression | 2007-07-16 | Paper |
| DNA Computing | 2006-10-19 | Paper |
| On finding approximate optimal paths in weighted regions | 2006-04-28 | Paper |
| On boundaries of highly visible spaces and applications | 2006-04-28 | Paper |
| Computation of equilibria in noncooperative games | 2006-02-16 | Paper |
| Efficient parallel factorization and solution of structured and unstructured linear systems | 2005-08-05 | Paper |
| MODELS AND RESOURCE METRICS FOR PARALLEL AND DISTRIBUTED COMPUTATION∗ | 2004-10-06 | Paper |
| Movement planning in the presence of flows | 2004-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737139 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737661 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474086 | 2004-08-04 | Paper |
| On Frictional Mechanical Systems and Their Computational Power | 2003-09-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414650 | 2003-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414651 | 2003-07-25 | Paper |
| On the impossibility of interaction-free quantum sensing for small I/O bandwidth | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778578 | 2002-11-18 | Paper |
| The emerging discipline of biomolecular computation in the US | 2002-09-30 | Paper |
| Parallel output-sensitive algorithms for combinatorial and linear algebra problems | 2002-07-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4530861 | 2002-06-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4529981 | 2002-05-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4499946 | 2002-04-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2749787 | 2001-10-21 | Paper |
| Optimal encoding of non-stationary sources | 2001-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945519 | 2001-10-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4499928 | 2001-08-16 | Paper |
| Efficient parallel computation of the characteristic polynomial of a sparse, separable matrix | 2001-07-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4762325 | 2001-05-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4526967 | 2001-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4762335 | 2001-02-22 | Paper |
| Parallel biomolecular computation: Models and simulations | 2001-01-29 | Paper |
| Fast spatial decomposition and closest pair computation for limited precision input | 2000-12-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234126 | 2000-11-20 | Paper |
| Nonuniform Discretization for Kinodynamic Motion Planning and its Applications | 2000-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263689 | 2000-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228445 | 2000-06-27 | Paper |
| Planarity testing in parallel | 2000-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4231917 | 2000-04-26 | Paper |
| Efficient approximate solution of sparse linear systems | 2000-04-25 | Paper |
| Efficient algorithmic learning of the structure of permutation groups by examples | 2000-01-20 | Paper |
| Approximate Complex Polynomial Evaluation in Near Constant Work Per Point | 1999-10-28 | Paper |
| A Randomized Parallel Algorithm for Planar Graph Isomorphism | 1998-10-06 | Paper |
| An efficient algorithm for the complex roots problem | 1998-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128888 | 1998-03-10 | Paper |
| Error-Resilient Optimal Data Compression | 1998-02-10 | Paper |
| Efficient parallel algorithms for computing all pair shortest paths in directed graphs | 1997-08-20 | Paper |
| On Dynamic Algorithms for Algebraic Problems | 1997-04-16 | Paper |
| Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem | 1997-03-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4858434 | 1996-08-19 | Paper |
| An algebraic technique for generating optimal CMOS circuitry in linear time | 1996-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4848599 | 1995-09-17 | Paper |
| An efficient output-sensitive hidden-surface removal algorithm for polyhedral terrains | 1995-08-15 | Paper |
| The light bulb problem | 1995-07-06 | Paper |
| Shortest paths in the plane with polygonal obstacles | 1995-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763419 | 1995-04-11 | Paper |
| A single-exponential upper bound for finding shortest paths in three dimensions | 1995-02-20 | Paper |
| Directed \(s\)-\(t\) numberings, rubber bands, and testing digraph \(k\)-vertex connecitivity | 1995-02-01 | Paper |
| Motion planning in the presence of moving obstacles | 1994-11-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4302456 | 1994-09-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4302458 | 1994-09-13 | Paper |
| Randomized Algorithms for Binary Search and Load Balancing on Fixed Connection Networks with Geometric Applications | 1994-08-14 | Paper |
| Erratum: Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems | 1994-07-28 | Paper |
| Fast and Efficient Parallel Solution of Sparse Linear Systems | 1994-06-23 | Paper |
| Approximate kinodynamic planning using \(L_ 2\)-norm dynamic bounds | 1994-05-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140448 | 1993-12-15 | Paper |
| Generalized compact multi-grid | 1993-12-09 | Paper |
| Continuous alternation: the complexity of pursuit in continuous domains | 1993-10-13 | Paper |
| Probabilistic parallel prefix computation | 1993-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4038722 | 1993-05-18 | Paper |
| Efficient VLSI fault simulation | 1993-02-22 | Paper |
| Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems | 1993-01-16 | Paper |
| Kinodynamic motion planning | 1993-01-01 | Paper |
| On Threshold Circuits and Polynomial Computation | 1992-12-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4013544 | 1992-09-27 | Paper |
| Nested annealing: A provable improvement to simulated annealing | 1992-09-27 | Paper |
| Compact Multigrid | 1992-06-28 | Paper |
| The parallel computation of minimum cost paths in graphs by stream contraction | 1992-06-28 | Paper |
| Expected parallel time and sequential space complexity of graph and digraph problems | 1992-06-28 | Paper |
| Optimal randomized parallel algorithms for computational geometry | 1992-06-28 | Paper |
| Parallel Tree Contraction Part 2: Further Applications | 1992-06-27 | Paper |
| An exact algorithm for kinodynamic planning in the plane | 1992-06-25 | Paper |
| Data flow analysis of distributed communicating processes | 1990-01-01 | Paper |
| The bit-complexity of discrete solutions of partial differential equations: Compact multigrid | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3359766 | 1990-01-01 | Paper |
| Optimal Size Integer Division Circuits | 1990-01-01 | Paper |
| Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms | 1989-01-01 | Paper |
| Fast and efficient solution of path algebra problems | 1989-01-01 | Paper |
| Fast and efficient parallel solution of dense linear systems | 1989-01-01 | Paper |
| Parallel processing can be harmful: The unusual behavior of interpolation search | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3484356 | 1989-01-01 | Paper |
| The complexity of reachability in distributed communicating processes | 1988-01-01 | Paper |
| A simple three-dimensional real-time reliable cellular array | 1988-01-01 | Paper |
| An efficient parallel algorithm for planarity | 1988-01-01 | Paper |
| Efficient Parallel Pseudorandom Number Generation | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3798232 | 1988-01-01 | Paper |
| Parallel Time $O(\log n)$ Acceptance of Deterministic CFL<scp>s</scp> on an Exclusive-Write P-RAM | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3802892 | 1988-01-01 | Paper |
| A topological approach to dynamic graph connectivity | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3783528 | 1987-01-01 | Paper |
| Efficient symbolic analysis of programs | 1986-01-01 | Paper |
| Parallel nested dissection for path algebra computations | 1986-01-01 | Paper |
| The complexity of elementary algebra and geometry | 1986-01-01 | Paper |
| Efficient parallel linear programming | 1986-01-01 | Paper |
| Fast and efficient linear programming and linear least-squares computations | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3723696 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3734987 | 1986-01-01 | Paper |
| Logarithmic Depth Circuits for Algebraic Functions | 1986-01-01 | Paper |
| Arithmetic theories for computational complexity problems | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3761693 | 1986-01-01 | Paper |
| A multiprocess network logic with temporal and spatial modalities | 1985-01-01 | Paper |
| k-connectivity in random undirected graphs | 1985-01-01 | Paper |
| Depth-first search is inherently sequential | 1985-01-01 | Paper |
| Unbounded Speed Variability in Distributed Communications Systems | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3698710 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3735917 | 1985-01-01 | Paper |
| The complexity of two-player games of incomplete information | 1984-01-01 | Paper |
| Real-Time Synchronization of Interprocess Communications | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3340175 | 1984-01-01 | Paper |
| On Synchronous Parallel Computations with Independent Probabilistic Choice | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3702501 | 1984-01-01 | Paper |
| Symmetric Complementation | 1984-01-01 | Paper |
| Minimums-tCut of a Planar Undirected Network in $O(n\log ^2 (n))$ Time | 1983-01-01 | Paper |
| The propositional dynamic logic of deterministic, well-structured programs | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3668862 | 1983-01-01 | Paper |
| Symbolic Program Analysis in Almost-Linear Time | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3945587 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3912040 | 1981-01-01 | Paper |
| Code Motion | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4195922 | 1977-01-01 | Paper |
| Numerical solution of the Fokker-Planck equation via Chebyschev polynomial approximations with reference to first passage time probability density functions | 1977-01-01 | Paper |
