Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Cryan, Mary"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Approximately counting integral flows and cell-bounded contingency tables
Mary Cryan
,
Martin Dyer
,
Dana Randall
SIAM Journal on Computing
39
(7), 2010, pp. 2683-2703
Rapidly mixing Markov chains for sampling contingency tables with a constant number of rows
Mary Cryan
,
Martin Dyer
,
Leslie Ann Goldberg
,
Mark Jerrum
,
Russell Martin
SIAM Journal on Computing
36
(1), 2006, pp. 247-278
Approximately counting integral flows and cell-bounded contingency tables
Mary Cryan
,
Martin Dyer
,
Dana Randall
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, STOC'2005 (Baltimore, Maryland, USA, May 22-24, 2005)
, 2005, pp. 413-422
A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant
Mary Cryan
,
Martin Dyer
Journal of Computer and System Sciences
67
(2), 2003, pp. 291-310
Rapidly mixing Markov chains for sampling contingency tables with a constant number of rows
Mary Cryan
,
Martin Dyer
,
Leslie Ann Goldberg
,
Mark Jerrum
,
Russell Martin
Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, FOCS'2002 (Vancouver, BC, Canada, November 16-19, 2002)
, 2002, pp. 711-720
A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant
Mary Cryan
,
Martin Dyer
Proceedings of the 34th Annual ACM Symposium on Theory of Computing, STOC'2002 (Montreal, Quebec, Canada, May 19-21, 2002)
, 2002, pp. 240-249
Evolutionary trees can be learned in polynomial time in the two-state general Markov model
Mary Cryan
,
Leslie Ann Goldberg
,
Paul W. Goldberg
SIAM Journal on Computing
31
(2), 2001, pp. 375-397
On pseudorandom generators in
NC^0
Mary Cryan
,
Peter Bro Miltersen
Lecture Notes in Computer Science
2136
, 2001, pp. 272-284
Evolutionary trees can be learned in polynomial time in the two-state general Markov model
Mary Cryan
,
Leslie Ann Goldberg
,
Paul W. Goldberg
Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, FOCS'98 (Palo Alto, California, November 8-11, 1998)
, 1998, pp. 436-445
Approximation algorithms for the fixed-topology phylogenetic number problem
Mary Cryan
,
Leslie Ann Goldberg
,
Cynthia A. Phillips
Lecture Notes in Computer Science
1264
, 1997, pp. 130-149