Michael Molloy
Orcid: 0000000154351015Affiliations:
 University of Toronto, Canada
According to our database^{1},
Michael Molloy
authored at least 87 papers
between 1994 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:

on orcid.org
On csauthors.net:
Bibliography
2023
Adaptable and conflict colouring multigraphs with no cycles of length three or four.
J. Graph Theory, September, 2023
J. Graph Theory, 2023
2022
J. Graph Theory, 2022
Graphs Comb., 2022
CoRR, 2022
2020
J. Comb. Theory B, 2020
2019
J. Comb. Theory B, 2019
2018
Random Struct. Algorithms, 2018
Random Struct. Algorithms, 2018
J. ACM, 2018
2017
J. Graph Theory, 2017
Inf. Comput., 2017
Electron. J. Comb., 2017
2016
Discret. Math., 2016
2015
Random Struct. Algorithms, 2015
2014
Random Struct. Algorithms, 2014
J. Comb. Theory B, 2014
2013
A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction Problems.
SIAM J. Comput., 2013
Containing Viral Spread on Sparse Random Graphs: Bounds, Algorithms, and Experiments.
Internet Math., 2013
CoRR, 2013
Proceedings of the TwentyFourth Annual ACMSIAM Symposium on Discrete Algorithms, 2013
2012
The Satisfiability Threshold for a Seemingly Intractable Random Constraint Satisfaction Problem.
SIAM J. Discret. Math., 2012
Random Struct. Algorithms, 2012
J. Graph Theory, 2012
Comb. Probab. Comput., 2012
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012
2011
SIAM J. Discret. Math., 2011
Discret. Math., 2011
2010
Corrigendum to "Asymptotically optimal frugal colouring" [J. Combin. Theory Ser. B 100 (2) (2010) 226246].
J. Comb. Theory B, 2010
J. Comb. Theory B, 2010
2009
Comb., 2009
Proceedings of the Approximation, 2009
2008
Random Struct. Algorithms, 2008
Comb., 2008
2007
SIAM J. Comput., 2007
2006
The satisfiability threshold for randomly generated binary constraint satisfaction problems.
Random Struct. Algorithms, 2006
Artif. Intell., 2006
Proceedings of the LATIN 2006: Theoretical Informatics, 2006
2005
Random Struct. Algorithms, 2005
J. Comb. Theory B, 2005
J. Comb. Theory B, 2005
2004
SIAM J. Comput., 2004
A sharp threshold in proof complexity yields lower bounds for satisfiability search.
J. Comput. Syst. Sci., 2004
Proceedings of the Fifteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2004
Proceedings of the Fifteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2004
Proceedings of the LATIN 2004: Theoretical Informatics, 2004
The Exact Satisfiability Threshold for a Potentially Intractible Random Constraint Satisfaction Problem.
Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004
2003
Theor. Comput. Sci., 2003
A probabilistic analysis of randomly generated binary constraint satisfaction problems.
Theor. Comput. Sci., 2003
SIAM J. Comput., 2003
2002
Very rapid mixing of the Glauber dynamics for proper colorings on boundeddegree graphs.
Random Struct. Algorithms, 2002
J. Graph Theory, 2002
J. Graph Theory, 2002
Discret. Math., 2002
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002
Proceedings of the Algorithms, 2002
Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, July 28, 2002
2001
Very rapidly mixing Markov chains for 2colorings and for independent sets in a graph with maximum degree 4.
Random Struct. Algorithms, 2001
Constraints An Int. J., 2001
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001
2000
Random Struct. Algorithms, 2000
Electron. Notes Discret. Math., 2000
1999
J. Graph Theory, 1999
J. Algorithms, 1999
Electron. J. Comb., 1999
Electron. J. Comb., 1999
1998
SIAM J. Comput., 1998
Discret. Math., 1998
Comb. Probab. Comput., 1998
Comb., 1998
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998
Proceedings of the LATIN '98: Theoretical Informatics, 1998
1997
Random Struct. Algorithms, 1997
J. Comb. Theory B, 1997
Comb., 1997
Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997
Proceedings of the Randomization Methods in Algorithm Design, 1997
1996
Random Struct. Algorithms, 1996
J. Graph Theory, 1996
J. Algorithms, 1996
Comb. Probab. Comput., 1996
1995
Random Struct. Algorithms, 1995
Random Struct. Algorithms, 1995
1994
Discret. Appl. Math., 1994
Comb. Probab. Comput., 1994