| 2012 | ||
|---|---|---|
| 18 | Páidí Creed, Mary Cryan: The number of Euler tours of a random directed graph CoRR abs/1202.2156: (2012) | |
| 17 | Prasad Chebolu, Mary Cryan, Russell Martin: Exact counting of Euler tours for generalized series-parallel graphs. J. Discrete Algorithms 10: 110-122 (2012) | |
| 2010 | ||
| 16 | Prasad Chebolu, Mary Cryan, Russell A. Martin: Exact counting of Euler Tours for generalized series-parallel graphs CoRR abs/1005.3477: (2010) | |
| 15 | Mary Cryan, Martin E. Dyer, Dana Randall: Approximately Counting Integral Flows and Cell-Bounded Contingency Tables. SIAM J. Comput. 39(7): 2683-2703 (2010) | |
| 2008 | ||
| 14 | 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): 333-355 (2008) | |
| 2007 | ||
| 13 | Mary Cryan, Martin Farach-Colton: Preface. Theor. Comput. Sci. 382(2): 85 (2007) | |
| 2006 | ||
| 12 | 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): 247-278 (2006) | |
| 2005 | ||
| 11 | Mary Cryan, Martin E. Dyer, Dana Randall: Approximately counting integral flows and cell-bounded contingency tables. STOC 2005: 413-422 | |
| 2003 | ||
| 10 | 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: 330-339 | |
| 9 | 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): 291-310 (2003) | |
| 2002 | ||
| 8 | 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: 711-720 | |
| 7 | Mary Cryan, Martin E. Dyer: A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant. STOC 2002: 240-249 | |
| 2001 | ||
| 6 | Mary Cryan, Peter Bro Miltersen: On Pseudorandom Generators in NC. MFCS 2001: 272-284 | |
| 5 | 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): 375-397 (2001) | |
| 1999 | ||
| 4 | Mary Cryan, Leslie Ann Goldberg, Cynthia A. Phillips: Approximation Algorithms for the Fixed-Topology Phylogenetic Number Problem. Algorithmica 25(2-3): 311-329 (1999) | |
| 1998 | ||
| 3 | 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: 436-445 | |
| 1997 | ||
| 2 | Mary Cryan, Allan Ramsay: Constructing a Normal Form for Property Theory. CADE 1997: 237-251 | |
| 1 | Mary Cryan, Leslie Ann Goldberg, Cynthia A. Phillips: Approximation Algorithms for the Fixed-Topology Phylogenetic Number Problem. CPM 1997: 130-149 | |
| 1 | Prasad Chebolu | [16] [17] |
| 2 | Páidí Creed (Páidí J. Creed) | [18] |
| 3 | Martin E. Dyer | [7] [8] [9] [10] [11] [12] [14] [15] |
| 4 | Martin Farach-Colton (Martin Farach) | [13] |
| 5 | Leslie Ann Goldberg | [1] [3] [4] [5] [8] [12] |
| 6 | Paul W. Goldberg | [3] [5] |
| 7 | Mark Jerrum | [8] [12] |
| 8 | Russell Martin (Russell A. Martin) | [8] [12] [16] [17] |
| 9 | Peter Bro Miltersen | [6] |
| 10 | Haiko Müller | [10] [14] |
| 11 | Cynthia A. Phillips | [1] [4] |
| 12 | Allan Ramsay | [2] |
| 13 | Dana Randall | [11] [15] |
| 14 | Leen Stougie | [10] [14] |
Colors in the list of coauthors
Last update Fri May 25 01:42:58 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page