Travelled to:1 × Spain
1 × The Netherlands
3 × Canada
5 × USA
Collaborated with:D.Achlioptas H.Jia B.Selman A.Russell Y.Zhu X.Yan P.Sniady A.Coja-Oghlan V.Sanwalani F.M.Ablayev C.Pollett L.Getoor A.Clauset D.Kempe J.Rouquier T.Lane S.Hallgren M.Rötteler P.Sen
Talks about:graph (5) quantum (3) isomorph (2) satisfi (2) formula (2) glass (2) degre (2) spin (2) link (2) hard (2)
Person: Cristopher Moore
DBLP: Moore:Cristopher
Contributed to:
20132011
200720062005
20042005
200320022002Wrote 10 papers:
- KDD-2013-ZhuYGM #analysis #modelling #scalability #topic
- Scalable text and link analysis with mixed-topic link models (YZ, XY, LG, CM), pp. 473–481.
- KDD-2011-MooreYZRL #classification #learning #network
- Active learning for node classification in assortative and disassortative networks (CM, XY, YZ, JBR, TL), pp. 841–849.
- STOC-2007-MooreRS #algorithm #graph #morphism #on the #quantum
- On the impossibility of a quantum sieve algorithm for graph isomorphism (CM, AR, PS), pp. 536–545.
- STOC-2006-HallgrenMRRS #graph #morphism #quantum
- Limitations of quantum coset states for graph isomorphism (SH, CM, MR, AR, PS), pp. 604–617.
- STOC-2005-AchlioptasCKM #bias #graph #on the
- On the bias of traceroute sampling: or, power-law degree distributions in regular graphs (DA, AC, DK, CM), pp. 694–703.
- SAT-2004-JiaMS #satisfiability
- From Spin Glasses to Hard Satisfiable Formulas (HJ, CM, BS), pp. 12–19.
- SAT-J-2004-JiaMS05 #satisfiability
- From Spin Glasses to Hard Satisfiable Formulas (HJ, CM, BS), pp. 199–210.
- ICALP-2003-Coja-OghlanMS #approximate #graph #random
- MAX k-CUT and Approximating the Chromatic Number of Random Graphs (ACO, CM, VS), pp. 200–211.
- ICALP-2002-AblayevMP #bound #branch #probability #quantum #source code
- Quantum and Stochastic Branching Programs of Bounded Width (FMA, CM, CP), pp. 343–354.
- STOC-2002-AchlioptasM #graph
- Almost all graphs with average degree 4 are 3-colorable (DA, CM), pp. 199–208.