Cristopher Moore | Academic Influence

Cristopher Moore's AcademicInfluence.com Rankings

Cristopher Moore

Computer Science

#3458

World Rank

#3630

Historical Rank

#1312

USA Rank

Database

#3328

World Rank

#3468

Historical Rank

#622

USA Rank

computer-science Degrees

Download Badge

Computer Science

Cristopher Moore's Degrees

PhD Computer Science Cornell University
Bachelors Mathematics Princeton University

Similar Degrees You Can Earn

Why Is Cristopher Moore Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Cristopher David Moore, known as Cris Moore, is an American computer scientist, mathematician, and physicist. He is resident faculty at the Santa Fe Institute, and was formerly a full professor at the University of New Mexico.

(See a Problem?)

Cristopher Moore's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Finding community structure in very large networks. (2004) (6337)
Hierarchical structure and the prediction of missing links in networks (2008) (1973)
Epidemics and percolation in small-world networks. (1999) (838)
Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications (2011) (708)
Spectral redemption in clustering sparse networks (2013) (581)
Quantum automata and quantum grammars (1997) (409)
Mean-field solution of the small-world network model. (1999) (390)
The Nature of Computation (2011) (361)
Stability Analysis of Financial Contagion Due to Overlapping Portfolios (2012) (343)
On the bias of traceroute sampling: Or, power-law degree distributions in regular graphs (2005) (217)
Quantum Walks on the Hypercube (2001) (201)
Exact solution of site and bond percolation on small-world networks. (2000) (179)
Recursion Theory on the Reals and Continuous-Time Computation (1996) (176)
Scale invariance in road networks. (2005) (163)
Phase transition in the detection of modules in sparse networks (2011) (161)
Generalized shifts: unpredictability and undecidability in dynamical systems Nonlinearity 4 199-230 (1991) (154)
Hard Tiling Problems with Simple Tiles (2000) (150)
Community detection, link prediction, and layer interdependence in multilayer networks (2017) (148)
Random k-SAT: Two Moments Suffice to Cross a Sharp Threshold (2003) (147)
Structural Inference of Hierarchies in Networks (2006) (146)
Parallel Quantum Computation and Quantum Codes (1998) (144)
Scalable detection of statistically significant communities and hierarchies, using message passing for modularity (2014) (144)
Continuum Percolation Thresholds in Two Dimensions (2012) (138)
Model selection for degree-corrected block models (2012) (114)
Information-theoretic thresholds for community detection in sparse networks (2016) (114)
Exact solutions for models of evolving networks with addition and deletion of nodes. (2006) (112)
Accuracy and scaling phenomena in Internet mapping. (2004) (112)
The Computer Science and Physics of Community Detection: Landscapes, Phase Transitions, and Hardness (2017) (112)
Random graph models for dynamic networks (2016) (108)
The asymptotic order of the random k-SAT threshold (2002) (106)
On the universal structure of human lexical semantics (2015) (102)
Detectability thresholds and optimal algorithms for community structure in dynamic networks (2015) (100)
Automatic filters for the detection of coherent structure in spatiotemporal systems. (2005) (99)
Limitations of quantum coset states for graph isomorphism (2005) (97)
Dynamical Recognizers: Real-Time Language Recognition by Analog Computers (1998) (95)
New constructions in cellular automata (2003) (86)
Generic quantum Fourier transforms (2003) (86)
On the bias of traceroute sampling (2005) (85)
What Is a Macrostate? Subjective Observations and Objective Dynamics (2003) (84)
Closed-for Analytic Maps in One and Two Dimensions can Simulate Universal Turing Machines (1999) (84)
Computational Complexity and Statistical Physics (2006) (80)
The symmetric group defies strong Fourier sampling (2005) (78)
The phase transition in 1-in-k SAT and NAE 3-SAT (2001) (75)
Glassy dynamics and aging in an exactly solvable spin model. (1997) (72)
The Computational Complexity of Sandpiles (1998) (70)
Braids in classical gravity (1993) (68)
An Analog Characterization of the Grzegorczyk Hierarchy (2002) (68)
The power of basis selection in fourier sampling: hidden subgroup problems in affine groups (2004) (66)
Information-Theoretic Bounds and Phase Transitions in Clustering, Sparse PCA, and Submatrix Localization (2016) (65)
A message-passing approach for recurrent-state epidemic models on networks (2015) (62)
The resolution complexity of random graph k-colorability (2005) (61)
Iteration, Inequalities, and Differentiability in Analog Computers (2000) (60)
Almost all graphs with average degree 4 are 3-colorable (2002) (60)
Scalable text and link analysis with mixed-topic link models (2013) (59)
Complexity of Two-Dimensional Patterns (1998) (59)
Majority-Vote Cellular Automata, Ising Dynamics, and P-Completeness (1997) (59)
Generating Hard Satisfiable Formulas by Hiding Solutions Deceptively (2005) (58)
Counting, fanout and the complexity of quantum ACC (2001) (58)
On the computational power of probabilistic and quantum branching program (2005) (57)
The Chromatic Number of Random Regular Graphs (2004) (57)
Hiding Satisfying Assignments: Two Are Better than One (2004) (53)
Phase transitions in semisupervised clustering of sparse networks (2014) (52)
McEliece and Niederreiter Cryptosystems That Resist Quantum Fourier Sampling Attacks (2011) (51)
A physical model for efficient ranking in networks (2017) (51)
Predicting nonlinear cellular automata quickly by decomposing them into linear ones (1997) (50)
MAX k‐CUT and approximating the chromatic number of random graphs (2003) (49)
Community detection in networks with unequal groups (2015) (45)
A message-passing approach for threshold models of behavior in networks (2013) (44)
Life Without Death is P-complete (1997) (44)
Counting connected graphs and hypergraphs via the probabilistic method (2007) (42)
New Results on Alternating and Non-deterministic Two-Dimensional Finite-State Automata (2001) (41)
Quantum Circuits: Fanout, Parity, and Counting (1999) (40)
Accurate and scalable social recommendation using mixed-membership stochastic block models (2016) (39)
On the impossibility of a quantum sieve algorithm for graph isomorphism (2006) (38)
The Kikuchi Hierarchy and Tensor PCA (2019) (38)
Dynamic Networks from Hierarchical Bayesian Graph Clustering (2010) (38)
Quasi-Linear Cellular Automata (1997) (37)
How Do Networks Become Navigable (2003) (37)
Traceroute sampling makes random graphs appear to have power law degree distributions (2003) (37)
Internal Diffusion-Limited Aggregation: Parallel Algorithms and Complexity (1999) (36)
From Spin Glasses to Hard Satisfiable Formulas (2004) (36)
Tree codes and a conjecture on exponential sums (2013) (35)
Height Representation, Critical Exponents, and Ergodicity in the Four-State Triangular Potts Antiferromagnet (1999) (34)
The physical limits of communication or Why any sufficiently advanced technology is indistinguishable from noise (1999) (30)
Who Wins Domineering on Rectangular Boards (2000) (29)
An n-Dimensional Generalization of the Rhombus Tiling (2001) (29)
For distinguishing conjugate hidden subgroups, the pretty good measurement is as good as it gets (2005) (29)
Oriented and degree-generated block models: generating and inferring communities with inhomogeneous degree distributions (2012) (29)
Frugal and Truthful Auctions for Vertex Covers, Flows and Cuts (2009) (28)
Phase transitions and optimal algorithms in high-dimensional Gaussian mixture clustering (2016) (28)
Minimum Circuit Size, Graph Isomorphism, and Related Problems (2017) (28)
The Power of Strong Fourier Sampling: Quantum Algorithms for Affine Groups and Hidden Shifts (2005) (28)
The Symmetric Group Defies Strong Fourier Sampling: Part II (2005) (27)
An Entropic Proof of Chang's Inequality (2012) (26)
On the 2-Colorability of Random Hypergraphs (2002) (25)
Quasilinear cellular automata (1997) (25)
Percolation thresholds and Fisher exponents in hypercubic lattices. (2018) (25)
Circuits and expressions with non-associative gates (1997) (24)
Quantum and Stochastic Branching Programs of Bounded Width (2002) (23)
How Much Backtracking Does It Take to Color Random Graphs? Rigorous Results on Heavy Tails (2004) (23)
Equation Satisfiability and Program Satisfiability for Finite Monoids (2000) (23)
Rectangles and Squares Recognized by Two-Dimensional Automata (2004) (22)
Bounds on the Quantum Satisfiability Threshold (2009) (22)
Quantum algorithms for Simon's problem over general groups (2006) (22)
The role of directionality, heterogeneity and correlations in epidemic risk and spread. (2020) (22)
New Periodic Orbits for the n-Body Problem (2005) (21)
The Phase Transition in Exact Cover (2005) (20)
Independent Sets in Random Graphs from the Weighted Second Moment Method (2010) (20)
A classical one-way function to confound quantum adversaries (2007) (20)
One-Dimensional Peg Solitaire, and Duotaire (2000) (19)
Vortex dynamics and entropic forces in antiferromagnets and antiferromagnetic Potts models. (1999) (19)
Generalized one-sided shifts and maps of the interval (1991) (19)
Spectral Planting and the Hardness of Refuting Cuts, Colorability, and Communities in Random Graphs (2020) (19)
Algebraic Properties of the Block Transformation on Cellular Automata (1995) (18)
Almost All Graphs of Degree 4 are 3-colorable (2001) (18)
The Complexity of the Fermionant and Immanants of Constant Width [Note] (2011) (17)
The Hidden Subgroup Problem in Affine Groups: Basis Selectio n in Fourier Sampling (2002) (16)
A Note on the Representational Incompatibility of Function Approximation and Factored Dynamics (2002) (16)
Topological phase transition in a network model with preferential attachment and node removal (2011) (15)
Sampling Grid Colorings with Fewer Colors (2004) (15)
Ribbon Tile Invariants from the Signed Area (2002) (15)
Graph Isomorphism and Circuit Size (2015) (15)
The Lovász Theta Function for Random Regular Graphs and Community Detection in the Hard Regime (2017) (15)
Closed-form Analytic Maps in One and Two DimensionsCan Simulate Turing Machines (1996) (14)
Rapid mixing for lattice colourings with fewer colours (2005) (14)
Matrix multiplication algorithms from group orbits (2016) (14)
Upper and Lower Bounds on Continuous-Time Computation (2000) (13)
The Combinatorics of the Longest-Chain Rule: Linear Consistency for Proof-of-Stake Blockchains (2020) (13)
The McEliece Cryptosystem Resists Quantum Fourier Sampling Attacks (2010) (13)
Non-Abelian Cellular Automata (1995) (13)
Lattice Gas Prediction is P-Complete (1997) (12)
Satisfiability of Systems of Equations over Finite Monoids (2001) (12)
Explicit Multiregister Measurements for Hidden Subgroup Problems; or, Fourier Sampling Strikes Back (2005) (12)
Information-theoretic bounds and phase transitions in clustering, sparse PCA, and submatrix localization (2017) (11)
Small-Bias Sets for Nonabelian Groups - Derandomizations of the Alon-Roichman Theorem (2013) (11)
Finding conjugate stabilizer subgroups in PSL and related groups (2008) (11)
Approximate Representations, Approximate Homomorphisms, and Low-Dimensional Embeddings of Groups (2015) (11)
Why Mapping the Internet is Hard (2004) (11)
Tiling groups for Wang tiles (2002) (11)
An Analog Characterization of the Subrecursive Functions (2000) (10)
Some Notes on Parallel Quantum Computation (1998) (10)
Queues, stacks, and transcendentality at the transition to chaos (1998) (10)
The rigidity transition in random graphs (2010) (10)
The Asymptotic Order of the k-SAT Threshold (2002) (10)
Sampling grid colourings with fewer colours (2004) (10)
Predicting Lattice Gases is P-complete (1997) (10)
Percolation thresholds in hyperbolic lattices. (2017) (9)
The phase transition in random regular exact cover (2015) (9)
Commuting Cellular Automata (1997) (9)
The Planted Matching Problem: Phase Transitions and Exact Results (2019) (9)
Lower Bounds on the Critical Density in the Hard Disk Model via Optimized Metrics (2014) (9)
Limitations of quantum coset states for graph isomorphism (2010) (8)
Tight Bounds on the Threshold for Permuted k-Colorability (2011) (8)
Phase transitions in community detection: A solvable toy model (2013) (8)
Strong Fourier Sampling Fails over $G^n$ (2005) (8)
A continuous–discontinuous second‐order transition in the satisfiability of random Horn‐SAT formulas (2005) (8)
The Generals' Scuttlebutt: Byzantine-Resilient Gossip Protocols (2022) (8)
Quantum Fourier sampling, Code Equivalence, and the quantum security of the McEliece and Sidelnikov cryptosystems (2011) (8)
Complexity in Dynamical Systems (1991) (7)
Building the Components for a Biomolecular Computer (2004) (7)
Series expansion of the percolation threshold on hypercubic lattices (2018) (7)
Designing Strassen's algorithm (2017) (6)
The Power of Choice for Random Satisfiability (2012) (6)
A complex legacy (2011) (6)
Forkable Strings are Rare (2017) (6)
Subexponential-Time Algorithms for Hidden Subgroup Problems Over Product Groups (2006) (5)
Explicit Multiregister Measurements for Hidden Subgroup Problems (2005) (5)
Linear Consistency for Proof-of-Stake Blockchains (2019) (5)
Active Learning for Hidden Attributes in Networks (2010) (5)
Approximating the Permanent via Nonabelian Determinants (2009) (4)
Computational Complexity in Physics (2001) (4)
Limitations of single coset states and quantum algorithms for code equivalence (2015) (4)
Disordered systems insights on computational hardness (2022) (4)
Tight Results on Multiregister Fourier Sampling: Quantum Measurements for Graph Isomorphism Require Entanglement (2005) (4)
A computational approach to animal breeding. (2007) (4)
Bounds on the quantum satisfibility threshold (2009) (4)
Small-Bias Sets for Nonabelian Groups: Derandomizing the Alon-Roichman Theorem (2013) (3)
One-Dimensional Peg Solitaire (2000) (3)
Quantum algorithms for Simon's problem over nonabelian groups (2009) (3)
Group representations that resist random sampling (2014) (3)
CELLULAR AUTOMATA: A DISCRETE UNIVERSE By ANDREW ILACHINSKI: 808 pp., £76.00, ISBN 981-02-4623-4 (World Scientific, Singapore, 2001). (2003) (3)
Some Polyomino Tilings of the Plane (1999) (3)
Entropic Coulomb Forces in Ising and Potts Antiferromagnets and Ice Models (1999) (3)
Polyabelian loops and Boolean completeness (2000) (3)
Statistical Inference for Detecting Structures and Anomalies in Networks (2015) (2)
Effective resistance against pandemics: Mobility network sparsification for high-fidelity epidemic simulations (2021) (2)
Optimal epsilon-biased sets with just a little randomness (2012) (2)
The phase transition in random 1-in-k SAT and NAE 3-SAT (2001) (2)
Introduction: Where Statistical Physics Mects Computation (2006) (2)
Percolation is Odd (2019) (2)
Subtree-Counting Loops (2007) (2)
Codes, lower bounds, and phase transitions in the symmetric rendezvous problem (2016) (2)
A Graph Integral Formulation of the Circuit Partition Polynomial (2011) (2)
Belief propagation for permutations, rankings, and partial orders (2021) (1)
Community Detection with the z-Laplacian (2014) (1)
Efficient Random Beacons with Adaptive Security for Ungrindable Blockchains (2021) (1)
Another Way to Perform the Quantum Fourier Transform in Linear Parallel Time (1998) (1)
The Cavity Method, Belief Propagation, and Phase Transitions in Community Detection (2014) (1)
Circuit partitions and #P-complete products of inner products (2010) (1)
Quantum Measurements for Graph Isomorphism Require Entanglement: Tight Results on Multiregister Fourier Sampling (Withdrawn) (2005) (1)
Parallel complexity of random Boolean circuits (2011) (1)
Approximate Representations and Approximate Homomorphisms (2010) (1)
Dynamical Recognizers: Real-time Language Recognition by Analog Computers (Extended Abstract) (1997) (1)
Quantum and Stochastic Programs of Bounded Width (2002) (1)
MINIMUM CIRCUIT SIZE , GRAPH ISOMORPHISM , AND RELATED (2018) (1)
New results on alternating and non-deterministi two-dimensional nite-state automataJarkko (2001) (0)
Bratteli Diagrams and Subexponential Time Quantum Algorithms for Hidden Subgroup Problems: or, Fourier Sampling Strikes Back (2005) (0)
A simple constant-probability RP reduction from NP to Parity P (2008) (0)
Model selection for stochastic block models (2013) (0)
Finding conjugate stabilizer subgroups of almost 3-transitive groups (2008) (0)
Bubbles and Crashes in a Heterogeneous-Agent Financial Market Model (2013) (0)
Disease spreading and percolation in small-world networks (1999) (0)
D S ] 3 0 A ug 2 01 7 Designing Strassen ’ s Algorithm (2018) (0)
Regarding a Representation-Theoretic Conjecture of Wigderson (2010) (0)
Equation Satis ability and Program Satis ability forFinite (2000) (0)
Applications of the probabilistic method to random graphs (2005) (0)
The spectrum of the Grigoriev-Laurent pseudomoments (2022) (0)
Frontmatter, Table of Contents, Preface, Conference Organization (2014) (0)
Improved Reconstruction of Random Geometric Graphs (2022) (0)
Continuous and Discrete Methods in Computer Science (2010) (0)
Heat and Noise on Cubes and Spheres: The Sensitivity of Randomly Rotated Polynomial Threshold Functions (2014) (0)
Model Selection for Complex Networks (2011) (0)
Iteration , Inequalities , and Di erentiabilityin Analog (1999) (0)
Ac ce pt ed m an us cr ip t A Computational Approach to Animal Breeding (2006) (0)
Dynamical recognizers (extended abstract): real-time language recognition by analog computers (1997) (0)
Series Expansion of Critical Densities for Percolation on $\mathbb{Z}^d$ (2018) (0)
Automata , languages , and grammars CristopherMoore July (2014) (0)
Optimal ε-Biased Sets with Just a Little Randomness (2012) (0)
Automata , languages , and grammars CristopherMoore January 24 , 2015 (2015) (0)
Circuits and Expressions withNon-Associative Gates ( Extended Abstract ) ? (2007) (0)
Methods Hierarchy by aggregation Hierarchy by division Hierarchy by shuffling Spectral methods Hierarchies & Missing Links General structure detection (2009) (0)
How close can we come to a parity function when there isn't one? (2010) (0)
Hard instances with hidden solutions (2007) (0)
Lecture Notes on Automata, Languages, and Grammars (2019) (0)
Spatial Mixing for Independent Sets in Poisson Random Trees (2015) (0)
D S ] 1 O ct 2 01 9 The Kikuchi Hierarchy and Tensor PCA (2019) (0)
J un 2 00 0 Who Wins Domineering on Rectangular Boards ? (2002) (0)
A note on Graph Automorphism and Smart Reductions (2018) (0)
Interdependence Between Network Layers (2019) (0)
AN INCOMPLETENESS THEOREM FOR CALCULATING THE FUTURE (2007) (0)
0 30 94 15 v 2 1 3 O ct 2 00 3 How Do Networks Become Navigable ? (2008) (0)
The Onset of Difficulty in A Variant of Graph Coloring and the Jamming Transition (2011) (0)
Performing the Quantum Fourier Transform in Linear Parallel Time (1998) (0)
S ep 2 00 2 The Asymptotic Order of the Random kSAT Threshold (2022) (0)
Hierarchy by division Finding and evaluating community structure in networks (2011) (0)
C C ] 2 6 O ct 2 01 7 Minimum Circuit Size , Graph Isomorphism , and Related Problems ∗ (2018) (0)
Computational Complexity, Phase Transitions, and Message-Passing for Community Detection (2014) (0)
Upper and lower bounds on ontinuous-time omputationManuel (2007) (0)
Outline Single Source Distributed Sources Facility location Size-density law A reasonable derivation Global redistribution networks Structure Detection Hierarchy by division Hierarchy by shuffling Spectral methods Hierarchies & Missing Links General structure detection (2009) (0)
Series Expansion of Critical Densities for Percolation on Zd (2018) (0)
A pr 1 99 7 Lattice Gas Prediction is P-complete (1997) (0)
Special Section on the Fifty-Sixth Annual IEEE Symposium on Foundations of Computer Science (FOCS 2015) (2018) (0)
On the 2-olorability of random hypergraphsDimitris (2007) (0)
2 S ep 2 00 1 Computational complexity in physics (2008) (0)
Analog Computers and the Iteration Functional (1998) (0)
Fearful Symmetries: Quantum Computing, Factoring, and Graph Isomorphism (2005) (0)
Glassy Behavior in an Exactly Solvable Spin Model (1997) (0)
A network compression approach for quantifying the importance of temporal contact chronology (2022) (0)

This paper list is powered by the following services:

Other Resources About Cristopher Moore

en.wikipedia.org

What Schools Are Affiliated With Cristopher Moore?

Cristopher Moore is affiliated with the following schools: