#### Filter Results:

- Full text PDF available (106)

#### Publication Year

1971

2017

- This year (3)
- Last 5 years (18)
- Last 10 years (46)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

#### Method

#### Organism

Learn More

- Anne Condon
- Inf. Comput.
- 1992

We consider the complexity of stochastic games { simple games of chance played by two players. We show that the problem of deciding which player has the greatest chance of winning the game is in the class NP \ co-NP.

- Anne Condon, Richard M. Karp
- RANDOM-APPROX
- 1999

The NP-hard graph bisection problem is to partition the nodes of an undirected graph into two equal-sized groups so as to minimize the number of edges that cross the partition. The more general graph l-partition problem is to partition the nodes of an undirected graph into l equal-sized groups so as to minimize the total number of edges that cross between… (More)

- Anne Condon
- Advances In Computational Complexity Theory
- 1990

We survey a number of algorithms for the simple stochastic game problem, which is to determine the winning probability of a type of stochastic process, where the transitions are partially controlled by two players. We show that four natural approaches to solving the problem are incorrect, and present two new algorithms for the problem. The rst reduces the… (More)

- Jihong Ren, Baharak Rastegari, Anne Condon, Holger H Hoos
- RNA
- 2005

We present HotKnots, a new heuristic algorithm for the prediction of RNA secondary structures including pseudoknots. Based on the simple idea of iteratively forming stable stems, our algorithm explores many alternative secondary structures, using a free energy minimization algorithm for pseudoknot free secondary structures to identify promising candidate… (More)

- Mirela Andronescu, Vera Bereg, Holger H. Hoos, Anne Condon
- BMC Bioinformatics
- 2008

The ability to access, search and analyse secondary structures of a large set of known RNA molecules is very important for deriving improved RNA energy models, for evaluating computational predictions of RNA secondary structures and for a better understanding of RNA folding. Currently there is no database that can easily provide these capabilities for… (More)

- Mirela Andronescu, Anthony P Fejes, Frank Hutter, Holger H Hoos, Anne Condon
- Journal of molecular biology
- 2004

The function of many RNAs depends crucially on their structure. Therefore, the design of RNA molecules with specific structural properties has many potential applications, e.g. in the context of investigating the function of biological RNAs, of creating new ribozymes, or of designing artificial RNA nanostructures. Here, we present a new algorithm for… (More)

- Sun Chung, Anne Condon
- IPPS
- 1996

We study parallel algorithms for the minimum spanning tree problem, based on the sequential algorithm of Borůvka. The target architectures for our algorithm are asynchronous, distributed-memory machines. Analysis of our parallel algorithm, on a simple model that is reminiscent of the LogP model, shows that in principle a speedup proportional to the number… (More)

- Omid Madani, Steve Hanks, Anne Condon
- Artif. Intell.
- 2003

Automated planning, the problem of how an agent achieves a goal given a repertoire of actions, is one of the foundational and most widely studied problems in the AI literature. The original formulation of the problem makes strong assumptions regarding the agent's knowledge and control over the world, namely that its information is complete and correct, and… (More)

- Amit Marathe, Anne Condon, Robert M. Corn
- Journal of Computational Biology
- 1999

We consider the problem of designing DNA codes, namely sets of equi-length words over the alphabet [A, C, G, T] that satisfy certain combinatorial constraints. This problem is motivated by the task of reliably storing and retrieving information in synthetic DNA strands for use in DNA computing or as molecular bar codes in chemical libraries. The primary… (More)

- Anne Condon, Richard J. Lipton
- FOCS
- 1989

We prove two results on interactive proof systems with 2-way probabilistic finite state verifiers. The first is a lower bound on the power of such proof systems, if they are not required to halt with high probability on rejected inputs: we show that they can accept any recursively enumerable language. The second is an upper bound on the power of interactive… (More)