Anne Condon

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

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


Research outcomes over time


This page was built for person: Anne Condon