Anne Condon

Q: What Schools Are Affiliated With Anne Condon

Anne Condon is affiliated with the following schools: National University of Ireland, University of British Columbia, University of Wisconsin–Madison, University of Washington

Anne Condon's AcademicInfluence.com Rankings

Anne Condon

Computer Science

#2381

World Rank

#2486

Historical Rank

Database

#7813

World Rank

#8126

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Anne Condon's Degrees

Bachelors Computer Science National University of Ireland

Similar Degrees You Can Earn

Why Is Anne Condon Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Anne Elizabeth Condon, is an Irish-Canadian computer scientist, professor, and former head of the Computer Science Department of the University of British Columbia. Her research focuses on computational complexity theory, DNA computing, and bioinformatics. She has also held the NSERC/General Motors Canada Chair for Women in Science and Engineering from 2004 to 2009, and has worked to improve the success of women in the sciences and engineering.

(See a Problem?)

Anne Condon's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

The Complexity of Stochastic Games (1992) (534)
Algorithms for graph partitioning on the planted partition model (1999) (500)
DNA computing on surfaces (2000) (451)
On the Undecidability of Probabilistic Planning and Infinite-Horizon Partially Observable Markov Decision Problems (1999) (277)
On combinatorial DNA word design (1999) (263)
HotKnots: heuristic prediction of RNA secondary structures including pseudoknots. (2005) (262)
RNA STRAND: The RNA Secondary Structure and Statistical Analysis Database (2008) (260)
Interpretable dimensionality reduction of single cell transcriptome data with deep generative models (2017) (246)
On the undecidability of probabilistic planning and related stochastic optimization problems (2003) (245)
Demonstration of a word design strategy for DNA computing on surfaces. (1997) (208)
Secondary structure prediction of interacting RNA molecules. (2005) (193)
On Algorithms for Simple Stochastic Games (1990) (192)
Efficient parameter estimation for RNA secondary structure prediction (2007) (175)
A new algorithm for RNA secondary structure design. (2004) (162)
Feature-based classifiers for somatic mutation detection in tumour–normal paired sequencing data (2011) (151)
RNAsoft: a suite of RNA secondary structure prediction and design software tools (2003) (143)
Designed DNA molecules: principles and applications of molecular nanotechnology (2006) (126)
On the complexity of space bounded interactive proofs (1989) (119)
Computational approaches for RNA energy parameter estimation. (2010) (111)
Classifying RNA pseudoknotted structures (2004) (100)
A surface-based approach to DNA computation (1996) (100)
DNA models and algorithms for NP-complete problems (1996) (97)
Strand design for biomolecular computation (2002) (93)
Systematic analysis of somatic mutations impacting gene expression in 12 tumour types (2015) (92)
Improved free energy parameters for RNA pseudoknotted secondary structure prediction. (2010) (90)
Stochastic Local Search Algorithms for DNA Word Design (2002) (87)
Specifying and Verifying a Broadcast and a Multicast Snooping Cache Coherence Protocol (2002) (82)
Lamport clocks: verifying a directory cache-coherence protocol (1998) (82)
Computational models of games (1989) (81)
Parallel implementation of Bouvka's minimum spanning tree algorithm (1996) (78)
Random debaters and the hardness of approximating stochastic functions (1994) (74)
Experiments with parallel graph coloring heuristics and applications of graph coloring (1993) (68)
Thermodynamically based DNA strand design (2005) (64)
Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions (1993) (59)
Algorithmic Bioprocesses (2009) (58)
Two-sided matching with partial information (2013) (54)
Computational RNA secondary structure design: empirical complexity and improved methods (2007) (50)
Probabilistic Game Automata (1986) (50)
Analysis of energy-based algorithms for RNA secondary structure prediction (2012) (48)
On the Complexity of the Policy Improvement Algorithm for Markov Decision Processes (1994) (46)
A thermodynamic approach to designing structure-free combinatorial DNA word sets (2005) (46)
The determination of RNA folding nearest neighbor parameters. (2014) (45)
PSPACE is provable by two provers in one round (1991) (44)
An O(n5) Algorithm for MFE Prediction of Kissing Hairpins and 4-Chains in Nucleic Acids (2009) (44)
Initial association of NR2E1 with bipolar disorder and identification of candidate mutations in bipolar disorder, schizophrenia, and aggression through resequencing (2008) (42)
From RNA Secondary Structure to Coding Theory: A Combinatorial Approach (2002) (41)
Using Lamport clocks to reason about relaxed memory models (1999) (38)
Revenue monotonicity in combinatorial auctions (2007) (37)
Automatable Verification of Sequential Consistency (2001) (36)
Algorithms for testing that sets of DNA words concatenate without secondary structure (2002) (34)
Probabilistically Checkable Debate Systems and Nonapproximability of PSPACE-Hard Functions (1995) (34)
Revenue monotonicity in deterministic, dominant-strategy combinatorial auctions (2011) (33)
Space and Energy Efficient Computation with DNA Strand Displacement Systems (2012) (33)
On the Power of Finite Automata with Both Nondeterministic and Probabilistic States (1998) (32)
Progress toward demonstration of a surface based DNA computation: a one word approach to solve a model satisfiability problem. (1999) (32)
On bounded round multiprover interactive proof systems (1990) (31)
Space bounded probabilistic game automata (1988) (31)
Parsing Nucleic Acid Pseudoknotted Secondary Structure: Algorithm and Applications (2007) (30)
densityCut: an efficient and versatile topological approach for automatic clustering of biological data (2016) (30)
Surface-based DNA computing operations: DESTROY and READOUT. (1999) (29)
A fast and robust iterative algorithm for prediction of RNA pseudoknotted secondary structures (2014) (28)
Novel and Efficient RNA Secondary Structure Prediction Using Hierarchical Folding (2008) (27)
Less haste, less waste: on recycling and its limits in strand displacement systems (2011) (25)
Problems on RNA Secondary Structure Prediction and Design (2003) (24)
The Complexity of Space Boundes Interactive Proof Systems (1993) (24)
Power of surface-based DNA computation (1997) (24)
Playing Games of Incomplete Information (1990) (22)
Linear Time Algorithm for Parsing RNA Secondary Structure (2005) (22)
An Algorithm for the Energy Barrier Problem Without Pseudoknots and Temporary Arcs (2010) (22)
Flow algorithms for two pipelined filter ordering problems (2006) (20)
Algorithms for distributional and adversarial pipelined filter ordering problems (2009) (20)
NP-completeness of the energy barrier problem without pseudoknots and temporary arcs (2011) (19)
Reasoning about optimal stable matchings under partial information (2014) (18)
Approximate majority analyses using tri-molecular chemical reaction networks (2019) (17)
HFold: RNA Pseudoknotted Secondary Structure Prediction Using Hierarchical Folding (2007) (17)
On Games of Incomplete Information (1992) (17)
Asynchronous Analysis of Parallel Dynamic Programming Algorithms (1996) (16)
Interactive proof systems with polynomially bounded strategies (1992) (16)
The Complexity of the Max Word Problem (1991) (15)
The power of surface-based DNA computation (extended abstract) (1997) (15)
A theory of strict P-completeness (1992) (14)
Lamport Clocks : Reasoning About Shared Memory Correctness (1998) (14)
The complexity of the max word problem and the power of one-way interactive proof systems (1991) (13)
Multiple word DNA computing on surfaces (2000) (13)
Complexity of a Collision-Aware String Partition Problem and Its Relation to Oligo Design for Gene Synthesis (2008) (13)
Reachability bounds for chemical reaction networks and strand displacement systems (2012) (12)
Will biologists become computer scientists? (2018) (12)
NP-Completeness of the Direct Energy Barrier Problem without Pseudoknots (2009) (12)
Automata make antisense (2004) (12)
The complexity of string partitioning (2012) (12)
Toward a decidable notion of sequential consistency (2003) (11)
Efficient codon optimization with motif engineering (2011) (11)
Lamport Clocks: Reasoning About Shared Memory Correctness1 (1999) (11)
On approximation algorithms for hierarchical MAX-SAT (1995) (11)
Random walks on colored graphs (1993) (11)
DNA Computing on Surfaces : the Chemical Implementation (2000) (11)
A system-level specification framework for I/O architectures (1999) (11)
Complexity of Sub-Bus Mesh Computations (1996) (10)
Stepwise randomized combinatorial auctions achieve revenue monotonicity (2009) (10)
Bounded Error Probabilistic Finite State Automata (2001) (10)
Inferring Parameters for an Elementary Step Model of DNA Structure Kinetics with Locally Context-Dependent Arrhenius Rates (2017) (9)
Proving sequential consistency by model checking (2001) (9)
Computational prediction of nucleic acid secondary structure: Methods, applications, and challenges (2009) (8)
Interpretable dimensionality reduction of single cell transcriptome data with deep generative models (2018) (8)
Molecular programming: DNA and the brain (2011) (8)
Approximate solutions to problems in PSPACE (1995) (7)
Simplifying Analyses of Chemical Reaction Networks for Approximate Majority (2017) (7)
Upper and Lower Bounds for Selection on the Mesh (1994) (7)
Output-Oblivious Stochastic Chemical Reaction Networks (2018) (7)
On the power of finite automata with both nondeterministic and probabilistic states (preliminary version) (1994) (6)
A limit theorem for sets of stochastic matrices (2004) (6)
Women in Computing (2008) (5)
RNA Molecules: Glimpses Through an Algorithmic Lens (2006) (5)
On the Design of Oligos for Gene Synthesis (2007) (4)
Efficient Parameter Estimation for DNA Kinetics Modeled as Continuous-Time Markov Chains (2019) (4)
DNA Computing: 6th International Workshop on DNA-Based Computers, DNA 2000, Leiden, The Netherlands, June 13-17, 2000. Revised Papers (2001) (3)
A new model for approximating RNA folding trajectories and population kinetics (2013) (3)
Error-Free Stable Computation with Polymer-Supplemented Chemical Reaction Networks (2019) (3)
Automatic Verification of Sequential Consistency for Unbounded Addresses and Data Values (2004) (3)
Asynchronous analysis of parallel dynamic programming (1993) (3)
Unconventional Computation and Natural Computation (2016) (2)
Composable Computation in Leaderless, Discrete Chemical Reaction Networks (2020) (2)
On Low Energy Barrier Folding Pathways for Nucleic Acid Sequences (2015) (2)
Toward Space- and Energy-Efficient Computations (2019) (2)
Automatable Verification of Sequential Consistency [ Extended (2001) (1)
Revised Papers from the 6th International Workshop on DNA-Based Computers: DNA Computing (2000) (1)
Programming with Chemical Reaction Networks: Mathematical Foundations (2016) (1)
Unconventional Computation and Natural Computation : 15th International Conference, UCNC 2016, Manchester, UK, July 11-15, 2016, Proceedings (2016) (1)
Reachability bounds for chemical reaction networks and strand displacement systems (2013) (1)
Isometric Hamming embeddings of weighted graphs (2021) (1)
Preface (2018) (1)
Factorization and pseudofactorization of weighted graphs (2021) (1)
Experiments on parallel graph coloring and applications (1994) (1)
Analysis of energy-based algorithms for RNA secondary structure prediction (2012) (1)
Proceedings of the 15th International Conference on Unconventional Computation and Natural Computation - Volume 9726 (2016) (0)
Predicting Minimum Free Energy Structures of Multi-Stranded Nucleic Acid Complexes Is APX-Hard (2021) (0)
Approximate majority analyses using tri-molecular chemical reaction networks (2019) (0)
A Coupled Reconfiguration Mechanism for Single-Stranded DNA Strand Displacement Systems (2022) (0)
Weakly Growing Context-sensitive Grammars Chicago Journal of Theoretical Computer Science (1996) (0)
The Biology-Combinatorics Interface: Addressing new challenges in computational biology (2008) (0)
Design of nucleic acid strands with long low-barrier folding pathways (2017) (0)
Computational Challenges and Opportunities in the Design of Unconventional Machines from Nucleic Acids (2008) (0)
Design of nucleic acid strands with long low-barrier folding pathways (2017) (0)
Design and implementation of parallel graph algorithms for minimum spanning tree, list ranking, and root finding on trees (1998) (0)
AlignOT: An optimal transport based algorithm for fast 3D alignment with applications to cryogenic electron microscopy density maps (2022) (0)
The CRA Distributed Mentor Project: Mentoring Undergraduate Women in Computer Science and Computer Engineering (2006) (0)
On Design and Analysis of Chemical Reaction Network Algorithms (2018) (0)
Preliminary Draft of SPAA ’ 99 Submission A System-Level Specification Framework for I / O Ar chitectures 1 (1999) (0)
The pathway elaboration method for mean first passage time estimation in large continuous-time Markov chains with applications to nucleic acid kinetics (2021) (0)
Self-stabilization by Tree Correction (info) Self-stabilization by Tree Correction (info) Self-stabilization by Tree Correction (1995) (0)
An O(n 5 ) algorithm for predicting RNA kissing hairpins (2011) (0)
Predicting DNA kinetics with a truncated continuous-time Markov chain method. (2023) (0)
Finding MFE Structures Formed by Nucleic Acid Strands in a Combinatorial Set (2006) (0)
Probabilistic Game Automata ( Preliminary Version ) (0)
A fast and robust iterative algorithm for prediction of RNA pseudoknotted secondary (2014) (0)
Preface (2018) (0)
Finding local RNA motifs using covariance models (2006) (0)
Pspace-hard Functions Checkable Debate Systems and Approximation Algorithms for Pspace (2007) (0)
Strategic directions in research in theory of computing (1997) (0)
Linear Time Algorithm for Parsing RNA Secondary Structure Extended Abstract (2005) (0)
Mathematisches Forschungsinstitut Oberwolfach Proving Hard-core Predicates Using List Decoding Proving Integrality Gaps without Knowing the Linear Program How to Go beyond the Black-box Simulation Barrier Derandomization in Cryptography Formula Caching Proof Systems Algebras of Minimal Rank over Arb (2003) (0)
Guest Editors’ Foreword (2002) (0)

This paper list is powered by the following services:

Other Resources About Anne Condon

What Schools Are Affiliated With Anne Condon?

Anne Condon is affiliated with the following schools:

Anne Condon's Academic­Influence.com Rankings