Anne Condon
Affiliations: University of British Columbia, Department of Computer Science
 University of WisconsinMadison, Computer Sciences Department
According to our database^{1},
Anne Condon
authored at least 103 papers
between 1988 and 2021.
Collaborative distances:
Collaborative distances:
Awards
ACM Fellow
ACM Fellow 2010, "For contributions in complexity theory and leadership in advancing women in computing.".
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Online presence:

on zbmath.org

on cs.ubc.ca

on twitter.com

on orcid.org

on id.loc.gov

on cra.org

on cs.wisc.edu

on dl.acm.org
On csauthors.net:
Bibliography
2021
Predicting Minimum Free Energy Structures of MultiStranded Nucleic Acid Complexes Is APXHard.
Proceedings of the 27th International Conference on DNA Computing and Molecular Programming, 2021
2020
Nat. Comput., 2020
Proceedings of the 26th International Conference on DNA Computing and Molecular Programming, 2020
2019
Efficient Parameter Estimation for DNA Kinetics Modeled as ContinuousTime Markov Chains.
Proceedings of the DNA Computing and Molecular Programming  25th International Conference, 2019
ErrorFree Stable Computation with PolymerSupplemented Chemical Reaction Networks.
Proceedings of the DNA Computing and Molecular Programming  25th International Conference, 2019
2018
Nat. Comput., 2018
Proceedings of the Implementation and Application of Automata, 2018
Proceedings of the 22nd International Conference on Principles of Distributed Systems, 2018
2017
Nat. Comput., 2017
Inferring Parameters for an Elementary Step Model of DNA Structure Kinetics with Locally ContextDependent Arrhenius Rates.
Proceedings of the DNA Computing and Molecular Programming  23rd International Conference, 2017
Proceedings of the DNA Computing and Molecular Programming  23rd International Conference, 2017
2016
densityCut: an efficient and versatile topological approach for automatic clustering of biological data.
Bioinform., 2016
2015
J. Discrete Algorithms, 2015
Proceedings of the DNA Computing and Molecular Programming  21st International Conference, 2015
2014
Reachability bounds for chemical reaction networks and strand displacement systems.
Nat. Comput., 2014
A fast and robust iterative algorithm for prediction of RNA pseudoknotted secondary structures.
BMC Bioinform., 2014
Proceedings of the ACM Conference on Economics and Computation, 2014
2013
Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013
2012
J. Discrete Algorithms, 2012
BMC Bioinform., 2012
Featurebased classifiers for somatic mutation detection in tumournormal paired sequencing data.
Bioinform., 2012
Proceedings of the DNA Computing and Molecular Programming  18th International Conference, 2012
2011
NPcompleteness of the energy barrier problem without pseudoknots and temporary arcs.
Nat. Comput., 2011
Nat., 2011
Artif. Intell., 2011
Less Haste, Less Waste: On Recycling and Its Limits in Strand Displacement Systems.
Proceedings of the DNA Computing and Molecular Programming  17th International Conference, 2011
2010
An Algorithm for the Energy Barrier Problem Without Pseudoknots and Temporary Arcs.
Proceedings of the Biocomputing 2010: Proceedings of the Pacific Symposium, 2010
2009
Computational prediction of nucleic acid secondary structure: Methods, applications, and challenges.
Theor. Comput. Sci., 2009
ACM Trans. Algorithms, 2009
An <i>O</i>(<i>n</i><sup>5</sup>) Algorithm for MFE Prediction of Kissing Hairpins and 4Chains in Nucleic Acids.
J. Comput. Biol., 2009
Proceedings of the Twentieth Annual ACMSIAM Symposium on Discrete Algorithms, 2009
Proceedings of the DNA Computing and Molecular Programming, 15th International Conference, 2009
2008
Proceedings of the Wiley Encyclopedia of Computer Science and Engineering, 2008
Novel and Efficient RNA Secondary Structure Prediction Using Hierarchical Folding.
J. Comput. Biol., 2008
BMC Bioinform., 2008
Computational Challenges and Opportunities in the Design of Unconventional Machines from Nucleic Acids.
Proceedings of the Unconventional Computing, 7th International Conference, 2008
Complexity of a CollisionAware String Partition Problem and Its Relation to Oligo Design for Gene Synthesis.
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008
2007
SIGecom Exch., 2007
Parsing Nucleic Acid Pseudoknotted Secondary Structure: Algorithm and Applications.
J. Comput. Biol., 2007
Computational RNA secondary structure design: empirical complexity and improved methods.
BMC Bioinform., 2007
HFold: RNA Pseudoknotted Secondary Structure Prediction Using Hierarchical Folding.
Proceedings of the Algorithms in Bioinformatics, 7th International Workshop, 2007
Proceedings of the Proceedings 15th International Conference on Intelligent Systems for Molecular Biology (ISMB) & 6th European Conference on Computational Biology (ECCB), 2007
Proceedings of the 7th IEEE International Conference on Bioinformatics and Bioengineering, 2007
2006
Proceedings of the TwentyFifth ACM SIGACTSIGMODSIGART Symposium on Principles of Database Systems, 2006
Proceedings of the Nanotechnology: Science and Computation, 2006
Proceedings of the LATIN 2006: Theoretical Informatics, 2006
2005
Proceedings of the Algorithms in Bioinformatics, 5th International Workshop, 2005
2004
Theor. Comput. Sci., 2004
J. Comput. Syst. Sci., 2004
Automatic Verification of Sequential Consistency for Unbounded Addresses and Data Values.
Proceedings of the Computer Aided Verification, 16th International Conference, 2004
2003
Algorithms for testing that sets of DNA words concatenate without secondary structure.
Nat. Comput., 2003
Nucleic Acids Res., 2003
Theory Comput. Syst., 2003
On the undecidability of probabilistic planning and related stochastic optimization problems.
Artif. Intell., 2003
Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003
2002
Specifying and Verifying a Broadcast and a Multicast Snooping Cache Coherence Protocol.
IEEE Trans. Parallel Distributed Syst., 2002
Theor. Comput. Sci., 2002
Theory Comput. Syst., 2002
Proceedings of the DNA Computing, 8th International Workshop on DNA Based Computers, 2002
Proceedings of the DNA Computing, 8th International Workshop on DNA Based Computers, 2002
2001
Random Struct. Algorithms, 2001
J. Comput. Biol., 2001
Proceedings of the Sixth IEEE International HighLevel Design Validation and Test Workshop 2001, 2001
1999
Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures, 1999
Proceedings of the Fifth International Symposium on HighPerformance Computer Architecture, 1999
On the Undecidability of Probabilistic Planning and InfiniteHorizon Partially Observable Markov Decision Problems.
Proceedings of the Sixteenth National Conference on Artificial Intelligence and Eleventh Conference on Innovative Applications of Artificial Intelligence, 1999
1998
On the Power of Finite Automata with Both Nondeterministic and Probabilistic States.
SIAM J. Comput., 1998
J. Comput. Syst. Sci., 1998
J. Comput. Biol., 1998
J. Algorithms, 1998
Algorithmica, 1998
Proceedings of the Tenth Annual ACM Symposium on Parallel Algorithms and Architectures, 1998
1997
SIGACT News, 1997
SIAM J. Comput., 1997
Proceedings of the First Annual International Conference on Research in Computational Molecular Biology, 1997
1996
IEEE Trans. Parallel Distributed Syst., 1996
SIAM J. Comput., 1996
Proceedings of IPPS '96, 1996
Proceedings of the DNA Based Computers, 1996
1995
SIGACT News, 1995
J. Comput. Syst. Sci., 1995
Probabilistically Checkable Debate Systems and Nonapproximability of PSPACEHard Functions.
Chic. J. Theor. Comput. Sci., 1995
1994
Random Struct. Algorithms, 1994
J. Comput. Syst. Sci., 1994
On the Complexity of the Policy Improvement Algorithm for Markov Decision Processes.
INFORMS J. Comput., 1994
Comput. Complex., 1994
On the power of finite automata with both nondeterministic and probabilistic states (preliminary version).
Proceedings of the TwentySixth Annual ACM Symposium on Theory of Computing, 1994
1993
The Complexity of the Max Word Problem and the Power of OneWay Interactive Proof Systems.
Comput. Complex., 1993
Probabilistically checkable debate systems and approximation algorithms for PSPACEhard functions.
Proceedings of the TwentyFifth Annual ACM Symposium on Theory of Computing, 1993
Proceedings of the 1993 ACM SIGMETRICS conference on Measurement and modeling of computer systems, 1993
Experiments with parallel graph coloring heuristics and applications of graph coloring.
Proceedings of the Cliques, 1993
1992
Inf. Comput., February, 1992
Theor. Comput. Sci., 1992
The Complexity of Space Boundes Interactive Proof Systems.
Proceedings of the Complexity Theory: Current Research, 1992
1991
J. ACM, 1991
Proceedings of the STACS 91, 1991
1990
Proceedings of the STACS 90, 1990
Proceedings of the Advances In Computational Complexity Theory, 1990
Proceedings of the Proceedings: Fifth Annual Structure in Complexity Theory Conference, 1990
1989
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989
Computational models of games.
ACM distinguished dissertations, MIT Press, ISBN: 9780262031523, 1989
1988
J. Comput. Syst. Sci., 1988