| 2008 |
|---|
| 69 | EE | 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 |
| 2007 |
|---|
| 68 | | Baharak Rastegari,
Anne Condon,
Kevin Leyton-Brown:
Revenue Monotonicity in Combinatorial Auctions.
AAAI 2007: 122-127 |
| 67 | EE | Chris Thachuk,
Anne Condon:
On the Design of Oligos for Gene Synthesis.
BIBE 2007: 123-130 |
| 66 | EE | Mirela Andronescu,
Anne Condon,
Holger H. Hoos,
David H. Mathews,
Kevin P. Murphy:
Efficient parameter estimation for RNA secondary structure prediction.
ISMB/ECCB (Supplement of Bioinformatics) 2007: 19-28 |
| 65 | EE | Hosna Jabbari,
Anne Condon,
Ana Pop,
Cristina Pop,
Yinglei Zhao:
HFold: RNA Pseudoknotted Secondary Structure Prediction Using Hierarchical Folding.
WABI 2007: 323-334 |
| 64 | EE | Baharak Rastegari,
Anne Condon,
Kevin Leyton-Brown:
Revenue monotonicity in combinatorial auctions.
SIGecom Exchanges 7(1): 45-47 (2007) |
| 2006 |
|---|
| 63 | EE | Anne Condon:
RNA Molecules: Glimpses Through an Algorithmic Lens.
LATIN 2006: 8-10 |
| 62 | EE | Anne Condon,
Amol Deshpande,
Lisa Hellerstein,
Ning Wu:
Flow algorithms for two pipelined filter ordering problems.
PODS 2006: 193-202 |
| 2005 |
|---|
| 61 | EE | Baharak Rastegari,
Anne Condon:
Linear Time Algorithm for Parsing RNA Secondary Structure.
WABI 2005: 341-352 |
| 2004 |
|---|
| 60 | EE | 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 |
| 59 | EE | Anne Condon:
Guest editor's foreword.
J. Comput. Syst. Sci. 69(1): 1-2 (2004) |
| 58 | EE | Anne Condon,
Beth Davy,
Baharak Rastegari,
Shelly Zhao,
Finbarr Tarrant:
Classifying RNA pseudoknotted structures.
Theor. Comput. Sci. 320(1): 35-50 (2004) |
| 2003 |
|---|
| 57 | EE | Anne Condon:
Problems on RNA Secondary Structure Prediction and Design.
ICALP 2003: 22-32 |
| 56 | EE | Jesse D. Bingham,
Anne Condon,
Alan J. Hu:
Toward a decidable notion of sequential consistency.
SPAA 2003: 304-313 |
| 55 | EE | 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) |
| 54 | EE | 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.
Natural Computing 2(4): 391-415 (2003) |
| 53 | | 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 Research 31(13): 3416-3422 (2003) |
| 52 | EE | Anne Condon,
Alan J. Hu:
Automatable Verification of Sequential Consistency.
Theory Comput. Syst. 36(5): 431-460 (2003) |
| 2002 |
|---|
| 51 | EE | 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 |
| 50 | EE | Christine E. Heitsch,
Anne Condon,
Holger H. Hoos:
From RNA Secondary Structure to Coding Theory: A Combinatorial Approach.
DNA 2002: 215-228 |
| 49 | EE | Dan C. Tulpan,
Holger H. Hoos,
Anne Condon:
Stochastic Local Search Algorithms for DNA Word Design.
DNA 2002: 229-241 |
| 48 | EE | 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 Distrib. Syst. 13(6): 556-578 (2002) |
| 47 | | Arwen Brenneman,
Anne Condon:
Strand design for biomolecular computation.
Theor. Comput. Sci. 287(1): 39-58 (2002) |
| 46 | EE | Mitsunori Ogihara,
Anne Condon:
Guest Editors' Foreword.
Theory Comput. Syst. 35(5): 469 (2002) |
| 2001 |
|---|
| 45 | | Anne Condon,
Grzegorz Rozenberg:
DNA Computing, 6th International Workshop on DNA-Based Computers, DNA 2000, Leiden, The Netherlands, June 13-17, 2000, Revised Papers
Springer 2001 |
| 44 | EE | Anne Condon,
Alan J. Hu:
Automatable verification of sequential consistency.
SPAA 2001: 113-121 |
| 43 | | Amit Marathe,
Anne Condon,
Robert M. Corn:
On Combinatorial DNA Word Design.
Journal of Computational Biology 8(3): 201-219 (2001) |
| 42 | | Anne Condon,
Richard M. Karp:
Algorithms for graph partitioning on the planted partition model.
Random Struct. Algorithms 18(2): 116-140 (2001) |
| 1999 |
|---|
| 41 | | 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 |
| 40 | EE | Anne Condon,
Mark D. Hill,
Manoj Plakal,
Daniel J. Sorin:
Using Lamport Clocks to Reason about Relaxed Memory Models.
HPCA 1999: 270-278 |
| 39 | | Anne Condon,
Richard M. Karp:
Algorithms for Graph Partitioning on the Planted Partition Model.
RANDOM-APPROX 1999: 221-232 |
| 38 | EE | Mark D. Hill,
Anne Condon,
Manoj Plakal,
Daniel J. Sorin:
A System-Level Specification Framework for I/O Architectures.
SPAA 1999: 138-147 |
| 1998 |
|---|
| 37 | EE | Manoj Plakal,
Daniel J. Sorin,
Anne Condon,
Mark D. Hill:
Lamport Clocks: Verifying a Directory Cache-Coherence Protocol.
SPAA 1998: 67-76 |
| 36 | | Anne Condon,
Lata Narayanan:
Upper and Lower Bounds for Selection in the Mesh.
Algorithmica 20(1): 1-30 (1998) |
| 35 | | Sameet Agarwal,
Anne Condon:
On Approximation Algorithms for Hierarchical MAX-SAT.
J. Algorithms 26(1): 141-165 (1998) |
| 34 | | 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) |
| 33 | | Lloyd M. Smith,
Robert M. Corn,
Anne Condon,
Max G. Lagally,
Tony Frutos,
Qinghua Liu,
Andrew Thiel:
A Surface-Based Approach to DNA Computation.
Journal of Computational Biology 5(2): 255-266 (1998) |
| 32 | | 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) |
| 1997 |
|---|
| 31 | EE | 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 |
| 30 | | 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) |
| 1996 |
|---|
| 29 | EE | Eric Bach,
Anne Condon,
Elton Glaser,
Celena Tanguay:
DNA Models and Algorithms for NP-complete Problems.
IEEE Conference on Computational Complexity 1996: 290-300 |
| 28 | EE | Sun Chung,
Anne Condon:
Parallel Implementation of Borvka's Minimum Spanning Tree Algorithm.
IPPS 1996: 302-308 |
| 27 | EE | Gary Lewandowski,
Anne Condon,
Eric Bach:
Asynchronous Analysis of Parallel Dynamic Programming Algorithms.
IEEE Trans. Parallel Distrib. Syst. 7(4): 425-438 (1996) |
| 26 | | Anne Condon,
Richard E. Ladner,
Jordan Lampe,
Rakesh K. Sinha:
Complexity of Sub-Bus Mesh Computations.
SIAM J. Comput. 25(3): 520-539 (1996) |
| 1995 |
|---|
| 25 | | Sameet Agarwal,
Anne Condon:
On Approximation Algorithms for Hierarchical MAX-SAT.
Structure in Complexity Theory Conference 1995: 214-226 |
| 24 | EE | Anne Condon,
Joan Feigenbaum,
Carsten Lund,
Peter W. Shor:
Probabilistically Checkable Debate Systems and Nonapproximability of PSPACE-Hard Functions.
Chicago J. Theor. Comput. Sci. 1995: (1995) |
| 23 | | Anne Condon,
Richard E. Ladner:
Interactive Proof Systems with Polynomially Bounded Strategies.
J. Comput. Syst. Sci. 50(3): 506-518 (1995) |
| 1994 |
|---|
| 22 | EE | 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 |
| 21 | | Anne Condon,
Joan Feigenbaum,
Carsten Lund,
Peter W. Shor:
Random Debaters and the Hardness of Approximating Stochastic Functions.
Structure in Complexity Theory Conference 1994: 280-293 |
| 20 | | Anne Condon:
A Theory of Strict P-Completeness.
Computational Complexity 4: 220-241 (1994) |
| 19 | | 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) |
| 18 | | Anne Condon,
Diane Hernek:
Random Walks on Colored Graphs.
Random Struct. Algorithms 5(2): 285-304 (1994) |
| 1993 |
|---|
| 17 | | Anne Condon,
Diane Hernek:
Random Walks on Colored Graphs.
ISTCS 1993: 134-140 |
| 16 | | Gary Lewandowski,
Anne Condon,
Eric Bach:
Asynchronous Analysis of Parallel Dynamic Programming.
SIGMETRICS 1993: 268-269 |
| 15 | EE | Anne Condon,
Joan Feigenbaum,
Carsten Lund,
Peter W. Shor:
Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions.
STOC 1993: 305-314 |
| 14 | | Anne Condon:
The Complexity of the Max Word Problem and the Power of One-Way Interactive Proof Systems.
Computational Complexity 3: 292-305 (1993) |
| 1992 |
|---|
| 13 | | Anne Condon:
The Complexity of Space Boundes Interactive Proof Systems.
Complexity Theory: Current Research 1992: 147-189 |
| 12 | | Anne Condon:
A Theory of Strict P-completeness.
STACS 1992: 33-44 |
| 11 | | Anne Condon,
Richard E. Ladner:
Interactive Proof Systems with Polynomially Bounded Strategies.
Structure in Complexity Theory Conference 1992: 282-294 |
| 10 | | Anne Condon:
The Complexity of Stochastic Games
Inf. Comput. 96(2): 203-224 (1992) |
| 9 | | Jin-yi Cai,
Anne Condon,
Richard J. Lipton:
On Games of Incomplete Information.
Theor. Comput. Sci. 103(1): 25-38 (1992) |
| 1991 |
|---|
| 8 | | Anne Condon:
The Complexity of the Max Word Problem.
STACS 1991: 456-465 |
| 7 | | Jin-yi Cai,
Anne Condon,
Richard J. Lipton:
PSPACE Is Provable By Two Provers In One Round.
Structure in Complexity Theory Conference 1991: 110-115 |
| 6 | EE | Anne Condon:
Space-Bounded Probabilistic Game Automata.
J. ACM 38(2): 472-494 (1991) |
| 1990 |
|---|
| 5 | | Jin-yi Cai,
Anne Condon,
Richard J. Lipton:
Playing Games of Incomplete Information.
STACS 1990: 58-69 |
| 4 | | Jin-yi Cai,
Anne Condon,
Richard J. Lipton:
On Bounded Round Multi-Prover Interactive Proof Systems.
Structure in Complexity Theory Conference 1990: 45-54 |
| 1989 |
|---|
| 3 | | Anne Condon,
Richard J. Lipton:
On the Complexity of Space Bounded Interactive Proofs (Extended Abstract)
FOCS 1989: 462-467 |
| 1988 |
|---|
| 2 | | Anne Condon,
Richard E. Ladner:
Probabilistic Game Automata.
J. Comput. Syst. Sci. 36(3): 452-489 (1988) |
| 1986 |
|---|
| 1 | | Anne Condon,
Richard E. Ladner:
Probabilistic Game Automata.
Structure in Complexity Theory Conference 1986: 144-162 |
