Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Cryan, Mary - Laboratory for Foundations of Computer Science, School of Informatics, University of Edinburgh
EVOLUTIONARY TREES CAN BE LEARNED IN POLYNOMIAL TIME IN THE TWOSTATE GENERAL MARKOV MODEL #
Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows
A Polynomial-time Algorithm to Approximately Count Contingency Tables
APPROXIMATELY COUNTING INTEGRAL FLOWS AND CELL-BOUNDED CONTINGENCY TABLES
Polynomialtime Algorithm to Approximately Count Contingency Tables when the Number of Rows
APPROXIMATION ALGORITHMS FOR THE FIXEDTOPOLOGY PHYLOGENETIC NUMBER PROBLEM \Lambda
Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows #
Discrete Mathematics and Theoretical Computer Science DMTCS vol. (subm.), by the authors, 11 The number of Euler tours of a random
EVOLUTIONARY TREES CAN BE LEARNED IN POLYNOMIAL TIME IN THE TWO-STATE GENERAL MARKOV MODEL
Random Walks on the Vertices of Transportation Polytopes with Constant Number of Sources
On pseudorandom generators in NC 0# Mary Cryan and Peter Bro Miltersen