( en | de | ru )

 

Disambiguation of "Condon, Anne"

Author of the publication

copydeleteadd this publication to your clipboard
Random Debaters and the Hardness of Approximating Stochastic Functions.

, , , and . SCT, page 280-293. IEEE Computer Society, (1994)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Virginia Condon

Edward Condon

Chris Condon

Dieter Annemaier

Marianne Annen

 

Other publications of authors with the same name

On the undecidability of probabilistic planning and related stochastic optimization problems., , and . Artif. Intell., 147 (1-2): 5-34 (2003)Probabilistically Checkable Debate Systems and Nonapproximability of PSPACE-Hard Functions., , , and . Chic. J. Theor. Comput. Sci., (1995)Efficient codon optimization with motif engineering., and . J. Discrete Algorithms, (2012)Random Debaters and the Hardness of Approximating Stochastic Functions., , , and . SIAM J. Comput., 26 (2): 369-400 (1997)Lamport Clocks: Verifying a Directory Cache-Coherence Protocol., , , and . SPAA, page 67-76. ACM, (1998)A System-Level Specification Framework for I/O Architectures., , , and . SPAA, page 138-147. ACM, (1999)Toward a decidable notion of sequential consistency., , and . SPAA, page 304-313. ACM, (2003)Linear Time Algorithm for Parsing RNA Secondary Structure., and . WABI, volume 3692 of Lecture Notes in Computer Science, page 341-352. Springer, (2005)Complexity of a Collision-Aware String Partition Problem and Its Relation to Oligo Design for Gene Synthesis., , and . COCOON, volume 5092 of Lecture Notes in Computer Science, page 265-275. Springer, (2008)A Theory of Strict P-completeness.. STACS, volume 577 of Lecture Notes in Computer Science, page 33-44. Springer, (1992)