The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Mary Cryan: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Mary Cryan, Allan Ramsay
    Constructing a Normal Form for Property Theory. [Citation Graph (0, 0)][DBLP]
    CADE, 1997, pp:237-251 [Conf]
  2. Mary Cryan, Leslie Ann Goldberg, Cynthia A. Phillips
    Approximation Algorithms for the Fixed-Topology Phylogenetic Number Problem. [Citation Graph (0, 0)][DBLP]
    CPM, 1997, pp:130-149 [Conf]
  3. 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. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:711-720 [Conf]
  4. Mary Cryan, Leslie Ann Goldberg, Paul W. Goldberg
    Evolutionary Trees can be Learned in Polynomial Time in the Two-State General Markov Model. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:436-445 [Conf]
  5. Mary Cryan, Peter Bro Miltersen
    On Pseudorandom Generators in NC. [Citation Graph (0, 0)][DBLP]
    MFCS, 2001, pp:272-284 [Conf]
  6. Mary Cryan, Martin E. Dyer, Haiko Müller, Leen Stougie
    Random walks on the vertices of transportation polytopes with constant number of sources. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:330-339 [Conf]
  7. Mary Cryan, Martin E. Dyer
    A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:240-249 [Conf]
  8. Mary Cryan, Martin E. Dyer, Dana Randall
    Approximately counting integral flows and cell-bounded contingency tables. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:413-422 [Conf]
  9. Mary Cryan, Leslie Ann Goldberg, Cynthia A. Phillips
    Approximation Algorithms for the Fixed-Topology Phylogenetic Number Problem. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1999, v:25, n:2-3, pp:311-329 [Journal]
  10. Mary Cryan, Martin E. Dyer
    A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2003, v:67, n:2, pp:291-310 [Journal]
  11. Mary Cryan, Leslie Ann Goldberg, Paul W. Goldberg
    Evolutionary Trees Can be Learned in Polynomial Time in the Two-State General Markov Model. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:2, pp:375-397 [Journal]
  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. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:1, pp:247-278 [Journal]
  13. Mary Cryan, Martin Farach-Colton
    Preface. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:382, n:2, pp:85- [Journal]

  14. Exact counting of Euler Tours for generalized series-parallel graphs [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002