Mary Cryan

Publication Activity (10 Years)

Years Active: 1997-2019
Publications (10 Years): 2

Top Topics

Monadic Datalog

Linear Inequalities

Randomly Distributed

Top Venues

Electron. J. Comb.

J. Discrete Algorithms

Publications

Mary Cryan, Heng Guo, Giorgos Mousa
Modified log-Sobolev Inequalities for Strongly Log-Concave Distributions. FOCS (2019)
Mary Cryan, Heng Guo, Giorgos Mousa
Modified log-Sobolev inequalities for strongly log-concave distributions. CoRR (2019)
Páidí Creed, Mary Cryan
The Number of Euler Tours of Random Directed Graphs. Electron. J. Comb. 20 (3) (2013)
Prasad Chebolu, Mary Cryan, Russell Martin
Exact counting of Euler Tours for Graphs of Bounded Treewidth. CoRR (2013)
Páidí Creed, Mary Cryan
The number of Euler tours of a random directed graph CoRR (2012)
Prasad Chebolu, Mary Cryan, Russell Martin
Exact counting of Euler tours for generalized series-parallel graphs. J. Discrete Algorithms 10 (2012)
Mary Cryan, Martin E. Dyer, Dana Randall
Approximately Counting Integral Flows and Cell-Bounded Contingency Tables. SIAM J. Comput. 39 (7) (2010)
Prasad Chebolu, Mary Cryan, Russell A. Martin
Exact counting of Euler Tours for generalized series-parallel graphs CoRR (2010)
Mary Cryan, Martin E. Dyer, Haiko Müller, Leen Stougie
Random walks on the vertices of transportation polytopes with constant number of sources. Random Struct. Algorithms 33 (3) (2008)
Mary Cryan, Martin Farach-Colton
Preface. Theor. Comput. Sci. 382 (2) (2007)
Mary Cryan, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Russell A. Martin
Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows. SIAM J. Comput. 36 (1) (2006)
Mary Cryan, Martin E. Dyer, Dana Randall
Approximately counting integral flows and cell-bounded contingency tables. STOC (2005)
Mary Cryan, Martin E. Dyer
A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant. J. Comput. Syst. Sci. 67 (2) (2003)
Mary Cryan, Martin E. Dyer, Haiko Müller, Leen Stougie
Random walks on the vertices of transportation polytopes with constant number of sources. SODA (2003)
Mary Cryan, Martin E. Dyer
A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant. STOC (2002)
Mary Cryan, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Russell A. Martin
Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows. FOCS (2002)
Mary Cryan, Peter Bro Miltersen
On Pseudorandom Generators in NC. MFCS (2001)
Mary Cryan, Leslie Ann Goldberg, Paul W. Goldberg
Evolutionary Trees Can be Learned in Polynomial Time in the Two-State General Markov Model. SIAM J. Comput. 31 (2) (2001)
Mary Cryan, Leslie Ann Goldberg, Cynthia A. Phillips
Approximation Algorithms for the Fixed-Topology Phylogenetic Number Problem. Algorithmica 25 (2-3) (1999)
Mary Cryan, Leslie Ann Goldberg, Paul W. Goldberg
Evolutionary Trees can be Learned in Polynomial Time in the Two-State General Markov Model. FOCS (1998)
Mary Cryan, Allan Ramsay
Constructing a Normal Form for Property Theory. CADE (1997)
Mary Cryan, Leslie Ann Goldberg, Cynthia A. Phillips
Approximation Algorithms for the Fixed-Topology Phylogenetic Number Problem. CPM (1997)