default search action
Mary Cryan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [c9]Mary Cryan, Heng Guo, Giorgos Mousa:
Modified log-Sobolev Inequalities for Strongly Log-Concave Distributions. FOCS 2019: 1358-1370 - [i4]Mary Cryan, Heng Guo, Giorgos Mousa:
Modified log-Sobolev inequalities for strongly log-concave distributions. CoRR abs/1903.06081 (2019) - 2013
- [j9]Páidí Creed, Mary Cryan:
The Number of Euler Tours of Random Directed Graphs. Electron. J. Comb. 20(3): 13 (2013) - [i3]Prasad Chebolu, Mary Cryan, Russell Martin:
Exact counting of Euler Tours for Graphs of Bounded Treewidth. CoRR abs/1310.0185 (2013) - 2012
- [j8]Prasad Chebolu, Mary Cryan, Russell Martin:
Exact counting of Euler tours for generalized series-parallel graphs. J. Discrete Algorithms 10: 110-122 (2012) - [i2]Páidí Creed, Mary Cryan:
The number of Euler tours of a random directed graph. CoRR abs/1202.2156 (2012) - 2010
- [j7]Mary Cryan, Martin E. Dyer
, Dana Randall:
Approximately Counting Integral Flows and Cell-Bounded Contingency Tables. SIAM J. Comput. 39(7): 2683-2703 (2010) - [i1]Prasad Chebolu, Mary Cryan, Russell A. Martin:
Exact counting of Euler Tours for generalized series-parallel graphs. CoRR abs/1005.3477 (2010)
2000 – 2009
- 2008
- [j6]Mary Cryan, Martin E. Dyer
Random walks on the vertices of transportation polytopes with constant number of sources. Random Struct. Algorithms 33(3): 333-355 (2008) - 2007
- [j5]Mary Cryan, Martin Farach-Colton
Preface. Theor. Comput. Sci. 382(2): 85 (2007) - 2006
- [j4]Mary Cryan, Martin E. Dyer
Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows. SIAM J. Comput. 36(1): 247-278 (2006) - 2005
- [c8]Mary Cryan, Martin E. Dyer
Approximately counting integral flows and cell-bounded contingency tables. STOC 2005: 413-422 - 2003
- [j3]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) - [c7]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 - 2002
- [c6]Mary Cryan, Martin E. Dyer
Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows. FOCS 2002: 711-720 - [c5]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
- [j2]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) - [c4]Mary Cryan, Peter Bro Miltersen:
On Pseudorandom Generators in NC. MFCS 2001: 272-284
1990 – 1999
- 1999
- [b1]Mary Elizabeth Cryan:
Learning and approximation algorithms for problems motivated by evolutionary trees. University of Warwick, Coventry, UK, 1999 - [j1]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
- [c3]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
- [c2]Mary Cryan, Allan Ramsay:
Constructing a Normal Form for Property Theory. CADE 1997: 237-251 - [c1]Mary Cryan, Leslie Ann Goldberg, Cynthia A. Phillips:
Approximation Algorithms for the Fixed-Topology Phylogenetic Number Problem. CPM 1997: 130-149
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 20:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: