( en | de | ru )

 

Disambiguation of "Moore, Cristopher"

Author of the publication

copydeleteadd this publication to your clipboard
Detectability Thresholds and Optimal Algorithms for Community Structure in Dynamic Networks

, , , , and . Phys. Rev. X, 6 (3): 031005 (July 2016)
DOI: 10.1103/PhysRevX.6.031005

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Patrick Moore

Johannes Moore

Ciara Moore

Christine Moore

Claire Moore

 

Other publications of authors with the same name

Spectral redemption in clustering sparse networks, , , , , , and . Proceedings of the National Academy of Sciences, 110 (52): 20935--20940 (Dec 24, 2013)Continuum Percolation Thresholds in Two Dimensions, and . CoRR, (2012)The phase transition in 1-in-k SAT and NAE 3-SAT., , , and . SODA, page 721-722. ACM/SIAM, (2001)Stability analysis of financial contagion due to overlapping portfolios, , , and . Journal of Banking & Finance, (Sep 22, 2014)Limitations of single coset states and quantum algorithms for code equivalence., , and . Quantum Inf. Comput., 15 (3&4): 260-294 (2015)The Role of Directionality, Heterogeneity, and Correlations in Epidemic Risk and Spread., , , , and . SIAM Rev., 65 (2): 471-492 (May 2023)Improved Reconstruction of Random Geometric Graphs., , , and . CoRR, (2021)A continuous-discontinuous second-order transition in the satisfiability of random Horn-SAT formulas., , , and . Random Struct. Algorithms, 31 (2): 173-185 (2007)Counting Connected Graphs and Hypergraphs via the Probabilistic Method., , and . APPROX-RANDOM, volume 3122 of Lecture Notes in Computer Science, page 322-333. Springer, (2004)How Much Backtracking Does It Take to Color Random Graphs? Rigorous Results on Heavy Tails., and . CP, volume 3258 of Lecture Notes in Computer Science, page 742-746. Springer, (2004)