| Publication | Date of Publication | Type |
|---|
Approximate majority analyses using tri-molecular chemical reaction networks
Natural Computing | 2024-02-09 | Paper |
Composable computation in leaderless, discrete chemical reaction networks
| 2023-10-27 | Paper |
Predicting minimum free energy structures of multi-stranded nucleic acid complexes is APX-hard
| 2023-09-21 | Paper |
Factorization and pseudofactorization of weighted graphs
Discrete Applied Mathematics | 2023-06-15 | Paper |
Isometric Hamming embeddings of weighted graphs
Discrete Applied Mathematics | 2023-04-17 | Paper |
A theory of strict P-completeness
STACS 92 | 2022-08-18 | Paper |
scientific article; zbMATH DE number 7561449 (Why is no real title available?)
| 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
Natural Computing | 2019-07-10 | Paper |
Stepwise randomized combinatorial auctions achieve revenue monotonicity
| 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
ACM Transactions on Algorithms | 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)
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Reachability bounds for chemical reaction networks and strand displacement systems
Natural Computing | 2016-04-15 | Paper |
On low energy barrier folding pathways for nucleic acid sequences
Lecture Notes in Computer Science | 2015-09-30 | Paper |
Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
The complexity of string partitioning
Journal of Discrete Algorithms | 2015-05-04 | Paper |
Efficient codon optimization with motif engineering
Journal of Discrete Algorithms | 2013-01-18 | Paper |
Reachability bounds for chemical reaction networks and strand displacement systems
Lecture Notes in Computer Science | 2012-11-06 | Paper |
Space and energy efficient computation with DNA strand displacement systems
Lecture Notes in Computer Science | 2012-11-06 | Paper |
The Complexity of String Partitioning
Combinatorial Pattern Matching | 2012-08-14 | Paper |
Efficient Codon Optimization with Motif Engineering
Lecture Notes in Computer Science | 2012-01-13 | Paper |
Less haste, less waste: on recycling and its limits in strand displacement systems
Lecture Notes in Computer Science | 2011-09-16 | Paper |
Revenue monotonicity in deterministic, dominant-strategy combinatorial auctions
Artificial Intelligence | 2011-06-17 | Paper |
NP-completeness of the energy barrier problem without pseudoknots and temporary arcs
Natural Computing | 2011-05-23 | Paper |
NP-Completeness of the Direct Energy Barrier Problem without Pseudoknots
Lecture Notes in Computer Science | 2010-01-07 | Paper |
Computational prediction of nucleic acid secondary structure: Methods, applications, and challenges
Theoretical Computer Science | 2009-03-02 | Paper |
Computational Challenges and Opportunities in the Design of Unconventional Machines from Nucleic Acids
Unconventional Computing | 2008-12-02 | Paper |
Complexity of a Collision-Aware String Partition Problem and Its Relation to Oligo Design for Gene Synthesis
Lecture Notes in Computer Science | 2008-07-10 | Paper |
On the undecidability of probabilistic planning and related stochastic optimization problems
Artificial Intelligence | 2006-02-07 | Paper |
Computer Aided Verification
Lecture Notes in Computer Science | 2005-08-25 | Paper |
Automatable verification of sequential consistency
Theory of Computing Systems | 2004-09-22 | Paper |
Classifying RNA pseudoknotted structures
Theoretical Computer Science | 2004-08-10 | Paper |
A limit theorem for sets of stochastic matrices.
Linear Algebra and its Applications | 2004-05-27 | Paper |
Algorithms for testing that sets of DNA words concatenate without secondary structure
Natural Computing | 2004-03-15 | Paper |
scientific article; zbMATH DE number 2038695 (Why is no real title available?)
| 2004-02-08 | Paper |
scientific article; zbMATH DE number 1953221 (Why is no real title available?)
| 2003-07-25 | Paper |
scientific article; zbMATH DE number 1953220 (Why is no real title available?)
| 2003-07-25 | Paper |
scientific article; zbMATH DE number 1953217 (Why is no real title available?)
| 2003-07-25 | Paper |
Strand design for biomolecular computation.
Theoretical Computer Science | 2003-01-21 | Paper |
Algorithms for graph partitioning on the planted partition model
Random Structures \& Algorithms | 2001-11-06 | Paper |
scientific article; zbMATH DE number 1568800 (Why is no real title available?)
| 2001-06-21 | Paper |
scientific article; zbMATH DE number 1857649 (Why is no real title available?)
| 2001-01-01 | Paper |
scientific article; zbMATH DE number 1418276 (Why is no real title available?)
| 2000-07-19 | Paper |
scientific article; zbMATH DE number 1332658 (Why is no real title available?)
| 1999-09-07 | Paper |
DNA models and algorithms for NP-complete problems
Journal of Computer and System Sciences | 1999-01-17 | Paper |
scientific article; zbMATH DE number 1241368 (Why is no real title available?)
| 1999-01-17 | Paper |
Upper and lower bounds for selection on the mesh
Algorithmica | 1998-05-24 | Paper |
On the Power of Finite Automata with both Nondeterministic and Probabilistic States
SIAM Journal on Computing | 1998-05-10 | Paper |
On Approximation Algorithms for Hierarchical MAX-SAT
Journal of Algorithms | 1998-03-31 | Paper |
Random Debaters and the Hardness of Approximating Stochastic Functions
SIAM Journal on Computing | 1997-05-26 | Paper |
scientific article; zbMATH DE number 956853 (Why is no real title available?)
| 1997-01-22 | Paper |
Complexity of Sub-Bus Mesh Computations
SIAM Journal on Computing | 1996-07-23 | Paper |
Interactive proof systems with polynomially bounded strategies
Journal of Computer and System Sciences | 1996-04-16 | Paper |
scientific article; zbMATH DE number 549853 (Why is no real title available?)
| 1995-03-15 | Paper |
On the Complexity of the Policy Improvement Algorithm for Markov Decision Processes
ORSA Journal on Computing | 1995-03-12 | Paper |
Space-bounded probabilistic game automata
Journal of the ACM | 1994-11-13 | Paper |
A theory of strict P-completeness
Computational Complexity | 1994-10-30 | Paper |
PSPACE is provable by two provers in one round
Journal of Computer and System Sciences | 1994-04-27 | Paper |
scientific article; zbMATH DE number 512803 (Why is no real title available?)
| 1994-04-07 | Paper |
Random walks on colored graphs
Random Structures \& Algorithms | 1994-03-27 | Paper |
The complexity of the max word problem and the power of one-way interactive proof systems
Computational Complexity | 1994-01-19 | Paper |
scientific article; zbMATH DE number 176526 (Why is no real title available?)
| 1993-05-18 | Paper |
On games of incomplete information
Theoretical Computer Science | 1993-01-16 | Paper |
The complexity of stochastic games
Information and Computation | 1992-06-28 | Paper |
scientific article; zbMATH DE number 18527 (Why is no real title available?)
| 1992-06-26 | Paper |
Probabilistic game automata
Journal of Computer and System Sciences | 1988-01-01 | Paper |
scientific article; zbMATH DE number 3992936 (Why is no real title available?)
| 1986-01-01 | Paper |
