Cristopher Moore

	2009
75		Cristopher Moore, Alexander Russell: Approximating the Permanent via Nonabelian Determinants CoRR abs/0906.1702: (2009)
74		Sergey Bravyi, Cristopher Moore, Alexander Russell: Bounds on the quantum satisfibility threshold CoRR abs/0907.1297: (2009)
73		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): (2009)
	2008
72		Cristopher Moore, Alexander Russell: A simple constant-probability RP reduction from NP to Parity P CoRR abs/0810.1018: (2008)
71		Cristopher Moore, Alexander Russell: A simple constant-probability RP reduction from NP to Parity P. Electronic Colloquium on Computational Complexity (ECCC) 15(093): (2008)
70		Cristopher Moore, Alexander Russell, Leonard J. Schulman: The Symmetric Group Defies Strong Fourier Sampling. SIAM J. Comput. 37(6): 1842-1864 (2008)
	2007
69		Gorjan Alagic, Cristopher Moore, Alexander Russell: Quantum algorithms for Simon's problem over general groups. SODA 2007: 1217-1224
68		Cristopher Moore, Alexander Russell, Piotr Sniady: On the impossibility of a quantum sieve algorithm for graph isomorphism. STOC 2007: 536-545
67		Haixia Jia, Cristopher Moore, Doug Strain: Generating Hard Satisfiable Formulas by Hiding Solutions Deceptively. J. Artif. Intell. Res. (JAIR) 28: 107-118 (2007)
66		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)
65		Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwalani: Counting connected graphs and hypergraphs via the probabilistic method. Random Struct. Algorithms 31(3): 288-329 (2007)
64		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)
	2006
63		Raissa D'Souza, David Galvin, Cristopher Moore, Dana Randall: Global connectivity from local geometric constraints for sensor networks with various wireless footprints. IPSN 2006: 19-26
62		Sean Hallgren, Cristopher Moore, Martin Rötteler, Alexander Russell, Pranab Sen: Limitations of quantum coset states for graph isomorphism. STOC 2006: 604-617
61		Cristopher Moore, Daniel N. Rockmore, Alexander Russell: Generic quantum Fourier transforms. ACM Transactions on Algorithms 2(4): 707-723 (2006)
60		Aaron Clauset, Cristopher Moore, M. E. J. Newman: Structural Inference of Hierarchies in Networks CoRR abs/physics/0610051: (2006)
59		Cristopher Moore, Alexander Russell: On the Impossibility of a Quantum Sieve Algorithm for Graph Isomorphism CoRR abs/quant-ph/0609138: (2006)
58		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)
57		Dimitris Achlioptas, Cristopher Moore: Random k-SAT: Two Moments Suffice to Cross a Sharp Threshold. SIAM J. Comput. 36(3): 740-762 (2006)
	2005
56		Haixia Jia, Cristopher Moore, Doug Strain: Generating Hard Satisfiable Formulas by Hiding Solutions Deceptively. AAAI 2005: 384-389
55		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
54		Cristopher Moore: Fearful Symmetries: Quantum Computing, Factoring, and Graph Isomorphism. ESA 2005: 10
53		Cristopher Moore, Alexander Russell, Leonard J. Schulman: The Symmetric Group Defies Strong Fourier Sampling. FOCS 2005: 479-490
52		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
51		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)
50		Haixia Jia, Cristopher Moore, Doug Strain: Generating Hard Satisfiable Formulas by Hiding Solutions Deceptively CoRR abs/cs/0503044: (2005)
49		Dimitris Achlioptas, Haixia Jia, Cristopher Moore: Hiding Satisfying Assignments: Two are Better than One CoRR abs/cs/0503046: (2005)
48		Cristopher Moore, Alexander Russell, Leonard J. Schulman: The Symmetric Group Defies Strong Fourier Sampling: Part I CoRR abs/quant-ph/0501056: (2005)
47		Cristopher Moore, Alexander Russell: The Symmetric Group Defies Strong Fourier Sampling: Part II CoRR abs/quant-ph/0501066: (2005)
46		Paul Beame, Joseph C. Culberson, David G. Mitchell, Cristopher Moore: The resolution complexity of random graph k-colorability. Discrete Applied Mathematics 153(1-3): 25-47 (2005)
45		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)
44		Dimitris Achlioptas, Haixia Jia, Cristopher Moore: Hiding Satisfying Assignments: Two are Better than One. J. Artif. Intell. Res. (JAIR) 24: 623-639 (2005)
	2004
43		Dimitris Achlioptas, Haixia Jia, Cristopher Moore: Hiding Satisfying Assignments: Two Are Better than One. AAAI 2004: 131-136
42		Dimitris Achlioptas, Cristopher Moore: The Chromatic Number of Random Regular Graphs. APPROX-RANDOM 2004: 219-228
41		Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwalani: Counting Connected Graphs and Hypergraphs via the Probabilistic Method. APPROX-RANDOM 2004: 322-333
40		Haixia Jia, Cristopher Moore: How Much Backtracking Does It Take to Color Random Graphs? Rigorous Results on Heavy Tails. CP 2004: 742-746
39		Clint Morgan, Darko Stefanovic, Cristopher Moore, Milan N. Stojanovic: Building the Components for a Biomolecular Computer. DNA 2004: 247-257
38		Dimitris Achlioptas, Michael S. O. Molloy, Cristopher Moore, Frank Van Bussel: Sampling Grid Colorings with Fewer Colors. LATIN 2004: 80-89
37		Haixia Jia, Cristopher Moore, Bart Selman: From Spin Glasses to Hard Satisfiable Formulas. SAT 2004
36		Haixia Jia, Cristopher Moore, Bart Selman: From Spin Glasses to Hard Satisfiable Formulas. SAT (Selected Papers 2004: 199-210
35		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
34		Cristopher Moore, Daniel N. Rockmore, Alexander Russell: Generic quantum Fourier transforms. SODA 2004: 778-787
33		Jarkko Kari, Cristopher Moore: Rectangles and Squares Recognized by Two-Dimensional Automata. Theory Is Forever 2004: 134-144
32		Paul Beame, Joseph C. Culberson, David G. Mitchell, Cristopher Moore: The Resolution Complexity of Random Graph k-Colorability Electronic Colloquium on Computational Complexity (ECCC)(012): (2004)
	2003
31		Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwalani: MAX k-CUT and Approximating the Chromatic Number of Random Graphs. ICALP 2003: 200-211
30		Dimitris Achlioptas, Cristopher Moore: Random k-SAT: Two Moments Suffice to Cross a Sharp Threshold CoRR cond-mat/0310227: (2003)
29		Dimitris Achlioptas, Cristopher Moore: Almost all graphs with average degree 4 are 3-colorable. J. Comput. Syst. Sci. 67(2): 441-471 (2003)
	2002
28		Dimitris Achlioptas, Cristopher Moore: The Asymptotic Order of the Random k -SAT Threshold. FOCS 2002: 779-788
27		Farid M. Ablayev, Cristopher Moore, Chris Pollett: Quantum and Stochastic Branching Programs of Bounded Width. ICALP 2002: 343-354
26		Eric Allender, Sanjeev Arora, Michael S. Kearns, Cristopher Moore, Alexander Russell: A Note on the Representational Incompatibility of Function Approximation and Factored Dynamics. NIPS 2002: 431-437
25		Cristopher Moore, Alexander Russell: Quantum Walks on the Hypercube. RANDOM 2002: 164-178
24		Dimitris Achlioptas, Cristopher Moore: On the 2-Colorability of Random Hypergraphs. RANDOM 2002: 78-90
23		Cristopher Moore, Ivan Rapaport, Eric Rémila: Tiling groups for Wang tiles. SODA 2002: 402-411
22		Dimitris Achlioptas, Cristopher Moore: Almost all graphs with average degree 4 are 3-colorable. STOC 2002: 199-208
21		Chris Pollett, Farid M. Ablayev, Cristopher Moore: Quantum and Stochastic Programs of Bounded Width Electronic Colloquium on Computational Complexity (ECCC)(013): (2002)
20		Cristopher Moore, Igor Pak: Ribbon Tile Invariants from the Signed Area. J. Comb. Theory, Ser. A 98(1): 1-16 (2002)
19		Manuel Lameiras Campagnolo, Cristopher Moore, José Félix Costa: An Analog Characterization of the Grzegorczyk Hierarchy. J. Complexity 18(4): 977-1000 (2002)
	2001
18		Joakim Linde, Cristopher Moore, Mats G. Nordahl: An n-Dimensional Generalization of the Rhombus Tiling. DM-CCG 2001: 23-42
17		Cristopher Moore, Pascal Tesson, Denis Thérien: Satisfiability of Systems of Equations over Finite Monoids. MFCS 2001: 537-547
16		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
15		Jarkko Kari, Cristopher Moore: New Results on Alternating and Non-deterministic Two-Dimensional Finite-State Automata. STACS 2001: 396-406
14		Cristopher Moore, J. M. Robson: Hard Tiling Problems with Simple Tiles. Discrete & Computational Geometry 26(4): 573-590 (2001)
13		Cristopher Moore, Martin Nilsson: Parallel Quantum Computation and Quantum Codes. SIAM J. Comput. 31(3): 799-815 (2001)
	2000
12		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
11		Manuel Lameiras Campagnolo, Cristopher Moore: Upper and Lower Bounds on Continuous-Time Computation. UMC 2000: 135-153
10		Cristopher Moore, David Eppstein: One-Dimensional Peg Solitaire CoRR math.CO/0006067: (2000)
9		Cristopher Moore, David Eppstein: One-Dimensional Peg Solitaire, and Duotaire CoRR math.CO/0008172: (2000)
8		Manuel Lameiras Campagnolo, Cristopher Moore, José Félix Costa: Iteration, Inequalities, and Differentiability in Analog Computers. J. Complexity 16(4): 642-660 (2000)
7		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)
6		Cristopher Moore, James P. Crutchfield: Quantum automata and quantum grammars. Theor. Comput. Sci. 237(1-2): 275-306 (2000)
	1999
