Condon, Anne
Overview
Works:  31 works in 87 publications in 1 language and 1,396 library holdings 

Genres:  Conference papers and proceedings 
Roles:  Author, Editor, Other, Creator 
Classifications:  QA269, 511.3 
Publication Timeline
.
Most widely held works by
Anne Condon
Computational models of games by
Anne Condon(
Book
)
9 editions published between 1987 and 1989 in English and Undetermined and held by 279 WorldCat member libraries worldwide
9 editions published between 1987 and 1989 in English and Undetermined and held by 279 WorldCat member libraries worldwide
DNA computing : 6th International Workshop on DNABased Computers, DNA 2000, Leiden, the Netherlands, June 1317, 2000 : revised
papers by
Masami Hagiya(
Book
)
22 editions published between 2001 and 2003 in English and held by 265 WorldCat member libraries worldwide
This book constitutes the thoroughly refereed postproceedings of the 6th International Workshop on DNABased Computers, DNA 2000, held in Leiden, The Netherlands, in June 2000. The 16 revised full papers presented together with two invited papers were carefully reviewed and selected from 33 submissions. All current aspects of DNA computing, ranging from theoretical and foundational issues to algorithms, are addressed, from the computer science point of view as well as from the molecular biology point of view
22 editions published between 2001 and 2003 in English and held by 265 WorldCat member libraries worldwide
This book constitutes the thoroughly refereed postproceedings of the 6th International Workshop on DNABased Computers, DNA 2000, held in Leiden, The Netherlands, in June 2000. The 16 revised full papers presented together with two invited papers were carefully reviewed and selected from 33 submissions. All current aspects of DNA computing, ranging from theoretical and foundational issues to algorithms, are addressed, from the computer science point of view as well as from the molecular biology point of view
Algorithmic bioprocesses by
Anne Condon(
)
18 editions published between 2009 and 2013 in English and Undetermined and held by 99 WorldCat member libraries worldwide
This text offers a comprehensive overview of research into algorithmic selfassembly, RNA folding, the algorithmic foundations for biochemical reactions, and the algorithmic nature of developmental processes
18 editions published between 2009 and 2013 in English and Undetermined and held by 99 WorldCat member libraries worldwide
This text offers a comprehensive overview of research into algorithmic selfassembly, RNA folding, the algorithmic foundations for biochemical reactions, and the algorithmic nature of developmental processes
Unconventional Computation and Natural Computation : 15th International Conference, UCNC 2016, Manchester, UK, July 1115,
2016, Proceedings by
UCNC (Conference)(
)
5 editions published in 2016 in English and held by 35 WorldCat member libraries worldwide
This book constitutes the refereed proceedings of the 15th International Conference on Unconventional Computation and Natural Computation, UCNC 2016, held in Manchester, UK, in July 2016. The 15 revised full papers presented together with 5 invited papers were carefully reviewed and selected from 30 submissions. The papers cover a wide range of topics including molecular, cellular, quantum, optical and chaos computing; cellular automata; neural and evolutionary computation; artificial immune systems; Ant algorithms and swarm intelligence; amorphous computing; membrane computing; computational systems biology and computational neuroscience; and synthetic biology.
5 editions published in 2016 in English and held by 35 WorldCat member libraries worldwide
This book constitutes the refereed proceedings of the 15th International Conference on Unconventional Computation and Natural Computation, UCNC 2016, held in Manchester, UK, in July 2016. The 15 revised full papers presented together with 5 invited papers were carefully reviewed and selected from 30 submissions. The papers cover a wide range of topics including molecular, cellular, quantum, optical and chaos computing; cellular automata; neural and evolutionary computation; artificial immune systems; Ant algorithms and swarm intelligence; amorphous computing; membrane computing; computational systems biology and computational neuroscience; and synthetic biology.
Random walks in colored graphs by
Anne Condon(
Book
)
2 editions published in 1992 in English and held by 6 WorldCat member libraries worldwide
Abstract: "We give tight upper and lower bounds on the expected cover time of a random walk in an undirected graph with colored edges. We show that for graphs with two colors the expected cover time is exponential, and that for three or more colors it is double exponential. In addition, we give polynomial bounds in a number of interesting special cases. We describe applications of these results to understanding the eigenvalues of products and weighted averages of matrices, and to problems on timeinhomogeneous Markov chains."
2 editions published in 1992 in English and held by 6 WorldCat member libraries worldwide
Abstract: "We give tight upper and lower bounds on the expected cover time of a random walk in an undirected graph with colored edges. We show that for graphs with two colors the expected cover time is exponential, and that for three or more colors it is double exponential. In addition, we give polynomial bounds in a number of interesting special cases. We describe applications of these results to understanding the eigenvalues of products and weighted averages of matrices, and to problems on timeinhomogeneous Markov chains."
The complexity of stochastic games by
Anne Condon(
Book
)
2 editions published in 1989 in English and held by 4 WorldCat member libraries worldwide
Abstract: "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 is in the class NP [intersect] coNP."
2 editions published in 1989 in English and held by 4 WorldCat member libraries worldwide
Abstract: "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 is in the class NP [intersect] coNP."
On the complexity of the policy iteration algorithm by Mary Melekopoglou(
Book
)
2 editions published in 1990 in English and held by 4 WorldCat member libraries worldwide
Abstract: "We consider a natural class of algorithms for simple stochastic games. It has been proved that the problem of deciding which player has the greatest chance of winning the game is in the class NP [intersect] coNP. It is not known whether the problem is in P. We examine a number of local search algorithms, called policy iteration algorithms, which solve this problem, and prove that these algorithms require exponential time in the worst case."
2 editions published in 1990 in English and held by 4 WorldCat member libraries worldwide
Abstract: "We consider a natural class of algorithms for simple stochastic games. It has been proved that the problem of deciding which player has the greatest chance of winning the game is in the class NP [intersect] coNP. It is not known whether the problem is in P. We examine a number of local search algorithms, called policy iteration algorithms, which solve this problem, and prove that these algorithms require exponential time in the worst case."
Special issue on Computational Complexity 2002 : [selected contributions to the 17th Annual IEEE Conference on Computational
Complexity (CCC 2002)] by
2002, Montréal> Conference on Computational Complexity. <17(
Book
)
2 editions published in 2004 in English and held by 4 WorldCat member libraries worldwide
2 editions published in 2004 in English and held by 4 WorldCat member libraries worldwide
Realistic analysis of parallel dynamic programming algorithms by Gary Lewandowski(
Book
)
1 edition published in 1992 in English and held by 4 WorldCat member libraries worldwide
The algorithms we consider are a pipeline algorithm, where each processor i computes in order the entries of rows i, i + p and so on, where p is the number of processors; and a diagonal algorithm, where entries along each diagonal extending from the left to the top of the table are computed in turn. It is likely that the techniques used here can be used in the analysis of other algorithms that use barriers or pipelining techniques."
1 edition published in 1992 in English and held by 4 WorldCat member libraries worldwide
The algorithms we consider are a pipeline algorithm, where each processor i computes in order the entries of rows i, i + p and so on, where p is the number of processors; and a diagonal algorithm, where entries along each diagonal extending from the left to the top of the table are computed in turn. It is likely that the techniques used here can be used in the analysis of other algorithms that use barriers or pipelining techniques."
Upper bounds on the complexity of space bounded interactive proofs by
Anne Condon(
Book
)
2 editions published in 1989 in English and held by 4 WorldCat member libraries worldwide
2 editions published in 1989 in English and held by 4 WorldCat member libraries worldwide
The complexity of the max word problem and the power of oneway interactive proof systems by
Anne Condon(
Book
)
2 editions published in 1990 in English and held by 4 WorldCat member libraries worldwide
Abstract: "We study the complexity of the max word problem for matrices, a variation of the wellknown word problem for matrices. We show that the problem is NPcomplete, and cannot be approximated within any constant factor, unless P = NP. We describe applications of this result to probabilistic finite state automata, rational series and kregular sequences. Our proof is novel in that it employs the theory of interactive proof systems, rather than a standard reduction argument. As another consequence of our results, we characterize NP exactly in terms of oneway interactive proof systems."
2 editions published in 1990 in English and held by 4 WorldCat member libraries worldwide
Abstract: "We study the complexity of the max word problem for matrices, a variation of the wellknown word problem for matrices. We show that the problem is NPcomplete, and cannot be approximated within any constant factor, unless P = NP. We describe applications of this result to probabilistic finite state automata, rational series and kregular sequences. Our proof is novel in that it employs the theory of interactive proof systems, rather than a standard reduction argument. As another consequence of our results, we characterize NP exactly in terms of oneway interactive proof systems."
Playing games of incomplete information by
Jinyi Cai(
Book
)
1 edition published in 1989 in English and held by 3 WorldCat member libraries worldwide
1 edition published in 1989 in English and held by 3 WorldCat member libraries worldwide
On bounded round multiprover interactive proof systems by
Jinyi Cai(
Book
)
1 edition published in 1989 in English and held by 3 WorldCat member libraries worldwide
Abstract: "We compare bounded round multiprover interactive proof systems (MIP's) with unbounded round interactive proof systems (IPS's). We show that for any constant [epsilon], any language accepted by an unbounded round IPS has a bounded round, 2prover MIP that has error probability [epsilon], resolving an open problem of Fortnow, Rompel and Sipser [7]. To obtain this result, we show that a certain 1round MIP that simulates the computation of an unbounded round IPS can be executed many times in parallel to significantly reduce its probability of error."
1 edition published in 1989 in English and held by 3 WorldCat member libraries worldwide
Abstract: "We compare bounded round multiprover interactive proof systems (MIP's) with unbounded round interactive proof systems (IPS's). We show that for any constant [epsilon], any language accepted by an unbounded round IPS has a bounded round, 2prover MIP that has error probability [epsilon], resolving an open problem of Fortnow, Rompel and Sipser [7]. To obtain this result, we show that a certain 1round MIP that simulates the computation of an unbounded round IPS can be executed many times in parallel to significantly reduce its probability of error."
Seventh International Meeting on DNABased Computers : [held from June 10  13, 2001 at the University of South Florida] by
International Workshop on DNABased Computers(
Book
)
1 edition published in 2002 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 2002 in English and held by 2 WorldCat member libraries worldwide
Seventh international meeting on DNAbased computers : special issue by International meeting on DNAbased computers(
Book
)
1 edition published in 2002 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 2002 in English and held by 2 WorldCat member libraries worldwide
Experiments with parallel graph coloring heuristics by Gary Lewandowski(
Book
)
1 edition published in 1994 in English and held by 2 WorldCat member libraries worldwide
Abstract: "We report on experiments with a new hybrid graph coloring algorithm, which combines a parallel version of Morgenstern's S Impasse algorithm [20], with exhaustive search. We contribute new test data arising in five different application domains, including register allocation and class scheduling. We test our algorithms both on this test data and on several types of randomly generated graphs. We compare our parallel implementation, which is done on the CM5, with two simple heuristics, the Saturation algorithm of Brélaz [4] and the Recursive Largest First (RLF) algorithm of Leighton [18]. We also compare our results with previous work reported by Morgenstern [20] and Johnson et al. [13]. Our main results are as follows: On the randomly generated graphs, the performance of Hybrid is consistently better than the sequential algorithms, both in terms of speed and number of colorings produced. However, on large random graphs, our algorithms do not come close to the best colorings found by other timeintensive algorithms such as the XRLF algorithm of Johnson et al. [13] and Morgenstern's tuned SImpasse algorithm. Of the five types of test data, three are easily colored even by the simple RLF and Saturation heuristics; one (the class scheduling data) is optimally colored by Hybrid but not by the simple heuristics, and one appears to be very hard. However, it should not be concluded that coloring is 'easy' in most applications. In several cases, such as the class and exam scheduling graphs, finding an optimal coloring is not sufficient to solve the problem at hand, but rather colorings satisfying additional restrictions are really needed. The Hybrid algorithm parallelizes well. This appears to be for three main reasons. First, the number of iterations needed by the Simpasse decreases as the number of processors increase. Second, in the exhaustive search algorithm the work involved in expanding the search tree is effectively shared among the processors. Third, on some tests, the SImpasse and ExhaustiveSearch procedures progress in a symbiotic fashion, one using a good coloring obtained by the other as a basis for further improvement. Overall, we are satisfied that our parallel algorithm effectively exploits the processing power of the CM5, and that further work on a hybrid algorithm can lead to even better results. Since the performance of all the implemented algorithms on random graphs does not correlate well with their performance on application data, we conclude that further effort spent in collecting application data is well justified, and suggest that new generators, which model the structure of application data, be investigated."
1 edition published in 1994 in English and held by 2 WorldCat member libraries worldwide
Abstract: "We report on experiments with a new hybrid graph coloring algorithm, which combines a parallel version of Morgenstern's S Impasse algorithm [20], with exhaustive search. We contribute new test data arising in five different application domains, including register allocation and class scheduling. We test our algorithms both on this test data and on several types of randomly generated graphs. We compare our parallel implementation, which is done on the CM5, with two simple heuristics, the Saturation algorithm of Brélaz [4] and the Recursive Largest First (RLF) algorithm of Leighton [18]. We also compare our results with previous work reported by Morgenstern [20] and Johnson et al. [13]. Our main results are as follows: On the randomly generated graphs, the performance of Hybrid is consistently better than the sequential algorithms, both in terms of speed and number of colorings produced. However, on large random graphs, our algorithms do not come close to the best colorings found by other timeintensive algorithms such as the XRLF algorithm of Johnson et al. [13] and Morgenstern's tuned SImpasse algorithm. Of the five types of test data, three are easily colored even by the simple RLF and Saturation heuristics; one (the class scheduling data) is optimally colored by Hybrid but not by the simple heuristics, and one appears to be very hard. However, it should not be concluded that coloring is 'easy' in most applications. In several cases, such as the class and exam scheduling graphs, finding an optimal coloring is not sufficient to solve the problem at hand, but rather colorings satisfying additional restrictions are really needed. The Hybrid algorithm parallelizes well. This appears to be for three main reasons. First, the number of iterations needed by the Simpasse decreases as the number of processors increase. Second, in the exhaustive search algorithm the work involved in expanding the search tree is effectively shared among the processors. Third, on some tests, the SImpasse and ExhaustiveSearch procedures progress in a symbiotic fashion, one using a good coloring obtained by the other as a basis for further improvement. Overall, we are satisfied that our parallel algorithm effectively exploits the processing power of the CM5, and that further work on a hybrid algorithm can lead to even better results. Since the performance of all the implemented algorithms on random graphs does not correlate well with their performance on application data, we conclude that further effort spent in collecting application data is well justified, and suggest that new generators, which model the structure of application data, be investigated."
Pspace is provable by two provers in one round by
Jinyi Cai(
Book
)
1 edition published in 1991 in English and held by 2 WorldCat member libraries worldwide
Abstract: "We show that every language in PSPACE, or equivalently every language accepted by an unbounded round interactive proof system, has a 1round, 2prover interactive proof with exponentially small error probability. To obtain this result, we prove the correctness of a simple but powerful method for parallelizing 2prover interactive proofs to reduce their error."
1 edition published in 1991 in English and held by 2 WorldCat member libraries worldwide
Abstract: "We show that every language in PSPACE, or equivalently every language accepted by an unbounded round interactive proof system, has a 1round, 2prover interactive proof with exponentially small error probability. To obtain this result, we prove the correctness of a simple but powerful method for parallelizing 2prover interactive proofs to reduce their error."
On the power of finite automata with both nondeterministic and probabilistic states(
Book
)
1 edition published in 1994 in English and held by 2 WorldCat member libraries worldwide
Abstract: "We study finite automata with both nondeterministic and random states (npfa's). We restrict our attention to those npfa's that accept their languages with a small probability of error and run in polynomial expected time. Equivalently, we study ArthurMerlin games where Arthur is limited to polynomial time and constant space. Dwork and Stockmeyer asked whether these npfa's accept only the regular languages (this was known if the automaton has only randomness or only nondeterminism). We show that the answer is yes in the case of npfa's with a 1way input head. We also show that if L is a nonregular language, then either L or [overline]L is not accepted by any npfa with a 2way input head. Toward this end, we define a new measure of the complexity of a language L, called is 1tiling complexity. For each n, this is the number of tiles needed to cover the 1's in the 'characteristic matrix' of L, namely the binary matrix with a row and column for each string of length [<or =] n, where entry [x, y] = 1 if and only if the string xy [member of] L. We show that a language has constant 1tiling complexity if and only if it is regular, from which the result on 1way input follows. Our main result regarding the general 2way input tape follows by contrasting two bounds: an upper bound of polylog(n) on the 1tiling complexity of every language computed by our model, and a lower bound stating that the 1 tiling complexity of a nonregular language or its complement exceeds a function in 2[superscript [omega][square root of log n]] infinitely often. The last lower bound follows by proving that the characteristic matrix of every nonregular language has rank n for infinitely many n. This is our main technical result, and its proof extends techniques of Frobenius and Iohvidov developed for Hankel matrices."
1 edition published in 1994 in English and held by 2 WorldCat member libraries worldwide
Abstract: "We study finite automata with both nondeterministic and random states (npfa's). We restrict our attention to those npfa's that accept their languages with a small probability of error and run in polynomial expected time. Equivalently, we study ArthurMerlin games where Arthur is limited to polynomial time and constant space. Dwork and Stockmeyer asked whether these npfa's accept only the regular languages (this was known if the automaton has only randomness or only nondeterminism). We show that the answer is yes in the case of npfa's with a 1way input head. We also show that if L is a nonregular language, then either L or [overline]L is not accepted by any npfa with a 2way input head. Toward this end, we define a new measure of the complexity of a language L, called is 1tiling complexity. For each n, this is the number of tiles needed to cover the 1's in the 'characteristic matrix' of L, namely the binary matrix with a row and column for each string of length [<or =] n, where entry [x, y] = 1 if and only if the string xy [member of] L. We show that a language has constant 1tiling complexity if and only if it is regular, from which the result on 1way input follows. Our main result regarding the general 2way input tape follows by contrasting two bounds: an upper bound of polylog(n) on the 1tiling complexity of every language computed by our model, and a lower bound stating that the 1 tiling complexity of a nonregular language or its complement exceeds a function in 2[superscript [omega][square root of log n]] infinitely often. The last lower bound follows by proving that the characteristic matrix of every nonregular language has rank n for infinitely many n. This is our main technical result, and its proof extends techniques of Frobenius and Iohvidov developed for Hankel matrices."
Asynchronous analysis of parallel dynamic programming algorithms by Gary Lewandowski(
Book
)
1 edition published in 1994 in English and held by 2 WorldCat member libraries worldwide
Abstract: "We examine a very simple asynchronous model of parallel computation that assumes the time to compute a task is random, following some probability distribution. The goal of this model is to capture the effects of unpredictable delays on processors, due to communication delays or cache misses, for example. Using techniques from queueing theory and occupancy problems, we use this model to analyze two parallel dynamic programming algorithms. We show that this model is both simple to analyze and accurately predicts which algorithm will perform better in practice. The algorithms we consider are a pipeline algorithm, where each processor i computes in order the entries of rows, i, i+p and so on, where p is the number of processors; and a diagonal algorithm, where entries along each diagonal extending from the left to the top of the table are computed in turn. It is likely that the techniques used here can be useful in the analysis of other algorithms that use barriers or pipelining techniques."
1 edition published in 1994 in English and held by 2 WorldCat member libraries worldwide
Abstract: "We examine a very simple asynchronous model of parallel computation that assumes the time to compute a task is random, following some probability distribution. The goal of this model is to capture the effects of unpredictable delays on processors, due to communication delays or cache misses, for example. Using techniques from queueing theory and occupancy problems, we use this model to analyze two parallel dynamic programming algorithms. We show that this model is both simple to analyze and accurately predicts which algorithm will perform better in practice. The algorithms we consider are a pipeline algorithm, where each processor i computes in order the entries of rows, i, i+p and so on, where p is the number of processors; and a diagonal algorithm, where entries along each diagonal extending from the left to the top of the table are computed in turn. It is likely that the techniques used here can be useful in the analysis of other algorithms that use barriers or pipelining techniques."
DNA computing : new computing paradigms by
Gheorghe Păun(
)
1 edition published in 2001 in English and held by 0 WorldCat member libraries worldwide
This is the first text and monograph about DNA computing, a molecular approach that might revolutionize our thinking and ideas about computing. Although it is too soon to predict whether computer hardware is likely to change from silicon to carbon and from microchips to DNA molecules, the theoretical premises have already been studied extensively. The book starts with an introduction to DNArelated matters, the basics of biochemistry and language and computation theory, and progresses to the advanced mathematical theory of DNA computing. Apart from being wellknown scientists, all three authors are known for their lucid writing. Many of their previous books have become classics in their field, and this book too is sure to follow their example
1 edition published in 2001 in English and held by 0 WorldCat member libraries worldwide
This is the first text and monograph about DNA computing, a molecular approach that might revolutionize our thinking and ideas about computing. Although it is too soon to predict whether computer hardware is likely to change from silicon to carbon and from microchips to DNA molecules, the theoretical premises have already been studied extensively. The book starts with an introduction to DNArelated matters, the basics of biochemistry and language and computation theory, and progresses to the advanced mathematical theory of DNA computing. Apart from being wellknown scientists, all three authors are known for their lucid writing. Many of their previous books have become classics in their field, and this book too is sure to follow their example
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Rozenberg, Grzegorz Other Editor
 Amos, Martyn Other Editor
 Kok, Joost N. Editor
 Harel, David Editor
 Winfree, Erik Editor
 Salomaa, Arto Editor
 International Workshop on DNABased Computers <6, 2000, Leiden>
 SpringerLink (Online service)
 Lipton, Richard J.
 Cai, Jinyi 1961 Author
Associated Subjects
Algorithms Artificial intelligence Automatic theorem proving Bioinformatics BiologyData processing Computational complexity Computer logic Computer networks Computers Computer science Computer software Cytology Dynamic programming Electronic data processing Game theory Game theoryComputer simulation Game theoryData processing Graph theory Information theory Information theory in biology Logic, Symbolic and mathematical Markov processes Matrices Molecular biologyMathematical models Molecular computers Nanotechnology Natural computation NPcomplete problems Parallel programming (Computer science) Proof theory Soft computing Stochastic processes Structural bioinformatics