Faculty profile
Michael Molloy
Back to facultyResearch
Read how they describe their research on their University of Toronto profile.
Latest funding
- $246,000
Probabilistic Graph Theory and Random Constraint Satisfaction Problems
NSERC · 2019 · Principal investigator
- $310,000
Probabilistic Graph Theory and Random Constraint Satisfaction Problems
NSERC · 2014 · Principal investigator
- $250,000
Probabilistic graph theory and theoretical computer science
NSERC · 2009 · Principal investigator
No publications available.
Probabilistic Graph Theory and Random Constraint Satisfaction Problems
Principal investigators: Molloy, Michael
Keywords: graph colouring; random graphs; satisfiability thresholds
Probabilistic Graph Theory and Random Constraint Satisfaction Problems
Principal investigators: Molloy, Michael
Probabilistic graph theory and theoretical computer science
Principal investigators: Molloy, Michael
Probabilistic graph theory and theoretical computer science
Principal investigators: Molloy, Michael
High performance computing facilities for new developments in algorithmic design and analysis
Principal investigators: Magen, Avner
probabllistic graph theory and theoretical computer science
Principal investigators: Molloy, Michael
Graph theory and probabllistic computer science
Principal investigators: Molloy, Michael
Research computing for theoretical computer science
Principal investigators: Borodin, Allan
Algorithmic graph theory and random structures
Principal investigators: Molloy, Michael
From CIHR, NSERC and SSHRC funding decisions: CIHR since 2008, NSERC since 1991 and SSHRC since 1998, including their latest published competition results.
A short, specific email works best. This draft uses one of their recent papers; replace the parts in brackets with your own details before sending.
Profile data last refreshed on September 26, 2026 from the university directory, publication records and CIHR, NSERC and SSHRC funding.