Mary Cryan - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 18 from 18

2019

Modified log-Sobolev Inequalities for Strongly Log-Concave DistributionsMary Cryan, Heng Guo 0001, Giorgos Mousa. focs 2019: 1358-1370 [doi]

2013

The Number of Euler Tours of Random Directed GraphsPáidí Creed, Mary Cryan. combinatorics, 20(3):13, 2013. [doi]

2012

Exact counting of Euler tours for generalized series-parallel graphsPrasad Chebolu, Mary Cryan, Russell Martin. jda, 10:110-122, 2012. [doi]

2010

Approximately Counting Integral Flows and Cell-Bounded Contingency TablesMary Cryan, Martin E. Dyer, Dana Randall. SICOMP, 39(7):2683-2703, 2010. [doi]

2008

Random walks on the vertices of transportation polytopes with constant number of sourcesMary Cryan, Martin E. Dyer, Haiko Müller, Leen Stougie. rsa, 33(3):333-355, 2008. [doi]

2007

PrefaceMary Cryan, Martin Farach-Colton. TCS, 382(2):85, 2007. [doi]

2006

Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of RowsMary Cryan, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Russell A. Martin. SICOMP, 36(1):247-278, 2006. [doi]

2005

Approximately counting integral flows and cell-bounded contingency tablesMary Cryan, Martin E. Dyer, Dana Randall. stoc 2005: 413-422 [doi]

2003

A polynomial-time algorithm to approximately count contingency tables when the number of rows is constantMary Cryan, Martin E. Dyer. jcss, 67(2):291-310, 2003. [doi]

Random walks on the vertices of transportation polytopes with constant number of sourcesMary Cryan, Martin E. Dyer, Haiko Müller, Leen Stougie. soda 2003: 330-339 [doi]

2002

A polynomial-time algorithm to approximately count contingency tables when the number of rows is constantMary Cryan, Martin E. Dyer. stoc 2002: 240-249 [doi]

Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of RowsMary Cryan, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Russell A. Martin. focs 2002: 711-720 [doi]

2001

On Pseudorandom Generators in NCMary Cryan, Peter Bro Miltersen. mfcs 2001: 272-284 [doi]

Evolutionary Trees Can be Learned in Polynomial Time in the Two-State General Markov ModelMary Cryan, Leslie Ann Goldberg, Paul W. Goldberg. SICOMP, 31(2):375-397, 2001. [doi]

1999

Approximation Algorithms for the Fixed-Topology Phylogenetic Number ProblemMary Cryan, Leslie Ann Goldberg, Cynthia A. Phillips. algorithmica, 25(2-3):311-329, 1999. [doi]

1998

Evolutionary Trees can be Learned in Polynomial Time in the Two-State General Markov ModelMary Cryan, Leslie Ann Goldberg, Paul W. Goldberg. focs 1998: 436-445 [doi]

1997

Constructing a Normal Form for Property TheoryMary Cryan, Allan Ramsay. cade 1997: 237-251

Approximation Algorithms for the Fixed-Topology Phylogenetic Number ProblemMary Cryan, Leslie Ann Goldberg, Cynthia A. Phillips. cpm 1997: 130-149

Sign in or sign up to see more results.

runs on WebDSL