default search action
Anne Condon
Person information
- affiliation: University of British Columbia, Department of Computer Science
- affiliation: University of Wisconsin-Madison, Computer Sciences Department
- award (2014): Anita Borg Institute Women of Vision Awards
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [i8]Chenwei Zhang, Anne Condon, Khanh Dao Duc:
Synthetic High-resolution Cryo-EM Density Maps with Generative Adversarial Networks. CoRR abs/2407.17674 (2024) - 2023
- [j57]Sedigheh Zolaktaf
, Frits Dannenberg, Mark Schmidt, Anne Condon, Erik Winfree:
Predicting DNA kinetics with a truncated continuous-time Markov chain method. Comput. Biol. Chem. 104: 107837 (2023) - [j56]Joseph Berleant
Isometric Hamming embeddings of weighted graphs. Discret. Appl. Math. 332: 119-128 (2023) - [j55]Kristin Sheridan
Factorization and pseudofactorization of weighted graphs. Discret. Appl. Math. 337: 81-105 (2023) - [j54]Aryan Tajmir Riahi
AlignOT: An Optimal Transport Based Algorithm for Fast 3D Alignment With Applications to Cryogenic Electron Microscopy Density Maps. IEEE ACM Trans. Comput. Biol. Bioinform. 20(6): 3842-3850 (2023) - [c70]Anne Condon, Yuval Emek, Noga Harlev:
On the Runtime of Chemical Reaction Networks Beyond Idealized Conditions. DNA 2023: 3:1-3:22 - [c69]Jordan Lovrod, Boyan Beronov
Revisiting Hybridization Kinetics with Improved Elementary Step Simulation. DNA 2023: 5:1-5:24 - [c68]Chenwei Zhang, Jordan Lovrod, Boyan Beronov, Khanh Dao Duc, Anne Condon:
ViDa: Visualizing DNA hybridization trajectories with biophysics-informed deep graph embeddings. MLCB 2023: 148-162 - [i7]Anne Condon, Yuval Emek, Noga Harlev:
On the Runtime of Chemical Reaction Networks Beyond Idealized Conditions. CoRR abs/2307.00647 (2023) - [i6]Chenwei Zhang, Khanh Dao Duc, Anne Condon:
Visualizing DNA reaction trajectories with deep graph embedding approaches. CoRR abs/2311.03409 (2023) - [i5]Chenwei Zhang, Jordan Lovrod, Boyan Beronov, Khanh Dao Duc, Anne Condon:
ViDa: Visualizing DNA hybridization trajectories with biophysics-informed deep graph embeddings. CoRR abs/2311.03411 (2023) - 2022
- [c67]Hope Amber Johnson, Anne Condon:
A Coupled Reconfiguration Mechanism for Single-Stranded DNA Strand Displacement Systems. DNA 2022: 3:1-3:19 - 2021
- [c66]Anne Condon, Monir Hajiaghayi, Chris Thachuk:
Predicting Minimum Free Energy Structures of Multi-Stranded Nucleic Acid Complexes Is APX-Hard. DNA 2021: 9:1-9:21 - [i4]Kristin Sheridan, Joseph Berleant, Mark Bathe, Anne Condon, Virginia Vassilevska Williams:
Factorization and pseudofactorization of weighted graphs. CoRR abs/2112.06990 (2021) - [i3]Joseph Berleant, Kristin Sheridan, Anne Condon, Virginia Vassilevska Williams, Mark Bathe:
Isometric Hamming embeddings of weighted graphs. CoRR abs/2112.06994 (2021) - 2020
- [j53]Anne Condon
Approximate majority analyses using tri-molecular chemical reaction networks. Nat. Comput. 19(1): 249-270 (2020) - [c65]Hooman Hashemi, Ben Chugg
Composable Computation in Leaderless, Discrete Chemical Reaction Networks. DNA 2020: 3:1-3:18
2010 – 2019
- 2019
- [c64]Sedigheh Zolaktaf, Frits Dannenberg, Erik Winfree, Alexandre Bouchard-Côté, Mark Schmidt, Anne Condon:
Efficient Parameter Estimation for DNA Kinetics Modeled as Continuous-Time Markov Chains. DNA 2019: 80-99 - [c63]Allison Tai, Anne Condon:
Error-Free Stable Computation with Polymer-Supplemented Chemical Reaction Networks. DNA 2019: 197-218 - 2018
- [j52]Martyn Amos, Anne Condon:
Preface. Nat. Comput. 17(2): 221-222 (2018) - [c62]Ben Chugg
Output-Oblivious Stochastic Chemical Reaction Networks. OPODIS 2018: 21:1-21:16 - [c61]Anne Condon:
On Design and Analysis of Chemical Reaction Network Algorithms. CIAA 2018: 1-3 - [i2]Ben Chugg, Anne Condon, Hooman Hashemi:
Output-Oblivious Stochastic Chemical Reaction Networks. CoRR abs/1812.04401 (2018) - 2017
- [j51]Anne Condon, Bonnie Kirkpatrick, Ján Manuch:
Design of nucleic acid strands with long low-barrier folding pathways. Nat. Comput. 16(2): 261-284 (2017) - [c60]Sedigheh Zolaktaf, Frits Dannenberg, Xander Rudelis, Anne Condon, Joseph M. Schaeffer, Mark Schmidt, Chris Thachuk, Erik Winfree
Inferring Parameters for an Elementary Step Model of DNA Structure Kinetics with Locally Context-Dependent Arrhenius Rates. DNA 2017: 172-187 - [c59]Anne Condon, Monir Hajiaghayi, David G. Kirkpatrick, Ján Manuch:
Simplifying Analyses of Chemical Reaction Networks for Approximate Majority. DNA 2017: 188-209 - 2016
- [j50]Jiarui Ding, Sohrab P. Shah, Anne Condon:
densityCut: an efficient and versatile topological approach for automatic clustering of biological data. Bioinform. 32(17): 2567-2576 (2016) - [e3]Martyn Amos, Anne Condon:
Unconventional Computation and Natural Computation - 15th International Conference, UCNC 2016, Manchester, UK, July 11-15, 2016, Proceedings. Lecture Notes in Computer Science 9726, Springer 2016, ISBN 978-3-319-41311-2 [contents] - 2015
- [j49]Anne Condon
The complexity of string partitioning. J. Discrete Algorithms 32: 24-43 (2015) - [c58]Leigh-Anne Mathieson, Anne Condon:
On Low Energy Barrier Folding Pathways for Nucleic Acid Sequences. DNA 2015: 181-193 - 2014
- [j48]Hosna Jabbari
A fast and robust iterative algorithm for prediction of RNA pseudoknotted secondary structures. BMC Bioinform. 15: 147 (2014) - [j47]Anne Condon, Bonnie Kirkpatrick, Ján Manuch:
Reachability bounds for chemical reaction networks and strand displacement systems. Nat. Comput. 13(4): 499-516 (2014) - [c57]Baharak Rastegari
Reasoning about optimal stable matchings under partial information. EC 2014: 431-448 - 2013
- [c56]Baharak Rastegari
Two-sided matching with partial information. EC 2013: 733-750 - 2012
- [j46]Jiarui Ding, Ali Bashashati, Andrew Roth
Feature-based classifiers for somatic mutation detection in tumour-normal paired sequencing data. Bioinform. 28(2): 167-175 (2012) - [j45]Monir Hajiaghayi, Anne Condon, Holger H. Hoos
Analysis of energy-based algorithms for RNA secondary structure prediction. BMC Bioinform. 13: 22 (2012) - [j44]Anne Condon, Chris Thachuk:
Efficient codon optimization with motif engineering. J. Discrete Algorithms 16: 104-112 (2012) - [c55]Anne Condon, Ján Manuch, Chris Thachuk:
The Complexity of String Partitioning. CPM 2012: 159-172 - [c54]Anne Condon, Bonnie Kirkpatrick, Ján Manuch:
Reachability Bounds for Chemical Reaction Networks and Strand Displacement Systems. DNA 2012: 43-57 - [c53]Chris Thachuk, Anne Condon:
Space and Energy Efficient Computation with DNA Strand Displacement Systems. DNA 2012: 135-149 - [i1]Anne Condon, Ján Manuch, Chris Thachuk:
The complexity of string partitioning. CoRR abs/1204.2201 (2012) - 2011
- [j43]Baharak Rastegari
Revenue monotonicity in deterministic, dominant-strategy combinatorial auctions. Artif. Intell. 175(2): 441-456 (2011) - [j42]Anne Condon:
Molecular programming: DNA and the brain. Nat. 475(7356): 304-305 (2011) - [j41]Ján Manuch, Chris Thachuk, Ladislav Stacho, Anne Condon:
NP-completeness of the energy barrier problem without pseudoknots and temporary arcs. Nat. Comput. 10(1): 391-405 (2011) - [c52]Anne Condon, Alan J. Hu, Ján Manuch, Chris Thachuk:
Less Haste, Less Waste: On Recycling and Its Limits in Strand Displacement Systems. DNA 2011: 84-99 - [c51]Anne Condon, Chris Thachuk:
Efficient Codon Optimization with Motif Engineering. IWOCA 2011: 337-348 - 2010
- [c50]Chris Thachuk, Ján Manuch, Arash Rafiey, Leigh-Anne Mathieson, Ladislav Stacho, Anne Condon:
An Algorithm for the Energy Barrier Problem Without Pseudoknots and Temporary Arcs. Pacific Symposium on Biocomputing 2010: 108-119
2000 – 2009
- 2009
- [j40]Ho-Lin Chen
An O(n5) Algorithm for MFE Prediction of Kissing Hairpins and 4-Chains in Nucleic Acids. J. Comput. Biol. 16(6): 803-815 (2009) - [j39]Anne Condon, Amol Deshpande, Lisa Hellerstein, Ning Wu:
Algorithms for distributional and adversarial pipelined filter ordering problems. ACM Trans. Algorithms 5(2): 24:1-24:34 (2009) - [j38]Anne Condon, Hosna Jabbari
Computational prediction of nucleic acid secondary structure: Methods, applications, and challenges. Theor. Comput. Sci. 410(4-5): 294-301 (2009) - [c49]Ján Manuch, Chris Thachuk, Ladislav Stacho, Anne Condon:
NP-Completeness of the Direct Energy Barrier Problem without Pseudoknots. DNA 2009: 106-115 - [c48]Baharak Rastegari
Stepwise randomized combinatorial auctions achieve revenue monotonicity. SODA 2009: 738-747 - [e2]Anne Condon, David Harel, Joost N. Kok, Arto Salomaa, Erik Winfree
Algorithmic Bioprocesses. Natural Computing Series, Springer 2009, ISBN 978-3-540-88868-0 [contents] - 2008
- [j37]Mirela Andronescu, Vera Bereg, Holger H. Hoos
RNA STRAND: The RNA Secondary Structure and Statistical Analysis Database. BMC Bioinform. 9 (2008) - [j36]Hosna Jabbari
Novel and Efficient RNA Secondary Structure Prediction Using Hierarchical Folding. J. Comput. Biol. 15(2): 139-163 (2008) - [c47]Anne Condon, Ján Manuch, Chris Thachuk:
Complexity of a Collision-Aware String Partition Problem and Its Relation to Oligo Design for Gene Synthesis. COCOON 2008: 265-275 - [c46]Anne Condon:
Computational Challenges and Opportunities in the Design of Unconventional Machines from Nucleic Acids. UC 2008: 6 - [p1]Denise W. Gürer, Jennifer Light, Christina Björkman, Rhian Davies, Mark S. Hancock, Anne Condon, Annemieke Craig, Vashti Galpin, Ursula Martin
Women in Computing. Wiley Encyclopedia of Computer Science and Engineering 2008 - 2007
- [j35]Rosalía Aguirre-Hernández, Holger H. Hoos
Computational RNA secondary structure design: empirical complexity and improved methods. BMC Bioinform. 8 (2007) - [j34]Baharak Rastegari
Parsing Nucleic Acid Pseudoknotted Secondary Structure: Algorithm and Applications. J. Comput. Biol. 14(1): 16-32 (2007) - [j33]Baharak Rastegari
Revenue monotonicity in combinatorial auctions. SIGecom Exch. 7(1): 45-47 (2007) - [c45]Baharak Rastegari, Anne Condon, Kevin Leyton-Brown:
Revenue Monotonicity in Combinatorial Auctions. AAAI 2007: 122-127 - [c44]Chris Thachuk, Anne Condon:
On the Design of Oligos for Gene Synthesis. BIBE 2007: 123-130 - [c43]Mirela Andronescu, Anne Condon, Holger H. Hoos
Efficient parameter estimation for RNA secondary structure prediction. ISMB/ECCB (Supplement of Bioinformatics) 2007: 19-28 - [c42]Hosna Jabbari
HFold: RNA Pseudoknotted Secondary Structure Prediction Using Hierarchical Folding. WABI 2007: 323-334 - 2006
- [c41]Anne Condon:
RNA Molecules: Glimpses Through an Algorithmic Lens. LATIN 2006: 8-10 - [c40]Mirela Andronescu, Anne Condon:
Finding MFE Structures Formed by Nucleic Acid Strands in a Combinatorial Set. Nanotechnology: Science and Computation 2006: 121-135 - [c39]Anne Condon, Amol Deshpande, Lisa Hellerstein, Ning Wu:
Flow algorithms for two pipelined filter ordering problems. PODS 2006: 193-202 - 2005
- [c38]Baharak Rastegari
Linear Time Algorithm for Parsing RNA Secondary Structure. WABI 2005: 341-352 - 2004
- [j32]Anne Condon:
Guest editor's foreword. J. Comput. Syst. Sci. 69(1): 1-2 (2004) - [j31]Anne Condon, Beth Davy, Baharak Rastegari
Classifying RNA pseudoknotted structures. Theor. Comput. Sci. 320(1): 35-50 (2004) - [c37]Jesse D. Bingham, Anne Condon, Alan J. Hu, Shaz Qadeer, Zhichuan Zhang:
Automatic Verification of Sequential Consistency for Unbounded Addresses and Data Values. CAV 2004: 427-439 - 2003
- [j30]Omid Madani, Steve Hanks, Anne Condon:
On the undecidability of probabilistic planning and related stochastic optimization problems. Artif. Intell. 147(1-2): 5-34 (2003) - [j29]Anne Condon, Alan J. Hu:
Automatable Verification of Sequential Consistency. Theory Comput. Syst. 36(5): 431-460 (2003) - [j28]Mirela Andronescu, Rosalía Aguirre-Hernández, Anne Condon, Holger H. Hoos
RNAsoft: a suite of RNA secondary structure prediction and design software tools. Nucleic Acids Res. 31(13): 3416-3422 (2003) - [j27]Mirela Andronescu, Danielle Dees, Laura Slaybaugh, Yinglei Zhao, Anne Condon, Barry Cohen, Steven Skiena
Algorithms for testing that sets of DNA words concatenate without secondary structure. Nat. Comput. 2(4): 391-415 (2003) - [c36]Anne Condon:
Problems on RNA Secondary Structure Prediction and Design. ICALP 2003: 22-32 - [c35]Jesse D. Bingham, Anne Condon, Alan J. Hu:
Toward a decidable notion of sequential consistency. SPAA 2003: 304-313 - 2002
- [j26]Mitsunori Ogihara
Guest Editors' Foreword. Theory Comput. Syst. 35(5): 469 (2002) - [j25]Arwen Brenneman, Anne Condon:
Strand design for biomolecular computation. Theor. Comput. Sci. 287(1): 39-58 (2002) - [j24]Daniel J. Sorin, Manoj Plakal, Anne Condon, Mark D. Hill, Milo M. K. Martin, David A. Wood:
Specifying and Verifying a Broadcast and a Multicast Snooping Cache Coherence Protocol. IEEE Trans. Parallel Distributed Syst. 13(6): 556-578 (2002) - [c34]Mirela Andronescu, Danielle Dees, Laura Slaybaugh, Yinglei Zhao, Anne Condon, Barry Cohen, Steven Skiena:
Algorithms for Testing That Sets of DNA Words Concatenate without Secondary Structure. DNA 2002: 182-195 - [c33]Christine E. Heitsch, Anne Condon, Holger H. Hoos:
From RNA Secondary Structure to Coding Theory: A Combinatorial Approach. DNA 2002: 215-228 - [c32]Dan C. Tulpan
Stochastic Local Search Algorithms for DNA Word Design. DNA 2002: 229-241 - 2001
- [j23]Amit Marathe, Anne Condon, Robert M. Corn:
On Combinatorial DNA Word Design. J. Comput. Biol. 8(3): 201-219 (2001) - [j22]Anne Condon, Richard M. Karp:
Algorithms for graph partitioning on the planted partition model. Random Struct. Algorithms 18(2): 116-140 (2001) - [c31]Tim Braun, Anne Condon, Alan J. Hu, Kai S. Juse, Marius Laza, Michael Leslie, Rita Sharma:
Proving sequential consistency by model checking. HLDVT 2001: 103-108 - [c30]Anne Condon, Alan J. Hu:
Automatable verification of sequential consistency. SPAA 2001: 113-121 - [e1]Anne Condon, Grzegorz Rozenberg:
DNA Computing, 6th International Workshop on DNA-Based Computers, DNA 2000, Leiden, The Netherlands, June 13-17, 2000, Revised Papers. Lecture Notes in Computer Science 2054, Springer 2001, ISBN 3-540-42076-2 [contents]
1990 – 1999
- 1999
- [c29]Omid Madani, Steve Hanks, Anne Condon:
On the Undecidability of Probabilistic Planning and Infinite-Horizon Partially Observable Markov Decision Problems. AAAI/IAAI 1999: 541-548 - [c28]Amit Marathe, Anne Condon, Robert M. Corn:
On combinatorial DNA word design. DNA Based Computers 1999: 75-89 - [c27]Anne Condon, Mark D. Hill, Manoj Plakal, Daniel J. Sorin:
Using Lamport Clocks to Reason about Relaxed Memory Models. HPCA 1999: 270-278 - [c26]Anne Condon, Richard M. Karp:
Algorithms for Graph Partitioning on the Planted Partition Model. RANDOM-APPROX 1999: 221-232 - [c25]Mark D. Hill, Anne Condon, Manoj Plakal, Daniel J. Sorin:
A System-Level Specification Framework for I/O Architectures. SPAA 1999: 138-147 - 1998
- [j21]Anne Condon, Lata Narayanan:
Upper and Lower Bounds for Selection in the Mesh. Algorithmica 20(1): 1-30 (1998) - [j20]Sameet Agarwal, Anne Condon:
On Approximation Algorithms for Hierarchical MAX-SAT. J. Algorithms 26(1): 141-165 (1998) - [j19]Lloyd M. Smith, Robert M. Corn, Anne Condon, Max G. Lagally, Tony Frutos, Qinghua Liu, Andrew Thiel:
A Surface-Based Approach to DNA Computation. J. Comput. Biol. 5(2): 255-267 (1998) - [j18]Eric Bach, Anne Condon, Elton Glaser, Celena Tanguay:
DNA Models and Algorithms for NP-Complete Problems. J. Comput. Syst. Sci. 57(2): 172-186 (1998) - [j17]Anne Condon, Lisa Hellerstein, Samuel Pottle, Avi Wigderson:
On the Power of Finite Automata with Both Nondeterministic and Probabilistic States. SIAM J. Comput. 27(3): 739-762 (1998) - [c24]Manoj Plakal, Daniel J. Sorin, Anne Condon, Mark D. Hill:
Lamport Clocks: Verifying a Directory Cache-Coherence Protocol. SPAA 1998: 67-76 - 1997
- [j16]Anne Condon, Joan Feigenbaum, Carsten Lund, Peter W. Shor:
Random Debaters and the Hardness of Approximating Stochastic Functions. SIAM J. Comput. 26(2): 369-400 (1997) - [j15]Anne Condon, Faith E. Fich, Greg N. Frederickson, Andrew V. Goldberg, David S. Johnson, Michael C. Loui, Steven Mahaney, Prabhakar Raghavan, John E. Savage, Alan L. Selman, David B. Shmoys
Strategic directions in research in theory of computing. SIGACT News 28(3): 75-93 (1997) - [c23]Weiping Cai, Anne Condon, Robert M. Corn, Elton Glaser, Zhengdong Fei, Tony Frutos, Zhen Guo, Max G. Lagally, Qinghua Liu, Lloyd M. Smith, Andrew Thiel:
The power of surface-based DNA computation (extended abstract). RECOMB 1997: 67-74 - 1996
- [j14]Anne Condon, Richard E. Ladner
Complexity of Sub-Bus Mesh Computations. SIAM J. Comput. 25(3): 520-539 (1996) - [j13]Gary Lewandowski, Anne Condon, Eric Bach:
Asynchronous Analysis of Parallel Dynamic Programming Algorithms. IEEE Trans. Parallel Distributed Syst. 7(4): 425-438 (1996) - [c22]Eric Bach, Anne Condon, Elton Glaser, Celena Tanguay:
DNA Models and Algorithms for NP-complete Problems. CCC 1996: 290-300 - [c21]Qinghua Liu, Zhen Guo, Zhengdong Fei, Anne Condon, Robert M. Corn, Max G. Lagally, Lloyd M. Smith:
A surface-based approach to DNA computation. DNA Based Computers 1996: 123-132 - [c20]Sun Chung, Anne Condon:
Parallel Implementation of Borvka's Minimum Spanning Tree Algorithm. IPPS 1996: 302-308 - 1995
- [j12]Anne Condon, Joan Feigenbaum, Carsten Lund, Peter W. Shor:
Probabilistically Checkable Debate Systems and Nonapproximability of PSPACE-Hard Functions. Chic. J. Theor. Comput. Sci. 1995 (1995) - [j11]Anne Condon, Richard E. Ladner
Interactive Proof Systems with Polynomially Bounded Strategies. J. Comput. Syst. Sci. 50(3): 506-518 (1995) - [j10]Anne Condon:
Approximate solutions to problems in PSPACE. SIGACT News 26(2): 4-13 (1995) - [c19]Sameet Agarwal, Anne Condon:
On Approximation Algorithms for Hierarchical MAX-SAT. SCT 1995: 214-226 - 1994
- [j9]Anne Condon:
A Theory of Strict P-Completeness. Comput. Complex. 4: 220-241 (1994) - [j8]Mary Melekopoglou, Anne Condon:
On the Complexity of the Policy Improvement Algorithm for Markov Decision Processes. INFORMS J. Comput. 6(2): 188-192 (1994) - [j7]Jin-yi Cai, Anne Condon, Richard J. Lipton:
PSPACE Is Provable by Two Provers in One Round. J. Comput. Syst. Sci. 48(1): 183-193 (1994) - [j6]Anne Condon, Diane Hernek:
Random Walks on Colored Graphs. Random Struct. Algorithms 5(2): 285-304 (1994) - [c18]Anne Condon, Joan Feigenbaum, Carsten Lund, Peter W. Shor:
Random Debaters and the Hardness of Approximating Stochastic Functions. SCT 1994: 280-293 - [c17]Lata Narayanan, Anne Condon:
Upper and lower bounds for selection on the mesh. SPDP 1994: 497-504 - [c16]Anne Condon, Lisa Hellerstein, Samuel Pottle, Avi Wigderson:
On the power of finite automata with both nondeterministic and probabilistic states (preliminary version). STOC 1994: 676-685 - 1993
- [j5]Anne Condon:
The Complexity of the Max Word Problem and the Power of One-Way Interactive Proof Systems. Comput. Complex. 3: 292-305 (1993) - [c15]Gary Lewandowski, Anne Condon:
Experiments with parallel graph coloring heuristics and applications of graph coloring. Cliques, Coloring, and Satisfiability 1993: 309-334 - [c14]Anne Condon, Diane Hernek:
Random Walks on Colored Graphs. ISTCS 1993: 134-140 - [c13]Gary Lewandowski, Anne Condon, Eric Bach:
Asynchronous Analysis of Parallel Dynamic Programming. SIGMETRICS 1993: 268-269 - [c12]Anne Condon, Joan Feigenbaum, Carsten Lund, Peter W. Shor:
Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions. STOC 1993: 305-314 - 1992
- [j4]Anne Condon:
The Complexity of Stochastic Games. Inf. Comput. 96(2): 203-224 (1992) - [j3]Jin-yi Cai, Anne Condon, Richard J. Lipton:
On Games of Incomplete Information. Theor. Comput. Sci. 103(1): 25-38 (1992) - [c11]Anne Condon, Richard E. Ladner
Interactive Proof Systems with Polynomially Bounded Strategies. SCT 1992: 282-294 - [c10]Anne Condon:
The Complexity of Space Boundes Interactive Proof Systems. Complexity Theory: Current Research 1992: 147-189 - [c9]Anne Condon:
A Theory of Strict P-completeness. STACS 1992: 33-44 - 1991
- [j2]Anne Condon:
Space-Bounded Probabilistic Game Automata. J. ACM 38(2): 472-494 (1991) - [c8]Jin-yi Cai, Anne Condon, Richard J. Lipton:
PSPACE Is Provable By Two Provers In One Round. SCT 1991: 110-115 - [c7]Anne Condon:
The Complexity of the Max Word Problem. STACS 1991: 456-465 - 1990
- [c6]Jin-yi Cai, Anne Condon, Richard J. Lipton:
On Bounded Round Multi-Prover Interactive Proof Systems. SCT 1990: 45-54 - [c5]Anne Condon:
On Algorithms for Simple Stochastic Games. Advances In Computational Complexity Theory 1990: 51-71 - [c4]Jin-yi Cai, Anne Condon, Richard J. Lipton:
Playing Games of Incomplete Information. STACS 1990: 58-69
1980 – 1989
- 1989
- [b1]Anne Condon:
Computational models of games. ACM distinguished dissertations, MIT Press 1989, ISBN 978-0-262-03152-3, pp. 1-125 - [c3]Anne Condon, Richard J. Lipton:
On the Complexity of Space Bounded Interactive Proofs (Extended Abstract). FOCS 1989: 462-467 - 1988
- [j1]Anne Condon, Richard E. Ladner
Probabilistic Game Automata. J. Comput. Syst. Sci. 36(3): 452-489 (1988) - [c2]Anne Condon:
Space bounded probabilistic game automata. SCT 1988: 162-174 - 1986
- [c1]Anne Condon, Richard E. Ladner:
Probabilistic Game Automata. SCT 1986: 144-162
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: