Person:162055: Difference between revisions

From MaRDI portal
Person:162055
Created automatically from import230924090903
 
m AuthorDisambiguator moved page Moore, Cristopher to Moore, Cristopher: Duplicate
 
(No difference)

Latest revision as of 14:26, 6 December 2023

Available identifiers

zbMath Open moore.cristopherDBLPm/CristopherMooreWikidataQ5185878 ScholiaQ5185878MaRDI QIDQ162055

List of research outcomes

PublicationDate of PublicationType
The Spectrum of the Grigoriev–Laurent Pseudomoments2024-01-10Paper
The Role of Directionality, Heterogeneity, and Correlations in Epidemic Risk and Spread2023-05-10Paper
Disordered systems insights on computational hardness2022-12-13Paper
Disordered Systems Insights on Computational Hardness2022-10-15Paper
The planted matching problem: phase transitions and exact results2022-02-14Paper
Trigonometric functions in the $p$-norm2021-09-28Paper
Reconstruction of Random Geometric Graphs: Breaking the Omega(r) distortion barrier2021-07-29Paper
The Lov\'asz Theta Function for Random Regular Graphs and Community Detection in the Hard Regime2021-07-28Paper
Minimum Circuit Size, Graph Isomorphism, and Related Problems2021-06-15Paper
The Combinatorics of the Longest-Chain Rule: Linear Consistency for Proof-of-Stake Blockchains2021-02-02Paper
A computational approach to animal breeding2020-10-28Paper
Spectral Planting and the Hardness of Refuting Cuts, Colorability, and Communities in Random Graphs2020-08-27Paper
The Lovász Theta Function for Random Regular Graphs and Community Detection in the Hard Regime2019-09-02Paper
Rapid mixing for lattice colourings with fewer colours2019-07-09Paper
The Computer Science and Physics of Community Detection: Landscapes, Phase Transitions, and Hardness2019-07-03Paper
Series expansion of the percolation threshold on hypercubic lattices2019-03-27Paper
Oriented and degree-generated block models: generating and inferring communities with inhomogeneous degree distributions2018-10-16Paper
Information-Theoretic Bounds and Phase Transitions in Clustering, Sparse PCA, and Submatrix Localization2018-09-19Paper
Minimum Circuit Size, Graph Isomorphism, and Related Problems2018-07-19Paper
The rigidity transition in random graphs2017-09-29Paper
Designing Strassen's algorithm2017-08-30Paper
Percolation Thresholds in Hyperbolic Lattices2017-08-19Paper
Tree codes and a conjecture on exponential sums2017-05-19Paper
Spectral redemption in clustering sparse networks2017-02-16Paper
Codes, lower bounds, and phase transitions in the symmetric rendezvous problem2017-01-05Paper
Matrix multiplication algorithms from group orbits2016-12-05Paper
The phase transition in random regular exact cover2016-10-21Paper
Computational complexity, phase transitions, and message-passing for community detection2016-07-29Paper
Information-theoretic thresholds for community detection in sparse networks2016-07-06Paper
Information-theoretic thresholds for community detection in sparse networks2016-01-11Paper
Approximate Representations, Approximate Homomorphisms, and Low-Dimensional Embeddings of Groups2015-11-27Paper
Group representations that resist random sampling2015-11-13Paper
On the bias of traceroute sampling2015-11-11Paper
Generic quantum Fourier transforms2015-09-02Paper
Generic quantum Fourier transforms2015-08-03Paper
https://portal.mardi4nfdi.de/entity/Q55013762015-08-03Paper
Optimal $\varepsilon$-Biased Sets with Just a Little Randomness2015-07-31Paper
Spatial Mixing for Independent Sets in Poisson Random Trees2015-02-21Paper
https://portal.mardi4nfdi.de/entity/Q29347172014-12-18Paper
Limitations of quantum coset states for graph isomorphism2014-11-25Paper
Quantum algorithms for Simon's problem over nonabelian groups2014-11-18Paper
The complexity of the fermionant, and immanants of constant width2014-10-06Paper
Heat and Noise on Cubes and Spheres: The Sensitivity of Randomly Rotated Polynomial Threshold Functions2014-08-22Paper
An Entropic Proof of Chang's Inequality2014-06-19Paper
https://portal.mardi4nfdi.de/entity/Q54145682014-05-06Paper
Small-Bias Sets for Nonabelian Groups2013-10-04Paper
The Power of Choice for Random Satisfiability2013-10-04Paper
Tight Bounds on the Threshold for Permuted k-Colorability2012-11-02Paper
Approximating the Permanent via Nonabelian Determinants2012-08-10Paper
A Graph Integral Formulation of the Circuit Partition Polynomial2011-12-08Paper
Finding conjugate stabilizer subgroups in PSL(2; q) and related groups2011-10-05Paper
https://portal.mardi4nfdi.de/entity/Q30907742011-09-02Paper
Independent Sets in Random Graphs from the Weighted Second Moment Method2011-08-17Paper
McEliece and Niederreiter Cryptosystems That Resist Quantum Fourier Sampling Attacks2011-08-12Paper
Limitations of quantum coset states for graph isomorphism2011-05-16Paper
On the Impossibility of a Quantum Sieve Algorithm for Graph Isomorphism2011-01-17Paper
Regarding a Representation-Theoretic Conjecture of Wigderson2010-09-21Paper
Quasilinear cellular automata2010-09-11Paper
On the bias of traceroute sampling2010-08-16Paper
Almost all graphs with average degree 4 are 3-colorable2010-08-05Paper
LATIN 2004: Theoretical Informatics2009-05-07Paper
https://portal.mardi4nfdi.de/entity/Q36240482009-04-28Paper
https://portal.mardi4nfdi.de/entity/Q35971472009-02-09Paper
https://portal.mardi4nfdi.de/entity/Q35496532009-01-05Paper
The Symmetric Group Defies Strong Fourier Sampling2008-12-22Paper
https://portal.mardi4nfdi.de/entity/Q35492542008-12-21Paper
Principles and Practice of Constraint Programming – CP 20042008-09-09Paper
https://portal.mardi4nfdi.de/entity/Q35226552008-09-03Paper
The Power of Strong Fourier Sampling: Quantum Algorithms for Affine Groups and Hidden Shifts2008-06-19Paper
A continuous–discontinuous second‐order transition in the satisfiability of random Horn‐SAT formulas2008-01-08Paper
Counting connected graphs and hypergraphs via the probabilistic method2008-01-08Paper
Random k‐SAT: Two Moments Suffice to Cross a Sharp Threshold2007-06-26Paper
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques2006-07-07Paper
MAX k‐CUT and approximating the chromatic number of random graphs2006-06-06Paper
On the computational power of probabilistic and quantum branching program2006-01-10Paper
https://portal.mardi4nfdi.de/entity/Q57157252006-01-04Paper
Theory and Applications of Satisfiability Testing2005-12-16Paper
New Periodic Orbits for the n-Body Problem2005-11-08Paper
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques2005-08-25Paper
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques2005-08-25Paper
Theory Is Forever2005-01-18Paper
https://portal.mardi4nfdi.de/entity/Q48289602004-11-29Paper
Almost all graphs with average degree 4 are 3-colorable2004-11-18Paper
https://portal.mardi4nfdi.de/entity/Q48143402004-09-07Paper
https://portal.mardi4nfdi.de/entity/Q47371692004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44491762004-02-08Paper
On the 2-colorability of random hypergraphs2003-12-17Paper
https://portal.mardi4nfdi.de/entity/Q44404362003-12-17Paper
https://portal.mardi4nfdi.de/entity/Q44077082003-11-10Paper
https://portal.mardi4nfdi.de/entity/Q44077122003-11-10Paper
https://portal.mardi4nfdi.de/entity/Q45295372003-09-18Paper
An analog characterization of the Grzegorczyk hierarchy2003-05-14Paper
Ribbon tile invariants from the signed area2002-12-11Paper
https://portal.mardi4nfdi.de/entity/Q47791712002-11-25Paper
https://portal.mardi4nfdi.de/entity/Q43311952002-06-10Paper
Parallel Quantum Computation and Quantum Codes2002-04-23Paper
Hard tiling problems with simple tiles2002-02-07Paper
https://portal.mardi4nfdi.de/entity/Q27683712002-01-30Paper
Queues, stacks, and transcendentality at the transition to chaos2002-01-13Paper
https://portal.mardi4nfdi.de/entity/Q27627942002-01-09Paper
https://portal.mardi4nfdi.de/entity/Q27075312001-04-03Paper
Iteration, inequalities, and differentiability in analog computers2001-03-12Paper
Internal diffusion-limited aggregation: parallel algorithms and complexity2000-10-08Paper
Height representation, critical exponents, and ergodicity in the four-state triangular Potts antiferromagnet2000-10-08Paper
Unpredictability and undecidability in dynamical systems2000-07-16Paper
Braids in classical dynamics2000-07-16Paper
Quantum automata and quantum grammars2000-06-04Paper
Circuits and expressions with nonassociative gates2000-01-01Paper
The computational complexity of sandpiles1999-11-22Paper
Complexity of two-dimensional patterns1999-08-08Paper
Majority-vote cellular automata, Ising dynamics, and \(\mathbf P\)-completeness1999-05-25Paper
https://portal.mardi4nfdi.de/entity/Q42246561999-05-18Paper
Closed-form analytic maps in one and two dimensions can simulate universal Turing machines1999-01-12Paper
Dynamical recognizers: real-time language recognition by analog computers1998-08-13Paper
https://portal.mardi4nfdi.de/entity/Q43856151998-04-20Paper
Predicting nonlinear cellular automata quickly by decomposing them into linear ones1997-12-17Paper
https://portal.mardi4nfdi.de/entity/Q43361081997-05-12Paper
Recursion theory on the reals and continuous-time computation1997-02-27Paper
Generalized one-sided shifts and maps of the interval1992-06-25Paper
Generalized shifts: unpredictability and undecidability in dynamical systems1991-01-01Paper
Some Polyomino Tilings of the Plane0001-01-03Paper
Tensor cumulants for statistical inference on invariant distributions0001-01-03Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Moore, Cristopher