The SCEAS System
| |||||||

## Search the dblp DataBase
Cristopher Moore:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Dimitris Achlioptas, Haixia Jia, Cristopher Moore
**Hiding Satisfying Assignments: Two Are Better than One.**[Citation Graph (0, 0)][DBLP] AAAI, 2004, pp:131-136 [Conf] - Haixia Jia, Cristopher Moore, Doug Strain
**Generating Hard Satisfiable Formulas by Hiding Solutions Deceptively.**[Citation Graph (0, 0)][DBLP] AAAI, 2005, pp:384-389 [Conf] - Dimitris Achlioptas, Cristopher Moore
**The Chromatic Number of Random Regular Graphs.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2004, pp:219-228 [Conf] - Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwalani
**Counting Connected Graphs and Hypergraphs via the Probabilistic Method.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2004, pp:322-333 [Conf] - Cristopher Moore, Gabriel Istrate, Demetrios D. Demopoulos, Moshe Y. Vardi
**A Continuous-Discontinuous Second-Order Transition in the Satisfiability of Random Horn-SAT Formulas.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2005, pp:414-425 [Conf] - Jarkko Kari, Cristopher Moore
**Rectangles and Squares Recognized by Two-Dimensional Automata.**[Citation Graph (0, 0)][DBLP] Theory Is Forever, 2004, pp:134-144 [Conf] - Joshua Berman, Arthur Drisko, François Lemieux, Cristopher Moore, Denis Thérien
**Circuits and Expressions with NOn-Associative Gates.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1997, pp:193-203 [Conf] - Haixia Jia, Cristopher Moore
**How Much Backtracking Does It Take to Color Random Graphs? Rigorous Results on Heavy Tails.**[Citation Graph (0, 0)][DBLP] CP, 2004, pp:742-746 [Conf] - Joakim Linde, Cristopher Moore, Mats G. Nordahl
**An n-Dimensional Generalization of the Rhombus Tiling.**[Citation Graph (0, 0)][DBLP] DM-CCG, 2001, pp:23-42 [Conf] - Clint Morgan, Darko Stefanovic, Cristopher Moore, Milan N. Stojanovic
**Building the Components for a Biomolecular Computer.**[Citation Graph (0, 0)][DBLP] DNA, 2004, pp:247-257 [Conf] - Cristopher Moore
**Fearful Symmetries: Quantum Computing, Factoring, and Graph Isomorphism.**[Citation Graph (0, 0)][DBLP] ESA, 2005, pp:10- [Conf] - Dimitris Achlioptas, Cristopher Moore
**The Asymptotic Order of the Random k -SAT Threshold.**[Citation Graph (0, 0)][DBLP] FOCS, 2002, pp:779-788 [Conf] - Cristopher Moore, Alexander Russell, Leonard J. Schulman
**The Symmetric Group Defies Strong Fourier Sampling.**[Citation Graph (0, 0)][DBLP] FOCS, 2005, pp:479-490 [Conf] - Farid M. Ablayev, Cristopher Moore, Chris Pollett
**Quantum and Stochastic Branching Programs of Bounded Width.**[Citation Graph (0, 0)][DBLP] ICALP, 2002, pp:343-354 [Conf] - Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwalani
**MAX k-CUT and Approximating the Chromatic Number of Random Graphs.**[Citation Graph (0, 0)][DBLP] ICALP, 2003, pp:200-211 [Conf] - Raissa D'Souza, David Galvin, Cristopher Moore, Dana Randall
**Global connectivity from local geometric constraints for sensor networks with various wireless footprints.**[Citation Graph (0, 0)][DBLP] IPSN, 2006, pp:19-26 [Conf] - Dimitris Achlioptas, Michael S. O. Molloy, Cristopher Moore, Frank Van Bussel
**Sampling Grid Colorings with Fewer Colors.**[Citation Graph (0, 0)][DBLP] LATIN, 2004, pp:80-89 [Conf] - David A. Mix Barrington, Pierre McKenzie, Cristopher Moore, Pascal Tesson, Denis Thérien
**Equation Satisfiability and Program Satisfiability for Finite Monoids.**[Citation Graph (0, 0)][DBLP] MFCS, 2000, pp:172-181 [Conf] - Cristopher Moore, Pascal Tesson, Denis Thérien
**Satisfiability of Systems of Equations over Finite Monoids.**[Citation Graph (0, 0)][DBLP] MFCS, 2001, pp:537-547 [Conf] - Eric Allender, Sanjeev Arora, Michael S. Kearns, Cristopher Moore, Alexander Russell
**A Note on the Representational Incompatibility of Function Approximation and Factored Dynamics.**[Citation Graph (0, 0)][DBLP] NIPS, 2002, pp:431-437 [Conf] - Dimitris Achlioptas, Cristopher Moore
**On the 2-Colorability of Random Hypergraphs.**[Citation Graph (0, 0)][DBLP] RANDOM, 2002, pp:78-90 [Conf] - Cristopher Moore, Alexander Russell
**Quantum Walks on the Hypercube.**[Citation Graph (0, 0)][DBLP] RANDOM, 2002, pp:164-178 [Conf] - Haixia Jia, Cristopher Moore, Bart Selman
**From Spin Glasses to Hard Satisfiable Formulas.**[Citation Graph (0, 0)][DBLP] SAT, 2004, pp:- [Conf] - Haixia Jia, Cristopher Moore, Bart Selman
**From Spin Glasses to Hard Satisfiable Formulas.**[Citation Graph (0, 0)][DBLP] SAT (Selected Papers, 2004, pp:199-210 [Conf] - Dimitris Achlioptas, Arthur D. Chtcherba, Gabriel Istrate, Cristopher Moore
**The phase transition in 1-in-k SAT and NAE 3-SAT.**[Citation Graph (0, 0)][DBLP] SODA, 2001, pp:721-722 [Conf] - Cristopher Moore, Ivan Rapaport, Eric Rémila
**Tiling groups for Wang tiles.**[Citation Graph (0, 0)][DBLP] SODA, 2002, pp:402-411 [Conf] - Cristopher Moore, Daniel N. Rockmore, Alexander Russell
**Generic quantum Fourier transforms.**[Citation Graph (0, 0)][DBLP] SODA, 2004, pp:778-787 [Conf] - Cristopher Moore, Daniel N. Rockmore, Alexander Russell, Leonard J. Schulman
**The power of basis selection in fourier sampling: hidden subgroup problems in affine groups.**[Citation Graph (0, 0)][DBLP] SODA, 2004, pp:1113-1122 [Conf] - Jarkko Kari, Cristopher Moore
**New Results on Alternating and Non-deterministic Two-Dimensional Finite-State Automata.**[Citation Graph (0, 0)][DBLP] STACS, 2001, pp:396-406 [Conf] - Dimitris Achlioptas, Aaron Clauset, David Kempe, Cristopher Moore
**On the bias of traceroute sampling: or, power-law degree distributions in regular graphs.**[Citation Graph (0, 0)][DBLP] STOC, 2005, pp:694-703 [Conf] - Dimitris Achlioptas, Cristopher Moore
**Almost all graphs with average degree 4 are 3-colorable.**[Citation Graph (0, 0)][DBLP] STOC, 2002, pp:199-208 [Conf] - Sean Hallgren, Cristopher Moore, Martin Rötteler, Alexander Russell, Pranab Sen
**Limitations of quantum coset states for graph isomorphism.**[Citation Graph (0, 0)][DBLP] STOC, 2006, pp:604-617 [Conf] - Manuel Lameiras Campagnolo, Cristopher Moore
**Upper and Lower Bounds on Continuous-Time Computation.**[Citation Graph (0, 0)][DBLP] UMC, 2000, pp:135-153 [Conf] - Dimitris Achlioptas, Cristopher Moore
**Random k-SAT: Two Moments Suffice to Cross a Sharp Threshold**[Citation Graph (0, 0)][DBLP] CoRR, 2003, v:0, n:, pp:- [Journal] - Cristopher Moore, David Eppstein
**One-Dimensional Peg Solitaire**[Citation Graph (0, 0)][DBLP] CoRR, 2000, v:0, n:, pp:- [Journal] - Cristopher Moore, David Eppstein
**One-Dimensional Peg Solitaire, and Duotaire**[Citation Graph (0, 0)][DBLP] CoRR, 2000, v:0, n:, pp:- [Journal] - Paul Beame, Joseph C. Culberson, David G. Mitchell, Cristopher Moore
**The resolution complexity of random graph**[Citation Graph (0, 0)][DBLP]*k*-colorability. Discrete Applied Mathematics, 2005, v:153, n:1-3, pp:25-47 [Journal] - Cristopher Moore, J. M. Robson
**Hard Tiling Problems with Simple Tiles.**[Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 2001, v:26, n:4, pp:573-590 [Journal] - Chris Pollett, Farid M. Ablayev, Cristopher Moore
**Quantum and Stochastic Programs of Bounded Width**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:013, pp:- [Journal] - Paul Beame, Joseph C. Culberson, David G. Mitchell, Cristopher Moore
**The Resolution Complexity of Random Graph k-Colorability**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:012, pp:- [Journal] - Cristopher Moore
**Quantum Circuits: Fanout, Parity, and Counting**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 1999, v:6, n:32, pp:- [Journal] - Farid M. Ablayev, Aida Gainutdinova, Marek Karpinski, Cristopher Moore, Christopher Pollett
**On the computational power of probabilistic and quantum branching program.**[Citation Graph (0, 0)][DBLP] Inf. Comput., 2005, v:203, n:2, pp:145-162 [Journal] - Manuel Lameiras Campagnolo, Cristopher Moore, José Félix Costa
**Iteration, Inequalities, and Differentiability in Analog Computers.**[Citation Graph (0, 0)][DBLP] J. Complexity, 2000, v:16, n:4, pp:642-660 [Journal] - Manuel Lameiras Campagnolo, Cristopher Moore, José Félix Costa
**An Analog Characterization of the Grzegorczyk Hierarchy.**[Citation Graph (0, 0)][DBLP] J. Complexity, 2002, v:18, n:4, pp:977-1000 [Journal] - Dimitris Achlioptas, Cristopher Moore
**Almost all graphs with average degree 4 are 3-colorable.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2003, v:67, n:2, pp:441-471 [Journal] - Cristopher Moore, Denis Thérien, François Lemieux, Joshua Berman, Arthur Drisko
**Circuits and Expressions with Nonassociative Gates.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2000, v:60, n:2, pp:368-394 [Journal] - Cristopher Moore, Igor Pak
**Ribbon Tile Invariants from the Signed Area.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 2002, v:98, n:1, pp:1-16 [Journal] - Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwalani
**MAX**[Citation Graph (0, 0)][DBLP]*k*-CUT and approximating the chromatic number of random graphs. Random Struct. Algorithms, 2006, v:28, n:3, pp:289-322 [Journal] - Cristopher Moore, Martin Nilsson
**Parallel Quantum Computation and Quantum Codes.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2001, v:31, n:3, pp:799-815 [Journal] - Dimitris Achlioptas, Cristopher Moore
**Random k-SAT: Two Moments Suffice to Cross a Sharp Threshold.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2006, v:36, n:3, pp:740-762 [Journal] - Cristopher Moore, Daniel N. Rockmore, Alexander Russell
**Generic quantum Fourier transforms.**[Citation Graph (0, 0)][DBLP] ACM Transactions on Algorithms, 2006, v:2, n:4, pp:707-723 [Journal] - Pascal Koiran, Cristopher Moore
**Closed-for Analytic Maps in One and Two Dimensions can Simulate Universal Turing Machines.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1999, v:210, n:1, pp:217-223 [Journal] - Cristopher Moore
**Recursion Theory on the Reals and Continuous-Time Computation.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1996, v:162, n:1, pp:23-44 [Journal] - Cristopher Moore
**Dynamical Recognizers: Real-Time Language Recognition by Analog Computers.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1998, v:201, n:1-2, pp:99-136 [Journal] - Cristopher Moore, James P. Crutchfield
**Quantum automata and quantum grammars.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2000, v:237, n:1-2, pp:275-306 [Journal] - Gorjan Alagic, Cristopher Moore, Alexander Russell
**Quantum algorithms for Simon's problem over general groups.**[Citation Graph (0, 0)][DBLP] SODA, 2007, pp:1217-1224 [Conf] - Cristopher Moore, Alexander Russell, Piotr Sniady
**On the impossibility of a quantum sieve algorithm for graph isomorphism.**[Citation Graph (0, 0)][DBLP] STOC, 2007, pp:536-545 [Conf] - Aaron Clauset, Cristopher Moore, M. E. J. Newman
**Structural Inference of Hierarchies in Networks**[Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal] - Cristopher Moore, Alexander Russell
**On the Impossibility of a Quantum Sieve Algorithm for Graph Isomorphism**[Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal] - Cristopher Moore, Alexander Russell, Leonard J. Schulman
**The Symmetric Group Defies Strong Fourier Sampling: Part I**[Citation Graph (0, 0)][DBLP] CoRR, 2005, v:0, n:, pp:- [Journal] - Cristopher Moore, Alexander Russell
**The Symmetric Group Defies Strong Fourier Sampling: Part II**[Citation Graph (0, 0)][DBLP] CoRR, 2005, v:0, n:, pp:- [Journal] - Haixia Jia, Cristopher Moore, Doug Strain
**Generating Hard Satisfiable Formulas by Hiding Solutions Deceptively**[Citation Graph (0, 0)][DBLP] CoRR, 2005, v:0, n:, pp:- [Journal] - Dimitris Achlioptas, Haixia Jia, Cristopher Moore
**Hiding Satisfying Assignments: Two are Better than One**[Citation Graph (0, 0)][DBLP] CoRR, 2005, v:0, n:, pp:- [Journal] - Dimitris Achlioptas, Aaron Clauset, David Kempe, Cristopher Moore
**On the Bias of Traceroute Sampling; or, Power-law Degree Distributions in Regular Graphs**[Citation Graph (0, 0)][DBLP] CoRR, 2005, v:0, n:, pp:- [Journal] - Dimitris Achlioptas, Haixia Jia, Cristopher Moore
**Hiding Satisfying Assignments: Two are Better than One.**[Citation Graph (0, 0)][DBLP] J. Artif. Intell. Res. (JAIR), 2005, v:24, n:, pp:623-639 [Journal] - Haixia Jia, Cristopher Moore, Doug Strain
**Generating Hard Satisfiable Formulas by Hiding Solutions Deceptively.**[Citation Graph (0, 0)][DBLP] J. Artif. Intell. Res. (JAIR), 2007, v:28, n:, pp:107-118 [Journal] - Cristopher Moore, Daniel N. Rockmore, Alexander Russell, Leonard J. Schulman
**The Power of Strong Fourier Sampling: Quantum Algorithms for Affine Groups and Hidden Shifts.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2007, v:37, n:3, pp:938-958 [Journal] **Continuous and Discrete Methods in Computer Science.**[Citation Graph (, )][DBLP]**Bounds on the Quantum Satisfiability Threshold.**[Citation Graph (, )][DBLP]**A simple constant-probability RP reduction from NP to Parity P**[Citation Graph (, )][DBLP]**Approximating the Permanent via Nonabelian Determinants**[Citation Graph (, )][DBLP]**Bounds on the quantum satisfibility threshold**[Citation Graph (, )][DBLP]**Frugal and Truthful Auctions for Vertex Covers, Flows, and Cuts**[Citation Graph (, )][DBLP]**Circuit partitions and #P-complete products of inner products**[Citation Graph (, )][DBLP]**Active Learning for Hidden Attributes in Networks**[Citation Graph (, )][DBLP]**How close can we come to a parity function when there isn't one?**[Citation Graph (, )][DBLP]**The McEliece Cryptosystem Resists Quantum Fourier Sampling Attacks**[Citation Graph (, )][DBLP]**A simple constant-probability RP reduction from NP to Parity P.**[Citation Graph (, )][DBLP]
Search in 0.029secs, Finished in 0.031secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |