Life Without Death is P-complete. - David Griffeath; Cristopher Moore (Complex Syst., 1996)

Algebraic Properties of the Block Transformation on Cellular Automata. - Cristopher Moore; Arthur A. Drisko (Complex Syst., 1996)

Recursion Theory on the Reals and Continuous-Time Computation. - Cristopher Moore (Theor. Comput. Sci., 1996)

Circuits and Expressions with NOn-Associative Gates. - Joshua Berman; Arthur Drisko; François Lemieux; Cristopher Moore; Denis Thérien (CCC, 1997)

Commuting Cellular Automata. - Cristopher Moore; Timothy Boykett (Complex Syst., 1997)

Dynamical Recognizers: Real-Time Language Recognition by Analog Computers. - Cristopher Moore (Theor. Comput. Sci., 1998)

Quantum Circuits: Fanout, Parity, and Counting - Cristopher Moore (Electron. Colloquium Comput. Complex., 1999)

Closed-for Analytic Maps in One and Two Dimensions can Simulate Universal Turing Machines. - Pascal Koiran; Cristopher Moore (Theor. Comput. Sci., 1999)

Equation Satisfiability and Program Satisfiability for Finite Monoids. - David A. Mix Barrington; Pierre McKenzie; Cristopher Moore; Pascal Tesson; Denis Thérien (MFCS, 2000)

Upper and Lower Bounds on Continuous-Time Computation. - Manuel Lameiras Campagnolo; Cristopher Moore (UMC, 2000)

One-Dimensional Peg Solitaire - Cristopher Moore; David Eppstein (CoRR, 2000)

One-Dimensional Peg Solitaire, and Duotaire - Cristopher Moore; David Eppstein (CoRR, 2000)

Iteration, Inequalities, and Differentiability in Analog Computers. - Manuel Lameiras Campagnolo; Cristopher Moore; José Félix Costa (J. Complex., 2000)

Circuits and Expressions with Nonassociative Gates. - Cristopher Moore; Denis Thérien; François Lemieux; Joshua Berman; Arthur Drisko (J. Comput. Syst. Sci., 2000)

Quantum automata and quantum grammars. - Cristopher Moore; James P. Crutchfield (Theor. Comput. Sci., 2000)

An n-Dimensional Generalization of the Rhombus Tiling. - Joakim Linde; Cristopher Moore; Mats G. Nordahl (DM-CCG, 2001)

Satisfiability of Systems of Equations over Finite Monoids. - Cristopher Moore; Pascal Tesson; Denis Thérien (MFCS, 2001)

The phase transition in 1-in-k SAT and NAE 3-SAT. - Dimitris Achlioptas; Arthur D. Chtcherba; Gabriel Istrate; Cristopher Moore (SODA, 2001)

New Results on Alternating and Non-deterministic Two-Dimensional Finite-State Automata. - Jarkko Kari; Cristopher Moore (STACS, 2001)

Hard Tiling Problems with Simple Tiles. - Cristopher Moore; J. M. Robson (Discret. Comput. Geom., 2001)

Parallel Quantum Computation and Quantum Codes. - Cristopher Moore; Martin Nilsson (SIAM J. Comput., 2001)

The Asymptotic Order of the Random k -SAT Threshold. - Dimitris Achlioptas; Cristopher Moore (FOCS, 2002)

Quantum and Stochastic Branching Programs of Bounded Width. - Farid M. Ablayev; Cristopher Moore; Chris Pollett (ICALP, 2002)

A Note on the Representational Incompatibility of Function Approximation and Factored Dynamics. - Eric Allender; Sanjeev Arora; Michael J. Kearns; Cristopher Moore; Alexander Russell (NIPS, 2002)

On the 2-Colorability of Random Hypergraphs. - Dimitris Achlioptas; Cristopher Moore (RANDOM, 2002)

Quantum Walks on the Hypercube. - Cristopher Moore; Alexander Russell (RANDOM, 2002)

Tiling groups for Wang tiles. - Cristopher Moore; Ivan Rapaport; Eric Rémila (SODA, 2002)

Quantum and Stochastic Programs of Bounded Width - Chris Pollett; Farid M. Ablayev; Cristopher Moore (Electron. Colloquium Comput. Complex., 2002)

An Analog Characterization of the Grzegorczyk Hierarchy. - Manuel Lameiras Campagnolo; Cristopher Moore; José Félix Costa (J. Complex., 2002)

Ribbon Tile Invariants from the Signed Area. - Cristopher Moore; Igor Pak (J. Comb. Theory A, 2002)

Counting, fanout and the complexity of quantum ACC. - Frederic Green; Steven Homer; Cristopher Moore; Christopher Pollett (Quantum Inf. Comput., 2002)

MAX k-CUT and Approximating the Chromatic Number of Random Graphs. - Amin Coja-Oghlan; Cristopher Moore; Vishal Sanwalani (ICALP, 2003)

Almost all graphs with average degree 4 are 3-colorable. - Dimitris Achlioptas; Cristopher Moore (J. Comput. Syst. Sci., 2003)

The Chromatic Number of Random Regular Graphs. - Dimitris Achlioptas; Cristopher Moore (APPROX-RANDOM, 2004)

Rectangles and Squares Recognized by Two-Dimensional Automata. - Jarkko Kari; Cristopher Moore (Theory Is Forever, 2004)

How Much Backtracking Does It Take to Color Random Graphs? Rigorous Results on Heavy Tails. - Haixia Jia; Cristopher Moore (CP, 2004)

Building the Components for a Biomolecular Computer. - Clint Morgan; Darko Stefanovic; Cristopher Moore; Milan N. Stojanovic (DNA, 2004)

Sampling Grid Colorings with Fewer Colors. - Dimitris Achlioptas; Michael S. O. Molloy; Cristopher Moore; Frank Van Bussel (LATIN, 2004)