5		Cristopher Moore: Quantum Circuits: Fanout, Parity, and Counting Electronic Colloquium on Computational Complexity (ECCC) 6(32): (1999)
4		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)
	1998
3		Cristopher Moore: Dynamical Recognizers: Real-Time Language Recognition by Analog Computers. Theor. Comput. Sci. 201(1-2): 99-136 (1998)
	1997
2		Joshua Berman, Arthur Drisko, François Lemieux, Cristopher Moore, Denis Thérien: Circuits and Expressions with NOn-Associative Gates. IEEE Conference on Computational Complexity 1997: 193-203
	1996
1		Cristopher Moore: Recursion Theory on the Reals and Continuous-Time Computation. Theor. Comput. Sci. 162(1): 23-44 (1996)

Coauthor Index

1	Farid M. Ablayev	[21] [27] [45]
2	Dimitris Achlioptas	[16] [22] [24] [28] [29] [30] [38] [42] [43] [44] [49] [51] [52] [57] [73]
3	Gorjan Alagic	[69]
4	Eric Allender	[26]
5	Sanjeev Arora	[26]
6	David A. Mix Barrington	[12]
7	Paul Beame	[32] [46]
8	Joshua Berman	[2] [7]
9	Sergey Bravyi	[74]
10	Frank Van Bussel	[38]
11	Manuel Lameiras Campagnolo	[8] [11] [19]
12	Arthur D. Chtcherba	[16]
13	Aaron Clauset	[51] [52] [60] [73]
14	Amin Coja-Oghlan	[31] [41] [58] [65]
15	José Félix Costa	[8] [19]
16	James P. Crutchfield	[6]
17	Joseph C. Culberson	[32] [46]
18	Raissa D'Souza	[63]
19	Demetrios D. Demopoulos	[55] [66]
20	Arthur Drisko	[2] [7]
21	David Eppstein	[9] [10]
22	Aida Gainutdinova	[45]
23	David Galvin	[63]
24	Sean Hallgren	[62]
25	Gabriel Istrate	[16] [55] [66]
26	Haixia Jia	[36] [37] [40] [43] [44] [49] [50] [56] [67]
27	Jarkko Kari	[15] [33]
28	Marek Karpinski	[45]
29	Michael S. Kearns	[26]
30	David Kempe	[51] [52] [73]
31	Pascal Koiran	[4]
32	François Lemieux	[2] [7]
33	Joakim Linde	[18]
34	Pierre McKenzie	[12]
35	David G. Mitchell	[32] [46]
36	Michael Molloy (Michael S. O. Molloy)	[38]
37	Clint Morgan	[39]
38	M. E. J. Newman	[60]
39	Martin Nilsson	[13]
40	Mats G. Nordahl	[18]
41	Igor Pak	[20]
42	Chris Pollett	[21] [27] [45]
43	Dana Randall	[63]
44	Ivan Rapaport	[23]
45	Eric Rémila	[23]
46	J. M. Robson	[14]
47	Daniel N. Rockmore	[34] [35] [61] [64]
48	Martin Rötteler	[62]
49	Alexander Russell	[25] [26] [34] [35] [47] [48] [53] [59] [61] [62] [64] [68] [69] [70] [71] [72] [74] [75]
50	Vishal Sanwalani	[31] [41] [58] [65]
51	Leonard J. Schulman	[35] [48] [53] [64] [70]
52	Bart Selman	[36] [37]
53	Pranab Sen	[62]
54	Piotr Sniady	[68]
55	Darko Stefanovic	[39]
56	Milan N. Stojanovic	[39]
57	Doug Strain	[50] [56] [67]
58	Pascal Tesson	[12] [17]
59	Denis Thérien	[2] [7] [12] [17]
60	Moshe Y. Vardi	[55] [66]

Colors in the list of coauthors