| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Heiko Bauke, Cristopher Moore, Jean-Baptiste Rouquier, David Sherrington |
Topological phase transition in a network model with preferential attachment and node removal  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Cristopher Moore, Alexander Russell |
Approximating the Permanent via Nonabelian Determinants.  |
SIAM J. Comput.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristopher Moore, Alexander Russell |
A Graph Integral Formulation of the Circuit Partition Polynomial.  |
Combinatorics, Probability & Computing  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Varsha Dani, Cristopher Moore, Anna Olson |
Tight bounds on the threshold for permuted k-colorability  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Cristopher Moore, Xiaoran Yan, Yaojia Zhu, Jean-Baptiste Rouquier, Terran Lane |
Active Learning for Node Classification in Assortative and Disassortative Networks  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Aurelien Decelle, Florent Krzakala, Cristopher Moore, Lenka Zdeborová |
Phase transition in the detection of modules in sparse networks  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Stephan Mertens, Cristopher Moore |
The complexity of the fermionant, and immanants of constant width  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Aurelien Decelle, Florent Krzakala, Cristopher Moore, Lenka Zdeborová |
Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Hang Dinh, Cristopher Moore, Alexander Russell |
Quantum Fourier sampling, Code Equivalence, and the quantum security of the McEliece and Sidelnikov cryptosystems  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Jon Machta, Simon Dedeo, Stephan Mertens, Cristopher Moore |
Parallel Complexity of Random Boolean Circuits  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Cristopher Moore, Stephan Mertens |
The Nature of Computation.  |
|
2011 |
RDF |
|
| 1 | Shiva Prasad Kasiviswanathan, Cristopher Moore, Louis Theran |
The Rigidity Transition in Random Graphs.  |
SODA  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Hang Dinh, Cristopher Moore, Alexander Russell |
McEliece and Niederreiter Cryptosystems That Resist Quantum Fourier Sampling Attacks.  |
CRYPTO  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Varsha Dani, Cristopher Moore |
Independent Sets in Random Graphs from the Weighted Second Moment Method.  |
APPROX-RANDOM  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristopher Moore, Xiaoran Yan, Yaojia Zhu, Jean-Baptiste Rouquier, Terran Lane |
Active learning for node classification in assortative and disassortative networks.  |
KDD  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sean Hallgren, Cristopher Moore, Martin Rötteler, Alexander Russell, Pranab Sen |
Limitations of quantum coset states for graph isomorphism.  |
J. ACM  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Aaron Denney, Cristopher Moore, Alexander Russell |
Finding conjugate stabilizer subgroups in PSL and related groups.  |
Quantum Information & Computation  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Xiaoran Yan, Yaojia Zhu, Jean-Baptiste Rouquier, Cristopher Moore |
Active Learning for Hidden Attributes in Networks  |
CoRR  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Cristopher Moore, Alexander Russell |
Approximate Representations and Approximate Homomorphisms  |
CoRR  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Cristopher Moore, Alexander Russell |
Circuit partitions and #P-complete products of inner products  |
CoRR  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Cristopher Moore, Alexander Russell |
How close can we come to a parity function when there isn't one?  |
CoRR  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Cristopher Moore, Alexander Russell |
Regarding a Representation-Theoretic Conjecture of Wigderson  |
CoRR  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Hang Dinh, Cristopher Moore, Alexander Russell |
The McEliece Cryptosystem Resists Quantum Fourier Sampling Attacks  |
CoRR  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Varsha Dani, Cristopher Moore |
Independent sets in random graphs from the weighted second moment method  |
CoRR  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Cristopher Moore, Alexander Russell, Piotr Sniady |
On the Impossibility of a Quantum Sieve Algorithm for Graph Isomorphism.  |
SIAM J. Comput.  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristopher Moore |
Continuous and Discrete Methods in Computer Science.  |
LATIN  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Sergey Bravyi, Cristopher Moore, Alexander Russell |
Bounds on the Quantum Satisfiability Threshold.  |
ICS  |
2010 |
DBLP BibTeX RDF |
|
| 1 | David Kempe, Mahyar Salek, Cristopher Moore |
Frugal and Truthful Auctions for Vertex Covers, Flows and Cuts.  |
FOCS  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Gorjan Alagic, Cristopher Moore, Alexander Russell |
Quantum algorithms for Simon's problem over nonabelian groups.  |
ACM Transactions on Algorithms  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Aaron Clauset, David Kempe, Cristopher Moore |
On the bias of traceroute sampling: Or, power-law degree distributions in regular graphs.  |
J. ACM  |
2009 |
DBLP DOI BibTeX RDF |
sampling bias, Internet topology, traceroute |
| 1 | David Kempe, Mahyar Salek, Cristopher Moore |
Frugal and Truthful Auctions for Vertex Covers, Flows, and Cuts  |
CoRR  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Cristopher Moore, Alexander Russell |
Approximating the Permanent via Nonabelian Determinants  |
CoRR  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Sergey Bravyi, Cristopher Moore, Alexander Russell |
Bounds on the quantum satisfibility threshold  |
CoRR  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Cristopher Moore, Alexander Russell |
A simple constant-probability RP reduction from NP to Parity P.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2008 |
DBLP BibTeX RDF |
|
| 1 | Cristopher Moore, Alexander Russell |
A simple constant-probability RP reduction from NP to Parity P  |
CoRR  |
2008 |
DBLP BibTeX RDF |
|
| 1 | Cristopher Moore, Alexander Russell, Leonard J. Schulman |
The Symmetric Group Defies Strong Fourier Sampling.  |
SIAM J. Comput.  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwalani |
Counting connected graphs and hypergraphs via the probabilistic method.  |
Random Struct. Algorithms  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristopher Moore, Alexander Russell |
For distinguishing conjugate hidden subgroups, the pretty good measurement is as good as it gets.  |
Quantum Information & Computation  |
2007 |
DBLP BibTeX RDF |
|
| 1 | Haixia Jia, Cristopher Moore, Doug Strain |
Generating Hard Satisfiable Formulas by Hiding Solutions Deceptively.  |
J. Artif. Intell. Res. (JAIR)  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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.  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Gorjan Alagic, Cristopher Moore, Alexander Russell |
Quantum algorithms for Simon's problem over general groups.  |
SODA  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristopher Moore, Alexander Russell, Piotr Sniady |
On the impossibility of a quantum sieve algorithm for graph isomorphism.  |
STOC  |
2007 |
DBLP DOI BibTeX RDF |
graph isomorphism problem, quantum computation |
| 1 | Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwalani |
MAX k-CUT and approximating the chromatic number of random graphs.  |
Random Struct. Algorithms  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristopher Moore, Daniel N. Rockmore, Alexander Russell |
Generic quantum Fourier transforms.  |
ACM Transactions on Algorithms  |
2006 |
DBLP DOI BibTeX RDF |
Quantum computation, group theory |
| 1 | Aaron Clauset, Cristopher Moore, Mark E. J. Newman |
Structural Inference of Hierarchies in Networks  |
CoRR  |
2006 |
DBLP BibTeX RDF |
|
| 1 | Cristopher Moore, Alexander Russell |
On the Impossibility of a Quantum Sieve Algorithm for Graph Isomorphism  |
CoRR  |
2006 |
DBLP BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Cristopher Moore |
Random k-SAT: Two Moments Suffice to Cross a Sharp Threshold.  |
SIAM J. Comput.  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Raissa D'Souza, David Galvin, Cristopher Moore, Dana Randall |
Global connectivity from local geometric constraints for sensor networks with various wireless footprints.  |
IPSN  |
2006 |
DBLP DOI BibTeX RDF |
adaptive power, ad hoc networks, graph theory, connectivity, self-organization, topology control |
| 1 | Sean Hallgren, Cristopher Moore, Martin Rötteler, Alexander Russell, Pranab Sen |
Limitations of quantum coset states for graph isomorphism.  |
STOC  |
2006 |
DBLP DOI BibTeX RDF |
hidden subgroup problem, graph isomorphism, quantum algorithms |
| 1 | Farid M. Ablayev, Aida Gainutdinova, Marek Karpinski, Cristopher Moore, Chris Pollett |
On the computational power of probabilistic and quantum branching program.  |
Inf. Comput.  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Haixia Jia, Cristopher Moore, Doug Strain |
Generating Hard Satisfiable Formulas by Hiding Solutions Deceptively  |
CoRR  |
2005 |
DBLP BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Haixia Jia, Cristopher Moore |
Hiding Satisfying Assignments: Two are Better than One  |
CoRR  |
2005 |
DBLP BibTeX RDF |
|
| 1 | Cristopher Moore, Alexander Russell, Leonard J. Schulman |
The Symmetric Group Defies Strong Fourier Sampling: Part I  |
CoRR  |
2005 |
DBLP BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Aaron Clauset, David Kempe, Cristopher Moore |
On the Bias of Traceroute Sampling; or, Power-law Degree Distributions in Regular Graphs  |
CoRR  |
2005 |
DBLP BibTeX RDF |
|
| 1 | Cristopher Moore, Alexander Russell |
The Symmetric Group Defies Strong Fourier Sampling: Part II  |
CoRR  |
2005 |
DBLP BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Haixia Jia, Cristopher Moore |
Hiding Satisfying Assignments: Two are Better than One.  |
J. Artif. Intell. Res. (JAIR)  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Beame, Joseph C. Culberson, David G. Mitchell, Cristopher Moore |
The resolution complexity of random graph k-colorability.  |
Discrete Applied Mathematics  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristopher Moore |
Fearful Symmetries: Quantum Computing, Factoring, and Graph Isomorphism.  |
ESA  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristopher Moore, Alexander Russell, Leonard J. Schulman |
The Symmetric Group Defies Strong Fourier Sampling.  |
FOCS  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Aaron Clauset, David Kempe, Cristopher Moore |
On the bias of traceroute sampling: or, power-law degree distributions in regular graphs.  |
STOC  |
2005 |
DBLP DOI BibTeX RDF |
internet mapping, random graphs, power laws |
| 1 | Haixia Jia, Cristopher Moore, Doug Strain |
Generating Hard Satisfiable Formulas by Hiding Solutions Deceptively.  |
AAAI  |
2005 |
DBLP BibTeX RDF |
|
| 1 | Paul Beame, Joseph C. Culberson, David G. Mitchell, Cristopher Moore |
The Resolution Complexity of Random Graph k-Colorability  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2004 |
DBLP BibTeX RDF |
|
| 1 | Cristopher Moore, Daniel N. Rockmore, Alexander Russell |
Generic quantum Fourier transforms.  |
SODA  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Clint Morgan, Darko Stefanovic, Cristopher Moore, Milan N. Stojanovic |
Building the Components for a Biomolecular Computer.  |
DNA  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Haixia Jia, Cristopher Moore, Bart Selman |
From Spin Glasses to Hard Satisfiable Formulas.  |
SAT (Selected Papers  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Haixia Jia, Cristopher Moore, Bart Selman |
From Spin Glasses to Hard Satisfiable Formulas.  |
SAT  |
2004 |
DBLP BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Michael S. O. Molloy, Cristopher Moore, Frank Van Bussel |
Sampling Grid Colorings with Fewer Colors.  |
LATIN  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Jarkko Kari, Cristopher Moore |
Rectangles and Squares Recognized by Two-Dimensional Automata.  |
Theory Is Forever  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwalani |
Counting Connected Graphs and Hypergraphs via the Probabilistic Method.  |
APPROX-RANDOM  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Cristopher Moore |
The Chromatic Number of Random Regular Graphs.  |
APPROX-RANDOM  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Haixia Jia, Cristopher Moore |
Hiding Satisfying Assignments: Two Are Better than One.  |
AAAI  |
2004 |
DBLP BibTeX RDF |
|
| 1 | Haixia Jia, Cristopher Moore |
How Much Backtracking Does It Take to Color Random Graphs? Rigorous Results on Heavy Tails.  |
CP  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Cristopher Moore |
Random k-SAT: Two Moments Suffice to Cross a Sharp Threshold  |
CoRR  |
2003 |
DBLP BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Cristopher Moore |
Almost all graphs with average degree 4 are 3-colorable.  |
J. Comput. Syst. Sci.  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwalani |
MAX k-CUT and Approximating the Chromatic Number of Random Graphs.  |
ICALP  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristopher Moore, Igor Pak |
Ribbon Tile Invariants from the Signed Area.  |
J. Comb. Theory, Ser. A  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Chris Pollett, Farid M. Ablayev, Cristopher Moore |
Quantum and Stochastic Programs of Bounded Width  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2002 |
DBLP BibTeX RDF |
|
| 1 | Manuel Lameiras Campagnolo, Cristopher Moore, José Félix Costa |
An Analog Characterization of the Grzegorczyk Hierarchy.  |
J. Complexity  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Frederic Green, Steven Homer, Cristopher Moore, Christopher Pollett |
Counting, fanout and the complexity of quantum ACC.  |
Quantum Information & Computation  |
2002 |
DBLP BibTeX RDF |
|
| 1 | Cristopher Moore, Ivan Rapaport, Eric Rémila |
Tiling groups for Wang tiles.  |
SODA  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Farid M. Ablayev, Cristopher Moore, Chris Pollett |
Quantum and Stochastic Branching Programs of Bounded Width.  |
ICALP  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Cristopher Moore |
On the 2-Colorability of Random Hypergraphs.  |
RANDOM  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristopher Moore, Alexander Russell |
Quantum Walks on the Hypercube.  |
RANDOM  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Cristopher Moore |
The Asymptotic Order of the Random k -SAT Threshold.  |
FOCS  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Cristopher Moore |
Almost all graphs with average degree 4 are 3-colorable.  |
STOC  |
2002 |
DBLP DOI BibTeX RDF |
threshold phenomena, graph coloring, random graphs |
| 1 | Eric Allender, Sanjeev Arora, Michael Kearns, Cristopher Moore, Alexander Russell |
A Note on the Representational Incompatibility of Function Approximation and Factored Dynamics.  |
NIPS ![In: Advances in Neural Information Processing Systems 15 [Neural Information Processing Systems, NIPS 2002, December 9-14, 2002, Vancouver, British Columbia, Canada], pp. 431-437, 2002, MIT Press, 0-262-02550-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP BibTeX RDF |
|
| 1 | Cristopher Moore, J. M. Robson |
Hard Tiling Problems with Simple Tiles.  |
Discrete & Computational Geometry  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristopher Moore, Martin Nilsson |
Parallel Quantum Computation and Quantum Codes.  |
SIAM J. Comput.  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Arthur D. Chtcherba, Gabriel Istrate, Cristopher Moore |
The phase transition in 1-in-k SAT and NAE 3-SAT.  |
SODA  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristopher Moore, Pascal Tesson, Denis Thérien |
Satisfiability of Systems of Equations over Finite Monoids.  |
MFCS  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Jarkko Kari, Cristopher Moore |
New Results on Alternating and Non-deterministic Two-Dimensional Finite-State Automata.  |
STACS  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Joakim Linde, Cristopher Moore, Mats G. Nordahl |
An n-Dimensional Generalization of the Rhombus Tiling.  |
DM-CCG  |
2001 |
DBLP BibTeX RDF |
|
| 1 | Cristopher Moore, James P. Crutchfield |
Quantum automata and quantum grammars.  |
Theor. Comput. Sci.  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Lameiras Campagnolo, Cristopher Moore, José Félix Costa |
Iteration, Inequalities, and Differentiability in Analog Computers.  |
J. Complexity  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristopher Moore, David Eppstein |
One-Dimensional Peg Solitaire  |
CoRR  |
2000 |
DBLP BibTeX RDF |
|
| 1 | Cristopher Moore, David Eppstein |
One-Dimensional Peg Solitaire, and Duotaire  |
CoRR  |
2000 |
DBLP BibTeX RDF |
|
| 1 | Cristopher Moore, Denis Thérien, François Lemieux, Joshua Berman, Arthur Drisko |
Circuits and Expressions with Nonassociative Gates.  |
J. Comput. Syst. Sci.  |
2000 |
DBLP DOI BibTeX RDF |
|