Michael S. O. Molloy

Publication Activity (10 Years)

Years Active: 1997-2005
Publications (10 Years): 0

Publications

Babak Farzad, Michael S. O. Molloy, Bruce A. Reed
)-critical graphs. J. Comb. Theory, Ser. B 93 (2) (2005)
Dimitris Achlioptas, Michael S. O. Molloy, Cristopher Moore, Frank Van Bussel
Sampling Grid Colorings with Fewer Colors. LATIN (2004)
Dimitris Achlioptas, Paul Beame, Michael S. O. Molloy
A sharp threshold in proof complexity yields lower bounds for satisfiability search. J. Comput. Syst. Sci. 68 (2) (2004)
Dimitris Achlioptas, Paul Beame, Michael S. O. Molloy
A sharp threshold in proof complexity. STOC (2001)
Dimitris Achlioptas, Michael S. O. Molloy, Lefteris M. Kirousis, Yannis C. Stamatiou, Evangelos Kranakis, Danny Krizanc
Random Constraint Satisfaction: A More Accurate Picture. Constraints An Int. J. 6 (4) (2001)
Michael S. O. Molloy, Bruce A. Reed, William Steiger
On the mixing rate of the triangulation walk. Randomization Methods in Algorithm Design (1997)
Dimitris Achlioptas, Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Michael S. O. Molloy, Yannis C. Stamatiou
Random Constraint Satisfaction: A More Accurate Picture. CP (1997)
Dimitris Achlioptas, Michael S. O. Molloy
The Analysis of a List-Coloring Algorithm on a Random Graph. FOCS (1997)