From Spin Glasses to Hard Satisfiable Formulas. - Haixia Jia; Cristopher Moore; Bart Selman (SAT (Selected Papers, 2004)

The power of basis selection in fourier sampling: hidden subgroup problems in affine groups. - Cristopher Moore; Daniel N. Rockmore; Alexander Russell; Leonard J. Schulman (SODA, 2004)

The Resolution Complexity of Random Graph k-Colorability - Paul Beame; Joseph C. Culberson; David G. Mitchell; Cristopher Moore (Electron. Colloquium Comput. Complex., 2004)

Fearful Symmetries: Quantum Computing, Factoring, and Graph Isomorphism. - Cristopher Moore (ESA, 2005)

The Symmetric Group Defies Strong Fourier Sampling: Part I - Cristopher Moore; Alexander Russell; Leonard J. Schulman (CoRR, 2005)

The Symmetric Group Defies Strong Fourier Sampling: Part II - Cristopher Moore; Alexander Russell (CoRR, 2005)

The resolution complexity of random graph k-colorability. - Paul Beame; Joseph C. Culberson; David G. Mitchell; Cristopher Moore (Discret. Appl. Math., 2005)

On the computational power of probabilistic and quantum branching program. - Farid M. Ablayev; Aida Gainutdinova; Marek Karpinski; Cristopher Moore; Chris Pollett (Inf. Comput., 2005)

Hiding Satisfying Assignments: Two are Better than One. - Dimitris Achlioptas; Haixia Jia; Cristopher Moore (J. Artif. Intell. Res., 2005)

Introduction: Where Statistical Physics Mects Computation. - Allon G. Percus; Gabriel Istrate; Cristopher Moore (Computational Complexity and Statistical Physics, 2006)

Structural Inference of Hierarchies in Networks. - Aaron Clauset; Cristopher Moore; Mark E. J. Newman (SNA@ICML, 2006)

Global connectivity from local geometric constraints for sensor networks with various wireless footprints. - Raissa M. D'Souza; David J. Galvin; Cristopher Moore; Dana Randall (IPSN, 2006)

On the Impossibility of a Quantum Sieve Algorithm for Graph Isomorphism - Cristopher Moore; Alexander Russell (CoRR, 2006)

MAX k-CUT and approximating the chromatic number of random graphs. - Amin Coja-Oghlan; Cristopher Moore; Vishal Sanwalani (Random Struct. Algorithms, 2006)

Random k-SAT: Two Moments Suffice to Cross a Sharp Threshold. - Dimitris Achlioptas; Cristopher Moore (SIAM J. Comput., 2006)

Generic quantum Fourier transforms. - Cristopher Moore; Daniel N. Rockmore; Alexander Russell (ACM Trans. Algorithms, 2006)

Quantum algorithms for Simon's problem over general groups. - Gorjan Alagic; Cristopher Moore; Alexander Russell (SODA, 2007)

Generating Hard Satisfiable Formulas by Hiding Solutions Deceptively. - Haixia Jia; Cristopher Moore; Doug Strain (J. Artif. Intell. Res., 2007)

For distinguishing conjugate hidden subgroups, the pretty good measurement is as good as it gets. - Cristopher Moore; Alexander Russell (Quantum Inf. Comput., 2007)

Counting connected graphs and hypergraphs via the probabilistic method. - Amin Coja-Oghlan; Cristopher Moore; Vishal Sanwalani (Random Struct. Algorithms, 2007)

A continuous-discontinuous second-order transition in the satisfiability of random Horn-SAT formulas. - Cristopher Moore; Gabriel Istrate; Demetrios D. Demopoulos; Moshe Y. Vardi (Random Struct. Algorithms, 2007)

The Power of Strong Fourier Sampling: Quantum Algorithms for Affine Groups and Hidden Shifts. - Cristopher Moore; Daniel N. Rockmore; Alexander Russell; Leonard J. Schulman (SIAM J. Comput., 2007)

The Phase Transition in Exact Cover. - Vamsi Kalapala; Cris Moore (Chic. J. Theor. Comput. Sci., 2008)

A simple constant-probability RP reduction from NP to Parity P. - Cristopher Moore; Alexander Russell (Electron. Colloquium Comput. Complex., 2008)

The Symmetric Group Defies Strong Fourier Sampling. - Cristopher Moore; Alexander Russell; Leonard J. Schulman (SIAM J. Comput., 2008)

Bounds on the quantum satisfibility threshold - Sergey Bravyi 001; Cristopher Moore; Alexander Russell (CoRR, 2009)

On the bias of traceroute sampling: Or, power-law degree distributions in regular graphs. - Dimitris Achlioptas; Aaron Clauset; David Kempe 001; Cristopher Moore (J. ACM, 2009)

Quantum algorithms for Simon's problem over nonabelian groups. - Gorjan Alagic; Cristopher Moore; Alexander Russell (ACM Trans. Algorithms, 2009)

Frugal and Truthful Auctions for Vertex Covers, Flows and Cuts. - David Kempe 001; Mahyar Salek; Cristopher Moore (FOCS, 2010)

Bounds on the Quantum Satisfiability Threshold. - Sergey Bravyi 001; Cristopher Moore; Alexander Russell (ICS, 2010)

Continuous and Discrete Methods in Computer Science. - Cristopher Moore (LATIN, 2010)

Circuit partitions and #P-complete products of inner products - Cristopher Moore; Alexander Russell (CoRR, 2010)

Active Learning for Hidden Attributes in Networks - Xiaoran Yan; Yaojia Zhu; Jean-Baptiste Rouquier; Cristopher Moore (CoRR, 2010)

How close can we come to a parity function when there isn't one? - Cristopher Moore; Alexander Russell (CoRR, 2010)

The McEliece Cryptosystem Resists Quantum Fourier Sampling Attacks - Hang Dinh; Cristopher Moore; Alexander Russell (CoRR, 2010)

Regarding a Representation-Theoretic Conjecture of Wigderson - Cristopher Moore; Alexander Russell (CoRR, 2010)

Approximate Representations and Approximate Homomorphisms - Cristopher Moore; Alexander Russell (CoRR, 2010)

Limitations of quantum coset states for graph isomorphism. - Sean Hallgren; Cristopher Moore; Martin Rötteler; Alexander Russell; Pranab Sen (J. ACM, 2010)

Finding conjugate stabilizer subgroups in PSL and related groups. - Aaron Denney; Cristopher Moore; Alexander Russell (Quantum Inf. Comput., 2010)

On the Impossibility of a Quantum Sieve Algorithm for Graph Isomorphism. - Cristopher Moore; Alexander Russell; Piotr Sniady (SIAM J. Comput., 2010)

The Nature of Computation. - Cristopher Moore; Stephan Mertens (Oxford University Press, 2011)

Independent Sets in Random Graphs from the Weighted Second Moment Method. - Varsha Dani; Cristopher Moore (APPROX-RANDOM, 2011)

McEliece and Niederreiter Cryptosystems That Resist Quantum Fourier Sampling Attacks. - Hang Dinh; Cristopher Moore; Alexander Russell (CRYPTO, 2011)

Active learning for node classification in assortative and disassortative networks. - Cristopher Moore; Xiaoran Yan; Yaojia Zhu; Jean-Baptiste Rouquier; Terran Lane (KDD, 2011)

The Rigidity Transition in Random Graphs. - Shiva Prasad Kasiviswanathan; Cristopher Moore; Louis Theran (SODA, 2011)

Phase transition in the detection of modules in sparse networks - Aurélien Decelle; Florent Krzakala; Cristopher Moore; Lenka Zdeborová (CoRR, 2011)

Parallel Complexity of Random Boolean Circuits - Jon Machta; Simon DeDeo; Stephan Mertens; Cristopher Moore (CoRR, 2011)

Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications - Aurélien Decelle; Florent Krzakala; Cristopher Moore; Lenka Zdeborová (CoRR, 2011)

The complexity of the fermionant, and immanants of constant width - Stephan Mertens; Cristopher Moore (CoRR, 2011)

Quantum Fourier sampling, Code Equivalence, and the quantum security of the McEliece and Sidelnikov cryptosystems - Hang Dinh; Cristopher Moore; Alexander Russell (CoRR, 2011)

A Graph Integral Formulation of the Circuit Partition Polynomial. - Cristopher Moore; Alexander Russell (Comb. Probab. Comput., 2011)

Tight Bounds on the Threshold for Permuted k-Colorability. - Varsha Dani; Cristopher Moore; Anna Olson (APPROX-RANDOM, 2012)

Topological phase transition in a network model with preferential attachment and node removal - Heiko Bauke; Cristopher Moore; Jean-Baptiste Rouquier; David Sherrington (CoRR, 2012)

Optimal epsilon-biased sets with just a little randomness - Cristopher Moore; Alexander Russell (CoRR, 2012)

Model Selection for Degree-corrected Block Models - Xiaoran Yan; Jacob E. Jensen; Florent Krzakala; Cristopher Moore; Cosma Rohilla Shalizi; Lenka Zdeborová; Pan Zhang; Yaojia Zhu (CoRR, 2012)

Continuum Percolation Thresholds in Two Dimensions - Stephan Mertens; Cristopher Moore (CoRR, 2012)

Stability analysis of financial contagion due to overlapping portfolios - Fabio Caccioli; Munik Shrestha; Cristopher Moore; J. Doyne Farmer (CoRR, 2012)

Approximating the Permanent via Nonabelian Determinants. - Cristopher Moore; Alexander Russell (SIAM J. Comput., 2012)

Small-Bias Sets for Nonabelian Groups - Derandomizations of the Alon-Roichman Theorem. - Sixia Chen; Cristopher Moore; Alexander Russell (APPROX-RANDOM, 2013)

The Power of Choice for Random Satisfiability. - Varsha Dani; Josep Díaz; Thomas P. Hayes; Cristopher Moore (APPROX-RANDOM, 2013)

Scalable text and link analysis with mixed-topic link models. - Yaojia Zhu; Xiaoran Yan; Lise Getoor; Cristopher Moore (KDD, 2013)

Transdisciplinary electric power grid science. - Charles D. Brummitt; Paul D. H. Hines; Ian Dobson; Cristopher Moore; Raissa M. D'Souza (CoRR, 2013)

Spectral redemption: clustering sparse networks. - Florent Krzakala; Cristopher Moore; Elchanan Mossel; Joe Neeman; Allan Sly; Lenka Zdeborová; Pan Zhang (CoRR, 2013)

A message-passing approach for threshold models of behavior in networks. - Munik Shrestha; Cristopher Moore (CoRR, 2013)

Phase Transitions in Community Detection: A Solvable Toy Model. - Greg Ver Steeg; Cristopher Moore; Aram Galstyan; Armen E. Allahverdyan (CoRR, 2013)

Small-Bias Sets for Nonabelian Groups: Derandomizing the Alon-Roichman Theorem - Sixia Chen; Cristopher Moore; Alexander Russell (CoRR, 2013)

The Complexity of the Fermionant and Immanants of Constant Width [Note]. - Stephan Mertens; Cristopher Moore (Theory Comput., 2013)

Tree codes and a conjecture on exponential sums. - Cristopher Moore; Leonard J. Schulman (ITCS, 2014)

Oriented and degree-generated block models: generating and inferring communities with inhomogeneous degree distributions. - Yaojia Zhu; Xiaoran Yan; Cristopher Moore (J. Complex Networks, 2014)

Computational Complexity, Phase Transitions, and Message-Passing for Community Detection. - Aurélien Decelle; Janina Hüttel; Alaa Saade; Cristopher Moore (CoRR, 2014)

Lower Bounds on the Critical Density in the Hard Disk Model via Optimized Metrics. - Thomas P. Hayes; Cristopher Moore (CoRR, 2014)

Heat and Noise on Cubes and Spheres: The Sensitivity of Randomly Rotated Polynomial Threshold Functions. - Cristopher Moore; Alexander Russell (CoRR, 2014)

Scalable detection of statistically significant communities and hierarchies: message-passing for modularity. - Pan Zhang; Cristopher Moore (CoRR, 2014)

Phase transitions in semisupervised clustering of sparse networks. - Pan Zhang; Cristopher Moore; Lenka Zdeborová (CoRR, 2014)

Group representations that resist random sampling. - Shachar Lovett; Cristopher Moore; Alexander Russell (Electron. Colloquium Comput. Complex., 2014)

Scalable detection of statistically significant communities and hierarchies, using message passing for modularity. - Pan Zhang; Cristopher Moore (Proc. Natl. Acad. Sci. USA, 2014)

An Entropic Proof of Chang's Inequality. - Russell Impagliazzo; Cristopher Moore; Alexander Russell (SIAM J. Discret. Math., 2014)

Detectability thresholds and optimal algorithms for community structure in dynamic networks. - Amir Ghasemian; Pan Zhang; Aaron Clauset; Cristopher Moore; Leto Peel (CoRR, 2015)

The phase transition in random regular exact cover. - Cristopher Moore (CoRR, 2015)

A message-passing approach for recurrent-state epidemic models on networks. - Munik Shrestha; Samuel V. Scarpino; Cristopher Moore (CoRR, 2015)

On the universal structure of human lexical semantics. - Hyejin Youn; Logan Sutton; Eric Smith; Cristopher Moore; Jon F. Wilkins; Ian Maddieson; William Croft 001; Tanmoy Bhattacharya 001 (CoRR, 2015)

Community detection in networks with unequal groups. - Pan Zhang; Cristopher Moore; M. E. J. Newman (CoRR, 2015)

Graph Isomorphism and Circuit Size. - Eric Allender; Joshua A. Grochow; Cristopher Moore (Electron. Colloquium Comput. Complex., 2015)

Limitations of single coset states and quantum algorithms for code equivalence. - Hang T. Dinh; Cristopher Moore; Alexander Russell (Quantum Inf. Comput., 2015)

Approximate Representations, Approximate Homomorphisms, and Low-Dimensional Embeddings of Groups. - Cristopher Moore; Alexander Russell (SIAM J. Discret. Math., 2015)

Optimal ε-Biased Sets with Just a Little Randomness. - Cristopher Moore; Alexander Russell (SIAM J. Discret. Math., 2015)

Phase transitions and optimal algorithms in high-dimensional Gaussian mixture clustering. - Thibault Lesieur; Caterina De Bacco; Jess Banks; Florent Krzakala; Cristopher Moore; Lenka Zdeborová (Allerton, 2016)

Information-theoretic thresholds for community detection in sparse networks. - Jess Banks; Cristopher Moore; Joe Neeman; Praneeth Netrapalli (COLT, 2016)

Information-theoretic thresholds for community detection in sparse networks. - Jess Banks; Cristopher Moore (CoRR, 2016)

Information-theoretic bounds and phase transitions in clustering, sparse PCA, and submatrix localization. - Jess Banks; Cristopher Moore; Roman Vershynin; Jiaming Xu 002 (CoRR, 2016)

Accurate and scalable social recommendation using mixed-membership stochastic block models. - Antonia Godoy-Lorite; Roger Guimerà; Cristopher Moore; Marta Sales-Pardo (CoRR, 2016)

Matrix multiplication algorithms from group orbits. - Joshua A. Grochow; Cristopher Moore (CoRR, 2016)

Random graph models for dynamic networks. - Xiao Zhang; Cristopher Moore; M. E. J. Newman (CoRR, 2016)

Codes, lower bounds, and phase transitions in the symmetric rendezvous problem. - Varsha Dani; Thomas P. Hayes; Cristopher Moore; Alexander Russell (Random Struct. Algorithms, 2016)

Community detection, link prediction, and layer interdependence in multilayer networks. - Caterina De Bacco; Eleanor A. Power; Daniel B. Larremore; Cristopher Moore (CoRR, 2017)

A physical model for efficient ranking in networks. - Caterina De Bacco; Daniel B. Larremore; Cristopher Moore (CoRR, 2017)

The Computer Science and Physics of Community Detection: Landscapes, Phase Transitions, and Hardness. - Cristopher Moore (Bull. EATCS, 2017)

Designing Strassen's algorithm. - Joshua A. Grochow; Cristopher Moore (Electron. Colloquium Comput. Complex., 2017)

Forkable Strings are Rare. - Alexander Russell; Cristopher Moore; Aggelos Kiayias; Saad Quader (IACR Cryptol. ePrint Arch., 2017)

Minimum Circuit Size, Graph Isomorphism, and Related Problems. - Eric Allender; Joshua A. Grochow; Dieter van Melkebeek; Cristopher Moore; Andrew Morgan (SIAM J. Comput., 2018)

Special Section on the Fifty-Sixth Annual IEEE Symposium on Foundations of Computer Science (FOCS 2015). - Cristopher Moore; Santosh S. Vempala (SIAM J. Comput., 2018)

Information-Theoretic Bounds and Phase Transitions in Clustering, Sparse PCA, and Submatrix Localization. - Jess Banks; Cristopher Moore; Roman Vershynin; Nicolas Verzelen; Jiaming Xu 002 (IEEE Trans. Inf. Theory, 2018)

The Kikuchi Hierarchy and Tensor PCA. - Alexander S. Wein; Ahmed El Alaoui; Cristopher Moore (FOCS, 2019)

Lecture Notes on Automata, Languages, and Grammars. - Cristopher Moore (CoRR, 2019)

Percolation is Odd. - Stephan Mertens; Cristopher Moore (CoRR, 2019)

Linear Consistency for Proof-of-Stake Blockchains. - Erica Blum; Aggelos Kiayias; Cristopher Moore; Saad Quader; Alexander Russell (CoRR, 2019)

The Planted Matching Problem: Phase Transitions and Exact Results. - Mehrdad Moharrami; Cristopher Moore; Jiaming Xu 002 (CoRR, 2019)

The Lovász Theta Function for Random Regular Graphs and Community Detection in the Hard Regime. - Jess Banks; Robert Kleinberg; Cristopher Moore (SIAM J. Comput., 2019)

The Combinatorics of the Longest-Chain Rule: Linear Consistency for Proof-of-Stake Blockchains. - Erica Blum; Aggelos Kiayias; Cristopher Moore; Saad Quader; Alexander Russell (SODA, 2020)

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 (COLT, 2021)

Belief propagation for permutations, rankings, and partial orders. - George T. Cantwell; Cristopher Moore (CoRR, 2021)

Effective Resistance for Pandemics: Mobility Network Sparsification for High-Fidelity Epidemic Simulation. - Alexander M. Mercier; Samuel V. Scarpino; Cristopher Moore (CoRR, 2021)

Efficient Random Beacons with Adaptive Security for Ungrindable Blockchains. - Aggelos Kiayias; Cristopher Moore; Saad Quader; Alexander Russell (IACR Cryptol. ePrint Arch., 2021)

The Generals' Scuttlebutt: Byzantine-Resilient Gossip Protocols. - Sandro Coretti; Aggelos Kiayias; Cristopher Moore; Alexander Russell (CCS, 2022)

Improved Reconstruction of Random Geometric Graphs. - Varsha Dani; Josep Díaz; Thomas P. Hayes; Cristopher Moore (ICALP, 2022)

A network compression approach for quantifying the importance of temporal contact chronology. - Andrea J. Allen; Cristopher Moore; Laurent Hébert-Dufresne (CoRR, 2022)

Disordered Systems Insights on Computational Hardness. - David Gamarnik; Cristopher Moore; Lenka Zdeborová (CoRR, 2022)

The Generalsâ Scuttlebutt: Byzantine-Resilient Gossip Protocols. - Sandro Coretti; Aggelos Kiayias; Cristopher Moore; Alexander Russell (IACR Cryptol. ePrint Arch., 2022)

Effective resistance against pandemics: Mobility network sparsification for high-fidelity epidemic simulations. - Alexander M. Mercier; Samuel V. Scarpino; Cristopher Moore (PLoS Comput. Biol., 2022)

Adaptively Secure Random Beacons for Ungrindable Blockchains. - Aggelos Kiayias; Cristopher Moore; Saad Quader; Alexander Russell (ICDCS, 2023)

A model for efficient dynamical ranking in networks. - Andrea Della Vecchia; Kibidi Neocosmos; Daniel B. Larremore; Cristopher Moore; Caterina De Bacco (CoRR, 2023)

The Role of Directionality, Heterogeneity, and Correlations in Epidemic Risk and Spread. - Antoine Allard; Cristopher Moore; Samuel V. Scarpino; Benjamin M. Althouse; Laurent Hébert-Dufresne (SIAM Rev., 2023)

Tensor Cumulants for Statistical Inference on Invariant Distributions. - Dmitriy Kunisky; Cristopher Moore; Alexander S. Wein (FOCS, 2024)

Reconstruction of random geometric graphs: Breaking the Ω(r) distortion barrier. - Varsha Dani; Josep Díaz; Thomas P. Hayes; Cristopher Moore (Eur. J. Comb., 2024)

The Spectrum of the Grigoriev-Laurent Pseudomoments. - Dmitriy Kunisky; Cristopher Moore (SIAM J. Discret. Math., 2024)

The Planted Spanning Tree Problems: Exact Overlap Characterization via Local Weak Convergence Extended Abstract. - Mehrdad Moharrami; Cristopher Moore; Jiaming Xu 002 (COLT, 2025)

The Planted Spanning Tree Problem. - Mehrdad Moharrami; Cristopher Moore; Jiaming Xu 002 (CoRR, 2025)

The Metric Dimension of Sparse Random Graphs. - Josep Díaz; Harrison Hartle; Cristopher Moore (CoRR, 2025)

Concerning the Responsible Use of AI in the US Criminal Justice System. - Cristopher Moore; Catherine Gill; Nadya Bliss; Kevin R. B. Butler; Stephanie Forrest; Daniel Lopresti; Mary Lou Maher; Helena Mentis; Shashi Shekhar 001; Amanda Stent; Matthew Turk 002 (CoRR, 2025)