Cristopher Moore

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2011
100Independent Sets in Random Graphs from the Weighted Second Moment Method. Varsha Dani, Cristopher Moore. APPROX-RANDOM 2011, 472-482. Web SearchBibTeXDownload
99A Graph Integral Formulation of the Circuit Partition Polynomial. Cristopher Moore, Alexander Russell. Combinatorics, Probability & Computing (20): 911-920 (2011). Web SearchBibTeXDownload
98Tight bounds on the threshold for permuted k-colorability. Varsha Dani, Cristopher Moore, Anna Olson. CoRR (abs/1111.2947) (2011). Web SearchBibTeXDownload
97Phase transition in the detection of modules in sparse networks. Aurelien Decelle, Florent Krzakala, Cristopher Moore, Lenka Zdeborová. CoRR (abs/1102.1182) (2011). Web SearchBibTeXDownload
96Quantum Fourier sampling, Code Equivalence, and the quantum security of the McEliece and Sidelnikov cryptosystems. Hang Dinh, Cristopher Moore, Alexander Russell. CoRR (abs/1111.4382) (2011). Web SearchBibTeXDownload
95Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications. Aurelien Decelle, Florent Krzakala, Cristopher Moore, Lenka Zdeborová. CoRR (abs/1109.3041) (2011). Web SearchBibTeXDownload
94The complexity of the fermionant, and immanants of constant width. Stephan Mertens, Cristopher Moore. CoRR (abs/1110.1821) (2011). Web SearchBibTeXDownload
93Parallel Complexity of Random Boolean Circuits. Jon Machta, Simon Dedeo, Stephan Mertens, Cristopher Moore. CoRR (abs/1102.3310) (2011). Web SearchBibTeXDownload
92Active Learning for Node Classification in Assortative and Disassortative Networks. Cristopher Moore, Xiaoran Yan, Yaojia Zhu, Jean-Baptiste Rouquier, Terran Lane. CoRR (abs/1109.3240) (2011). Web SearchBibTeXDownload
91McEliece and Niederreiter Cryptosystems That Resist Quantum Fourier Sampling Attacks. Hang Dinh, Cristopher Moore, Alexander Russell. CRYPTO 2011, 761-779. Web SearchBibTeXDownload
90Active learning for node classification in assortative and disassortative networks. Cristopher Moore, Xiaoran Yan, Yaojia Zhu, Jean-Baptiste Rouquier, Terran Lane. KDD 2011, 841-849. Web SearchBibTeXDownload
89The Rigidity Transition in Random Graphs. Shiva Prasad Kasiviswanathan, Cristopher Moore, Louis Theran. SODA 2011, 1237-1252. Web SearchBibTeXDownload
2010
88Regarding a Representation-Theoretic Conjecture of Wigderson. Cristopher Moore, Alexander Russell. CoRR (abs/1009.4136) (2010). Web SearchBibTeXDownload
87Independent sets in random graphs from the weighted second moment method. Varsha Dani, Cristopher Moore. CoRR (abs/1011.0180) (2010). Web SearchBibTeXDownload
86Approximate Representations and Approximate Homomorphisms. Cristopher Moore, Alexander Russell. CoRR (abs/1009.6230) (2010). Web SearchBibTeXDownload
85The McEliece Cryptosystem Resists Quantum Fourier Sampling Attacks. Hang Dinh, Cristopher Moore, Alexander Russell. CoRR (abs/1008.2390) (2010). Web SearchBibTeXDownload
84Circuit partitions and #P-complete products of inner products. Cristopher Moore, Alexander Russell. CoRR (abs/1001.2314) (2010). Web SearchBibTeXDownload
83How close can we come to a parity function when there isn't one?. Cristopher Moore, Alexander Russell. CoRR (abs/1005.4897) (2010). Web SearchBibTeXDownload
82Active Learning for Hidden Attributes in Networks. Xiaoran Yan, Yaojia Zhu, Jean-Baptiste Rouquier, Cristopher Moore. CoRR (abs/1005.0794) (2010). Web SearchBibTeXDownload
81Frugal and Truthful Auctions for Vertex Covers, Flows and Cuts. David Kempe, Mahyar Salek, Cristopher Moore. FOCS 2010, 745-754. Web SearchBibTeXDownload
80Bounds on the Quantum Satisfiability Threshold. Sergey Bravyi, Cristopher Moore, Alexander Russell. ICS 2010, 482-489. Web SearchBibTeXDownload
79Limitations of quantum coset states for graph isomorphism. Sean Hallgren, Cristopher Moore, Martin Rötteler, Alexander Russell, Pranab Sen. J. ACM (57): 34 (2010). Web SearchBibTeXDownload
78Continuous and Discrete Methods in Computer Science. Cristopher Moore. LATIN 2010, 1. Web SearchBibTeXDownload
77Finding conjugate stabilizer subgroups in PSL and related groups. Aaron Denney, Cristopher Moore, Alexander Russell. Quantum Information & Computation (10): 282-291 (2010). Web SearchBibTeXDownload
76On the Impossibility of a Quantum Sieve Algorithm for Graph Isomorphism. Cristopher Moore, Alexander Russell, Piotr Sniady. SIAM J. Comput. (39): 2377-2396 (2010). Web SearchBibTeXDownload
2009
75Quantum algorithms for Simon's problem over nonabelian groups. Gorjan Alagic, Cristopher Moore, Alexander Russell. ACM Transactions on Algorithms (6) (2009). Web SearchBibTeXDownload
74Bounds on the quantum satisfibility threshold. Sergey Bravyi, Cristopher Moore, Alexander Russell. CoRR (abs/0907.1297) (2009). Web SearchBibTeXDownload
73Approximating the Permanent via Nonabelian Determinants. Cristopher Moore, Alexander Russell. CoRR (abs/0906.1702) (2009). Web SearchBibTeXDownload
72Frugal and Truthful Auctions for Vertex Covers, Flows, and Cuts. David Kempe, Mahyar Salek, Cristopher Moore. CoRR (abs/0912.3310) (2009). Web SearchBibTeXDownload
71On the bias of traceroute sampling: Or, power-law degree distributions in regular graphs. Dimitris Achlioptas, Aaron Clauset, David Kempe, Cristopher Moore. J. ACM (56) (2009). Web SearchBibTeXDownload
2008
70A simple constant-probability RP reduction from NP to Parity P. Cristopher Moore, Alexander Russell. Electronic Colloquium on Computational Complexity (ECCC) (15) (2008). Web SearchBibTeXDownload
69The Symmetric Group Defies Strong Fourier Sampling. Cristopher Moore, Alexander Russell, Leonard J. Schulman. SIAM J. Comput. (37): 1842-1864 (2008). Web SearchBibTeXDownload
2007
68Generating Hard Satisfiable Formulas by Hiding Solutions Deceptively. Haixia Jia, Cristopher Moore, Doug Strain. J. Artif. Intell. Res. (JAIR) (28): 107-118 (2007). Web SearchBibTeXDownload
67For distinguishing conjugate hidden subgroups, the pretty good measurement is as good as it gets. Cristopher Moore, Alexander Russell. Quantum Information & Computation (7): 752-765 (2007). Web SearchBibTeXDownload
66Counting connected graphs and hypergraphs via the probabilistic method. Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwalani. Random Struct. Algorithms (31): 288-329 (2007). Web SearchBibTeXDownload
65A continuous-discontinuous second-order transition in the satisfiability of random Horn-SAT formulas. Cristopher Moore, Gabriel Istrate, Demetrios D. Demopoulos, Moshe Y. Vardi. Random Struct. Algorithms (31): 173-185 (2007). Cited by 2Web SearchBibTeXDownload
64The Power of Strong Fourier Sampling: Quantum Algorithms for Affine Groups and Hidden Shifts. Cristopher Moore, Daniel N. Rockmore, Alexander Russell, Leonard J. Schulman. SIAM J. Comput. (37): 938-958 (2007). Web SearchBibTeXDownload
63Quantum algorithms for Simon's problem over general groups. Gorjan Alagic, Cristopher Moore, Alexander Russell. SODA 2007, 1217-1224. Web SearchBibTeXDownload
62On the impossibility of a quantum sieve algorithm for graph isomorphism. Cristopher Moore, Alexander Russell, Piotr Sniady. STOC 2007, 536-545. Web SearchBibTeXDownload
2006
61Generic quantum Fourier transforms. Cristopher Moore, Daniel N. Rockmore, Alexander Russell. ACM Transactions on Algorithms (2): 707-723 (2006). Web SearchBibTeXDownload
60Structural Inference of Hierarchies in Networks. Aaron Clauset, Cristopher Moore, Mark E. J. Newman. CoRR (abs/physics/0610051) (2006). Web SearchBibTeXDownload
59On the Impossibility of a Quantum Sieve Algorithm for Graph Isomorphism. Cristopher Moore, Alexander Russell, Piotr Sniady. CoRR (abs/quant-ph/0609138) (2006). Web SearchBibTeXDownload
58Global connectivity from local geometric constraints for sensor networks with various wireless footprints. Raissa D'Souza, David Galvin, Cristopher Moore, Dana Randall. IPSN 2006, 19-26. Web SearchBibTeXDownload
57MAX k-CUT and approximating the chromatic number of random graphs. Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwalani. Random Struct. Algorithms (28): 289-322 (2006). Web SearchBibTeXDownload
56Random k-SAT: Two Moments Suffice to Cross a Sharp Threshold. Dimitris Achlioptas, Cristopher Moore. SIAM J. Comput. (36): 740-762 (2006). Web SearchBibTeXDownload
55Limitations of quantum coset states for graph isomorphism. Sean Hallgren, Cristopher Moore, Martin Rötteler, Alexander Russell, Pranab Sen. STOC 2006, 604-617. Web SearchBibTeXDownload
2005
54Generating Hard Satisfiable Formulas by Hiding Solutions Deceptively. Haixia Jia, Cristopher Moore, Doug Strain. AAAI 2005, 384-389. Web SearchBibTeX
53A Continuous-Discontinuous Second-Order Transition in the Satisfiability of Random Horn-SAT Formulas. Cristopher Moore, Gabriel Istrate, Demetrios D. Demopoulos, Moshe Y. Vardi. APPROX-RANDOM 2005, 414-425. Web SearchBibTeXDownload
52Hiding Satisfying Assignments: Two are Better than One. Dimitris Achlioptas, Haixia Jia, Cristopher Moore. CoRR (abs/cs/0503046): 623-639 (2005). Web SearchBibTeXDownload
51On the Bias of Traceroute Sampling; or, Power-law Degree Distributions in Regular Graphs. Dimitris Achlioptas, Aaron Clauset, David Kempe, Cristopher Moore. CoRR (abs/cond-mat/0503087) (2005). Web SearchBibTeXDownload
50The Symmetric Group Defies Strong Fourier Sampling: Part I. Cristopher Moore, Alexander Russell, Leonard J. Schulman. CoRR (abs/quant-ph/0501056) (2005). Web SearchBibTeXDownload
49The Symmetric Group Defies Strong Fourier Sampling: Part II. Cristopher Moore, Alexander Russell. CoRR (abs/quant-ph/0501066) (2005). Web SearchBibTeXDownload
48The resolution complexity of random graph k-colorability. Paul Beame, Joseph C. Culberson, David G. Mitchell, Cristopher Moore. Discrete Applied Mathematics (153): 25-47 (2005). Web SearchBibTeXDownload
47Fearful Symmetries: Quantum Computing, Factoring, and Graph Isomorphism. Cristopher Moore. ESA 2005, 10. Web SearchBibTeXDownload
46The Symmetric Group Defies Strong Fourier Sampling. Cristopher Moore, Alexander Russell, Leonard J. Schulman. FOCS 2005, 479-490. Web SearchBibTeXDownload
45On the computational power of probabilistic and quantum branching program. Farid M. Ablayev, Aida Gainutdinova, Marek Karpinski, Cristopher Moore, Chris Pollett. Inf. Comput. (203): 145-162 (2005). Web SearchBibTeXDownload
44On the bias of traceroute sampling: or, power-law degree distributions in regular graphs. Dimitris Achlioptas, Aaron Clauset, David Kempe, Cristopher Moore. STOC 2005, 694-703. Web SearchBibTeXDownload
2004
43Hiding Satisfying Assignments: Two Are Better than One. Dimitris Achlioptas, Haixia Jia, Cristopher Moore. AAAI 2004, 131-136. Web SearchBibTeX
42Counting Connected Graphs and Hypergraphs via the Probabilistic Method. Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwalani. APPROX-RANDOM 2004, 322-333. Web SearchBibTeXDownload
41The Chromatic Number of Random Regular Graphs. Dimitris Achlioptas, Cristopher Moore. APPROX-RANDOM 2004, 219-228. Web SearchBibTeXDownload
40How Much Backtracking Does It Take to Color Random Graphs? Rigorous Results on Heavy Tails. Haixia Jia, Cristopher Moore. CP 2004, 742-746. Web SearchBibTeXDownload
39Building the Components for a Biomolecular Computer. Clint Morgan, Darko Stefanovic, Cristopher Moore, Milan N. Stojanovic. DNA 2004, 247-257. Web SearchBibTeXDownload
38The Resolution Complexity of Random Graph k-Colorability. Paul Beame, Joseph C. Culberson, David G. Mitchell, Cristopher Moore. Electronic Colloquium on Computational Complexity (ECCC) 2004. Web SearchBibTeXDownload
37Sampling Grid Colorings with Fewer Colors. Dimitris Achlioptas, Michael S. O. Molloy, Cristopher Moore, Frank Van Bussel. LATIN 2004, 80-89. Web SearchBibTeXDownload
36From Spin Glasses to Hard Satisfiable Formulas. Haixia Jia, Cristopher Moore, Bart Selman. SAT 2004. Web SearchBibTeXDownload
35The power of basis selection in fourier sampling: hidden subgroup problems in affine groups. Cristopher Moore, Daniel N. Rockmore, Alexander Russell, Leonard J. Schulman. SODA 2004, 1113-1122. Web SearchBibTeXDownload
34Generic quantum Fourier transforms. Cristopher Moore, Daniel N. Rockmore, Alexander Russell. SODA 2004, 778-787. Web SearchBibTeXDownload
33Rectangles and Squares Recognized by Two-Dimensional Automata. Jarkko Kari, Cristopher Moore. Theory Is Forever 2004, 134-144. Web SearchBibTeXDownload
2003
32Random k-SAT: Two Moments Suffice to Cross a Sharp Threshold. Dimitris Achlioptas, Cristopher Moore. CoRR (cond-mat/0310227) (2003). Web SearchBibTeXDownload
31MAX k-CUT and Approximating the Chromatic Number of Random Graphs. Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwalani. ICALP 2003, 200-211. Web SearchBibTeXDownload
30Almost all graphs with average degree 4 are 3-colorable. Dimitris Achlioptas, Cristopher Moore. J. Comput. Syst. Sci. (67): 441-471 (2003). Web SearchBibTeXDownload
2002
29Quantum and Stochastic Programs of Bounded Width. Chris Pollett, Farid M. Ablayev, Cristopher Moore. Electronic Colloquium on Computational Complexity (ECCC) 2002. Web SearchBibTeXDownload
28The Asymptotic Order of the Random k -SAT Threshold. Dimitris Achlioptas, Cristopher Moore. FOCS 2002, 779-788. Web SearchBibTeXDownload
27Quantum and Stochastic Branching Programs of Bounded Width. Farid M. Ablayev, Cristopher Moore, Chris Pollett. ICALP 2002, 343-354. Web SearchBibTeXDownload
26Ribbon Tile Invariants from the Signed Area. Cristopher Moore, Igor Pak. J. Comb. Theory, Ser. A (98): 1-16 (2002). Web SearchBibTeXDownload
25An Analog Characterization of the Grzegorczyk Hierarchy. Manuel Lameiras Campagnolo, Cristopher Moore, José Félix Costa. J. Complexity (18): 977-1000 (2002). Web SearchBibTeXDownload
24A Note on the Representational Incompatibility of Function Approximation and Factored Dynamics. Eric Allender, Sanjeev Arora, Michael S. Kearns, Cristopher Moore, Alexander Russell. NIPS 2002, 431-437. Web SearchBibTeXDownload
23Counting, fanout and the complexity of quantum ACC. Frederic Green, Steven Homer, Cristopher Moore, Christopher Pollett. Quantum Information & Computation (2): 35-65 (2002). Web SearchBibTeXDownload
22On the 2-Colorability of Random Hypergraphs. Dimitris Achlioptas, Cristopher Moore. RANDOM 2002, 78-90. Web SearchBibTeXDownload
21Quantum Walks on the Hypercube. Cristopher Moore, Alexander Russell. RANDOM 2002, 164-178. Web SearchBibTeXDownload
20Tiling groups for Wang tiles. Cristopher Moore, Ivan Rapaport, Eric Rémila. SODA 2002, 402-411. Web SearchBibTeXDownload
19Almost all graphs with average degree 4 are 3-colorable. Dimitris Achlioptas, Cristopher Moore. STOC 2002, 199-208. Web SearchBibTeXDownload
2001
18Hard Tiling Problems with Simple Tiles. Cristopher Moore, J. M. Robson. Discrete & Computational Geometry (26): 573-590 (2001). Web SearchBibTeXDownload
17An n-Dimensional Generalization of the Rhombus Tiling. Joakim Linde, Cristopher Moore, Mats G. Nordahl. DM-CCG 2001, 23-42. Web SearchBibTeXDownload
16Satisfiability of Systems of Equations over Finite Monoids. Cristopher Moore, Pascal Tesson, Denis Thérien. MFCS 2001, 537-547. Web SearchBibTeXDownload
15Parallel Quantum Computation and Quantum Codes. Cristopher Moore, Martin Nilsson. SIAM J. Comput. (31): 799-815 (2001). Web SearchBibTeXDownload
14The phase transition in 1-in-k SAT and NAE 3-SAT. Dimitris Achlioptas, Arthur D. Chtcherba, Gabriel Istrate, Cristopher Moore. SODA 2001, 721-722. Web SearchBibTeXDownload
13New Results on Alternating and Non-deterministic Two-Dimensional Finite-State Automata. Jarkko Kari, Cristopher Moore. STACS 2001, 396-406. Web SearchBibTeXDownload
2000
12One-Dimensional Peg Solitaire, and Duotaire. Cristopher Moore, David Eppstein. CoRR (math.CO/0008172) (2000). Web SearchBibTeXDownload
11One-Dimensional Peg Solitaire. Cristopher Moore, David Eppstein. CoRR (math.CO/0006067) (2000). Web SearchBibTeXDownload
10Iteration, Inequalities, and Differentiability in Analog Computers. Manuel Lameiras Campagnolo, Cristopher Moore, José Félix Costa. J. Complexity (16): 642-660 (2000). Web SearchBibTeXDownload
9Circuits and Expressions with Nonassociative Gates. Cristopher Moore, Denis Thérien, François Lemieux, Joshua Berman, Arthur Drisko. J. Comput. Syst. Sci. (60): 368-394 (2000). Web SearchBibTeXDownload
8Equation Satisfiability and Program Satisfiability for Finite Monoids. David A. Mix Barrington, Pierre McKenzie, Cristopher Moore, Pascal Tesson, Denis Thérien. MFCS 2000, 172-181. Web SearchBibTeXDownload
7Quantum automata and quantum grammars. Cristopher Moore, James P. Crutchfield. Theor. Comput. Sci. (237): 275-306 (2000). Web SearchBibTeXDownload
6Upper and Lower Bounds on Continuous-Time Computation. Manuel Lameiras Campagnolo, Cristopher Moore. UMC 2000, 135-153. Web SearchBibTeX
1999
5Quantum Circuits: Fanout, Parity, and Counting. Cristopher Moore. Electronic Colloquium on Computational Complexity (ECCC) (6) (1999). Web SearchBibTeXDownload
4Closed-for Analytic Maps in One and Two Dimensions can Simulate Universal Turing Machines. Pascal Koiran, Cristopher Moore. Theor. Comput. Sci. (210): 217-223 (1999). Web SearchBibTeXDownload
1998
3Dynamical Recognizers: Real-Time Language Recognition by Analog Computers. Cristopher Moore. Theor. Comput. Sci. (201): 99-136 (1998). Web SearchBibTeXDownload
1997
2Circuits and Expressions with NOn-Associative Gates. Joshua Berman, Arthur Drisko, François Lemieux, Cristopher Moore, Denis Thérien. IEEE Conference on Computational Complexity 1997, 193-203. Web SearchBibTeXDownload
1996
1Recursion Theory on the Reals and Continuous-Time Computation. Cristopher Moore. Theor. Comput. Sci. (162): 23-44 (1996). Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research