default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCristopher Moore
Person information
- affiliation: Santa Fe Institute, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j52]Varsha Dani
, Josep Díaz, Thomas P. Hayes, Cristopher Moore:
Reconstruction of random geometric graphs: Breaking the Ω(r) distortion barrier. Eur. J. Comb. 121: 103842 (2024)- [j51]Dmitriy Kunisky, Cristopher Moore:
The Spectrum of the Grigoriev-Laurent Pseudomoments. SIAM J. Discret. Math. 38(1): 103-131 (2024) - [c60]Dmitriy Kunisky, Cristopher Moore, Alexander S. Wein:
Tensor Cumulants for Statistical Inference on Invariant Distributions. FOCS 2024: 1007-1026 - [i94]Dmitriy Kunisky, Cristopher Moore, Alexander S. Wein:
Tensor cumulants for statistical inference on invariant distributions. CoRR abs/2404.18735 (2024) - 2023
- [j50]Antoine Allard, Cristopher Moore, Samuel V. Scarpino, Benjamin M. Althouse, Laurent Hébert-Dufresne:
The Role of Directionality, Heterogeneity, and Correlations in Epidemic Risk and Spread. SIAM Rev. 65(2): 471-492 (2023) - [c59]Aggelos Kiayias, Cristopher Moore, Saad Quader, Alexander Russell:
Adaptively Secure Random Beacons for Ungrindable Blockchains. ICDCS 2023: 62-72 - [i93]Andrea Della Vecchia, Kibidi Neocosmos, Daniel B. Larremore, Cristopher Moore, Caterina De Bacco:
A model for efficient dynamical ranking in networks. CoRR abs/2307.13544 (2023) - 2022
- [j49]Alexander M. Mercier, Samuel V. Scarpino, Cristopher Moore:
Effective resistance against pandemics: Mobility network sparsification for high-fidelity epidemic simulations. PLoS Comput. Biol. 18(11): 1010650 (2022) - [c58]Sandro Coretti, Aggelos Kiayias, Cristopher Moore, Alexander Russell:
The Generals' Scuttlebutt: Byzantine-Resilient Gossip Protocols. CCS 2022: 595-608 - [c57]Varsha Dani, Josep Díaz, Thomas P. Hayes, Cristopher Moore:
Improved Reconstruction of Random Geometric Graphs. ICALP 2022: 48:1-48:17 - [i92]Dmitriy Kunisky, Cristopher Moore:
The spectrum of the Grigoriev-Laurent pseudomoments. CoRR abs/2203.05693 (2022) - [i91]Andrea J. Allen, Cristopher Moore, Laurent Hébert-Dufresne:
A network compression approach for quantifying the importance of temporal contact chronology. CoRR abs/2205.11566 (2022) - [i90]David Gamarnik, Cristopher Moore, Lenka Zdeborová:
Disordered Systems Insights on Computational Hardness. CoRR abs/2210.08312 (2022) - [i89]Sandro Coretti, Aggelos Kiayias, Cristopher Moore, Alexander Russell:
The Generals’ Scuttlebutt: Byzantine-Resilient Gossip Protocols. IACR Cryptol. ePrint Arch. 2022: 541 (2022) - 2021
- [c56]Afonso S. Bandeira, Jess Banks, Dmitriy Kunisky, Cristopher Moore, Alexander S. Wein:
Spectral Planting and the Hardness of Refuting Cuts, Colorability, and Communities in Random Graphs. COLT 2021: 410-473 - [i88]Varsha Dani, Josep Díaz, Thomas P. Hayes, Cristopher Moore:
Improved Reconstruction of Random Geometric Graphs. CoRR abs/2107.14323 (2021) - [i87]George T. Cantwell, Cristopher Moore:
Belief propagation for permutations, rankings, and partial orders. CoRR abs/2110.00513 (2021) - [i86]Alexander M. Mercier, Samuel V. Scarpino, Cristopher Moore:
Effective Resistance for Pandemics: Mobility Network Sparsification for High-Fidelity Epidemic Simulation. CoRR abs/2111.02449 (2021) - [i85]Aggelos Kiayias, Cristopher Moore, Saad Quader, Alexander Russell:
Efficient Random Beacons with Adaptive Security for Ungrindable Blockchains. IACR Cryptol. ePrint Arch. 2021: 1698 (2021) - 2020
- [c55]Erica Blum, Aggelos Kiayias, Cristopher Moore, Saad Quader, Alexander Russell:
The Combinatorics of the Longest-Chain Rule: Linear Consistency for Proof-of-Stake Blockchains. SODA 2020: 1135-1154 - [i84]Afonso S. Bandeira, Jess Banks, Dmitriy Kunisky, Cristopher Moore, Alexander S. Wein:
Spectral Planting and the Hardness of Refuting Cuts, Colorability, and Communities in Random Graphs. CoRR abs/2008.12237 (2020)
2010 – 2019
- 2019
- [j48]Jess Banks, Robert Kleinberg, Cristopher Moore:
The Lovász Theta Function for Random Regular Graphs and Community Detection in the Hard Regime. SIAM J. Comput. 48(3): 1098-1119 (2019) - [c54]Alexander S. Wein, Ahmed El Alaoui, Cristopher Moore:
The Kikuchi Hierarchy and Tensor PCA. FOCS 2019: 1446-1468 - [i83]Alexander S. Wein, Ahmed El Alaoui, Cristopher Moore:
The Kikuchi Hierarchy and Tensor PCA. CoRR abs/1904.03858 (2019) - [i82]Cristopher Moore:
Lecture Notes on Automata, Languages, and Grammars. CoRR abs/1907.12713 (2019) - [i81]Stephan Mertens, Cristopher Moore:
Percolation is Odd. CoRR abs/1909.01484 (2019) - [i80]Erica Blum, Aggelos Kiayias, Cristopher Moore, Saad Quader, Alexander Russell:
Linear Consistency for Proof-of-Stake Blockchains. CoRR abs/1911.10187 (2019) - [i79]Mehrdad Moharrami, Cristopher Moore, Jiaming Xu:
The Planted Matching Problem: Phase Transitions and Exact Results. CoRR abs/1912.08880 (2019) - 2018
- [j47]Eric Allender, Joshua A. Grochow, Dieter van Melkebeek, Cristopher Moore, Andrew Morgan:
Minimum Circuit Size, Graph Isomorphism, and Related Problems. SIAM J. Comput. 47(4): 1339-1372 (2018) - [j46]Cristopher Moore, Santosh S. Vempala:
Special Section on the Fifty-Sixth Annual IEEE Symposium on Foundations of Computer Science (FOCS 2015). SIAM J. Comput. 47(6): 2237 (2018) - [j45]Jess Banks, Cristopher Moore, Roman Vershynin, Nicolas Verzelen, Jiaming Xu:
Information-Theoretic Bounds and Phase Transitions in Clustering, Sparse PCA, and Submatrix Localization. IEEE Trans. Inf. Theory 64(7): 4872-4894 (2018) - [c53]Eric Allender, Joshua A. Grochow, Dieter van Melkebeek, Cristopher Moore, Andrew Morgan:
Minimum Circuit Size, Graph Isomorphism, and Related Problems. ITCS 2018: 20:1-20:20 - 2017
- [j44]Cristopher Moore:
The Computer Science and Physics of Community Detection: Landscapes, Phase Transitions, and Hardness. Bull. EATCS 121 (2017) - [c52]Jess Banks, Robert Kleinberg, Cristopher Moore:
The Lovász Theta Function for Random Regular Graphs and Community Detection in the Hard Regime. APPROX-RANDOM 2017: 28:1-28:22 - [c51]Jess Banks, Cristopher Moore, Roman Vershynin, Nicolas Verzelen, Jiaming Xu:
Information-theoretic bounds and phase transitions in clustering, sparse PCA, and submatrix localization. ISIT 2017: 1137-1141 - [i78]Caterina De Bacco, Eleanor A. Power, Daniel B. Larremore, Cristopher Moore:
Community detection, link prediction, and layer interdependence in multilayer networks. CoRR abs/1701.01369 (2017) - [i77]Cristopher Moore:
The Computer Science and Physics of Community Detection: Landscapes, Phase Transitions, and Hardness. CoRR abs/1702.00467 (2017) - [i76]Jess Banks, Robert Kleinberg, Cristopher Moore:
The Lovász Theta Function for Random Regular Graphs and Community Detection in the Hard Regime. CoRR abs/1705.01194 (2017) - [i75]Joshua A. Grochow, Cristopher Moore:
Designing Strassen's algorithm. CoRR abs/1708.09398 (2017) - [i74]Caterina De Bacco, Daniel B. Larremore, Cristopher Moore:
A physical model for efficient ranking in networks. CoRR abs/1709.09002 (2017) - [i73]Eric Allender, Joshua A. Grochow, Dieter van Melkebeek, Cristopher Moore, Andrew Morgan:
Minimum Circuit Size, Graph Isomorphism, and Related Problems. CoRR abs/1710.09806 (2017) - [i72]Eric Allender, Joshua A. Grochow, Dieter van Melkebeek, Cristopher Moore, Andrew Morgan:
Minimum Circuit Size, Graph Isomorphism, and Related Problems. Electron. Colloquium Comput. Complex. TR17 (2017) - [i71]Joshua A. Grochow, Cristopher Moore:
Designing Strassen's algorithm. Electron. Colloquium Comput. Complex. TR17 (2017) - [i70]Alexander Russell, Cristopher Moore, Aggelos Kiayias, Saad Quader:
Forkable Strings are Rare. IACR Cryptol. ePrint Arch. 2017: 241 (2017) - 2016
- [j43]Varsha Dani, Thomas P. Hayes, Cristopher Moore, Alexander Russell:
Codes, lower bounds, and phase transitions in the symmetric rendezvous problem. Random Struct. Algorithms 49(4): 742-765 (2016) - [c50]Thibault Lesieur, Caterina De Bacco, Jess Banks, Florent Krzakala, Cristopher Moore, Lenka Zdeborová:
Phase transitions and optimal algorithms in high-dimensional Gaussian mixture clustering. Allerton 2016: 601-608 - [c49]Jess Banks, Cristopher Moore, Joe Neeman, Praneeth Netrapalli:
Information-theoretic thresholds for community detection in sparse networks. COLT 2016: 383-416 - [i69]Jess Banks, Cristopher Moore:
Information-theoretic thresholds for community detection in sparse networks. CoRR abs/1601.02658 (2016) - [i68]Antonia Godoy-Lorite, Roger Guimerà, Cristopher Moore, Marta Sales-Pardo:
Accurate and scalable social recommendation using mixed-membership stochastic block models. CoRR abs/1604.01170 (2016) - [i67]Jess Banks, Cristopher Moore, Joe Neeman, Praneeth Netrapalli:
Information-theoretic thresholds for community detection in sparse networks. CoRR abs/1607.01760 (2016) - [i66]Jess Banks, Cristopher Moore, Roman Vershynin, Jiaming Xu:
Information-theoretic bounds and phase transitions in clustering, sparse PCA, and submatrix localization. CoRR abs/1607.05222 (2016) - [i65]Xiao Zhang, Cristopher Moore, M. E. J. Newman:
Random graph models for dynamic networks. CoRR abs/1607.07570 (2016) - [i64]Varsha Dani, Thomas P. Hayes, Cristopher Moore, Alexander Russell:
Codes, Lower Bounds, and Phase Transitions in the Symmetric Rendezvous Problem. CoRR abs/1609.01582 (2016) - [i63]Thibault Lesieur, Caterina De Bacco, Jess Banks, Florent Krzakala, Cristopher Moore, Lenka Zdeborová:
Phase transitions and optimal algorithms in high-dimensional Gaussian mixture clustering. CoRR abs/1610.02918 (2016) - [i62]Joshua A. Grochow, Cristopher Moore:
Matrix multiplication algorithms from group orbits. CoRR abs/1612.01527 (2016) - 2015
- [j42]Hang T. Dinh, Cristopher Moore, Alexander Russell:
Limitations of single coset states and quantum algorithms for code equivalence. Quantum Inf. Comput. 15(3&4): 260-294 (2015) - [j41]Shachar Lovett, Cristopher Moore, Alexander Russell:
Group representations that resist random sampling. Random Struct. Algorithms 47(3): 605-614 (2015) - [j40]Cristopher Moore, Alexander Russell:
Approximate Representations, Approximate Homomorphisms, and Low-Dimensional Embeddings of Groups. SIAM J. Discret. Math. 29(1): 182-197 (2015) - [j39]Cristopher Moore, Alexander Russell:
Optimal ε-Biased Sets with Just a Little Randomness. SIAM J. Discret. Math. 29(3): 1303-1311 (2015) - [i61]Cristopher Moore:
The phase transition in random regular exact cover. CoRR abs/1502.07591 (2015) - [i60]Hyejin Youn, Logan Sutton, Eric Smith, Cristopher Moore, Jon F. Wilkins, Ian Maddieson, William Croft, Tanmoy Bhattacharya:
On the universal structure of human lexical semantics. CoRR abs/1504.07843 (2015) - [i59]Munik Shrestha, Samuel V. Scarpino, Cristopher Moore:
A message-passing approach for recurrent-state epidemic models on networks. CoRR abs/1505.02192 (2015) - [i58]Amir Ghasemian, Pan Zhang, Aaron Clauset, Cristopher Moore, Leto Peel:
Detectability thresholds and optimal algorithms for community structure in dynamic networks. CoRR abs/1506.06179 (2015) - [i57]Pan Zhang, Cristopher Moore, M. E. J. Newman:
Community detection in networks with unequal groups. CoRR abs/1509.00107 (2015) - [i56]Eric Allender, Joshua A. Grochow, Cristopher Moore:
Graph Isomorphism and Circuit Size. CoRR abs/1511.08189 (2015) - [i55]Eric Allender, Joshua A. Grochow, Cristopher Moore:
Graph Isomorphism and Circuit Size. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j38]Yaojia Zhu, Xiaoran Yan, Cristopher Moore:
Oriented and degree-generated block models: generating and inferring communities with inhomogeneous degree distributions. J. Complex Networks 2(1): 1-18 (2014) - [j37]Pan Zhang, Cristopher Moore:
Scalable detection of statistically significant communities and hierarchies, using message passing for modularity. Proc. Natl. Acad. Sci. USA 111(51): 18144-18149 (2014) - [j36]Russell Impagliazzo, Cristopher Moore, Alexander Russell:
An Entropic Proof of Chang's Inequality. SIAM J. Discret. Math. 28(1): 173-176 (2014) - [c48]Cristopher Moore, Leonard J. Schulman:
Tree codes and a conjecture on exponential sums. ITCS 2014: 145-154 - [e2]Klaus Jansen, José D. P. Rolim, Nikhil R. Devanur, Cristopher Moore:
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2014, September 4-6, 2014, Barcelona, Spain. LIPIcs 28, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2014, ISBN 978-3-939897-74-3 [contents] - [i54]Pan Zhang, Cristopher Moore:
Scalable detection of statistically significant communities and hierarchies: message-passing for modularity. CoRR abs/1403.5787 (2014) - [i53]Pan Zhang, Cristopher Moore, Lenka Zdeborová:
Phase transitions in semisupervised clustering of sparse networks. CoRR abs/1404.7789 (2014) - [i52]Thomas P. Hayes, Cristopher Moore:
Lower Bounds on the Critical Density in the Hard Disk Model via Optimized Metrics. CoRR abs/1407.1930 (2014) - [i51]Cristopher Moore, Alexander Russell:
Heat and Noise on Cubes and Spheres: The Sensitivity of Randomly Rotated Polynomial Threshold Functions. CoRR abs/1408.5425 (2014) - [i50]Aurélien Decelle, Janina Hüttel, Alaa Saade, Cristopher Moore:
Computational Complexity, Phase Transitions, and Message-Passing for Community Detection. CoRR abs/1409.2290 (2014) - [i49]Shachar Lovett, Cristopher Moore, Alexander Russell:
Group representations that resist random sampling. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [j35]Stephan Mertens, Cristopher Moore:
The Complexity of the Fermionant and Immanants of Constant Width [Note]. Theory Comput. 9: 273-282 (2013) - [c47]Sixia Chen, Cristopher Moore, Alexander Russell:
Small-Bias Sets for Nonabelian Groups - Derandomizations of the Alon-Roichman Theorem. APPROX-RANDOM 2013: 436-451 - [c46]Varsha Dani, Josep Díaz, Thomas P. Hayes, Cristopher Moore:
The Power of Choice for Random Satisfiability. APPROX-RANDOM 2013: 484-496 - [c45]Yaojia Zhu, Xiaoran Yan, Lise Getoor, Cristopher Moore:
Scalable text and link analysis with mixed-topic link models. KDD 2013: 473-481 - [i48]Yaojia Zhu, Xiaoran Yan, Lise Getoor, Cristopher Moore:
Scalable Text and Link Analysis with Mixed-Topic Link Models. CoRR abs/1303.7264 (2013) - [i47]Sixia Chen, Cristopher Moore, Alexander Russell:
Small-Bias Sets for Nonabelian Groups: Derandomizing the Alon-Roichman Theorem. CoRR abs/1304.5010 (2013) - [i46]Florent Krzakala, Cristopher Moore, Elchanan Mossel, Joe Neeman, Allan Sly, Lenka Zdeborová, Pan Zhang:
Spectral redemption: clustering sparse networks. CoRR abs/1306.5550 (2013) - [i45]Charles D. Brummitt, Paul D. H. Hines, Ian Dobson, Cristopher Moore, Raissa M. D'Souza:
Transdisciplinary electric power grid science. CoRR abs/1307.7305 (2013) - [i44]Cristopher Moore, Leonard J. Schulman:
Tree Codes and a Conjecture on Exponential Sums. CoRR abs/1308.6007 (2013) - [i43]Greg Ver Steeg, Cristopher Moore, Aram Galstyan, Armen E. Allahverdyan:
Phase Transitions in Community Detection: A Solvable Toy Model. CoRR abs/1312.0631 (2013) - [i42]Munik Shrestha, Cristopher Moore:
A message-passing approach for threshold models of behavior in networks. CoRR abs/1312.2070 (2013) - 2012
- [j34]Cristopher Moore, Alexander Russell:
Approximating the Permanent via Nonabelian Determinants. SIAM J. Comput. 41(2): 332-355 (2012) - [c44]Varsha Dani, Cristopher Moore, Anna Olson:
Tight Bounds on the Threshold for Permuted k-Colorability. APPROX-RANDOM 2012: 505-516 - [i41]Heiko Bauke, Cristopher Moore, Jean-Baptiste Rouquier, David Sherrington:
Topological phase transition in a network model with preferential attachment and node removal. CoRR abs/1201.4044 (2012) - [i40]Russell Impagliazzo, Cristopher Moore, Alexander Russell:
An Entropic Proof of Chang's Inequality. CoRR abs/1205.0263 (2012) - [i39]Cristopher Moore, Alexander Russell:
Optimal epsilon-biased sets with just a little randomness. CoRR abs/1205.6218 (2012) - [i38]Yaojia Zhu, Xiaoran Yan, Cristopher Moore:
Oriented and Degree-generated Block Models: Generating and Inferring Communities with Inhomogeneous Degree Distributions. CoRR abs/1205.7009 (2012) - [i37]Xiaoran Yan, Jacob E. Jensen, Florent Krzakala, Cristopher Moore, Cosma Rohilla Shalizi, Lenka Zdeborová, Pan Zhang, Yaojia Zhu:
Model Selection for Degree-corrected Block Models. CoRR abs/1207.3994 (2012) - [i36]Stephan Mertens, Cristopher Moore:
Continuum Percolation Thresholds in Two Dimensions. CoRR abs/1209.4936 (2012) - [i35]Fabio Caccioli, Munik Shrestha, Cristopher Moore, J. Doyne Farmer:
Stability analysis of financial contagion due to overlapping portfolios. CoRR abs/1210.5987 (2012) - [i34]Varsha Dani, Josep Díaz, Thomas P. Hayes, Cristopher Moore:
The Power of Choice for Random Satisfiability. CoRR abs/1211.6997 (2012) - 2011
- [b1]Cristopher Moore, Stephan Mertens:
The Nature of Computation. Oxford University Press 2011, ISBN 978-0-19-923321-2, pp. I-XVII, 1-985 - [j33]Cristopher Moore, Alexander Russell:
A Graph Integral Formulation of the Circuit Partition Polynomial. Comb. Probab. Comput. 20(6): 911-920 (2011) - [c43]Varsha Dani, Cristopher Moore:
Independent Sets in Random Graphs from the Weighted Second Moment Method. APPROX-RANDOM 2011: 472-482 - [c42]Hang Dinh, Cristopher Moore, Alexander Russell:
McEliece and Niederreiter Cryptosystems That Resist Quantum Fourier Sampling Attacks. CRYPTO 2011: 761-779 - [c41]Cristopher Moore, Xiaoran Yan, Yaojia Zhu, Jean-Baptiste Rouquier, Terran Lane:
Active learning for node classification in assortative and disassortative networks. KDD 2011: 841-849 - [c40]Shiva Prasad Kasiviswanathan, Cristopher Moore, Louis Theran:
The Rigidity Transition in Random Graphs. SODA 2011: 1237-1252 - [i33]Aurélien Decelle, Florent Krzakala, Cristopher Moore, Lenka Zdeborová:
Phase transition in the detection of modules in sparse networks. CoRR abs/1102.1182 (2011) - [i32]Jon Machta, Simon DeDeo, Stephan Mertens, Cristopher Moore:
Parallel Complexity of Random Boolean Circuits. CoRR abs/1102.3310 (2011) - [i31]Aurélien Decelle, Florent Krzakala, Cristopher Moore, Lenka Zdeborová:
Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications. CoRR abs/1109.3041 (2011) - [i30]Cristopher Moore, Xiaoran Yan, Yaojia Zhu, Jean-Baptiste Rouquier, Terran Lane:
Active Learning for Node Classification in Assortative and Disassortative Networks. CoRR abs/1109.3240 (2011) - [i29]Stephan Mertens, Cristopher Moore:
The complexity of the fermionant, and immanants of constant width. CoRR abs/1110.1821 (2011) - [i28]Varsha Dani, Cristopher Moore, Anna Olson:
Tight bounds on the threshold for permuted k-colorability. CoRR abs/1111.2947 (2011) - [i27]Hang Dinh, Cristopher Moore, Alexander Russell:
Quantum Fourier sampling, Code Equivalence, and the quantum security of the McEliece and Sidelnikov cryptosystems. CoRR abs/1111.4382 (2011) - 2010
- [j32]Sean Hallgren, Cristopher Moore, Martin Rötteler, Alexander Russell, Pranab Sen:
Limitations of quantum coset states for graph isomorphism. J. ACM 57(6): 34:1-34:33 (2010) - [j31]Aaron Denney, Cristopher Moore, Alexander Russell:
Finding conjugate stabilizer subgroups in PSL and related groups. Quantum Inf. Comput. 10(3&4): 282-291 (2010) - [j30]Cristopher Moore, Alexander Russell, Piotr Sniady:
On the Impossibility of a Quantum Sieve Algorithm for Graph Isomorphism. SIAM J. Comput. 39(6): 2377-2396 (2010) - [c39]David Kempe, Mahyar Salek, Cristopher Moore:
Frugal and Truthful Auctions for Vertex Covers, Flows and Cuts. FOCS 2010: 745-754 - [c38]Sergey Bravyi, Cristopher Moore, Alexander Russell:
Bounds on the Quantum Satisfiability Threshold. ICS 2010: 482-489 - [c37]Cristopher Moore:
Continuous and Discrete Methods in Computer Science. LATIN 2010: 1 - [i26]Cristopher Moore, Alexander Russell:
Circuit partitions and #P-complete products of inner products. CoRR abs/1001.2314 (2010) - [i25]Xiaoran Yan, Yaojia Zhu, Jean-Baptiste Rouquier, Cristopher Moore:
Active Learning for Hidden Attributes in Networks. CoRR abs/1005.0794 (2010) - [i24]Cristopher Moore, Alexander Russell:
How close can we come to a parity function when there isn't one? CoRR abs/1005.4897 (2010) - [i23]Hang Dinh, Cristopher Moore, Alexander Russell:
The McEliece Cryptosystem Resists Quantum Fourier Sampling Attacks. CoRR abs/1008.2390 (2010) - [i22]Cristopher Moore, Alexander Russell:
Regarding a Representation-Theoretic Conjecture of Wigderson. CoRR abs/1009.4136 (2010) - [i21]Cristopher Moore, Alexander Russell:
Approximate Representations and Approximate Homomorphisms. CoRR abs/1009.6230 (2010) - [i20]Shiva Prasad Kasiviswanathan, Cristopher Moore, Louis Theran:
The rigidity transition in random graphs. CoRR abs/1010.3605 (2010) - [i19]Varsha Dani, Cristopher Moore:
Independent sets in random graphs from the weighted second moment method. CoRR abs/1011.0180 (2010)
2000 – 2009
- 2009
- [j29]Dimitris Achlioptas, Aaron Clauset, David Kempe, Cristopher Moore:
On the bias of traceroute sampling: Or, power-law degree distributions in regular graphs. J. ACM 56(4): 21:1-21:28 (2009) - [j28]Gorjan Alagic, Cristopher Moore, Alexander Russell:
Quantum algorithms for Simon's problem over nonabelian groups. ACM Trans. Algorithms 6(1): 19:1-19:15 (2009) - [i18]Cristopher Moore, Alexander Russell:
Approximating the Permanent via Nonabelian Determinants. CoRR abs/0906.1702 (2009) - [i17]Sergey Bravyi, Cristopher Moore, Alexander Russell:
Bounds on the quantum satisfibility threshold. CoRR abs/0907.1297 (2009) - [i16]David Kempe, Mahyar Salek, Cristopher Moore:
Frugal and Truthful Auctions for Vertex Covers, Flows, and Cuts. CoRR abs/0912.3310 (2009) - 2008
- [j27]Cristopher Moore, Alexander Russell, Leonard J. Schulman:
The Symmetric Group Defies Strong Fourier Sampling. SIAM J. Comput. 37(6): 1842-1864 (2008) - [i15]Cristopher Moore, Alexander Russell:
A simple constant-probability RP reduction from NP to Parity P. CoRR abs/0810.1018 (2008) - [i14]Cristopher Moore, Alexander Russell:
A simple constant-probability RP reduction from NP to Parity P. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [j26]Haixia Jia, Cristopher Moore, Doug Strain:
Generating Hard Satisfiable Formulas by Hiding Solutions Deceptively. J. Artif. Intell. Res. 28: 107-118 (2007) - [j25]Cristopher Moore, Alexander Russell:
For distinguishing conjugate hidden subgroups, the pretty good measurement is as good as it gets. Quantum Inf. Comput. 7(8): 752-765 (2007) - [j24]Cristopher Moore, Gabriel Istrate, Demetrios D. Demopoulos, Moshe Y. Vardi:
A continuous-discontinuous second-order transition in the satisfiability of random Horn-SAT formulas. Random Struct. Algorithms 31(2): 173-185 (2007) - [j23]Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwalani:
Counting connected graphs and hypergraphs via the probabilistic method. Random Struct. Algorithms 31(3): 288-329 (2007) - [j22]Cristopher Moore, Daniel N. Rockmore, Alexander Russell, Leonard J. Schulman:
The Power of Strong Fourier Sampling: Quantum Algorithms for Affine Groups and Hidden Shifts. SIAM J. Comput. 37(3): 938-958 (2007) - [c36]Gorjan Alagic, Cristopher Moore, Alexander Russell:
Quantum algorithms for Simon's problem over general groups. SODA 2007: 1217-1224 - [c35]Cristopher Moore, Alexander Russell, Piotr Sniady:
On the impossibility of a quantum sieve algorithm for graph isomorphism. STOC 2007: 536-545 - 2006
- [j21]Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwalani:
MAX k-CUT and approximating the chromatic number of random graphs. Random Struct. Algorithms 28(3): 289-322 (2006) - [j20]Dimitris Achlioptas, Cristopher Moore:
Random k-SAT: Two Moments Suffice to Cross a Sharp Threshold. SIAM J. Comput. 36(3): 740-762 (2006) - [j19]Cristopher Moore, Daniel N. Rockmore, Alexander Russell:
Generic quantum Fourier transforms. ACM Trans. Algorithms 2(4): 707-723 (2006) - [c34]Aaron Clauset, Cristopher Moore, Mark E. J. Newman:
Structural Inference of Hierarchies in Networks. SNA@ICML 2006: 1-13 - [c33]Raissa M. D'Souza, David J. Galvin, Cristopher Moore, Dana Randall:
Global connectivity from local geometric constraints for sensor networks with various wireless footprints. IPSN 2006: 19-26 - [c32]Sean Hallgren, Cristopher Moore, Martin Rötteler, Alexander Russell, Pranab Sen:
Limitations of quantum coset states for graph isomorphism. STOC 2006: 604-617 - [p1]Allon G. Percus, Gabriel Istrate, Cristopher Moore:
Introduction: Where Statistical Physics Mects Computation. Computational Complexity and Statistical Physics 2006: 3-24 - [e1]Allon G. Percus, Gabriel Istrate, Cristopher Moore:
Computational Complexity and Statistical Physics. Santa Fe Institute Studies in the Sciences of Complexity, Oxford University Press 2006, ISBN 978-0-19-517738-1 [contents] - [i13]Aaron Clauset, Cristopher Moore, Mark E. J. Newman:
Structural Inference of Hierarchies in Networks. CoRR abs/physics/0610051 (2006) - [i12]Cristopher Moore, Alexander Russell:
On the Impossibility of a Quantum Sieve Algorithm for Graph Isomorphism. CoRR abs/quant-ph/0609138 (2006) - 2005
- [j18]Paul Beame, Joseph C. Culberson, David G. Mitchell, Cristopher Moore:
The resolution complexity of random graph k-colorability. Discret. Appl. Math. 153(1-3): 25-47 (2005) - [j17]Farid M. Ablayev, Aida Gainutdinova, Marek Karpinski, Cristopher Moore, Chris Pollett:
On the computational power of probabilistic and quantum branching program. Inf. Comput. 203(2): 145-162 (2005) - [j16]Dimitris Achlioptas, Haixia Jia, Cristopher Moore:
Hiding Satisfying Assignments: Two are Better than One. J. Artif. Intell. Res. 24: 623-639 (2005) - [c31]Haixia Jia, Cristopher Moore, Doug Strain:
Generating Hard Satisfiable Formulas by Hiding Solutions Deceptively. AAAI 2005: 384-389 - [c30]Cristopher Moore, Gabriel Istrate, Demetrios D. Demopoulos, Moshe Y. Vardi:
A Continuous-Discontinuous Second-Order Transition in the Satisfiability of Random Horn-SAT Formulas. APPROX-RANDOM 2005: 414-425 - [c29]Cristopher Moore:
Fearful Symmetries: Quantum Computing, Factoring, and Graph Isomorphism. ESA 2005: 10 - [c28]Cristopher Moore, Alexander Russell, Leonard J. Schulman:
The Symmetric Group Defies Strong Fourier Sampling. FOCS 2005: 479-490 - [c27]Dimitris Achlioptas, Aaron Clauset, David Kempe, Cristopher Moore:
On the bias of traceroute sampling: or, power-law degree distributions in regular graphs. STOC 2005: 694-703 - [i11]Dimitris Achlioptas, Aaron Clauset, David Kempe, Cristopher Moore:
On the Bias of Traceroute Sampling; or, Power-law Degree Distributions in Regular Graphs. CoRR abs/cond-mat/0503087 (2005) - [i10]Haixia Jia, Cristopher Moore, Doug Strain:
Generating Hard Satisfiable Formulas by Hiding Solutions Deceptively. CoRR abs/cs/0503044 (2005) - [i9]Dimitris Achlioptas, Haixia Jia, Cristopher Moore:
Hiding Satisfying Assignments: Two are Better than One. CoRR abs/cs/0503046 (2005) - [i8]Cristopher Moore, Alexander Russell, Leonard J. Schulman:
The Symmetric Group Defies Strong Fourier Sampling: Part I. CoRR abs/quant-ph/0501056 (2005) - [i7]Cristopher Moore, Alexander Russell:
The Symmetric Group Defies Strong Fourier Sampling: Part II. CoRR abs/quant-ph/0501066 (2005) - 2004
- [c26]Dimitris Achlioptas, Haixia Jia, Cristopher Moore:
Hiding Satisfying Assignments: Two Are Better than One. AAAI 2004: 131-136 - [c25]Dimitris Achlioptas, Cristopher Moore:
The Chromatic Number of Random Regular Graphs. APPROX-RANDOM 2004: 219-228 - [c24]Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwalani:
Counting Connected Graphs and Hypergraphs via the Probabilistic Method. APPROX-RANDOM 2004: 322-333 - [c23]Jarkko Kari, Cristopher Moore:
Rectangles and Squares Recognized by Two-Dimensional Automata. Theory Is Forever 2004: 134-144 - [c22]Haixia Jia, Cristopher Moore:
How Much Backtracking Does It Take to Color Random Graphs? Rigorous Results on Heavy Tails. CP 2004: 742-746 - [c21]Clint Morgan, Darko Stefanovic, Cristopher Moore, Milan N. Stojanovic:
Building the Components for a Biomolecular Computer. DNA 2004: 247-257 - [c20]Dimitris Achlioptas, Michael S. O. Molloy, Cristopher Moore, Frank Van Bussel:
Sampling Grid Colorings with Fewer Colors. LATIN 2004: 80-89 - [c19]Haixia Jia, Cristopher Moore, Bart Selman:
From Spin Glasses to Hard Satisfiable Formulas. SAT 2004 - [c18]Haixia Jia, Cristopher Moore, Bart Selman:
From Spin Glasses to Hard Satisfiable Formulas. SAT (Selected Papers 2004: 199-210 - [c17]Cristopher Moore, Daniel N. Rockmore, Alexander Russell:
Generic quantum Fourier transforms. SODA 2004: 778-787 - [c16]Cristopher Moore, Daniel N. Rockmore, Alexander Russell, Leonard J. Schulman:
The power of basis selection in fourier sampling: hidden subgroup problems in affine groups. SODA 2004: 1113-1122 - [i6]Paul Beame, Joseph C. Culberson, David G. Mitchell, Cristopher Moore:
The Resolution Complexity of Random Graph k-Colorability. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [j15]Dimitris Achlioptas, Cristopher Moore:
Almost all graphs with average degree 4 are 3-colorable. J. Comput. Syst. Sci. 67(2): 441-471 (2003) - [c15]Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwalani:
MAX k-CUT and Approximating the Chromatic Number of Random Graphs. ICALP 2003: 200-211 - [i5]Dimitris Achlioptas, Cristopher Moore:
Random k-SAT: Two Moments Suffice to Cross a Sharp Threshold. CoRR cond-mat/0310227 (2003) - 2002
- [j14]Manuel Lameiras Campagnolo, Cristopher Moore, José Félix Costa:
An Analog Characterization of the Grzegorczyk Hierarchy. J. Complex. 18(4): 977-1000 (2002) - [j13]Cristopher Moore, Igor Pak:
Ribbon Tile Invariants from the Signed Area. J. Comb. Theory A 98(1): 1-16 (2002) - [j12]Frederic Green, Steven Homer, Cristopher Moore, Christopher Pollett:
Counting, fanout and the complexity of quantum ACC. Quantum Inf. Comput. 2(1): 35-65 (2002) - [c14]Dimitris Achlioptas, Cristopher Moore:
The Asymptotic Order of the Random k -SAT Threshold. FOCS 2002: 779-788 - [c13]Farid M. Ablayev, Cristopher Moore, Chris Pollett:
Quantum and Stochastic Branching Programs of Bounded Width. ICALP 2002: 343-354 - [c12]Eric Allender, Sanjeev Arora, Michael J. Kearns, Cristopher Moore, Alexander Russell:
A Note on the Representational Incompatibility of Function Approximation and Factored Dynamics. NIPS 2002: 431-437 - [c11]Dimitris Achlioptas, Cristopher Moore:
On the 2-Colorability of Random Hypergraphs. RANDOM 2002: 78-90 - [c10]Cristopher Moore, Alexander Russell:
Quantum Walks on the Hypercube. RANDOM 2002: 164-178 - [c9]Cristopher Moore, Ivan Rapaport, Eric Rémila:
Tiling groups for Wang tiles. SODA 2002: 402-411 - [c8]Dimitris Achlioptas, Cristopher Moore:
Almost all graphs with average degree 4 are 3-colorable. STOC 2002: 199-208 - [i4]Chris Pollett, Farid M. Ablayev, Cristopher Moore:
Quantum and Stochastic Programs of Bounded Width. Electron. Colloquium Comput. Complex. TR02 (2002) - 2001
- [j11]Cristopher Moore, J. M. Robson:
Hard Tiling Problems with Simple Tiles. Discret. Comput. Geom. 26(4): 573-590 (2001) - [j10]Cristopher Moore, Martin Nilsson:
Parallel Quantum Computation and Quantum Codes. SIAM J. Comput. 31(3): 799-815 (2001) - [c7]Joakim Linde, Cristopher Moore, Mats G. Nordahl:
An n-Dimensional Generalization of the Rhombus Tiling. DM-CCG 2001: 23-42 - [c6]Cristopher Moore, Pascal Tesson, Denis Thérien:
Satisfiability of Systems of Equations over Finite Monoids. MFCS 2001: 537-547 - [c5]Dimitris Achlioptas, Arthur D. Chtcherba, Gabriel Istrate, Cristopher Moore:
The phase transition in 1-in-k SAT and NAE 3-SAT. SODA 2001: 721-722 - [c4]Jarkko Kari, Cristopher Moore:
New Results on Alternating and Non-deterministic Two-Dimensional Finite-State Automata. STACS 2001: 396-406 - 2000
- [j9]Manuel Lameiras Campagnolo, Cristopher Moore, José Félix Costa:
Iteration, Inequalities, and Differentiability in Analog Computers. J. Complex. 16(4): 642-660 (2000) - [j8]Cristopher Moore, Denis Thérien, François Lemieux, Joshua Berman, Arthur Drisko:
Circuits and Expressions with Nonassociative Gates. J. Comput. Syst. Sci. 60(2): 368-394 (2000) - [j7]Cristopher Moore, James P. Crutchfield:
Quantum automata and quantum grammars. Theor. Comput. Sci. 237(1-2): 275-306 (2000) - [c3]David A. Mix Barrington, Pierre McKenzie, Cristopher Moore, Pascal Tesson, Denis Thérien:
Equation Satisfiability and Program Satisfiability for Finite Monoids. MFCS 2000: 172-181 - [c2]Manuel Lameiras Campagnolo, Cristopher Moore:
Upper and Lower Bounds on Continuous-Time Computation. UMC 2000: 135-153 - [i3]Cristopher Moore, David Eppstein:
One-Dimensional Peg Solitaire. CoRR math.CO/0006067 (2000) - [i2]Cristopher Moore, David Eppstein:
One-Dimensional Peg Solitaire, and Duotaire. CoRR math.CO/0008172 (2000)
1990 – 1999
- 1999
- [j6]Pascal Koiran, Cristopher Moore:
Closed-for Analytic Maps in One and Two Dimensions can Simulate Universal Turing Machines. Theor. Comput. Sci. 210(1): 217-223 (1999) - [i1]Cristopher Moore:
Quantum Circuits: Fanout, Parity, and Counting. Electron. Colloquium Comput. Complex. TR99 (1999) - 1998
- [j5]Cristopher Moore:
Dynamical Recognizers: Real-Time Language Recognition by Analog Computers. Theor. Comput. Sci. 201(1-2): 99-136 (1998) - 1997
- [j4]Cristopher Moore, Timothy Boykett:
Commuting Cellular Automata. Complex Syst. 11(1) (1997) - [c1]Joshua Berman, Arthur Drisko, François Lemieux, Cristopher Moore, Denis Thérien:
Circuits and Expressions with NOn-Associative Gates. CCC 1997: 193-203 - 1996
- [j3]Cristopher Moore, Arthur A. Drisko:
Algebraic Properties of the Block Transformation on Cellular Automata. Complex Syst. 10(3) (1996) - [j2]David Griffeath, Cristopher Moore:
Life Without Death is P-complete. Complex Syst. 10(6) (1996) - [j1]Cristopher Moore:
Recursion Theory on the Reals and Continuous-Time Computation. Theor. Comput. Sci. 162(1): 23-44 (1996)
Coauthor Index
[c59] [c58] [i89] [i85] [c55] [i80] [i70] [j43] [i64] [j42] [j41] [j40] [j39] [j36] [i51] [i49] [c47] [i47] [j34] [i40] [i39] [j33] [c42] [i27] [j32] [j31] [j30] [c38] [i26] [i24] [i23] [i22] [i21] [j28] [i18] [i17] [j27] [i15] [i14] [j25] [j22] [c36] [c35] [j19] [c32] [i12] [c28] [i8] [i7] [c17] [c16] [c12] [c10]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:09 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
