Michael Molloy 个人学术档案

引用次数

	总计	2019 年至今
引用	8165	2038
h 指数	34	18
i10 指数	64	30

440

220

110

330

199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202430 46 57 67 107 143 176 209 280 315 381 382 351 316 368 414 374 391 367 413 388 429 429 378 327 377 361 166

开放获取的出版物数量

查看全部

9 篇文章

0 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

合著作者

Bruce ReedMcGill University在 cs.mcgill.ca 的电子邮件经过验证
Alan FriezeCarnegie Mellon University在 random.math.cmu.edu 的电子邮件经过验证
Mohammad SalavatipourProfessor of Computer Science, University of Alberta在 cs.ualberta.ca 的电子邮件经过验证
Evangelos KranakisChancellor's Professor, School of Computer Science, Carleton University在 scs.carleton.ca 的电子邮件经过验证
Lefteris KirousisProfessor, Department of Mathematics, National & Kapodistrian University of Athens在 math.uoa.gr 的电子邮件经过验证
Paul BeameProfessor of Computer Science and Engineering, University of Washington在 cs.washington.edu 的电子邮件经过验证
Yannis StamatiouUniversity of Patras在 ceid.upatras.gr 的电子邮件经过验证
Russ GreinerProfessor of Computer Science, University of Alberta在 ualberta.ca 的电子邮件经过验证
Ryan B HaywardProfessor of Computing Science, University of Alberta在 ualberta.ca 的电子邮件经过验证
Brendan LucierMicrosoft Research在 microsoft.com 的电子邮件经过验证
Noga AlonPrinceton University and Tel Aviv University在 tau.ac.il 的电子邮件经过验证
Cristopher MooreSanta Fe Institute在 santafe.edu 的电子邮件经过验证
Jason BrownProfessor of Mathematics and Statistisc, Dalhousie University在 mathstat.dal.ca 的电子邮件经过验证
Catherine GreenhillSchool of Mathematics and Statistics, UNSW Sydney在 unsw.edu.au 的电子邮件经过验证
Yuval Peresyuvalperes.com在 yuvalperes.com 的电子邮件经过验证
Ricardo Restrepo LopezGoogle在 google.com 的电子邮件经过验证
Lap Chi LauUniversity of Waterloo在 cs.uwaterloo.ca 的电子邮件经过验证
Paul ErdősMathematics
Guanhua YanDepartment of Computer Science, Binghamton University, State University of New York在 binghamton.edu 的电子邮件经过验证

关注

Michael Molloy

University of Toronto

在 cs.toronto.edu 的电子邮件经过验证 - 首页


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
A critical point for random graphs with a given degree sequence M Molloy, B Reed Random Structures & Algorithms 6 (2‐3), 161-180, 1995	2930	1995
The size of the giant component of a random graph with a given degree sequence M Molloy, B Reed Combinatorics probability and computing 7 (3), 295-305, 1998	1059	1998
Graph colouring and the probabilistic method M Molloy, B Reed Springer Science & Business Media, 2002	642	2002
Further algorithmic aspects of the local lemma M Molloy, B Reed Proceedings of the thirtieth annual ACM symposium on Theory of computing …, 1998	274	1998
A bound on the chromatic number of the square of a planar graph M Molloy, MR Salavatipour Journal of Combinatorial Theory, Series B 94 (2), 189-213, 2005	254	2005
A bound on the chromatic number of the square of a planar graph M Molloy, MR Salavatipour J. Combin. Theory Ser. B, 2001	254*	2001
Random constraint satisfaction: A more accurate picture D Achlioptas, LM Kirousis, E Kranakis, D Krizanc, MSO Molloy, ... Principles and Practice of Constraint Programming-CP97: Third International …, 1997	226*	1997
A bound on the strong chromatic index of a graph M Molloy, B Reed Journal of Combinatorial Theory, Series B 69 (2), 103-109, 1997	211	1997
Cores in random hypergraphs and Boolean formulas M Molloy Random Structures & Algorithms 27 (1), 124-135, 2005	172	2005
Random constraint satisfaction: a more accurate picture D Achlioptas, LM Kirousis, E Kranakis, D Krizanc, MSO Molloy, ... Random structures and algorithms 12, 253-269, 1998	158	1998
Random constraint satisfaction: A more accurate picture D Achlioptas, L Kirousis, E Kranakis, D Krizanc, M Molloy, Y Stamatiou Principles and Practice of Constraint Programming-CP97, 107-120, 1997	158	1997
A bound on the total chromatic number M Molloy, B Reed Combinatorica 18 (2), 241-280, 1998	142	1998
The analysis of a list-coloring algorithm on a random graph D Achlioptas, M Molloy Proceedings 38th Annual Symposium on Foundations of Computer Science, 204-212, 1997	106	1997
The list chromatic number of graphs with small clique number M Molloy Journal of Combinatorial Theory, Series B 134, 264-284, 2019	100	2019
Colouring a graph frugally H Hind, M Molloy, B Reed Combinatorica 17 (4), 469-482, 1997	91	1997
Frequency channel assignment on planar networks M Molloy, MR Salavatipour Algorithms—ESA 2002: 10th Annual European Symposium Rome, Italy, September …, 2002	83	2002
Models and thresholds for random constraint satisfaction problems M Molloy Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002	79	2002
Models and thresholds for random constraint satisfaction problems M Molloy Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002	79	2002
The Glauber dynamics on colourings of a graph with high girth and maximum degree M Molloy Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002	77	2002
A sharp threshold in proof complexity D Achlioptas, P Beame, M Molloy Proceedings of the thirty-third annual ACM symposium on Theory of computing …, 2001	76	2001

系统目前无法执行此操作，请稍后再试。

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

上传 PDF

关注此作者

引用次数

合著作者

引用