The following pages link to Anne Condon (Q268445):
Displaying 50 items.
- Reachability bounds for chemical reaction networks and strand displacement systems (Q268448) (← links)
- NP-completeness of the energy barrier problem without pseudoknots and temporary arcs (Q537858) (← links)
- Revenue monotonicity in deterministic, dominant-strategy combinatorial auctions (Q543608) (← links)
- Classifying RNA pseudoknotted structures (Q596125) (← links)
- On the undecidability of probabilistic planning and related stochastic optimization problems (Q814465) (← links)
- Computational prediction of nucleic acid secondary structure: Methods, applications, and challenges (Q1004072) (← links)
- The complexity of stochastic games (Q1187025) (← links)
- On games of incomplete information (Q1199525) (← links)
- DNA models and algorithms for NP-complete problems (Q1276167) (← links)
- The complexity of the max word problem and the power of one-way interactive proof systems (Q1312183) (← links)
- PSPACE is provable by two provers in one round (Q1318475) (← links)
- A theory of strict P-completeness (Q1337145) (← links)
- (Q1386350) (redirect page) (← links)
- Upper and lower bounds for selection on the mesh (Q1386351) (← links)
- Algorithms for testing that sets of DNA words concatenate without secondary structure (Q1426841) (← links)
- A limit theorem for sets of stochastic matrices. (Q1430373) (← links)
- On design and analysis of chemical reaction network algorithms (Q1616948) (← links)
- Inferring parameters for an elementary step model of DNA structure kinetics with locally context-dependent Arrhenius rates (Q1694432) (← links)
- Simplifying analyses of chemical reaction networks for approximate majority (Q1694434) (← links)
- Probabilistic game automata (Q1824400) (← links)
- Strand design for biomolecular computation. (Q1853477) (← links)
- Automatable verification of sequential consistency (Q1879185) (← links)
- Interactive proof systems with polynomially bounded strategies (Q1894457) (← links)
- Efficient codon optimization with motif engineering (Q1932358) (← links)
- Efficient parameter estimation for DNA kinetics modeled as continuous-time Markov chains (Q2278612) (← links)
- Error-free stable computation with polymer-supplemented chemical reaction networks (Q2278624) (← links)
- Design of nucleic acid strands with long low-barrier folding pathways (Q2311318) (← links)
- The complexity of string partitioning (Q2343298) (← links)
- Isometric Hamming embeddings of weighted graphs (Q2696622) (← links)
- (Q2712576) (← links)
- On the power of finite automata with both nondeterministic and probabilistic states (preliminary version) (Q2817662) (← links)
- The Complexity of String Partitioning (Q2904489) (← links)
- On Low Energy Barrier Folding Pathways for Nucleic Acid Sequences (Q2948417) (← links)
- Less Haste, Less Waste: On Recycling and Its Limits in Strand Displacement Systems (Q3092335) (← links)
- Efficient Codon Optimization with Motif Engineering (Q3111662) (← links)
- Complexity of a Collision-Aware String Partition Problem and Its Relation to Oligo Design for Gene Synthesis (Q3511336) (← links)
- Computational Challenges and Opportunities in the Design of Unconventional Machines from Nucleic Acids (Q3543326) (← links)
- NP-Completeness of the Direct Energy Barrier Problem without Pseudoknots (Q3654673) (← links)
- (Q3975930) (← links)
- (Q4035692) (← links)
- (Q4224896) (← links)
- (Q4259979) (← links)
- (Q4281496) (← links)
- Random walks on colored graphs (Q4286296) (← links)
- (Q4287357) (← links)
- On the Complexity of the Policy Improvement Algorithm for Markov Decision Processes (Q4302721) (← links)
- Space-bounded probabilistic game automata (Q4302843) (← links)
- Random Debaters and the Hardness of Approximating Stochastic Functions (Q4337648) (← links)
- On Approximation Algorithms for Hierarchical MAX-SAT (Q4377125) (← links)
- On the Power of Finite Automata with both Nondeterministic and Probabilistic States (Q4388897) (← links)