| Publication | Date of Publication | Type |
|---|
| Approximate majority analyses using tri-molecular chemical reaction networks | 2024-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6079210 | 2023-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6076676 | 2023-09-21 | Paper |
| Factorization and pseudofactorization of weighted graphs | 2023-06-15 | Paper |
| Isometric Hamming embeddings of weighted graphs | 2023-04-17 | Paper |
| A theory of strict P-completeness | 2022-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091098 | 2022-07-21 | Paper |
| Isometric Hamming embeddings of weighted graphs | 2021-12-13 | Paper |
| Efficient parameter estimation for DNA kinetics modeled as continuous-time Markov chains | 2019-12-05 | Paper |
| Error-free stable computation with polymer-supplemented chemical reaction networks | 2019-12-05 | Paper |
| Design of nucleic acid strands with long low-barrier folding pathways | 2019-07-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633886 | 2019-05-06 | Paper |
| On design and analysis of chemical reaction network algorithms | 2018-11-07 | Paper |
| Algorithms for distributional and adversarial pipelined filter ordering problems | 2018-11-05 | Paper |
| Inferring parameters for an elementary step model of DNA structure kinetics with locally context-dependent Arrhenius rates | 2018-02-02 | Paper |
| Simplifying analyses of chemical reaction networks for approximate majority | 2018-02-02 | Paper |
| On the power of finite automata with both nondeterministic and probabilistic states (preliminary version) | 2016-09-01 | Paper |
| Reachability bounds for chemical reaction networks and strand displacement systems | 2016-04-15 | Paper |
| On Low Energy Barrier Folding Pathways for Nucleic Acid Sequences | 2015-09-30 | Paper |
| Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions | 2015-05-07 | Paper |
| The complexity of string partitioning | 2015-05-04 | Paper |
| Efficient codon optimization with motif engineering | 2013-01-18 | Paper |
| Reachability Bounds for Chemical Reaction Networks and Strand Displacement Systems | 2012-11-06 | Paper |
| Space and Energy Efficient Computation with DNA Strand Displacement Systems | 2012-11-06 | Paper |
| The Complexity of String Partitioning | 2012-08-14 | Paper |
| Efficient Codon Optimization with Motif Engineering | 2012-01-13 | Paper |
| Less Haste, Less Waste: On Recycling and Its Limits in Strand Displacement Systems | 2011-09-16 | Paper |
| Revenue monotonicity in deterministic, dominant-strategy combinatorial auctions | 2011-06-17 | Paper |
| NP-completeness of the energy barrier problem without pseudoknots and temporary arcs | 2011-05-23 | Paper |
| NP-Completeness of the Direct Energy Barrier Problem without Pseudoknots | 2010-01-07 | Paper |
| Computational prediction of nucleic acid secondary structure: Methods, applications, and challenges | 2009-03-02 | Paper |
| Computational Challenges and Opportunities in the Design of Unconventional Machines from Nucleic Acids | 2008-12-02 | Paper |
| Complexity of a Collision-Aware String Partition Problem and Its Relation to Oligo Design for Gene Synthesis | 2008-07-10 | Paper |
| On the undecidability of probabilistic planning and related stochastic optimization problems | 2006-02-07 | Paper |
| Computer Aided Verification | 2005-08-25 | Paper |
| Automatable verification of sequential consistency | 2004-09-22 | Paper |
| Classifying RNA pseudoknotted structures | 2004-08-10 | Paper |
| A limit theorem for sets of stochastic matrices. | 2004-05-27 | Paper |
| Algorithms for testing that sets of DNA words concatenate without secondary structure | 2004-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449160 | 2004-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414677 | 2003-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414682 | 2003-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414683 | 2003-07-25 | Paper |
| Strand design for biomolecular computation. | 2003-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2712576 | 2001-11-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4762318 | 2001-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4788608 | 2001-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941836 | 2000-07-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4259979 | 1999-09-07 | Paper |
| DNA models and algorithms for NP-complete problems | 1999-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4224896 | 1999-01-17 | Paper |
| Upper and lower bounds for selection on the mesh | 1998-05-24 | Paper |
| On the Power of Finite Automata with both Nondeterministic and Probabilistic States | 1998-05-10 | Paper |
| On Approximation Algorithms for Hierarchical MAX-SAT | 1998-03-31 | Paper |
| Random Debaters and the Hardness of Approximating Stochastic Functions | 1997-05-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5687261 | 1997-01-22 | Paper |
| Complexity of Sub-Bus Mesh Computations | 1996-07-23 | Paper |
| Interactive proof systems with polynomially bounded strategies | 1996-04-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4287357 | 1995-03-15 | Paper |
| On the Complexity of the Policy Improvement Algorithm for Markov Decision Processes | 1995-03-12 | Paper |
| Space-bounded probabilistic game automata | 1994-11-13 | Paper |
| A theory of strict P-completeness | 1994-10-30 | Paper |
| PSPACE is provable by two provers in one round | 1994-04-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281496 | 1994-04-07 | Paper |
| Random walks on colored graphs | 1994-03-27 | Paper |
| The complexity of the max word problem and the power of one-way interactive proof systems | 1994-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035692 | 1993-05-18 | Paper |
| On games of incomplete information | 1993-01-16 | Paper |
| The complexity of stochastic games | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3975930 | 1992-06-26 | Paper |
| Probabilistic game automata | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4720789 | 1986-01-01 | Paper |
