Mary Cryan

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