Google Scholar

Recent First, Most Cited First

  1. Condon, A., Hajiaghayi, M., Kirkpatrick, D., & Manuch, J. (2019). Approximate majority analyses using tri-molecular chemical reaction networks. Natural Computing, 1–22. https://doi.org/10.1007/s11047-019-09756-4 PDF

    Approximate Majority is a well-studied problem in the context of chemical reaction networks (CRNs) and their close relatives, population protocols: Given a mixture of two types of species with an initial gap between their counts, a CRN computation must reach consensus on the majority species. Angluin, Aspnes, and Eisenstat proposed a simple population protocol for Approximate Majority and proved correctness and O(logn) time efficiency with high probability, given an initial gap of size Ï(nlogn) when the total molecular count in the mixture is n. Motivated by their intriguing but complex proof, we provide a new analysis of several CRNs for Approximate Majority, starting with a very simple tri-molecular protocol with just two reactions and two species. We obtain simple analyses of three bi-molecular protocols, including that of Angluin et al., by showing how they emulate the tri-molecular protocol. Our results improve on those of Angluin et al. in that they hold even with an initial gap of Ω(nlogn). We prove that our tri-molecular CRN is robust even when there is some uncertainty in the reaction rates, when some molecules are Byzantine (i.e., adversarial), or when activation of molecules is triggered by epidemic. We also analyse a natural variant of our tri-molecular protocol for the more general problem of multi-valued consensus. Our analysis approach, which leverages the simplicity of a tri-molecular CRN to ultimately reason about these many variants, may be useful in analysing other CRNs too.

    @article{approx-maj-journal,
  author = {Condon, Anne and Hajiaghayi, Monir and Kirkpatrick, David and Manuch, Jan},
  year = {2019},
  title = {Approximate majority analyses using tri-molecular chemical reaction networks},
  journal = {Natural Computing},
  issn = {1567-7818},
  doi = {10.1007/s11047-019-09756-4},
  month = aug,
  pages = {1--22},
  url = {https://doi.org/10.1007/s11047-019-09756-4}
}
  2. Tai, A., & Condon, A. (2019). Error-Free Stable Computation with Polymer-Supplemented Chemical Reaction Networks. In C. Thachuk & Y. Liu (Eds.), DNA Computing and Molecular Programming - 25th International Conference, DNA 25, Seattle, WA, USA, August 5-9, 2019, Proceedings (Vol. 11648, pp. 197–218). Springer. https://doi.org/10.1007/978-3-030-26807-7_11 PDF 
    @inproceedings{Tai-Condon2019_Chapter_Error-FreeStableComputationWit,
  author = {Tai, Allison and Condon, Anne},
  editor = {Thachuk, Chris and Liu, Yan},
  title = {Error-Free Stable Computation with Polymer-Supplemented Chemical Reaction
                 Networks},
  booktitle = {{DNA} Computing and Molecular Programming - 25th International Conference,
                 {DNA} 25, Seattle, WA, USA, August 5-9, 2019, Proceedings},
  series = {Lecture Notes in Computer Science},
  volume = {11648},
  pages = {197--218},
  publisher = {Springer},
  year = {2019},
  url = {https://doi.org/10.1007/978-3-030-26807-7\_11},
  doi = {10.1007/978-3-030-26807-7\_11},
  timestamp = {Tue, 30 Jul 2019 13:41:31 +0200},
  biburl = {https://dblp.org/rec/bib/conf/dna/TaiC19},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  3. Zolaktaf, S., Dannenberg, F., Winfree, E., Bouchard-Côté, A., Schmidt, M., & Condon, A. (2019). Efficient Parameter Estimation for DNA Kinetics Modeled as Continuous-Time Markov Chains. In C. Thachuk & Y. Liu (Eds.), DNA Computing and Molecular Programming - 25th International Conference, DNA 25, Seattle, WA, USA, August 5-9, 2019, Proceedings (Vol. 11648, pp. 80–99). Springer. https://doi.org/10.1007/978-3-030-26807-7_5 PDF 
    @inproceedings{RVSSA_FPEI_LNCS2019,
  author = {Zolaktaf, Sedigheh and Dannenberg, Frits and Winfree, Erik and Bouchard{-}C{\^{o}}t{\'{e}}, Alexandre and Schmidt, Mark and Condon, Anne},
  editor = {Thachuk, Chris and Liu, Yan},
  title = {Efficient Parameter Estimation for {DNA} Kinetics Modeled as Continuous-Time
                 Markov Chains},
  booktitle = {{DNA} Computing and Molecular Programming - 25th International Conference,
                 {DNA} 25, Seattle, WA, USA, August 5-9, 2019, Proceedings},
  series = {Lecture Notes in Computer Science},
  volume = {11648},
  pages = {80--99},
  publisher = {Springer},
  year = {2019},
  url = {https://doi.org/10.1007/978-3-030-26807-7\_5},
  doi = {10.1007/978-3-030-26807-7\_5},
  timestamp = {Tue, 30 Jul 2019 13:41:31 +0200},
  biburl = {https://dblp.org/rec/bib/conf/dna/ZolaktafDWBSC19},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  4. Chugg, B., Hashemi, H., & Condon, A. (2018). Output-Oblivious Stochastic Chemical Reaction Networks. In J. Cao, F. Ellen, L. Rodrigues, & B. Ferreira (Eds.), 22nd International Conference on Principles of Distributed Systems, OPODIS 2018, December 17-19, 2018, Hong Kong, China (Vol. 125, pp. 21:1–21:16). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.OPODIS.2018.21 
    @inproceedings{LIPIcs-OPODIS-2018-21,
  author = {Chugg, Ben and Hashemi, Hooman and Condon, Anne},
  editor = {Cao, Jiannong and Ellen, Faith and Rodrigues, Luis and Ferreira, Bernardo},
  title = {Output-Oblivious Stochastic Chemical Reaction Networks},
  booktitle = {22nd International Conference on Principles of Distributed Systems,
                 {OPODIS} 2018, December 17-19, 2018, Hong Kong, China},
  series = {LIPIcs},
  volume = {125},
  pages = {21:1--21:16},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year = {2018},
  url = {https://doi.org/10.4230/LIPIcs.OPODIS.2018.21},
  doi = {10.4230/LIPIcs.OPODIS.2018.21},
  timestamp = {Thu, 02 May 2019 17:40:16 +0200},
  biburl = {https://dblp.org/rec/bib/conf/opodis/ChuggHC18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  5. Zolaktaf, S., Dannenberg, F., Rudelis, X., Condon, A., Schaeffer, J. M., Schmidt, M., … Winfree, E. (2017). Inferring Parameters for an Elementary Step Model of DNA Structure Kinetics with Locally Context-Dependent Arrhenius Rates. In R. Brijder & L. Qian (Eds.), DNA Computing and Molecular Programming - 23rd International Conference, DNA 23, Austin, TX, USA, September 24-28, 2017, Proceedings (Vol. 10467, pp. 172–187). Springer. https://doi.org/10.1007/978-3-319-66799-7_12 PDF 
    @inproceedings{LNCS-DNA23-Arrhenius,
  author = {Zolaktaf, Sedigheh and Dannenberg, Frits and Rudelis, Xander and Condon, Anne and Schaeffer, Joseph M. and Schmidt, Mark and Thachuk, Chris and Winfree, Erik},
  editor = {Brijder, Robert and Qian, Lulu},
  title = {Inferring Parameters for an Elementary Step Model of {DNA} Structure
                 Kinetics with Locally Context-Dependent Arrhenius Rates},
  booktitle = {{DNA} Computing and Molecular Programming - 23rd International Conference,
                 {DNA} 23, Austin, TX, USA, September 24-28, 2017, Proceedings},
  series = {Lecture Notes in Computer Science},
  volume = {10467},
  pages = {172--187},
  publisher = {Springer},
  year = {2017},
  url = {https://doi.org/10.1007/978-3-319-66799-7\_12},
  doi = {10.1007/978-3-319-66799-7\_12},
  timestamp = {Tue, 14 May 2019 10:00:40 +0200},
  biburl = {https://dblp.org/rec/bib/conf/dna/ZolaktafDRCSSTW17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  6. Condon, A., Hajiaghayi, M., Kirkpatrick, D. G., & Manuch, J. (2017). Simplifying Analyses of Chemical Reaction Networks for Approximate Majority. In R. Brijder & L. Qian (Eds.), DNA Computing and Molecular Programming - 23rd International Conference, DNA 23, Austin, TX, USA, September 24-28, 2017, Proceedings (Vol. 10467, pp. 188–209). Springer. https://doi.org/10.1007/978-3-319-66799-7_13 PDF 
    @inproceedings{hajiaghayi-etal-2017,
  author = {Condon, Anne and Hajiaghayi, Monir and Kirkpatrick, David G. and Manuch, J{\'{a}}n},
  editor = {Brijder, Robert and Qian, Lulu},
  title = {Simplifying Analyses of Chemical Reaction Networks for Approximate
                 Majority},
  booktitle = {{DNA} Computing and Molecular Programming - 23rd International Conference,
                 {DNA} 23, Austin, TX, USA, September 24-28, 2017, Proceedings},
  series = {Lecture Notes in Computer Science},
  volume = {10467},
  pages = {188--209},
  publisher = {Springer},
  year = {2017},
  url = {https://doi.org/10.1007/978-3-319-66799-7\_13},
  doi = {10.1007/978-3-319-66799-7\_13},
  timestamp = {Tue, 14 May 2019 10:00:40 +0200},
  biburl = {https://dblp.org/rec/bib/conf/dna/CondonHKM17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  7. Condon, A., Manuch, J., & Thachuk, C. (2015). The complexity of string partitioning. J. Discrete Algorithms, 32, 24–43. https://doi.org/10.1016/j.jda.2014.11.002 PDF 
    @article{String-partitioning-2015,
  author = {Condon, Anne and Manuch, J{\'{a}}n and Thachuk, Chris},
  title = {The complexity of string partitioning},
  journal = {J. Discrete Algorithms},
  volume = {32},
  pages = {24--43},
  year = {2015},
  url = {https://doi.org/10.1016/j.jda.2014.11.002},
  doi = {10.1016/j.jda.2014.11.002},
  timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
  biburl = {https://dblp.org/rec/bib/journals/jda/CondonMT15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  8. Mathieson, L.-A., & Condon, A. (2015). On Low Energy Barrier Folding Pathways for Nucleic Acid Sequences. In A. Phillips & P. Yin (Eds.), DNA Computing and Molecular Programming - 21st International Conference, DNA 21, Boston and Cambridge, MA, USA, August 17-21, 2015. Proceedings (Vol. 9211, pp. 181–193). Springer. https://doi.org/10.1007/978-3-319-21999-8_12 PDF 
    @inproceedings{dna21,
  author = {Mathieson, Leigh{-}Anne and Condon, Anne},
  editor = {Phillips, Andrew and Yin, Peng},
  title = {On Low Energy Barrier Folding Pathways for Nucleic Acid Sequences},
  booktitle = {{DNA} Computing and Molecular Programming - 21st International Conference,
                 {DNA} 21, Boston and Cambridge, MA, USA, August 17-21, 2015. Proceedings},
  series = {Lecture Notes in Computer Science},
  volume = {9211},
  pages = {181--193},
  publisher = {Springer},
  year = {2015},
  url = {https://doi.org/10.1007/978-3-319-21999-8\_12},
  doi = {10.1007/978-3-319-21999-8\_12},
  timestamp = {Tue, 14 May 2019 10:00:40 +0200},
  biburl = {https://dblp.org/rec/bib/conf/dna/MathiesonC15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  9. Jabbari, H., & Condon, A. (2014). A fast and robust iterative algorithm for prediction of RNA pseudoknotted secondary structures. BMC Bioinformatics, 15, 147. https://doi.org/10.1186/1471-2105-15-147 PDF 
    @article{Jabbari-Condon-2014,
  author = {Jabbari, Hosna and Condon, Anne},
  title = {A fast and robust iterative algorithm for prediction of {RNA} pseudoknotted
                 secondary structures},
  journal = {{BMC} Bioinformatics},
  volume = {15},
  pages = {147},
  year = {2014},
  url = {https://doi.org/10.1186/1471-2105-15-147},
  doi = {10.1186/1471-2105-15-147},
  timestamp = {Thu, 16 May 2019 01:00:00 +0200},
  biburl = {https://dblp.org/rec/bib/journals/bmcbi/JabbariC14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  10. Condon, A., Kirkpatrick, B., & Manuch, J. (2014). Reachability bounds for chemical reaction networks and strand displacement systems. Natural Computing, 13(4), 499–516. https://doi.org/10.1007/s11047-013-9403-8 PDF 
    @article{Condon2014_Article_ReachabilityBoundsForChemicalR,
  author = {Condon, Anne and Kirkpatrick, Bonnie and Manuch, J{\'{a}}n},
  title = {Reachability bounds for chemical reaction networks and strand displacement
                 systems},
  journal = {Natural Computing},
  volume = {13},
  number = {4},
  pages = {499--516},
  year = {2014},
  url = {https://doi.org/10.1007/s11047-013-9403-8},
  doi = {10.1007/s11047-013-9403-8},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl = {https://dblp.org/rec/bib/journals/nc/CondonKM14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  11. Rastegari, B., Condon, A., Immorlica, N., Irving, R., & Leyton-Brown, K. (2014). Reasoning about optimal stable matchings under partial information. In M. Babaioff, V. Conitzer, & D. Easley (Eds.), ACM Conference on Economics and Computation, EC ’14, Stanford , CA, USA, June 8-12, 2014 (pp. 431–448). ACM. https://doi.org/10.1145/2600057.2602884 PDF 
    @inproceedings{2014-EC-MatchingInference,
  author = {Rastegari, Baharak and Condon, Anne and Immorlica, Nicole and Irving, Robert and Leyton{-}Brown, Kevin},
  editor = {Babaioff, Moshe and Conitzer, Vincent and Easley, David},
  title = {Reasoning about optimal stable matchings under partial information},
  booktitle = {{ACM} Conference on Economics and Computation, {EC} '14, Stanford
                 , CA, USA, June 8-12, 2014},
  pages = {431--448},
  publisher = {{ACM}},
  year = {2014},
  url = {https://doi.org/10.1145/2600057.2602884},
  doi = {10.1145/2600057.2602884},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl = {https://dblp.org/rec/bib/conf/sigecom/RastegariCIIL14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  12. Rastegari, B., Condon, A., Immorlica, N., & Leyton-Brown, K. (2013). Two-sided matching with partial information. In M. J. Kearns, R. P. McAfee, & Éva Tardos (Eds.), Proceedings of the fourteenth ACM Conference on Electronic Commerce, EC 2013, Philadelphia, PA, USA, June 16-20, 2013 (pp. 733–750). ACM. https://doi.org/10.1145/2492002.2482607 PDF 
    @inproceedings{interviews,
  author = {Rastegari, Baharak and Condon, Anne and Immorlica, Nicole and Leyton{-}Brown, Kevin},
  editor = {Kearns, Michael J. and McAfee, R. Preston and {\'{E}}va Tardos},
  title = {Two-sided matching with partial information},
  booktitle = {Proceedings of the fourteenth {ACM} Conference on Electronic Commerce,
                 {EC} 2013, Philadelphia, PA, USA, June 16-20, 2013},
  pages = {733--750},
  publisher = {{ACM}},
  year = {2013},
  url = {https://doi.org/10.1145/2492002.2482607},
  doi = {10.1145/2492002.2482607},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl = {https://dblp.org/rec/bib/conf/sigecom/RastegariCIL13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  13. Ding, J., Bashashati, A., Roth, A., Oloumi, A., Tse, K., Zeng, T., … Shah, S. P. (2012). Feature-based classifiers for somatic mutation detection in tumour-normal paired sequencing data. Bioinformatics, 28(2), 167–175. https://doi.org/10.1093/bioinformatics/btr629 PDF 
    @article{btr629,
  author = {Ding, Jiarui and Bashashati, Ali and Roth, Andrew and Oloumi, Arusha and Tse, Kane and Zeng, Thomas and Haffari, Gholamreza and Hirst, Martin and Marra, Marco A. and Condon, Anne and Aparicio, Sam and Shah, Sohrab P.},
  title = {Feature-based classifiers for somatic mutation detection in tumour-normal
                 paired sequencing data},
  journal = {Bioinformatics},
  volume = {28},
  number = {2},
  pages = {167--175},
  year = {2012},
  url = {https://doi.org/10.1093/bioinformatics/btr629},
  doi = {10.1093/bioinformatics/btr629},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl = {https://dblp.org/rec/bib/journals/bioinformatics/DingBROTZHHMCAS12},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  14. Hajiaghayi, M., Condon, A., & Hoos, H. H. (2012). Analysis of energy-based algorithms for RNA secondary structure prediction. BMC Bioinformatics, 13, 22. https://doi.org/10.1186/1471-2105-13-22 PDF 
    @article{hajiaghayi-etal-2012,
  author = {Hajiaghayi, Monir and Condon, Anne and Hoos, Holger H.},
  title = {Analysis of energy-based algorithms for {RNA} secondary structure
                 prediction},
  journal = {{BMC} Bioinformatics},
  volume = {13},
  pages = {22},
  year = {2012},
  url = {https://doi.org/10.1186/1471-2105-13-22},
  doi = {10.1186/1471-2105-13-22},
  timestamp = {Thu, 16 May 2019 01:00:00 +0200},
  biburl = {https://dblp.org/rec/bib/journals/bmcbi/HajiaghayiCH12},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  15. Condon, A., & Thachuk, C. (2012). Efficient codon optimization with motif engineering. J. Discrete Algorithms, 16, 104–112. https://doi.org/10.1016/j.jda.2012.04.017 PDF 
    @article{Condon-Thachuk-2012,
  author = {Condon, Anne and Thachuk, Chris},
  title = {Efficient codon optimization with motif engineering},
  journal = {J. Discrete Algorithms},
  volume = {16},
  pages = {104--112},
  year = {2012},
  url = {https://doi.org/10.1016/j.jda.2012.04.017},
  doi = {10.1016/j.jda.2012.04.017},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl = {https://dblp.org/rec/bib/journals/jda/CondonT12},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  16. Thachuk, C., & Condon, A. (2012). Space and Energy Efficient Computation with DNA Strand Displacement Systems. In D. Stefanovic & A. J. Turberfield (Eds.), DNA Computing and Molecular Programming - 18th International Conference, DNA 18, Aarhus, Denmark, August 14-17, 2012. Proceedings (Vol. 7433, pp. 135–149). Springer. https://doi.org/10.1007/978-3-642-32208-2_11 PDF 
    @inproceedings{dna-pspace,
  author = {Thachuk, Chris and Condon, Anne},
  editor = {Stefanovic, Darko and Turberfield, Andrew J.},
  title = {Space and Energy Efficient Computation with {DNA} Strand Displacement
                 Systems},
  booktitle = {{DNA} Computing and Molecular Programming - 18th International Conference,
                 {DNA} 18, Aarhus, Denmark, August 14-17, 2012. Proceedings},
  series = {Lecture Notes in Computer Science},
  volume = {7433},
  pages = {135--149},
  publisher = {Springer},
  year = {2012},
  url = {https://doi.org/10.1007/978-3-642-32208-2\_11},
  doi = {10.1007/978-3-642-32208-2\_11},
  timestamp = {Tue, 14 May 2019 10:00:40 +0200},
  biburl = {https://dblp.org/rec/bib/conf/dna/ThachukC12},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  17. Rastegari, B., Condon, A., & Leyton-Brown, K. (2011). Revenue monotonicity in deterministic, dominant-strategy combinatorial auctions. Artif. Intell., 175(2), 441–456. https://doi.org/10.1016/j.artint.2010.08.005 PDF 
    @article{rastegari-etal-2011,
  author = {Rastegari, Baharak and Condon, Anne and Leyton{-}Brown, Kevin},
  title = {Revenue monotonicity in deterministic, dominant-strategy combinatorial
                 auctions},
  journal = {Artif. Intell.},
  volume = {175},
  number = {2},
  pages = {441--456},
  year = {2011},
  url = {https://doi.org/10.1016/j.artint.2010.08.005},
  doi = {10.1016/j.artint.2010.08.005},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl = {https://dblp.org/rec/bib/journals/ai/RastegariCL11},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  18. Condon, A. (2011). Molecular programming: DNA and the brain. Nature, 475(7356), 304–305. https://doi.org/10.1038/475304a PDF 
    @article{Condon-News-and-Views-2011,
  author = {Condon, Anne},
  title = {Molecular programming: {DNA} and the brain},
  journal = {Nature},
  volume = {475},
  number = {7356},
  pages = {304--305},
  year = {2011},
  url = {https://doi.org/10.1038/475304a},
  doi = {10.1038/475304a},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl = {https://dblp.org/rec/bib/journals/nature/Condon11},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  19. Manuch, J., Thachuk, C., Stacho, L., & Condon, A. (2011). NP-completeness of the energy barrier problem without pseudoknots and temporary arcs. Natural Computing, 10(1), 391–405. https://doi.org/10.1007/s11047-010-9239-4 
    @article{manuch-et-al-2009-nat-comp.pdf,
  author = {Manuch, J{\'{a}}n and Thachuk, Chris and Stacho, Ladislav and Condon, Anne},
  title = {NP-completeness of the energy barrier problem without pseudoknots
                 and temporary arcs},
  journal = {Natural Computing},
  volume = {10},
  number = {1},
  pages = {391--405},
  year = {2011},
  url = {https://doi.org/10.1007/s11047-010-9239-4},
  doi = {10.1007/s11047-010-9239-4},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl = {https://dblp.org/rec/bib/journals/nc/ManuchTSC11},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  20. Condon, A., Hu, A. J., Manuch, J., & Thachuk, C. (2011). Less Haste, Less Waste: On Recycling and Its Limits in Strand Displacement Systems. In L. Cardelli & W. M. Shih (Eds.), DNA Computing and Molecular Programming - 17th International Conference, DNA 17, Pasadena, CA, USA, September 19-23, 2011. Proceedings (Vol. 6937, pp. 84–99). Springer. https://doi.org/10.1007/978-3-642-23638-9_9 PDF 
    @inproceedings{rsfs-2011-0106,
  author = {Condon, Anne and Hu, Alan J. and Manuch, J{\'{a}}n and Thachuk, Chris},
  editor = {Cardelli, Luca and Shih, William M.},
  title = {Less Haste, Less Waste: On Recycling and Its Limits in Strand Displacement
                 Systems},
  booktitle = {{DNA} Computing and Molecular Programming - 17th International Conference,
                 {DNA} 17, Pasadena, CA, USA, September 19-23, 2011. Proceedings},
  series = {Lecture Notes in Computer Science},
  volume = {6937},
  pages = {84--99},
  publisher = {Springer},
  year = {2011},
  url = {https://doi.org/10.1007/978-3-642-23638-9\_9},
  doi = {10.1007/978-3-642-23638-9\_9},
  timestamp = {Tue, 14 May 2019 10:00:40 +0200},
  biburl = {https://dblp.org/rec/bib/conf/dna/CondonHMT11},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  21. Condon, A., & Thachuk, C. (2011). Efficient Codon Optimization with Motif Engineering. In C. S. Iliopoulos & W. F. Smyth (Eds.), Combinatorial Algorithms - 22nd International Workshop, IWOCA 2011, Victoria, BC, Canada, July 20-22, 2011, Revised Selected Papers (Vol. 7056, pp. 337–348). Springer. https://doi.org/10.1007/978-3-642-25011-8_27 PDF 
    @inproceedings{1-s2-0-S157086671200086X-main,
  author = {Condon, Anne and Thachuk, Chris},
  editor = {Iliopoulos, Costas S. and Smyth, William F.},
  title = {Efficient Codon Optimization with Motif Engineering},
  booktitle = {Combinatorial Algorithms - 22nd International Workshop, {IWOCA} 2011,
                 Victoria, BC, Canada, July 20-22, 2011, Revised Selected Papers},
  series = {Lecture Notes in Computer Science},
  volume = {7056},
  pages = {337--348},
  publisher = {Springer},
  year = {2011},
  url = {https://doi.org/10.1007/978-3-642-25011-8\_27},
  doi = {10.1007/978-3-642-25011-8\_27},
  timestamp = {Tue, 14 May 2019 10:00:53 +0200},
  biburl = {https://dblp.org/rec/bib/conf/iwoca/CondonT11},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  22. Thachuk, C., Manuch, J., Rafiey, A., Mathieson, L.-A., Stacho, L., & Condon, A. (2010). An Algorithm for the Energy Barrier Problem Without Pseudoknots and Temporary Arcs. In R. B. Altman, A. K. Dunker, L. Hunter, T. Murray, & T. E. Klein (Eds.), Biocomputing 2010: Proceedings of the Pacific Symposium, Kamuela, Hawaii, USA, 4-8 January 2010 (pp. 108–119). World Scientific Publishing. Retrieved from http://psb.stanford.edu/psb-online/proceedings/psb10/thachuk.pdf PDF 
    @inproceedings{psb2010,
  author = {Thachuk, Chris and Manuch, J{\'{a}}n and Rafiey, Arash and Mathieson, Leigh{-}Anne and Stacho, Ladislav and Condon, Anne},
  editor = {Altman, Russ B. and Dunker, A. Keith and Hunter, Lawrence and Murray, Tiffany and Klein, Teri E.},
  title = {An Algorithm for the Energy Barrier Problem Without Pseudoknots and
                 Temporary Arcs},
  booktitle = {Biocomputing 2010: Proceedings of the Pacific Symposium, Kamuela,
                 Hawaii, USA, 4-8 January 2010},
  pages = {108--119},
  publisher = {World Scientific Publishing},
  year = {2010},
  url = {http://psb.stanford.edu/psb-online/proceedings/psb10/thachuk.pdf},
  timestamp = {Fri, 05 May 2017 13:11:14 +0200},
  biburl = {https://dblp.org/rec/bib/conf/psb/ThachukMRMSC10},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  23. Chen, H.-L., Condon, A., & Jabbari, H. (2009). An O(n\(^\mbox5\)) Algorithm for MFE Prediction of Kissing Hairpins and 4-Chains in Nucleic Acids. Journal of Computational Biology, 16(6), 803–815. https://doi.org/10.1089/cmb.2008.0219 PDF 
    @article{cmb-2008-0219,
  author = {Chen, Ho{-}Lin and Condon, Anne and Jabbari, Hosna},
  title = {An \emph{O}(\emph{n}\({}^{\mbox{5}}\)) Algorithm for {MFE} Prediction
                 of Kissing Hairpins and 4-Chains in Nucleic Acids},
  journal = {Journal of Computational Biology},
  volume = {16},
  number = {6},
  pages = {803--815},
  year = {2009},
  url = {https://doi.org/10.1089/cmb.2008.0219},
  doi = {10.1089/cmb.2008.0219},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl = {https://dblp.org/rec/bib/journals/jcb/ChenCJ09},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  24. Condon, A., Deshpande, A., Hellerstein, L., & Wu, N. (2009). Algorithms for distributional and adversarial pipelined filter ordering problems. ACM Trans. Algorithms, 5(2), 24:1–24:34. https://doi.org/10.1145/1497290.1497300 PDF 
    @article{pipelinedfilter,
  author = {Condon, Anne and Deshpande, Amol and Hellerstein, Lisa and Wu, Ning},
  title = {Algorithms for distributional and adversarial pipelined filter ordering
                 problems},
  journal = {{ACM} Trans. Algorithms},
  volume = {5},
  number = {2},
  pages = {24:1--24:34},
  year = {2009},
  url = {https://doi.org/10.1145/1497290.1497300},
  doi = {10.1145/1497290.1497300},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl = {https://dblp.org/rec/bib/journals/talg/CondonDHW09},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  25. Condon, A., & Jabbari, H. (2009). Computational prediction of nucleic acid secondary structure: Methods, applications, and challenges. Theor. Comput. Sci., 410(4-5), 294–301. https://doi.org/10.1016/j.tcs.2008.09.042 PDF 
    @article{Jabbari-Condon-2009,
  author = {Condon, Anne and Jabbari, Hosna},
  title = {Computational prediction of nucleic acid secondary structure: Methods,
                 applications, and challenges},
  journal = {Theor. Comput. Sci.},
  volume = {410},
  number = {4-5},
  pages = {294--301},
  year = {2009},
  url = {https://doi.org/10.1016/j.tcs.2008.09.042},
  doi = {10.1016/j.tcs.2008.09.042},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl = {https://dblp.org/rec/bib/journals/tcs/CondonJ09},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  26. Rastegari, B., Condon, A., & Leyton-Brown, K. (2009). Stepwise randomized combinatorial auctions achieve revenue monotonicity. In C. Mathieu (Ed.), Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009 (pp. 738–747). SIAM. Retrieved from http://dl.acm.org/citation.cfm?id=1496770.1496851 PDF 
    @inproceedings{rastegari-etal-09,
  author = {Rastegari, Baharak and Condon, Anne and Leyton{-}Brown, Kevin},
  editor = {Mathieu, Claire},
  title = {Stepwise randomized combinatorial auctions achieve revenue monotonicity},
  booktitle = {Proceedings of the Twentieth Annual {ACM-SIAM} Symposium on Discrete
                 Algorithms, {SODA} 2009, New York, NY, USA, January 4-6, 2009},
  pages = {738--747},
  publisher = {{SIAM}},
  year = {2009},
  url = {http://dl.acm.org/citation.cfm?id=1496770.1496851},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl = {https://dblp.org/rec/bib/conf/soda/RastegariCL09},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  27. Andronescu, M., Bereg, V., Hoos, H. H., & Condon, A. (2008). RNA STRAND: The RNA Secondary Structure and Statistical Analysis Database. BMC Bioinformatics, 9. https://doi.org/10.1186/1471-2105-9-340 PDF 
    @article{RNA-SSTRAND,
  author = {Andronescu, Mirela and Bereg, Vera and Hoos, Holger H. and Condon, Anne},
  title = {{RNA} {STRAND:} The {RNA} Secondary Structure and Statistical Analysis
                 Database},
  journal = {{BMC} Bioinformatics},
  volume = {9},
  year = {2008},
  url = {https://doi.org/10.1186/1471-2105-9-340},
  doi = {10.1186/1471-2105-9-340},
  timestamp = {Thu, 16 May 2019 01:00:00 +0200},
  biburl = {https://dblp.org/rec/bib/journals/bmcbi/AndronescuBHC08},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  28. Jabbari, H., Condon, A., & Zhao, S. (2008). Novel and Efficient RNA Secondary Structure Prediction Using Hierarchical Folding. Journal of Computational Biology, 15(2), 139–163. https://doi.org/10.1089/cmb.2007.0198 PDF 
    @article{cmb-2007-0198,
  author = {Jabbari, Hosna and Condon, Anne and Zhao, Shelly},
  title = {Novel and Efficient {RNA} Secondary Structure Prediction Using Hierarchical
                 Folding},
  journal = {Journal of Computational Biology},
  volume = {15},
  number = {2},
  pages = {139--163},
  year = {2008},
  url = {https://doi.org/10.1089/cmb.2007.0198},
  doi = {10.1089/cmb.2007.0198},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl = {https://dblp.org/rec/bib/journals/jcb/JabbariCZ08},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  29. Condon, A., Manuch, J., & Thachuk, C. (2008). Complexity of a Collision-Aware String Partition Problem and Its Relation to Oligo Design for Gene Synthesis. In X. Hu & J. Wang (Eds.), Computing and Combinatorics, 14th Annual International Conference, COCOON 2008, Dalian, China, June 27-29, 2008, Proceedings (Vol. 5092, pp. 265–275). Springer. https://doi.org/10.1007/978-3-540-69733-6_27 PDF 
    @inproceedings{Condon-etal-2008,
  author = {Condon, Anne and Manuch, J{\'{a}}n and Thachuk, Chris},
  editor = {Hu, Xiaodong and Wang, Jie},
  title = {Complexity of a Collision-Aware String Partition Problem and Its Relation
                 to Oligo Design for Gene Synthesis},
  booktitle = {Computing and Combinatorics, 14th Annual International Conference,
                 {COCOON} 2008, Dalian, China, June 27-29, 2008, Proceedings},
  series = {Lecture Notes in Computer Science},
  volume = {5092},
  pages = {265--275},
  publisher = {Springer},
  year = {2008},
  url = {https://doi.org/10.1007/978-3-540-69733-6\_27},
  doi = {10.1007/978-3-540-69733-6\_27},
  timestamp = {Tue, 14 May 2019 10:00:35 +0200},
  biburl = {https://dblp.org/rec/bib/conf/cocoon/CondonMT08},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  30. Aguirre-Hernández Rosalı́a, Hoos, H. H., & Condon, A. (2007). Computational RNA secondary structure design: empirical complexity and improved methods. BMC Bioinformatics, 8. https://doi.org/10.1186/1471-2105-8-34 PDF 
    @article{RNA-design-2007,
  author = {Aguirre{-}Hern{\'{a}}ndez, Rosal{\'{\i}}a and Hoos, Holger H. and Condon, Anne},
  title = {Computational {RNA} secondary structure design: empirical complexity
                 and improved methods},
  journal = {{BMC} Bioinformatics},
  volume = {8},
  year = {2007},
  url = {https://doi.org/10.1186/1471-2105-8-34},
  doi = {10.1186/1471-2105-8-34},
  timestamp = {Thu, 16 May 2019 01:00:00 +0200},
  biburl = {https://dblp.org/rec/bib/journals/bmcbi/Aguirre-HernandezHC07},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  31. Rastegari, B., & Condon, A. (2007). Parsing Nucleic Acid Pseudoknotted Secondary Structure: Algorithm and Applications. Journal of Computational Biology, 14(1), 16–32. https://doi.org/10.1089/cmb.2006.0108 PDF 
    @article{compbiol07,
  author = {Rastegari, Baharak and Condon, Anne},
  title = {Parsing Nucleic Acid Pseudoknotted Secondary Structure: Algorithm
                 and Applications},
  journal = {Journal of Computational Biology},
  volume = {14},
  number = {1},
  pages = {16--32},
  year = {2007},
  url = {https://doi.org/10.1089/cmb.2006.0108},
  doi = {10.1089/cmb.2006.0108},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl = {https://dblp.org/rec/bib/journals/jcb/RastegariC07},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  32. Rastegari, B., Condon, A., & Leyton-Brown, K. (2007). Revenue monotonicity in combinatorial auctions. SIGecom Exchanges, 7(1), 45–47. https://doi.org/10.1145/1345037.1345048 
    @article{DBLP:journals/sigecom/RastegariCL07,
  author = {Rastegari, Baharak and Condon, Anne and Leyton{-}Brown, Kevin},
  title = {Revenue monotonicity in combinatorial auctions},
  journal = {SIGecom Exchanges},
  volume = {7},
  number = {1},
  pages = {45--47},
  year = {2007},
  url = {https://doi.org/10.1145/1345037.1345048},
  doi = {10.1145/1345037.1345048},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl = {https://dblp.org/rec/bib/journals/sigecom/RastegariCL07},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  33. Rastegari, B., Condon, A., & Leyton-Brown, K. (2007). Revenue Monotonicity in Combinatorial Auctions. In Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, July 22-26, 2007, Vancouver, British Columbia, Canada (pp. 122–127). AAAI Press. Retrieved from http://www.aaai.org/Library/AAAI/2007/aaai07-018.php 
    @inproceedings{DBLP:conf/aaai/RastegariCL07,
  author = {Rastegari, Baharak and Condon, Anne and Leyton{-}Brown, Kevin},
  title = {Revenue Monotonicity in Combinatorial Auctions},
  booktitle = {Proceedings of the Twenty-Second {AAAI} Conference on Artificial Intelligence,
                 July 22-26, 2007, Vancouver, British Columbia, Canada},
  pages = {122--127},
  publisher = {{AAAI} Press},
  year = {2007},
  url = {http://www.aaai.org/Library/AAAI/2007/aaai07-018.php},
  timestamp = {Mon, 10 Dec 2012 00:00:00 +0100},
  biburl = {https://dblp.org/rec/bib/conf/aaai/RastegariCL07},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  34. Thachuk, C., & Condon, A. (2007). On the Design of Oligos for Gene Synthesis. In Proceedings of the 7th IEEE International Conference on Bioinformatics and Bioengineering, BIBE 2007, October 14-17, 2007, Harvard Medical School, Boston, MA, USA (pp. 123–130). IEEE Computer Society. https://doi.org/10.1109/BIBE.2007.4375554 PDF 
    @inproceedings{bibi-final,
  author = {Thachuk, Chris and Condon, Anne},
  title = {On the Design of Oligos for Gene Synthesis},
  booktitle = {Proceedings of the 7th {IEEE} International Conference on Bioinformatics
                 and Bioengineering, {BIBE} 2007, October 14-17, 2007, Harvard Medical
                 School, Boston, MA, {USA}},
  pages = {123--130},
  publisher = {{IEEE} Computer Society},
  year = {2007},
  url = {https://doi.org/10.1109/BIBE.2007.4375554},
  doi = {10.1109/BIBE.2007.4375554},
  timestamp = {Tue, 05 Feb 2019 00:00:00 +0100},
  biburl = {https://dblp.org/rec/bib/conf/bibe/ThachukC07},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  35. Andronescu, M., Condon, A., Hoos, H. H., Mathews, D. H., & Murphy, K. P. (2007). Efficient parameter estimation for RNA secondary structure prediction. In Proceedings 15th International Conference on Intelligent Systems for Molecular Biology (ISMB) & 6th European Conference on Computational Biology (ECCB), Vienna, Austria, July 21-25, 2007 (pp. 19–28). https://doi.org/10.1093/bioinformatics/btm223 PDF 
    @inproceedings{btm223,
  author = {Andronescu, Mirela and Condon, Anne and Hoos, Holger H. and Mathews, David H. and Murphy, Kevin P.},
  title = {Efficient parameter estimation for {RNA} secondary structure prediction},
  booktitle = {Proceedings 15th International Conference on Intelligent Systems for
                 Molecular Biology {(ISMB)} {\&} 6th European Conference on Computational
                 Biology (ECCB), Vienna, Austria, July 21-25, 2007},
  pages = {19--28},
  year = {2007},
  url = {https://doi.org/10.1093/bioinformatics/btm223},
  doi = {10.1093/bioinformatics/btm223},
  timestamp = {Sat, 07 Sep 2019 11:59:25 +0200},
  biburl = {https://dblp.org/rec/bib/conf/ismb/AndronescuCHMM07},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  36. Jabbari, H., Condon, A., Pop, A., Pop, C., & Zhao, Y. (2007). HFold: RNA Pseudoknotted Secondary Structure Prediction Using Hierarchical Folding. In R. Giancarlo & S. Hannenhalli (Eds.), Algorithms in Bioinformatics, 7th International Workshop, WABI 2007, Philadelphia, PA, USA, September 8-9, 2007, Proceedings (Vol. 4645, pp. 323–334). Springer. https://doi.org/10.1007/978-3-540-74126-8_30 PDF 
    @inproceedings{HFold,
  author = {Jabbari, Hosna and Condon, Anne and Pop, Ana and Pop, Cristina and Zhao, Yinglei},
  editor = {Giancarlo, Raffaele and Hannenhalli, Sridhar},
  title = {HFold: {RNA} Pseudoknotted Secondary Structure Prediction Using Hierarchical
                 Folding},
  booktitle = {Algorithms in Bioinformatics, 7th International Workshop, {WABI} 2007,
                 Philadelphia, PA, USA, September 8-9, 2007, Proceedings},
  series = {Lecture Notes in Computer Science},
  volume = {4645},
  pages = {323--334},
  publisher = {Springer},
  year = {2007},
  url = {https://doi.org/10.1007/978-3-540-74126-8\_30},
  doi = {10.1007/978-3-540-74126-8\_30},
  timestamp = {Tue, 14 May 2019 10:00:40 +0200},
  biburl = {https://dblp.org/rec/bib/conf/wabi/JabbariCPPZ07},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  37. Andronescu, M., & Condon, A. (2006). Finding MFE Structures Formed by Nucleic Acid Strands in a Combinatorial Set. In J. Chen, N. Jonoska, & G. Rozenberg (Eds.), Nanotechnology: Science and Computation (pp. 121–135). Springer. https://doi.org/10.1007/3-540-30296-4_7 PDF 
    @inproceedings{andronescu-condon05,
  author = {Andronescu, Mirela and Condon, Anne},
  editor = {Chen, Junghuei and Jonoska, Natasa and Rozenberg, Grzegorz},
  title = {Finding {MFE} Structures Formed by Nucleic Acid Strands in a Combinatorial
                 Set},
  booktitle = {Nanotechnology: Science and Computation},
  series = {Natural Computing Series},
  pages = {121--135},
  publisher = {Springer},
  year = {2006},
  url = {https://doi.org/10.1007/3-540-30296-4\_7},
  doi = {10.1007/3-540-30296-4\_7},
  timestamp = {Thu, 25 May 2017 01:00:00 +0200},
  biburl = {https://dblp.org/rec/bib/conf/ncs/AndronescuC06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  38. Condon, A., Deshpande, A., Hellerstein, L., & Wu, N. (2006). Flow algorithms for two pipelined filter ordering problems. In S. Vansummeren (Ed.), Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 26-28, 2006, Chicago, Illinois, USA (pp. 193–202). ACM. https://doi.org/10.1145/1142351.1142379 PDF 
    @inproceedings{pods338-condon,
  author = {Condon, Anne and Deshpande, Amol and Hellerstein, Lisa and Wu, Ning},
  editor = {Vansummeren, Stijn},
  title = {Flow algorithms for two pipelined filter ordering problems},
  booktitle = {Proceedings of the Twenty-Fifth {ACM} {SIGACT-SIGMOD-SIGART} Symposium
                 on Principles of Database Systems, June 26-28, 2006, Chicago, Illinois,
                 {USA}},
  pages = {193--202},
  publisher = {{ACM}},
  year = {2006},
  url = {https://doi.org/10.1145/1142351.1142379},
  doi = {10.1145/1142351.1142379},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl = {https://dblp.org/rec/bib/conf/pods/CondonDHW06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  39. Condon, A., Davy, B., Rastegari, B., Zhao, S., & Tarrant, F. (2004). Classifying RNA pseudoknotted structures. Theor. Comput. Sci., 320(1), 35–50. https://doi.org/10.1016/j.tcs.2004.03.042 PDF 
    @article{tcs,
  author = {Condon, Anne and Davy, Beth and Rastegari, Baharak and Zhao, Shelly and Tarrant, Finbarr},
  title = {Classifying {RNA} pseudoknotted structures},
  journal = {Theor. Comput. Sci.},
  volume = {320},
  number = {1},
  pages = {35--50},
  year = {2004},
  url = {https://doi.org/10.1016/j.tcs.2004.03.042},
  doi = {10.1016/j.tcs.2004.03.042},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl = {https://dblp.org/rec/bib/journals/tcs/CondonDRZT04},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  40. Bingham, J. D., Condon, A., Hu, A. J., Qadeer, S., & Zhang, Z. (2004). Automatic Verification of Sequential Consistency for Unbounded Addresses and Data Values. In R. Alur & D. A. Peled (Eds.), Computer Aided Verification, 16th International Conference, CAV 2004, Boston, MA, USA, July 13-17, 2004, Proceedings (Vol. 3114, pp. 427–439). Springer. https://doi.org/10.1007/978-3-540-27813-9_33 PDF 
    @inproceedings{bchqz-cav04,
  author = {Bingham, Jesse D. and Condon, Anne and Hu, Alan J. and Qadeer, Shaz and Zhang, Zhichuan},
  editor = {Alur, Rajeev and Peled, Doron A.},
  title = {Automatic Verification of Sequential Consistency for Unbounded Addresses
                 and Data Values},
  booktitle = {Computer Aided Verification, 16th International Conference, {CAV}
                 2004, Boston, MA, USA, July 13-17, 2004, Proceedings},
  series = {Lecture Notes in Computer Science},
  volume = {3114},
  pages = {427--439},
  publisher = {Springer},
  year = {2004},
  url = {https://doi.org/10.1007/978-3-540-27813-9\_33},
  doi = {10.1007/978-3-540-27813-9\_33},
  timestamp = {Tue, 14 May 2019 10:00:43 +0200},
  biburl = {https://dblp.org/rec/bib/conf/cav/BinghamCHQZ04},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  41. Madani, O., Hanks, S., & Condon, A. (2003). On the undecidability of probabilistic planning and related stochastic optimization problems. Artif. Intell., 147(1-2), 5–34. https://doi.org/10.1016/S0004-3702(02)00378-8 PDF 
    @article{jair02,
  author = {Madani, Omid and Hanks, Steve and Condon, Anne},
  title = {On the undecidability of probabilistic planning and related stochastic
                 optimization problems},
  journal = {Artif. Intell.},
  volume = {147},
  number = {1-2},
  pages = {5--34},
  year = {2003},
  url = {https://doi.org/10.1016/S0004-3702(02)00378-8},
  doi = {10.1016/S0004-3702(02)00378-8},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl = {https://dblp.org/rec/bib/journals/ai/MadaniHC03},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  42. Condon, A., & Hu, A. J. (2003). Automatable Verification of Sequential Consistency. Theory Comput. Syst., 36(5), 431–460. https://doi.org/10.1007/s00224-003-1082-x PDF 
    @article{ajh02,
  author = {Condon, Anne and Hu, Alan J.},
  title = {Automatable Verification of Sequential Consistency},
  journal = {Theory Comput. Syst.},
  volume = {36},
  number = {5},
  pages = {431--460},
  year = {2003},
  url = {https://doi.org/10.1007/s00224-003-1082-x},
  doi = {10.1007/s00224-003-1082-x},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl = {https://dblp.org/rec/bib/journals/mst/CondonH03},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  43. Andronescu, M., Aguirre-Hernández Rosalı́a, Condon, A., & Hoos, H. H. (2003). RNAsoft: a suite of RNA secondary structure prediction and design software tools. Nucleic Acids Research, 31(13), 3416–3422. https://doi.org/10.1093/nar/gkg612 PDF 
    @article{gkg612,
  author = {Andronescu, Mirela and Aguirre{-}Hern{\'{a}}ndez, Rosal{\'{\i}}a and Condon, Anne and Hoos, Holger H.},
  title = {RNAsoft: a suite of {RNA} secondary structure prediction and design
                 software tools},
  journal = {Nucleic Acids Research},
  volume = {31},
  number = {13},
  pages = {3416--3422},
  year = {2003},
  url = {https://doi.org/10.1093/nar/gkg612},
  doi = {10.1093/nar/gkg612},
  timestamp = {Thu, 23 May 2019 01:00:00 +0200},
  biburl = {https://dblp.org/rec/bib/journals/nar/AndronescuACH03},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  44. Andronescu, M., Dees, D., Slaybaugh, L., Zhao, Y., Condon, A., Cohen, B., & Skiena, S. (2003). Algorithms for testing that sets of DNA words concatenate without secondary structure. Natural Computing, 2(4), 391–415. https://doi.org/10.1023/B:NACO.0000006770.91995.ec PDF 
    @article{dna9,
  author = {Andronescu, Mirela and Dees, Danielle and Slaybaugh, Laura and Zhao, Yinglei and Condon, Anne and Cohen, Barry and Skiena, Steven},
  title = {Algorithms for testing that sets of {DNA} words concatenate without
                 secondary structure},
  journal = {Natural Computing},
  volume = {2},
  number = {4},
  pages = {391--415},
  year = {2003},
  url = {https://doi.org/10.1023/B:NACO.0000006770.91995.ec},
  doi = {10.1023/B:NACO.0000006770.91995.ec},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl = {https://dblp.org/rec/bib/journals/nc/AndronescuDSZCCS03},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  45. Condon, A. (2003). Problems on RNA Secondary Structure Prediction and Design. In J. C. M. Baeten, J. K. Lenstra, J. Parrow, & G. J. Woeginger (Eds.), Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings (Vol. 2719, pp. 22–32). Springer. https://doi.org/10.1007/3-540-45061-0_2 PDF 
    @inproceedings{icalp03,
  author = {Condon, Anne},
  editor = {Baeten, Jos C. M. and Lenstra, Jan Karel and Parrow, Joachim and Woeginger, Gerhard J.},
  title = {Problems on {RNA} Secondary Structure Prediction and Design},
  booktitle = {Automata, Languages and Programming, 30th International Colloquium,
                 {ICALP} 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003.
                 Proceedings},
  series = {Lecture Notes in Computer Science},
  volume = {2719},
  pages = {22--32},
  publisher = {Springer},
  year = {2003},
  url = {https://doi.org/10.1007/3-540-45061-0\_2},
  doi = {10.1007/3-540-45061-0\_2},
  timestamp = {Tue, 14 May 2019 10:00:44 +0200},
  biburl = {https://dblp.org/rec/bib/conf/icalp/Condon03},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  46. Bingham, J. D., Condon, A., & Hu, A. J. (2003). Toward a decidable notion of sequential consistency. In A. L. Rosenberg & F. M. auf der Heide (Eds.), SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, June 7-9, 2003, San Diego, California, USA (part of FCRC 2003) (pp. 304–313). ACM. https://doi.org/10.1145/777412.777467 PDF 
    @inproceedings{spaa03,
  author = {Bingham, Jesse D. and Condon, Anne and Hu, Alan J.},
  editor = {Rosenberg, Arnold L. and auf der Heide, Friedhelm Meyer},
  title = {Toward a decidable notion of sequential consistency},
  booktitle = {{SPAA} 2003: Proceedings of the Fifteenth Annual {ACM} Symposium on
                 Parallelism in Algorithms and Architectures, June 7-9, 2003, San Diego,
                 California, {USA} (part of {FCRC} 2003)},
  pages = {304--313},
  publisher = {{ACM}},
  year = {2003},
  url = {https://doi.org/10.1145/777412.777467},
  doi = {10.1145/777412.777467},
  timestamp = {Wed, 21 Nov 2018 11:11:22 +0100},
  biburl = {https://dblp.org/rec/bib/conf/spaa/BinghamCH03},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  47. Brenneman, A., & Condon, A. (2002). Strand design for biomolecular computation. Theor. Comput. Sci., 287(1), 39–58. https://doi.org/10.1016/S0304-3975(02)00135-4 PDF 
    @article{wordsurvey,
  author = {Brenneman, Arwen and Condon, Anne},
  title = {Strand design for biomolecular computation},
  journal = {Theor. Comput. Sci.},
  volume = {287},
  number = {1},
  pages = {39--58},
  year = {2002},
  url = {https://doi.org/10.1016/S0304-3975(02)00135-4},
  doi = {10.1016/S0304-3975(02)00135-4},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl = {https://dblp.org/rec/bib/journals/tcs/BrennemanC02},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  48. Sorin, D. J., Plakal, M., Condon, A., Hill, M. D., Martin, M. M. K., & Wood, D. A. (2002). Specifying and Verifying a Broadcast and a Multicast Snooping Cache Coherence Protocol. IEEE Trans. Parallel Distrib. Syst., 13(6), 556–578. https://doi.org/10.1109/TPDS.2002.1011412 PDF 
    @article{tpdp02,
  author = {Sorin, Daniel J. and Plakal, Manoj and Condon, Anne and Hill, Mark D. and Martin, Milo M. K. and Wood, David A.},
  title = {Specifying and Verifying a Broadcast and a Multicast Snooping Cache
                 Coherence Protocol},
  journal = {{IEEE} Trans. Parallel Distrib. Syst.},
  volume = {13},
  number = {6},
  pages = {556--578},
  year = {2002},
  url = {https://doi.org/10.1109/TPDS.2002.1011412},
  doi = {10.1109/TPDS.2002.1011412},
  timestamp = {Mon, 25 Mar 2019 00:00:00 +0100},
  biburl = {https://dblp.org/rec/bib/journals/tpds/SorinPCHMW02},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  49. Tulpan, D. C., Hoos, H. H., & Condon, A. (2002). Stochastic Local Search Algorithms for DNA Word Design. In M. Hagiya & A. Ohuchi (Eds.), DNA Computing, 8th International Workshop on DNA Based Computers, DNA8, Sapporo, Japan, June 10-13, 2002, Revised Papers (Vol. 2568, pp. 229–241). Springer. https://doi.org/10.1007/3-540-36440-4_20 PDF 
    @inproceedings{tulpanhoos02,
  author = {Tulpan, Dan C. and Hoos, Holger H. and Condon, Anne},
  editor = {Hagiya, Masami and Ohuchi, Azuma},
  title = {Stochastic Local Search Algorithms for {DNA} Word Design},
  booktitle = {{DNA} Computing, 8th International Workshop on {DNA} Based Computers,
                 DNA8, Sapporo, Japan, June 10-13, 2002, Revised Papers},
  series = {Lecture Notes in Computer Science},
  volume = {2568},
  pages = {229--241},
  publisher = {Springer},
  year = {2002},
  url = {https://doi.org/10.1007/3-540-36440-4\_20},
  doi = {10.1007/3-540-36440-4\_20},
  timestamp = {Tue, 14 May 2019 10:00:40 +0200},
  biburl = {https://dblp.org/rec/bib/conf/dna/TulpanHC02},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  50. Marathe, A., Condon, A., & Corn, R. M. (2001). On Combinatorial DNA Word Design. Journal of Computational Biology, 8(3), 201–219. https://doi.org/10.1089/10665270152530818 PDF 
    @article{amit99,
  author = {Marathe, Amit and Condon, Anne and Corn, Robert M.},
  title = {On Combinatorial {DNA} Word Design},
  journal = {Journal of Computational Biology},
  volume = {8},
  number = {3},
  pages = {201--219},
  year = {2001},
  url = {https://doi.org/10.1089/10665270152530818},
  doi = {10.1089/10665270152530818},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl = {https://dblp.org/rec/bib/journals/jcb/MaratheCC01},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  51. Condon, A., & Karp, R. M. (2001). Algorithms for graph partitioning on the planted partition model. Random Struct. Algorithms, 18(2), 116–140. https://doi.org/10.1002/1098-2418(200103)18:2<116::AID-RSA1001>3.0.CO;2-2 PDF 
    @article{karp99,
  author = {Condon, Anne and Karp, Richard M.},
  title = {Algorithms for graph partitioning on the planted partition model},
  journal = {Random Struct. Algorithms},
  volume = {18},
  number = {2},
  pages = {116--140},
  year = {2001},
  url = {https://doi.org/10.1002/1098-2418(200103)18:2\&\#60;116::AID-RSA1001\&\#62;3.0.CO;2-2},
  doi = {10.1002/1098-2418(200103)18:2\&\#60;116::AID-RSA1001\&\#62;3.0.CO;2-2},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl = {https://dblp.org/rec/bib/journals/rsa/CondonK01},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  52. Braun, T., Condon, A., Hu, A. J., Juse, K. S., Laza, M., Leslie, M., & Sharma, R. (2001). Proving sequential consistency by model checking. In Proceedings of the Sixth IEEE International High-Level Design Validation and Test Workshop 2001, Monterey, California, USA, November 7-9, 2001 (pp. 103–108). IEEE Computer Society. https://doi.org/10.1109/HLDVT.2001.972815 PDF 
    @inproceedings{hldvt,
  author = {Braun, Tim and Condon, Anne and Hu, Alan J. and Juse, Kai S. and Laza, Marius and Leslie, Michael and Sharma, Rita},
  title = {Proving sequential consistency by model checking},
  booktitle = {Proceedings of the Sixth {IEEE} International High-Level Design Validation
                 and Test Workshop 2001, Monterey, California, USA, November 7-9, 2001},
  pages = {103--108},
  publisher = {{IEEE} Computer Society},
  year = {2001},
  url = {https://doi.org/10.1109/HLDVT.2001.972815},
  doi = {10.1109/HLDVT.2001.972815},
  timestamp = {Thu, 25 May 2017 01:00:00 +0200},
  biburl = {https://dblp.org/rec/bib/conf/hldvt/BraunCHJLLS01},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  53. Condon, A., & Hu, A. J. (2001). Automatable verification of sequential consistency. In A. L. Rosenberg (Ed.), Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2001, Heraklion, Crete Island, Greece, July 4-6, 2001 (pp. 113–121). ACM. https://doi.org/10.1145/378580.378604 
    @inproceedings{ajh03,
  author = {Condon, Anne and Hu, Alan J.},
  editor = {Rosenberg, Arnold L.},
  title = {Automatable verification of sequential consistency},
  booktitle = {Proceedings of the Thirteenth Annual {ACM} Symposium on Parallel Algorithms
                 and Architectures, {SPAA} 2001, Heraklion, Crete Island, Greece, July
                 4-6, 2001},
  pages = {113--121},
  publisher = {{ACM}},
  year = {2001},
  url = {https://doi.org/10.1145/378580.378604},
  doi = {10.1145/378580.378604},
  timestamp = {Wed, 21 Nov 2018 12:27:44 +0100},
  biburl = {https://dblp.org/rec/bib/conf/spaa/CondonH01},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  54. Condon, A., Hill, M. D., Plakal, M., & Sorin, D. J. (1999). Using Lamport Clocks to Reason about Relaxed Memory Models. In Proceedings of the Fifth International Symposium on High-Performance Computer Architecture, Orlando, FL, USA, January 9-12, 1999 (pp. 270–278). IEEE Computer Society. https://doi.org/10.1109/HPCA.1999.744379 PDF 
    @inproceedings{hpca99,
  author = {Condon, Anne and Hill, Mark D. and Plakal, Manoj and Sorin, Daniel J.},
  title = {Using Lamport Clocks to Reason about Relaxed Memory Models},
  booktitle = {Proceedings of the Fifth International Symposium on High-Performance
                 Computer Architecture, Orlando, FL, USA, January 9-12, 1999},
  pages = {270--278},
  publisher = {{IEEE} Computer Society},
  year = {1999},
  url = {https://doi.org/10.1109/HPCA.1999.744379},
  doi = {10.1109/HPCA.1999.744379},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl = {https://dblp.org/rec/bib/conf/hpca/CondonHPS99},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  55. Hill, M. D., Condon, A., Plakal, M., & Sorin, D. J. (1999). A System-Level Specification Framework for I/O Architectures. In G. L. Miller & V. Ramachandran (Eds.), Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA ’99, Saint-Malo, France, June 27-30, 1999 (pp. 138–147). ACM. https://doi.org/10.1145/305619.305634 PDF 
    @inproceedings{spaa99,
  author = {Hill, Mark D. and Condon, Anne and Plakal, Manoj and Sorin, Daniel J.},
  editor = {Miller, Gary L. and Ramachandran, Vijaya},
  title = {A System-Level Specification Framework for {I/O} Architectures},
  booktitle = {Proceedings of the Eleventh Annual {ACM} Symposium on Parallel Algorithms
                 and Architectures, {SPAA} '99, Saint-Malo, France, June 27-30, 1999},
  pages = {138--147},
  publisher = {{ACM}},
  year = {1999},
  url = {https://doi.org/10.1145/305619.305634},
  doi = {10.1145/305619.305634},
  timestamp = {Wed, 21 Nov 2018 12:27:44 +0100},
  biburl = {https://dblp.org/rec/bib/conf/spaa/HillCPS99},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  56. Condon, A., & Narayanan, L. (1998). Upper and Lower Bounds for Selection in the Mesh. Algorithmica, 20(1), 1–30. https://doi.org/10.1007/PL00009184 PDF 
    @article{condonnarayanan,
  author = {Condon, Anne and Narayanan, Lata},
  title = {Upper and Lower Bounds for Selection in the Mesh},
  journal = {Algorithmica},
  volume = {20},
  number = {1},
  pages = {1--30},
  year = {1998},
  url = {https://doi.org/10.1007/PL00009184},
  doi = {10.1007/PL00009184},
  timestamp = {Wed, 17 May 2017 01:00:00 +0200},
  biburl = {https://dblp.org/rec/bib/journals/algorithmica/CondonN98},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  57. Agarwal, S., & Condon, A. (1998). On Approximation Algorithms for Hierarchical MAX-SAT. J. Algorithms, 26(1), 141–165. https://doi.org/10.1006/jagm.1997.0902 PDF 
    @article{agarwalcondon,
  author = {Agarwal, Sameet and Condon, Anne},
  title = {On Approximation Algorithms for Hierarchical {MAX-SAT}},
  journal = {J. Algorithms},
  volume = {26},
  number = {1},
  pages = {141--165},
  year = {1998},
  url = {https://doi.org/10.1006/jagm.1997.0902},
  doi = {10.1006/jagm.1997.0902},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl = {https://dblp.org/rec/bib/journals/jal/AgarwalC98},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  58. Smith, L. M., Corn, R. M., Condon, A., Lagally, M. G., Frutos, T., Liu, Q., & Thiel, A. (1998). A Surface-Based Approach to DNA Computation. Journal of Computational Biology, 5(2), 255–267. https://doi.org/10.1089/cmb.1998.5.255 PDF 
    @article{caietal97,
  author = {Smith, Lloyd M. and Corn, Robert M. and Condon, Anne and Lagally, Max G. and Frutos, Tony and Liu, Qinghua and Thiel, Andrew},
  title = {A Surface-Based Approach to {DNA} Computation},
  journal = {Journal of Computational Biology},
  volume = {5},
  number = {2},
  pages = {255--267},
  year = {1998},
  url = {https://doi.org/10.1089/cmb.1998.5.255},
  doi = {10.1089/cmb.1998.5.255},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl = {https://dblp.org/rec/bib/journals/jcb/SmithCCLFLT98},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  59. Bach, E., Condon, A., Glaser, E., & Tanguay, C. (1998). DNA Models and Algorithms for NP-Complete Problems. J. Comput. Syst. Sci., 57(2), 172–186. https://doi.org/10.1006/jcss.1998.1586 PDF 
    @article{bcgt,
  author = {Bach, Eric and Condon, Anne and Glaser, Elton and Tanguay, Celena},
  title = {{DNA} Models and Algorithms for NP-Complete Problems},
  journal = {J. Comput. Syst. Sci.},
  volume = {57},
  number = {2},
  pages = {172--186},
  year = {1998},
  url = {https://doi.org/10.1006/jcss.1998.1586},
  doi = {10.1006/jcss.1998.1586},
  timestamp = {Sat, 20 May 2017 01:00:00 +0200},
  biburl = {https://dblp.org/rec/bib/journals/jcss/BachCGT98},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  60. Condon, A., Hellerstein, L., Pottle, S., & Wigderson, A. (1998). On the Power of Finite Automata with Both Nondeterministic and Probabilistic States. SIAM J. Comput., 27(3), 739–762. https://doi.org/10.1137/S0097539794265578 PDF 
    @article{s0097539794265578,
  author = {Condon, Anne and Hellerstein, Lisa and Pottle, Samuel and Wigderson, Avi},
  title = {On the Power of Finite Automata with Both Nondeterministic and Probabilistic
                 States},
  journal = {{SIAM} J. Comput.},
  volume = {27},
  number = {3},
  pages = {739--762},
  year = {1998},
  url = {https://doi.org/10.1137/S0097539794265578},
  doi = {10.1137/S0097539794265578},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl = {https://dblp.org/rec/bib/journals/siamcomp/CondonHPW98},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  61. Plakal, M., Sorin, D. J., Condon, A., & Hill, M. D. (1998). Lamport Clocks: Verifying a Directory Cache-Coherence Protocol. In G. L. Miller & P. B. Gibbons (Eds.), Proceedings of the Tenth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA ’98, Puerto Vallarta, Mexico, June 28 - July 2, 1998 (pp. 67–76). ACM. https://doi.org/10.1145/277651.277672 PDF 
    @inproceedings{spaa98,
  author = {Plakal, Manoj and Sorin, Daniel J. and Condon, Anne and Hill, Mark D.},
  editor = {Miller, Gary L. and Gibbons, Phillip B.},
  title = {Lamport Clocks: Verifying a Directory Cache-Coherence Protocol},
  booktitle = {Proceedings of the Tenth Annual {ACM} Symposium on Parallel Algorithms
                 and Architectures, {SPAA} '98, Puerto Vallarta, Mexico, June 28 -
                 July 2, 1998},
  pages = {67--76},
  publisher = {{ACM}},
  year = {1998},
  url = {https://doi.org/10.1145/277651.277672},
  doi = {10.1145/277651.277672},
  timestamp = {Wed, 21 Nov 2018 12:27:44 +0100},
  biburl = {https://dblp.org/rec/bib/conf/spaa/PlakalSCH98},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  62. Condon, A., Feigenbaum, J., Lund, C., & Shor, P. W. (1997). Random Debaters and the Hardness of Approximating Stochastic Functions. SIAM J. Comput., 26(2), 369–400. https://doi.org/10.1137/S0097539793260738 PDF 
    @article{cfls97,
  author = {Condon, Anne and Feigenbaum, Joan and Lund, Carsten and Shor, Peter W.},
  title = {Random Debaters and the Hardness of Approximating Stochastic Functions},
  journal = {{SIAM} J. Comput.},
  volume = {26},
  number = {2},
  pages = {369--400},
  year = {1997},
  url = {https://doi.org/10.1137/S0097539793260738},
  doi = {10.1137/S0097539793260738},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl = {https://dblp.org/rec/bib/journals/siamcomp/CondonFLS97},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  63. Cai, W., Condon, A., Corn, R. M., Glaser, E., Fei, Z., Frutos, T., … Thiel, A. (1997). The power of surface-based DNA computation (extended abstract). In M. S. Waterman (Ed.), Proceedings of the First Annual International Conference on Research in Computational Molecular Biology, RECOMB 1997, Santa Fe, NM, USA, January 20-23, 1997 (pp. 67–74). ACM. https://doi.org/10.1145/267521.267530 
    @inproceedings{caietal98,
  author = {Cai, Weiping and Condon, Anne and Corn, Robert M. and Glaser, Elton and Fei, Zhengdong and Frutos, Tony and Guo, Zhen and Lagally, Max G. and Liu, Qinghua and Smith, Lloyd M. and Thiel, Andrew},
  editor = {Waterman, Michael S.},
  title = {The power of surface-based {DNA} computation (extended abstract)},
  booktitle = {Proceedings of the First Annual International Conference on Research
                 in Computational Molecular Biology, {RECOMB} 1997, Santa Fe, NM, USA,
                 January 20-23, 1997},
  pages = {67--74},
  publisher = {{ACM}},
  year = {1997},
  url = {https://doi.org/10.1145/267521.267530},
  doi = {10.1145/267521.267530},
  timestamp = {Mon, 13 May 2019 09:30:09 +0200},
  biburl = {https://dblp.org/rec/bib/conf/recomb/CaiCCGFFGLLST97},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  64. Condon, A., Ladner, R. E., Lampe, J., & Sinha, R. K. (1996). Complexity of Sub-Bus Mesh Computations. SIAM J. Comput., 25(3), 520–539. https://doi.org/10.1137/S0097539793256879 PDF 
    @article{clls96,
  author = {Condon, Anne and Ladner, Richard E. and Lampe, Jordan and Sinha, Rakesh K.},
  title = {Complexity of Sub-Bus Mesh Computations},
  journal = {{SIAM} J. Comput.},
  volume = {25},
  number = {3},
  pages = {520--539},
  year = {1996},
  url = {https://doi.org/10.1137/S0097539793256879},
  doi = {10.1137/S0097539793256879},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl = {https://dblp.org/rec/bib/journals/siamcomp/CondonLLS96},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  65. Lewandowski, G., Condon, A., & Bach, E. (1996). Asynchronous Analysis of Parallel Dynamic Programming Algorithms. IEEE Trans. Parallel Distrib. Syst., 7(4), 425–438. https://doi.org/10.1109/71.494636 PDF 
    @article{condonlewandowski96,
  author = {Lewandowski, Gary and Condon, Anne and Bach, Eric},
  title = {Asynchronous Analysis of Parallel Dynamic Programming Algorithms},
  journal = {{IEEE} Trans. Parallel Distrib. Syst.},
  volume = {7},
  number = {4},
  pages = {425--438},
  year = {1996},
  url = {https://doi.org/10.1109/71.494636},
  doi = {10.1109/71.494636},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl = {https://dblp.org/rec/bib/journals/tpds/LewandowskiCB96},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  66. Bach, E., Condon, A., Glaser, E., & Tanguay, C. (1996). DNA Models and Algorithms for NP-complete Problems. In S. Homer & J.-Y. Cai (Eds.), Proceedings of the Eleveth Annual IEEE Conference on Computational Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996 (pp. 290–300). IEEE Computer Society. https://doi.org/10.1109/CCC.1996.507691 
    @inproceedings{bcgu,
  author = {Bach, Eric and Condon, Anne and Glaser, Elton and Tanguay, Celena},
  editor = {Homer, Steven and Cai, Jin{-}Yi},
  title = {{DNA} Models and Algorithms for NP-complete Problems},
  booktitle = {Proceedings of the Eleveth Annual {IEEE} Conference on Computational
                 Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996},
  pages = {290--300},
  publisher = {{IEEE} Computer Society},
  year = {1996},
  url = {https://doi.org/10.1109/CCC.1996.507691},
  doi = {10.1109/CCC.1996.507691},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl = {https://dblp.org/rec/bib/conf/coco/BachCGT96},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  67. Liu, Q., Guo, Z., Fei, Z., Condon, A., Corn, R. M., Lagally, M. G., & Smith, L. M. (1996). A surface-based approach to DNA computation. In L. F. Landweber & E. B. Baum (Eds.), DNA Based Computers, Proceedings of a DIMACS Workshop, Princeton, New Jersey, USA, June 10-12, 1996 (Vol. 44, pp. 123–132). DIMACS/AMS. https://doi.org/10.1090/dimacs/044/10 PDF 
    @inproceedings{liuetal96,
  author = {Liu, Qinghua and Guo, Zhen and Fei, Zhengdong and Condon, Anne and Corn, Robert M. and Lagally, Max G. and Smith, Lloyd M.},
  editor = {Landweber, Laura F. and Baum, Eric B.},
  title = {A surface-based approach to {DNA} computation},
  booktitle = {{DNA} Based Computers, Proceedings of a {DIMACS} Workshop, Princeton,
                 New Jersey, USA, June 10-12, 1996},
  series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
  volume = {44},
  pages = {123--132},
  publisher = {{DIMACS/AMS}},
  year = {1996},
  url = {https://doi.org/10.1090/dimacs/044/10},
  doi = {10.1090/dimacs/044/10},
  timestamp = {Tue, 16 Jul 2019 17:45:06 +0200},
  biburl = {https://dblp.org/rec/bib/conf/dimacs/LiuGFCCLS96},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  68. Chung, S., & Condon, A. (1996). Parallel Implementation of Borvka’s Minimum Spanning Tree Algorithm. In Proceedings of IPPS ’96, The 10th International Parallel Processing Symposium, April 15-19, 1996, Honolulu, Hawaii, USA (pp. 302–308). IEEE Computer Society. https://doi.org/10.1109/IPPS.1996.508073 PDF 
    @inproceedings{chungcondon96,
  author = {Chung, Sun and Condon, Anne},
  title = {Parallel Implementation of Borvka's Minimum Spanning Tree Algorithm},
  booktitle = {Proceedings of {IPPS} '96, The 10th International Parallel Processing
                 Symposium, April 15-19, 1996, Honolulu, Hawaii, {USA}},
  pages = {302--308},
  publisher = {{IEEE} Computer Society},
  year = {1996},
  url = {https://doi.org/10.1109/IPPS.1996.508073},
  doi = {10.1109/IPPS.1996.508073},
  timestamp = {Wed, 24 May 2017 01:00:00 +0200},
  biburl = {https://dblp.org/rec/bib/conf/ipps/ChungC96},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  69. Condon, A., Feigenbaum, J., Lund, C., & Shor, P. W. (1995). Probabilistically Checkable Debate Systems and Nonapproximability of PSPACE-Hard Functions. Chicago J. Theor. Comput. Sci., 1995. Retrieved from http://cjtcs.cs.uchicago.edu/articles/1995/4/contents.html PDF 
    @article{cfls95,
  author = {Condon, Anne and Feigenbaum, Joan and Lund, Carsten and Shor, Peter W.},
  title = {Probabilistically Checkable Debate Systems and Nonapproximability
                 of PSPACE-Hard Functions},
  journal = {Chicago J. Theor. Comput. Sci.},
  volume = {1995},
  year = {1995},
  url = {http://cjtcs.cs.uchicago.edu/articles/1995/4/contents.html},
  timestamp = {Thu, 08 Jul 2004 01:00:00 +0200},
  biburl = {https://dblp.org/rec/bib/journals/cjtcs/CondonFLS95},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  70. Condon, A., & Ladner, R. E. (1995). Interactive Proof Systems with Polynomially Bounded Strategies. J. Comput. Syst. Sci., 50(3), 506–518. https://doi.org/10.1006/jcss.1995.1040 PDF 
    @article{condonladner95,
  author = {Condon, Anne and Ladner, Richard E.},
  title = {Interactive Proof Systems with Polynomially Bounded Strategies},
  journal = {J. Comput. Syst. Sci.},
  volume = {50},
  number = {3},
  pages = {506--518},
  year = {1995},
  url = {https://doi.org/10.1006/jcss.1995.1040},
  doi = {10.1006/jcss.1995.1040},
  timestamp = {Sat, 20 May 2017 01:00:00 +0200},
  biburl = {https://dblp.org/rec/bib/journals/jcss/CondonL95},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  71. Condon, A. (1994). A Theory of Strict P-Completeness. Computational Complexity, 4, 220–241. https://doi.org/10.1007/BF01206637 PDF 
    @article{condon94,
  author = {Condon, Anne},
  title = {A Theory of Strict P-Completeness},
  journal = {Computational Complexity},
  volume = {4},
  pages = {220--241},
  year = {1994},
  url = {https://doi.org/10.1007/BF01206637},
  doi = {10.1007/BF01206637},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl = {https://dblp.org/rec/bib/journals/cc/Condon94},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  72. Melekopoglou, M., & Condon, A. (1994). On the Complexity of the Policy Improvement Algorithm for Markov Decision Processes. INFORMS Journal on Computing, 6(2), 188–192. https://doi.org/10.1287/ijoc.6.2.188 PDF 
    @article{9edc2ce55b2d7f5d45cc014a0d2733ed3051,
  author = {Melekopoglou, Mary and Condon, Anne},
  title = {On the Complexity of the Policy Improvement Algorithm for Markov Decision
                 Processes},
  journal = {{INFORMS} Journal on Computing},
  volume = {6},
  number = {2},
  pages = {188--192},
  year = {1994},
  url = {https://doi.org/10.1287/ijoc.6.2.188},
  doi = {10.1287/ijoc.6.2.188},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl = {https://dblp.org/rec/bib/journals/informs/MelekopoglouC94},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  73. Cai, J.-yi, Condon, A., & Lipton, R. J. (1994). PSPACE Is Provable by Two Provers in One Round. J. Comput. Syst. Sci., 48(1), 183–193. https://doi.org/10.1016/S0022-0000(05)80026-1 PDF 
    @article{caicondonlipton94,
  author = {Cai, Jin{-}yi and Condon, Anne and Lipton, Richard J.},
  title = {{PSPACE} Is Provable by Two Provers in One Round},
  journal = {J. Comput. Syst. Sci.},
  volume = {48},
  number = {1},
  pages = {183--193},
  year = {1994},
  url = {https://doi.org/10.1016/S0022-0000(05)80026-1},
  doi = {10.1016/S0022-0000(05)80026-1},
  timestamp = {Sat, 20 May 2017 01:00:00 +0200},
  biburl = {https://dblp.org/rec/bib/journals/jcss/CaiCL94},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  74. Condon, A., & Hernek, D. (1994). Random Walks on Colored Graphs. Random Struct. Algorithms, 5(2), 285–304. https://doi.org/10.1002/rsa.3240050204 PDF 
    @article{condonhernek94,
  author = {Condon, Anne and Hernek, Diane},
  title = {Random Walks on Colored Graphs},
  journal = {Random Struct. Algorithms},
  volume = {5},
  number = {2},
  pages = {285--304},
  year = {1994},
  url = {https://doi.org/10.1002/rsa.3240050204},
  doi = {10.1002/rsa.3240050204},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl = {https://dblp.org/rec/bib/journals/rsa/CondonH94},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  75. Condon, A., Feigenbaum, J., Lund, C., & Shor, P. W. (1994). Random Debaters and the Hardness of Approximating Stochastic Functions. In Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28 - July 1, 1994 (pp. 280–293). IEEE Computer Society. https://doi.org/10.1109/SCT.1994.315796 PDF 
    @inproceedings{CFLS,
  author = {Condon, Anne and Feigenbaum, Joan and Lund, Carsten and Shor, Peter W.},
  title = {Random Debaters and the Hardness of Approximating Stochastic Functions},
  booktitle = {Proceedings of the Ninth Annual Structure in Complexity Theory Conference,
                 Amsterdam, The Netherlands, June 28 - July 1, 1994},
  pages = {280--293},
  publisher = {{IEEE} Computer Society},
  year = {1994},
  url = {https://doi.org/10.1109/SCT.1994.315796},
  doi = {10.1109/SCT.1994.315796},
  timestamp = {Wed, 06 Feb 2019 10:30:29 +0100},
  biburl = {https://dblp.org/rec/bib/conf/coco/CondonFLS94},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  76. Condon, A. (1993). The Complexity of the Max Word Problem and the Power of One-Way Interactive Proof Systems. Computational Complexity, 3, 292–305. https://doi.org/10.1007/BF01271372 
    @article{DBLP-journals-cc-Condon93,
  author = {Condon, Anne},
  title = {The Complexity of the Max Word Problem and the Power of One-Way Interactive
                 Proof Systems},
  journal = {Computational Complexity},
  volume = {3},
  pages = {292--305},
  year = {1993},
  url = {https://doi.org/10.1007/BF01271372},
  doi = {10.1007/BF01271372},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl = {https://dblp.org/rec/bib/journals/cc/Condon93},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  77. Lewandowski, G., & Condon, A. (1993). Experiments with parallel graph coloring heuristics and applications of graph coloring. In D. S. Johnson & M. A. Trick (Eds.), Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993 (Vol. 26, pp. 309–334). DIMACS/AMS. https://doi.org/10.1090/dimacs/026/15 
    @inproceedings{condonlewandowski97,
  author = {Lewandowski, Gary and Condon, Anne},
  editor = {Johnson, David S. and Trick, Michael A.},
  title = {Experiments with parallel graph coloring heuristics and applications
                 of graph coloring},
  booktitle = {Cliques, Coloring, and Satisfiability, Proceedings of a {DIMACS} Workshop,
                 New Brunswick, New Jersey, USA, October 11-13, 1993},
  series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
  volume = {26},
  pages = {309--334},
  publisher = {{DIMACS/AMS}},
  year = {1993},
  url = {https://doi.org/10.1090/dimacs/026/15},
  doi = {10.1090/dimacs/026/15},
  timestamp = {Tue, 16 Jul 2019 17:45:06 +0200},
  biburl = {https://dblp.org/rec/bib/conf/dimacs/LewandowskiC93},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  78. Lewandowski, G., Condon, A., & Bach, E. (1993). Asynchronous Analysis of Parallel Dynamic Programming. In S. S. Owicki & R. R. Muntz (Eds.), Proceedings of the 1993 ACM SIGMETRICS conference on Measurement and modeling of computer systems, Santa Clara, California, USA, May 10-14, 1993 (pp. 268–269). ACM. https://doi.org/10.1145/166955.167035 
    @inproceedings{DBLP-conf-sigmetrics-LewandowskiCB93,
  author = {Lewandowski, Gary and Condon, Anne and Bach, Eric},
  editor = {Owicki, Susan S. and Muntz, Richard R.},
  title = {Asynchronous Analysis of Parallel Dynamic Programming},
  booktitle = {Proceedings of the 1993 {ACM} {SIGMETRICS} conference on Measurement
                 and modeling of computer systems, Santa Clara, California, USA, May
                 10-14, 1993},
  pages = {268--269},
  publisher = {{ACM}},
  year = {1993},
  url = {https://doi.org/10.1145/166955.167035},
  doi = {10.1145/166955.167035},
  timestamp = {Tue, 06 Nov 2018 11:07:17 +0100},
  biburl = {https://dblp.org/rec/bib/conf/sigmetrics/LewandowskiCB93},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  79. Condon, A. (1992). The Complexity of Stochastic Games. Inf. Comput., 96(2), 203–224. https://doi.org/10.1016/0890-5401(92)90048-K 
    @article{DBLP-journals-iandc-Condon92,
  author = {Condon, Anne},
  title = {The Complexity of Stochastic Games},
  journal = {Inf. Comput.},
  volume = {96},
  number = {2},
  pages = {203--224},
  year = {1992},
  url = {https://doi.org/10.1016/0890-5401(92)90048-K},
  doi = {10.1016/0890-5401(92)90048-K},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl = {https://dblp.org/rec/bib/journals/iandc/Condon92},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  80. Cai, J.-yi, Condon, A., & Lipton, R. J. (1992). On Games of Incomplete Information. Theor. Comput. Sci., 103(1), 25–38. https://doi.org/10.1016/0304-3975(92)90085-T 
    @article{DBLP-journals-tcs-CaiCL92,
  author = {Cai, Jin{-}yi and Condon, Anne and Lipton, Richard J.},
  title = {On Games of Incomplete Information},
  journal = {Theor. Comput. Sci.},
  volume = {103},
  number = {1},
  pages = {25--38},
  year = {1992},
  url = {https://doi.org/10.1016/0304-3975(92)90085-T},
  doi = {10.1016/0304-3975(92)90085-T},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl = {https://dblp.org/rec/bib/journals/tcs/CaiCL92},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  81. Condon, A., & Ladner, R. E. (1992). Interactive Proof Systems with Polynomially Bounded Strategies. In Proceedings of the Seventh Annual Structure in Complexity Theory Conference, Boston, Massachusetts, USA, June 22-25, 1992 (pp. 282–294). IEEE Computer Society. https://doi.org/10.1109/SCT.1992.215403 
    @inproceedings{condonladner96,
  author = {Condon, Anne and Ladner, Richard E.},
  title = {Interactive Proof Systems with Polynomially Bounded Strategies},
  booktitle = {Proceedings of the Seventh Annual Structure in Complexity Theory Conference,
                 Boston, Massachusetts, USA, June 22-25, 1992},
  pages = {282--294},
  publisher = {{IEEE} Computer Society},
  year = {1992},
  url = {https://doi.org/10.1109/SCT.1992.215403},
  doi = {10.1109/SCT.1992.215403},
  timestamp = {Wed, 06 Feb 2019 10:30:29 +0100},
  biburl = {https://dblp.org/rec/bib/conf/coco/CondonL92},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  82. Condon, A. (1992). The Complexity of Space Bounded Interactive Proof Systems. In K. Ambos-Spies, S. Homer, & U. Schöning (Eds.), Complexity Theory: Current Research, Dagstuhl Workshop, February 2-8, 1992 (pp. 147–189). Cambridge University Press. 
    @inproceedings{ips-survey.pdf,
  author = {Condon, Anne},
  editor = {Ambos{-}Spies, Klaus and Homer, Steven and Sch{\"{o}}ning, Uwe},
  title = {The Complexity of Space Bounded Interactive Proof Systems},
  booktitle = {Complexity Theory: Current Research, Dagstuhl Workshop, February 2-8,
                 1992},
  pages = {147--189},
  publisher = {Cambridge University Press},
  year = {1992},
  timestamp = {Mon, 15 Jul 2002 11:29:49 +0200},
  biburl = {https://dblp.org/rec/bib/conf/dagstuhl/Condon92},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  83. Condon, A. (1991). Space-Bounded Probabilistic Game Automata. J. ACM, 38(2), 472–494. https://doi.org/10.1145/103516.128681 
    @article{DBLP:journals/jacm/Condon91,
  author = {Condon, Anne},
  title = {Space-Bounded Probabilistic Game Automata},
  journal = {J. {ACM}},
  volume = {38},
  number = {2},
  pages = {472--494},
  year = {1991},
  url = {https://doi.org/10.1145/103516.128681},
  doi = {10.1145/103516.128681},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl = {https://dblp.org/rec/bib/journals/jacm/Condon91},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  84. Cai, J.-yi, Condon, A., & Lipton, R. J. (1991). PSPACE Is Provable By Two Provers In One Round. In Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30 - July 3, 1991 (pp. 110–115). IEEE Computer Society. https://doi.org/10.1109/SCT.1991.160250 
    @inproceedings{caicondonlipton95,
  author = {Cai, Jin{-}yi and Condon, Anne and Lipton, Richard J.},
  title = {{PSPACE} Is Provable By Two Provers In One Round},
  booktitle = {Proceedings of the Sixth Annual Structure in Complexity Theory Conference,
                 Chicago, Illinois, USA, June 30 - July 3, 1991},
  pages = {110--115},
  publisher = {{IEEE} Computer Society},
  year = {1991},
  url = {https://doi.org/10.1109/SCT.1991.160250},
  doi = {10.1109/SCT.1991.160250},
  timestamp = {Wed, 06 Feb 2019 10:30:29 +0100},
  biburl = {https://dblp.org/rec/bib/conf/coco/CaiCL91},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  85. Condon, A. (1991). The Complexity of the Max Word Problem. In C. Choffrut & M. Jantzen (Eds.), STACS 91, 8th Annual Symposium on Theoretical Aspects of Computer Science, Hamburg, Germany, February 14-16, 1991, Proceedings (Vol. 480, pp. 456–465). Springer. https://doi.org/10.1007/BFb0020820 
    @inproceedings{DBLP:conf/stacs/Condon91,
  author = {Condon, Anne},
  editor = {Choffrut, Christian and Jantzen, Matthias},
  title = {The Complexity of the Max Word Problem},
  booktitle = {{STACS} 91, 8th Annual Symposium on Theoretical Aspects of Computer
                 Science, Hamburg, Germany, February 14-16, 1991, Proceedings},
  series = {Lecture Notes in Computer Science},
  volume = {480},
  pages = {456--465},
  publisher = {Springer},
  year = {1991},
  url = {https://doi.org/10.1007/BFb0020820},
  doi = {10.1007/BFb0020820},
  timestamp = {Tue, 14 May 2019 10:00:48 +0200},
  biburl = {https://dblp.org/rec/bib/conf/stacs/Condon91},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  86. Cai, J.-yi, Condon, A., & Lipton, R. J. (1990). On Bounded Round Multi-Prover Interactive Proof Systems. In Proceedings: Fifth Annual Structure in Complexity Theory Conference, Universitat Politècnica de Catalunya, Barcelona, Spain, July 8-11, 1990 (pp. 45–54). IEEE Computer Society. https://doi.org/10.1109/SCT.1990.113953 
    @inproceedings{DBLP:conf/coco/CaiCL90,
  author = {Cai, Jin{-}yi and Condon, Anne and Lipton, Richard J.},
  title = {On Bounded Round Multi-Prover Interactive Proof Systems},
  booktitle = {Proceedings: Fifth Annual Structure in Complexity Theory Conference,
                 Universitat Polit{\`{e}}cnica de Catalunya, Barcelona, Spain, July
                 8-11, 1990},
  pages = {45--54},
  publisher = {{IEEE} Computer Society},
  year = {1990},
  url = {https://doi.org/10.1109/SCT.1990.113953},
  doi = {10.1109/SCT.1990.113953},
  timestamp = {Wed, 06 Feb 2019 10:30:29 +0100},
  biburl = {https://dblp.org/rec/bib/conf/coco/CaiCL90},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  87. Condon, A. (1990). On Algorithms for Simple Stochastic Games. In J.-Y. Cai (Ed.), Advances In Computational Complexity Theory, Proceedings of a DIMACS Workshop, New Jersey, USA, December 3-7, 1990 (Vol. 13, pp. 51–71). DIMACS/AMS. https://doi.org/10.1090/dimacs/013/04 PDF 
    @inproceedings{random,
  author = {Condon, Anne},
  editor = {Cai, Jin{-}Yi},
  title = {On Algorithms for Simple Stochastic Games},
  booktitle = {Advances In Computational Complexity Theory, Proceedings of a {DIMACS}
                 Workshop, New Jersey, USA, December 3-7, 1990},
  series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
  volume = {13},
  pages = {51--71},
  publisher = {{DIMACS/AMS}},
  year = {1990},
  url = {https://doi.org/10.1090/dimacs/013/04},
  doi = {10.1090/dimacs/013/04},
  timestamp = {Tue, 16 Jul 2019 17:45:06 +0200},
  biburl = {https://dblp.org/rec/bib/conf/dimacs/Condon90},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  88. Cai, J.-yi, Condon, A., & Lipton, R. J. (1990). Playing Games of Incomplete Information. In C. Choffrut & T. Lengauer (Eds.), STACS 90, 7th Annual Symposium on Theoretical Aspects of Computer Science, Rouen, France, February 22-24, 1990, Proceedings (Vol. 415, pp. 58–69). Springer. https://doi.org/10.1007/3-540-52282-4_32 
    @inproceedings{DBLP:conf/stacs/CaiCL90,
  author = {Cai, Jin{-}yi and Condon, Anne and Lipton, Richard J.},
  editor = {Choffrut, Christian and Lengauer, Thomas},
  title = {Playing Games of Incomplete Information},
  booktitle = {{STACS} 90, 7th Annual Symposium on Theoretical Aspects of Computer
                 Science, Rouen, France, February 22-24, 1990, Proceedings},
  series = {Lecture Notes in Computer Science},
  volume = {415},
  pages = {58--69},
  publisher = {Springer},
  year = {1990},
  url = {https://doi.org/10.1007/3-540-52282-4\_32},
  doi = {10.1007/3-540-52282-4\_32},
  timestamp = {Tue, 14 May 2019 10:00:48 +0200},
  biburl = {https://dblp.org/rec/bib/conf/stacs/CaiCL90},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  89. Condon, A. (1989). Computational models of games. MIT Press. 
    @book{DBLP:books/daglib/0074447,
  author = {Condon, Anne},
  title = {Computational models of games},
  series = {{ACM} distinguished dissertations},
  publisher = {{MIT} Press},
  year = {1989},
  isbn = {978-0-262-03152-3},
  timestamp = {Tue, 15 Mar 2016 00:00:00 +0100},
  biburl = {https://dblp.org/rec/bib/books/daglib/0074447},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  90. Condon, A., & Lipton, R. J. (1989). On the Complexity of Space Bounded Interactive Proofs (Extended Abstract). In 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989 (pp. 462–467). IEEE Computer Society. https://doi.org/10.1109/SFCS.1989.63519 PDF 
    @inproceedings{condon-lipton89,
  author = {Condon, Anne and Lipton, Richard J.},
  title = {On the Complexity of Space Bounded Interactive Proofs (Extended Abstract)},
  booktitle = {30th Annual Symposium on Foundations of Computer Science, Research
                 Triangle Park, North Carolina, USA, 30 October - 1 November 1989},
  pages = {462--467},
  publisher = {{IEEE} Computer Society},
  year = {1989},
  url = {https://doi.org/10.1109/SFCS.1989.63519},
  doi = {10.1109/SFCS.1989.63519},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl = {https://dblp.org/rec/bib/conf/focs/CondonL89},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  91. Condon, A., & Ladner, R. E. (1988). Probabilistic Game Automata. J. Comput. Syst. Sci., 36(3), 452–489. https://doi.org/10.1016/0022-0000(88)90038-4 PDF 
    @article{pga-88,
  author = {Condon, Anne and Ladner, Richard E.},
  title = {Probabilistic Game Automata},
  journal = {J. Comput. Syst. Sci.},
  volume = {36},
  number = {3},
  pages = {452--489},
  year = {1988},
  url = {https://doi.org/10.1016/0022-0000(88)90038-4},
  doi = {10.1016/0022-0000(88)90038-4},
  timestamp = {Sat, 20 May 2017 01:00:00 +0200},
  biburl = {https://dblp.org/rec/bib/journals/jcss/CondonL88},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  92. Condon, A. (1988). Space bounded probabilistic game automata. In Proceedings: Third Annual Structure in Complexity Theory Conference, Georgetown University, Washington, D. C., USA, June 14-17, 1988 (pp. 162–174). IEEE Computer Society. https://doi.org/10.1109/SCT.1988.5276 
    @inproceedings{DBLP:conf/coco/Condon88,
  author = {Condon, Anne},
  title = {Space bounded probabilistic game automata},
  booktitle = {Proceedings: Third Annual Structure in Complexity Theory Conference,
                 Georgetown University, Washington, D. C., USA, June 14-17, 1988},
  pages = {162--174},
  publisher = {{IEEE} Computer Society},
  year = {1988},
  url = {https://doi.org/10.1109/SCT.1988.5276},
  doi = {10.1109/SCT.1988.5276},
  timestamp = {Wed, 06 Feb 2019 10:30:29 +0100},
  biburl = {https://dblp.org/rec/bib/conf/coco/Condon88},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}