Research output per year
Research output per year
Personal profile
Research Interests
Algorithms, especially Algorithms for counting and sampling; Random Structures; Learning theory; Pseudorandom generators.
Qualifications
1999, PhD, University of Warwick.
1995, MSc by Research, Computer Science, University College Dublin.
1993, BSc, Computer Science and Mathematics, University College Dublin.
Biography
I am originally from Dublin, and I did my undergraduate degree at University College Dublin, graduating with a BSc in Computer Science and Mathematics in 1993. I returned to UCD for the 1994-1995 academic year to do an MSc by research in Computer Science, supervised by Allan Ramsay. After that I spent four years at the University of Warwick doing research for my PhD. At Warwick I was a member of the Algorithms and Computational Complexity Group, working with Leslie Ann Goldberg. Between September 1999 and August 2001 I was a postdoc at the Center for Basic Research in Computer Science (BRICS) at the University of Aarhus in Denmark. Between September 2001 and May 2003 I was a postdoc with the Algorithms and Complexity Group of the University of Leeds, working on randomized algorithms with Martin Dyer. Since July 2003 I have been a lecturer in Informatics at Edinburgh.
Fingerprint
Dive into the research topics where Mary Cryan is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
- 1 Similar Profiles
-
Modified log-Sobolev inequalities for strongly log-concave distributions
Cryan, M., Guo, H. & Mousa, G., 22 Jan 2021, In: Annals of Probability. 49, 1, p. 506-525 20 p.Research output: Contribution to journal › Article › peer-review
Open AccessFile -
Modified log-Sobolev inequalities for strongly log-concave distributions
Cryan, M., Guo, H. & Mousa, G., 6 Jan 2020, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS). Institute of Electrical and Electronics Engineers, p. 1358-1370 14 p.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Open AccessFile -
Exact counting of Euler Tours for Graphs of Bounded Treewidth
Chebolu, P., Cryan, M. & Martin, R., 1 Oct 2013, ArXiv, 16 p.Research output: Working paper
-
The number of Euler tours of a random regular graph
Creed, P. & Cryan, M., 2013, In: Electronic Journal of Combinatorics. 20, 3, p. 1-31 31 p., P13.Research output: Contribution to journal › Article › peer-review
-
Exact counting of Euler tours for generalized series-parallel graphs
Chebolu, P., Cryan, M. & Martin, R., Jan 2012, In: Journal of Discrete Algorithms. 10, n/a, p. 110-122 13 p.Research output: Contribution to journal › Article › peer-review
Projects
- 1 Finished