Search the dblp DataBase
Anne Condon :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Omid Madani , Steve Hanks , Anne Condon On the Undecidability of Probabilistic Planning and Infinite-Horizon Partially Observable Markov Decision Problems. [Citation Graph (0, 0)][DBLP ] AAAI/IAAI, 1999, pp:541-548 [Conf ] Jesse D. Bingham , Anne Condon , Alan J. Hu , Shaz Qadeer , Zhichuan Zhang Automatic Verification of Sequential Consistency for Unbounded Addresses and Data Values. [Citation Graph (0, 0)][DBLP ] CAV, 2004, pp:427-439 [Conf ] Sameet Agarwal , Anne Condon On Approximation Algorithms for Hierarchical MAX-SAT. [Citation Graph (0, 0)][DBLP ] Structure in Complexity Theory Conference, 1995, pp:214-226 [Conf ] Eric Bach , Anne Condon , Elton Glaser , Celena Tanguay DNA Models and Algorithms for NP-complete Problems. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 1996, pp:290-300 [Conf ] Jin-yi Cai , Anne Condon , Richard J. Lipton On Bounded Round Multi-Prover Interactive Proof Systems. [Citation Graph (0, 0)][DBLP ] Structure in Complexity Theory Conference, 1990, pp:45-54 [Conf ] Jin-yi Cai , Anne Condon , Richard J. Lipton PSPACE Is Provable By Two Provers In One Round. [Citation Graph (0, 0)][DBLP ] Structure in Complexity Theory Conference, 1991, pp:110-115 [Conf ] Anne Condon , Joan Feigenbaum , Carsten Lund , Peter W. Shor Random Debaters and the Hardness of Approximating Stochastic Functions. [Citation Graph (0, 0)][DBLP ] Structure in Complexity Theory Conference, 1994, pp:280-293 [Conf ] Anne Condon , Richard E. Ladner Probabilistic Game Automata. [Citation Graph (0, 0)][DBLP ] Structure in Complexity Theory Conference, 1986, pp:144-162 [Conf ] Anne Condon , Richard E. Ladner Interactive Proof Systems with Polynomially Bounded Strategies. [Citation Graph (0, 0)][DBLP ] Structure in Complexity Theory Conference, 1992, pp:282-294 [Conf ] Anne Condon The Complexity of Space Boundes Interactive Proof Systems. [Citation Graph (0, 0)][DBLP ] Complexity Theory: Current Research, 1992, pp:147-189 [Conf ] 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. [Citation Graph (0, 0)][DBLP ] DNA, 2002, pp:182-195 [Conf ] Christine E. Heitsch , Anne Condon , Holger H. Hoos From RNA Secondary Structure to Coding Theory: A Combinatorial Approach. [Citation Graph (0, 0)][DBLP ] DNA, 2002, pp:215-228 [Conf ] Dan C. Tulpan , Holger H. Hoos , Anne Condon Stochastic Local Search Algorithms for DNA Word Design. [Citation Graph (0, 0)][DBLP ] DNA, 2002, pp:229-241 [Conf ] Anne Condon , Richard J. Lipton On the Complexity of Space Bounded Interactive Proofs (Extended Abstract) [Citation Graph (0, 0)][DBLP ] FOCS, 1989, pp:462-467 [Conf ] Anne Condon , Mark D. Hill , Manoj Plakal , Daniel J. Sorin Using Lamport Clocks to Reason about Relaxed Memory Models. [Citation Graph (0, 0)][DBLP ] HPCA, 1999, pp:270-278 [Conf ] Anne Condon Problems on RNA Secondary Structure Prediction and Design. [Citation Graph (0, 0)][DBLP ] ICALP, 2003, pp:22-32 [Conf ] Sun Chung , Anne Condon Parallel Implementation of Borvka's Minimum Spanning Tree Algorithm. [Citation Graph (0, 0)][DBLP ] IPPS, 1996, pp:302-308 [Conf ] Anne Condon , Diane Hernek Random Walks on Colored Graphs. [Citation Graph (0, 0)][DBLP ] ISTCS, 1993, pp:134-140 [Conf ] Anne Condon RNA Molecules: Glimpses Through an Algorithmic Lens. [Citation Graph (0, 0)][DBLP ] LATIN, 2006, pp:8-10 [Conf ] Anne Condon , Amol Deshpande , Lisa Hellerstein , Ning Wu Flow algorithms for two pipelined filter ordering problems. [Citation Graph (0, 0)][DBLP ] PODS, 2006, pp:193-202 [Conf ] Anne Condon , Richard M. Karp Algorithms for Graph Partitioning on the Planted Partition Model. [Citation Graph (0, 0)][DBLP ] RANDOM-APPROX, 1999, pp:221-232 [Conf ] 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). [Citation Graph (0, 0)][DBLP ] RECOMB, 1997, pp:67-74 [Conf ] Gary Lewandowski , Anne Condon , Eric Bach Asynchronous Analysis of Parallel Dynamic Programming. [Citation Graph (0, 0)][DBLP ] SIGMETRICS, 1993, pp:268-269 [Conf ] Jesse D. Bingham , Anne Condon , Alan J. Hu Toward a decidable notion of sequential consistency. [Citation Graph (0, 0)][DBLP ] SPAA, 2003, pp:304-313 [Conf ] Anne Condon , Alan J. Hu Automatable verification of sequential consistency. [Citation Graph (0, 0)][DBLP ] SPAA, 2001, pp:113-121 [Conf ] Mark D. Hill , Anne Condon , Manoj Plakal , Daniel J. Sorin A System-Level Specification Framework for I/O Architectures. [Citation Graph (0, 0)][DBLP ] SPAA, 1999, pp:138-147 [Conf ] Manoj Plakal , Daniel J. Sorin , Anne Condon , Mark D. Hill Lamport Clocks: Verifying a Directory Cache-Coherence Protocol. [Citation Graph (0, 0)][DBLP ] SPAA, 1998, pp:67-76 [Conf ] Jin-yi Cai , Anne Condon , Richard J. Lipton Playing Games of Incomplete Information. [Citation Graph (0, 0)][DBLP ] STACS, 1990, pp:58-69 [Conf ] Anne Condon The Complexity of the Max Word Problem. [Citation Graph (0, 0)][DBLP ] STACS, 1991, pp:456-465 [Conf ] Anne Condon A Theory of Strict P-completeness. [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:33-44 [Conf ] Anne Condon , Joan Feigenbaum , Carsten Lund , Peter W. Shor Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:305-314 [Conf ] Anne Condon , Lisa Hellerstein , Samuel Pottle , Avi Wigderson On the power of finite automata with both nondeterministic and probabilistic states (preliminary version). [Citation Graph (0, 0)][DBLP ] STOC, 1994, pp:676-685 [Conf ] Baharak Rastegari , Anne Condon Linear Time Algorithm for Parsing RNA Secondary Structure. [Citation Graph (0, 0)][DBLP ] WABI, 2005, pp:341-352 [Conf ] Omid Madani , Steve Hanks , Anne Condon On the undecidability of probabilistic planning and related stochastic optimization problems. [Citation Graph (0, 0)][DBLP ] Artif. Intell., 2003, v:147, n:1-2, pp:5-34 [Journal ] Anne Condon , Lata Narayanan Upper and Lower Bounds for Selection in the Mesh. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1998, v:20, n:1, pp:1-30 [Journal ] Anne Condon The Complexity of the Max Word Problem and the Power of One-Way Interactive Proof Systems. [Citation Graph (0, 0)][DBLP ] Computational Complexity, 1993, v:3, n:, pp:292-305 [Journal ] Anne Condon A Theory of Strict P-Completeness. [Citation Graph (0, 0)][DBLP ] Computational Complexity, 1994, v:4, n:, pp:220-241 [Journal ] Anne Condon , Joan Feigenbaum , Carsten Lund , Peter W. Shor Probabilistically Checkable Debate Systems and Nonapproximability of PSPACE-Hard Functions. [Citation Graph (0, 0)][DBLP ] Chicago J. Theor. Comput. Sci., 1995, v:1995, n:, pp:- [Journal ] Anne Condon The Complexity of Stochastic Games [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1992, v:96, n:2, pp:203-224 [Journal ] Anne Condon Space-Bounded Probabilistic Game Automata. [Citation Graph (0, 0)][DBLP ] J. ACM, 1991, v:38, n:2, pp:472-494 [Journal ] Sameet Agarwal , Anne Condon On Approximation Algorithms for Hierarchical MAX-SAT. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1998, v:26, n:1, pp:141-165 [Journal ] Amit Marathe , Anne Condon , Robert M. Corn On Combinatorial DNA Word Design. [Citation Graph (0, 0)][DBLP ] Journal of Computational Biology, 2001, v:8, n:3, pp:201-219 [Journal ] Lloyd M. Smith , Robert M. Corn , Anne Condon , Max G. Lagally , Tony Frutos , Qinghua Liu , Andrew Thiel A Surface-Based Approach to DNA Computation. [Citation Graph (0, 0)][DBLP ] Journal of Computational Biology, 1998, v:5, n:2, pp:255-266 [Journal ] Eric Bach , Anne Condon , Elton Glaser , Celena Tanguay DNA Models and Algorithms for NP-Complete Problems. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1998, v:57, n:2, pp:172-186 [Journal ] Jin-yi Cai , Anne Condon , Richard J. Lipton PSPACE Is Provable by Two Provers in One Round. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1994, v:48, n:1, pp:183-193 [Journal ] Anne Condon Guest editor's foreword. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 2004, v:69, n:1, pp:1-2 [Journal ] Anne Condon , Richard E. Ladner Probabilistic Game Automata. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1988, v:36, n:3, pp:452-489 [Journal ] Anne Condon , Richard E. Ladner Interactive Proof Systems with Polynomially Bounded Strategies. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1995, v:50, n:3, pp:506-518 [Journal ] Anne Condon , Alan J. Hu Automatable Verification of Sequential Consistency. [Citation Graph (0, 0)][DBLP ] Theory Comput. Syst., 2003, v:36, n:5, pp:431-460 [Journal ] Mitsunori Ogihara , Anne Condon Guest Editors' Foreword. [Citation Graph (0, 0)][DBLP ] Theory Comput. Syst., 2002, v:35, n:5, pp:469- [Journal ] Mirela Andronescu , Rosalía Aguirre-Hernández , Anne Condon , Holger H. Hoos RNAsoft: a suite of RNA secondary structure prediction and design software tools. [Citation Graph (0, 0)][DBLP ] Nucleic Acids Research, 2003, v:31, n:13, pp:3416-3422 [Journal ] 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. [Citation Graph (0, 0)][DBLP ] Natural Computing, 2003, v:2, n:4, pp:391-415 [Journal ] Anne Condon , Diane Hernek Random Walks on Colored Graphs. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 1994, v:5, n:2, pp:285-304 [Journal ] Anne Condon , Richard M. Karp Algorithms for graph partitioning on the planted partition model. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 2001, v:18, n:2, pp:116-140 [Journal ] Anne Condon , Joan Feigenbaum , Carsten Lund , Peter W. Shor Random Debaters and the Hardness of Approximating Stochastic Functions. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1997, v:26, n:2, pp:369-400 [Journal ] Anne Condon , Lisa Hellerstein , Samuel Pottle , Avi Wigderson On the Power of Finite Automata with Both Nondeterministic and Probabilistic States. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1998, v:27, n:3, pp:739-762 [Journal ] Anne Condon , Richard E. Ladner , Jordan Lampe , Rakesh K. Sinha Complexity of Sub-Bus Mesh Computations. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1996, v:25, n:3, pp:520-539 [Journal ] Arwen Brenneman , Anne Condon Strand design for biomolecular computation. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:287, n:1, pp:39-58 [Journal ] Jin-yi Cai , Anne Condon , Richard J. Lipton On Games of Incomplete Information. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1992, v:103, n:1, pp:25-38 [Journal ] Anne Condon , Beth Davy , Baharak Rastegari , Shelly Zhao , Finbarr Tarrant Classifying RNA pseudoknotted structures. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2004, v:320, n:1, pp:35-50 [Journal ] Gary Lewandowski , Anne Condon , Eric Bach Asynchronous Analysis of Parallel Dynamic Programming Algorithms. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Parallel Distrib. Syst., 1996, v:7, n:4, pp:425-438 [Journal ] 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. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Parallel Distrib. Syst., 2002, v:13, n:6, pp:556-578 [Journal ] Baharak Rastegari , Anne Condon , Kevin Leyton-Brown Revenue Monotonicity in Combinatorial Auctions. [Citation Graph (0, 0)][DBLP ] AAAI, 2007, pp:122-127 [Conf ] Hosna Jabbari , Anne Condon , Ana Pop , Cristina Pop , Yinglei Zhao HFold: RNA Pseudoknotted Secondary Structure Prediction Using Hierarchical Folding. [Citation Graph (0, 0)][DBLP ] WABI, 2007, pp:323-334 [Conf ] On the Design of Oligos for Gene Synthesis. [Citation Graph (, )][DBLP ] Complexity of a Collision-Aware String Partition Problem and Its Relation to Oligo Design for Gene Synthesis. [Citation Graph (, )][DBLP ] NP-Completeness of the Direct Energy Barrier Problem without Pseudoknots. [Citation Graph (, )][DBLP ] Efficient parameter estimation for RNA secondary structure prediction. [Citation Graph (, )][DBLP ] Stepwise randomized combinatorial auctions achieve revenue monotonicity. [Citation Graph (, )][DBLP ] Computational Challenges and Opportunities in the Design of Unconventional Machines from Nucleic Acids. [Citation Graph (, )][DBLP ] Finding MFE Structures Formed by Nucleic Acid Strands in a Combinatorial Set. [Citation Graph (, )][DBLP ] Computational RNA secondary structure design: empirical complexity and improved methods. [Citation Graph (, )][DBLP ] RNA STRAND: The RNA Secondary Structure and Statistical Analysis Database. [Citation Graph (, )][DBLP ] Search in 0.004secs, Finished in 0.484secs