Mary Cryan

发表

Approximately counting integral flows and cell-bounded contingency tables

Martin E. Dyer, Dana Randall, Mary Cryan, 2005, STOC '05.

Evolutionary trees can be learned in polynomial time in the two-state general Markov model

Paul W. Goldberg, Leslie Ann Goldberg, Mary Cryan, 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows

Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, 2006, SIAM J. Comput..

Exact counting of Euler tours for generalized series-parallel graphs pdf

Russell Martin, Mary Cryan, Prasad Chebolu, 2012, J. Discrete Algorithms.

On Pseudorandom Generators in NC

Peter Bro Miltersen, Mary Cryan, Mary Cryan, 2001, MFCS.

Notes on Dynamic Programming Algorithms & Data Structures

Mary Cryan, 2012 .

Random walks on the vertices of transportation polytopes with constant number of sources

Martin E. Dyer, Leen Stougie, Haiko Müller, 2003, SODA '03.

Michael Mitzenmacher and Eli Upfal. Probability and computing: Randomized algorithms and probabilistic analysis . Cambridge University Press, Cambridge, 2005, 386 pp.

Mary Cryan, 2006 .

A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant

Martin Dyer, Mary Cryan, 2003, J. Comput. Syst. Sci..

Approximation Algorithms for the Fixed-Topology Phylogenetic Number Problem

Cynthia A. Phillips, Leslie Ann Goldberg, Mary Cryan, 1997, Algorithmica.

Constructing a Normal Form for Property Theory

Allan Ramsay, Mary Cryan, 1997, CADE.

Evolutionary Trees Can be Learned in Polynomial Time in the Two-State General Markov Model

Paul W. Goldberg, Leslie Ann Goldberg, Mary Cryan, 2001, SIAM J. Comput..

The Number of Euler Tours of Random Directed Graphs

Páidí Creed, Mary Cryan, 2013, Electron. J. Comb..

Modified log-Sobolev Inequalities for Strongly Log-Concave Distributions

Heng Guo, Mary Cryan, Giorgos Mousa, 2019, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS).

Approximately Counting Integral Flows and Cell-Bounded Contingency Tables

Martin E. Dyer, Dana Randall, Mary Cryan, 2010, SIAM J. Comput..

Approximation Algorithms for the Fixed-Topology Phylogenetic Number Problem

Cynthia A. Phillips, Leslie Ann Goldberg, Mary Cryan, 1997, CPM.

A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant

Martin E. Dyer, Mary Cryan, M. Dyer, 2002, STOC '02.

DMTCS Proceedings, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10)

Páidí Creed, Mary Cryan, 2010 .

Exact counting of Euler Tours for Graphs of Bounded Treewidth pdf

Russell Martin, Mary Cryan, Prasad Chebolu, 2013, ArXiv.

Rapidly mixing Markov chains for sampling contingency tables with a constant number of rows

Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

Modified log-Sobolev inequalities for strongly log-concave distributions

Heng Guo, Mary Cryan, Giorgos Mousa, 2021, The Annals of Probability.

The number of Euler tours of a random regular graph

Páidí Creed, Mary Cryan, Mary Cryan, 2013 .