Constructing a Normal Form for Property Theory. - Mary Cryan; Allan Ramsay (CADE, 1997)

Approximation Algorithms for the Fixed-Topology Phylogenetic Number Problem. - Mary Cryan; Leslie Ann Goldberg; Cynthia A. Phillips (Algorithmica, 1999)

Learning and approximation algorithms for problems motivated by evolutionary trees. - Mary Elizabeth Cryan (1999)

On Pseudorandom Generators in NC. - Mary Cryan; Peter Bro Miltersen (MFCS, 2001)

Evolutionary Trees Can be Learned in Polynomial Time in the Two-State General Markov Model. - Mary Cryan; Leslie Ann Goldberg; Paul W. Goldberg (SIAM J. Comput., 2001)

A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant. - Mary Cryan; Martin E. Dyer (J. Comput. Syst. Sci., 2003)

Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows. - Mary Cryan; Martin E. Dyer; Leslie Ann Goldberg; Mark Jerrum; Russell A. Martin (SIAM J. Comput., 2006)

Preface. - Mary Cryan; Martin Farach-Colton (Theor. Comput. Sci., 2007)

Random walks on the vertices of transportation polytopes with constant number of sources. - Mary Cryan; Martin E. Dyer; Haiko Müller; Leen Stougie (Random Struct. Algorithms, 2008)

Approximately Counting Integral Flows and Cell-Bounded Contingency Tables. - Mary Cryan; Martin E. Dyer; Dana Randall (SIAM J. Comput., 2010)

The number of Euler tours of a random directed graph - Páidí Creed; Mary Cryan (CoRR, 2012)

Exact counting of Euler tours for generalized series-parallel graphs. - Prasad Chebolu; Mary Cryan; Russell Martin (J. Discrete Algorithms, 2012)

The Number of Euler Tours of Random Directed Graphs. - Páidí Creed; Mary Cryan (Electron. J. Comb., 2013)

Exact counting of Euler Tours for Graphs of Bounded Treewidth. - Prasad Chebolu; Mary Cryan; Russell Martin (CoRR, 2013)

Modified log-Sobolev Inequalities for Strongly Log-Concave Distributions. - Mary Cryan; Heng Guo 001; Giorgos Mousa (FOCS, 2019)