dblp.uni-trier.dewww.uni-trier.de

Cristopher Moore Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

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

Coauthor Index

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

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)