| 2025 | COLT | The Planted Spanning Tree Problems: Exact Overlap Characterization via Local Weak Convergence Extended Abstract. | Mehrdad Moharrami, Cristopher Moore, Jiaming Xu |
| 2024 | FOCS | Tensor Cumulants for Statistical Inference on Invariant Distributions. | Dmitriy Kunisky, Cristopher Moore, Alexander S. Wein |
| 2023 | ICDCS | Adaptively Secure Random Beacons for Ungrindable Blockchains. | Aggelos Kiayias, Cristopher Moore, Saad Quader, Alexander Russell |
| 2022 | CCS | The Generals' Scuttlebutt: Byzantine-Resilient Gossip Protocols. | Sandro Coretti, Aggelos Kiayias, Cristopher Moore, Alexander Russell |
| 2022 | ICALP | Improved Reconstruction of Random Geometric Graphs. | Varsha Dani, Josep Daz, Thomas P. Hayes, Cristopher Moore |
| 2021 | COLT | Spectral Planting and the Hardness of Refuting Cuts, Colorability, and Communities in Random Graphs. | Afonso S. Bandeira, Jess Banks, Dmitriy Kunisky, Cristopher Moore, Alexander S. Wein |
| 2020 | SODA | The Combinatorics of the Longest-Chain Rule: Linear Consistency for Proof-of-Stake Blockchains. | Erica Blum, Aggelos Kiayias, Cristopher Moore, Saad Quader, Alexander Russell |
| 2019 | FOCS | The Kikuchi Hierarchy and Tensor PCA. | Alexander S. Wein, Ahmed El Alaoui, Cristopher Moore |
| 2017 | ISIT | Information-theoretic bounds and phase transitions in clustering, sparse PCA, and submatrix localization. | Jess Banks, Cristopher Moore, Roman Vershynin, Nicolas Verzelen, Jiaming Xu |
| 2016 | COLT | Information-theoretic thresholds for community detection in sparse networks. | Jess Banks, Cristopher Moore, Joe Neeman, Praneeth Netrapalli |
| 2013 | KDD | Scalable text and link analysis with mixed-topic link models. | Yaojia Zhu, Xiaoran Yan, Lise Getoor, Cristopher Moore |
| 2011 | CRYPTO | McEliece and Niederreiter Cryptosystems That Resist Quantum Fourier Sampling Attacks. | Hang Dinh, Cristopher Moore, Alexander Russell |
| 2011 | KDD | Active learning for node classification in assortative and disassortative networks. | Cristopher Moore, Xiaoran Yan, Yaojia Zhu, Jean-Baptiste Rouquier, Terran Lane |
| 2011 | SODA | The Rigidity Transition in Random Graphs. | Shiva Prasad Kasiviswanathan, Cristopher Moore, Louis Theran |
| 2010 | FOCS | Frugal and Truthful Auctions for Vertex Covers, Flows and Cuts. | David Kempe, Mahyar Salek, Cristopher Moore |
| 2010 | LATIN | Continuous and Discrete Methods in Computer Science. | Cristopher Moore |
| 2007 | SODA | Quantum algorithms for Simon's problem over general groups. | Gorjan Alagic, Cristopher Moore, Alexander Russell |
| 2007 | STOC | On the impossibility of a quantum sieve algorithm for graph isomorphism. | Cristopher Moore, Alexander Russell, Piotr Sniady |
| 2006 | ICML | Structural Inference of Hierarchies in Networks. | Aaron Clauset, Cristopher Moore, Mark E. J. Newman |
| 2006 | STOC | Limitations of quantum coset states for graph isomorphism. | Sean Hallgren, Cristopher Moore, Martin Rtteler, Alexander Russell, Pranab Sen |
| 2005 | AAAI | Generating Hard Satisfiable Formulas by Hiding Solutions Deceptively. | Haixia Jia, Cristopher Moore, Doug Strain |
| 2005 | ESA | Fearful Symmetries: Quantum Computing, Factoring, and Graph Isomorphism. | Cristopher Moore |
| 2005 | FOCS | The Symmetric Group Defies Strong Fourier Sampling. | Cristopher Moore, Alexander Russell, Leonard J. Schulman |
| 2005 | STOC | On the bias of traceroute sampling: or, power-law degree distributions in regular graphs. | Dimitris Achlioptas, Aaron Clauset, David Kempe, Cristopher Moore |
| 2004 | AAAI | Hiding Satisfying Assignments: Two Are Better than One. | Dimitris Achlioptas, Haixia Jia, Cristopher Moore |
| 2004 | CP | How Much Backtracking Does It Take to Color Random Graphs? Rigorous Results on Heavy Tails. | Haixia Jia, Cristopher Moore |
| 2004 | DNA | Building the Components for a Biomolecular Computer. | Clint Morgan, Darko Stefanovic, Cristopher Moore, Milan N. Stojanovic |
| 2004 | LATIN | Sampling Grid Colorings with Fewer Colors. | Dimitris Achlioptas, Michael S. O. Molloy, Cristopher Moore, Frank Van Bussel |
| 2004 | SODA | Generic quantum Fourier transforms. | Cristopher Moore, Daniel N. Rockmore, Alexander Russell |
| 2004 | SODA | The power of basis selection in fourier sampling: hidden subgroup problems in affine groups. | Cristopher Moore, Daniel N. Rockmore, Alexander Russell, Leonard J. Schulman |
| 2004 | SAT | From Spin Glasses to Hard Satisfiable Formulas. | Haixia Jia, Cristopher Moore, Bart Selman |
| 2004 | SAT | From Spin Glasses to Hard Satisfiable Formulas. | Haixia Jia, Cristopher Moore, Bart Selman |
| 2003 | ICALP | MAX k-CUT and Approximating the Chromatic Number of Random Graphs. | Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwalani |
| 2002 | FOCS | The Asymptotic Order of the Random k -SAT Threshold. | Dimitris Achlioptas, Cristopher Moore |
| 2002 | ICALP | Quantum and Stochastic Branching Programs of Bounded Width. | Farid M. Ablayev, Cristopher Moore, Chris Pollett |
| 2002 | SODA | Tiling groups for Wang tiles. | Cristopher Moore, Ivan Rapaport, Eric Rmila |
| 2002 | STOC | Almost all graphs with average degree 4 are 3-colorable. | Dimitris Achlioptas, Cristopher Moore |
| 2001 | MFCS | Satisfiability of Systems of Equations over Finite Monoids. | Cristopher Moore, Pascal Tesson, Denis Thrien |
| 2001 | SODA | The phase transition in 1-in-k SAT and NAE 3-SAT. | Dimitris Achlioptas, Arthur D. Chtcherba, Gabriel Istrate, Cristopher Moore |
| 2001 | STACS | New Results on Alternating and Non-deterministic Two-Dimensional Finite-State Automata. | Jarkko Kari, Cristopher Moore |
| 2000 | MFCS | Equation Satisfiability and Program Satisfiability for Finite Monoids. | David A. Mix Barrington, Pierre McKenzie, Cristopher Moore, Pascal Tesson, Denis Thrien |