Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Moore, Cris"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Approximating the permanent via Nonabelian determinants
Cristopher Moore
,
Alexander Russell
SIAM Journal on Computing
41
(2), 2012, pp. 332-355
Limitations of quantum coset states for graph isomorphism
Sean Hallgren
,
Cristopher Moore
,
Martin Rötteler
,
Alexander Russell
,
Pranab Sen
Journal of the ACM
57
(6), 2010, pp. 34: 1-33
On the impossibility of a quantum Sieve algorithm for graph isomorphism
Cristopher Moore
,
Alexander Russell
,
Piotr Śniady
SIAM Journal on Computing
39
(6), 2010, pp. 2377-2396
Continuous and discrete methods in computer science
Cristopher Moore
Lecture Notes in Computer Science
6034
, 2010, pp. 1-1
On the bias of traceroute sampling: Or, power-law degree distributions in regular graphs
Dimitris Achlioptas
,
Aaron Clauset
,
David Kempe
,
Cristopher Moore
Journal of the ACM
56
(4), 2009, pp. 21: 1-28
The symmetric group defies strong Fourier sampling
Cristopher Moore
,
Alexander Russell
,
Leonard J. Schulman
SIAM Journal on Computing
37
(6), 2008, pp. 1842-1864
The power of strong Fourier sampling: Quantum algorithms for affine groups and hidden shifts
Cristopher Moore
,
Daniel Rockmore
,
Alexander Russell
,
Leonard J. Schulman
SIAM Journal on Computing
37
(3), 2007, pp. 938-958
On the impossibility of a quantum sieve algorithm for graph isomorphism
Cristopher Moore
,
Alexander Russell
,
Piotr Śniady
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, STOC'2007 (San Diego, CA, USA, June 11-13, 2007)
, 2007, pp. 536-545
Random
k
-SAT: Two moments suffice to cross a sharp threshold
Dimitris Achlioptas
,
Cristopher Moore
SIAM Journal on Computing
36
(3), 2006, pp. 740-762
Limitations of quantum coset states for graph isomorphism
Sean Hallgren
,
Cristopher Moore
,
Martin Rötteler
,
Alexander Russell
,
Pranab Sen
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, STOC'2006 (Seattle, Washington, USA, May 21-23, 2006)
, 2006, pp. 604-617
On the computational power of probabilistic and quantum branching program
Farid Ablayev
,
Aida Gainutdinova
,
Marek Karpinski
,
Cristopher Moore
,
Christopher Pollett
Information and Computation
203
(2), 2005, pp. 145-162
On the bias of traceroute sampling or, power-law degree distributions in regular graphs
Dimitris Achlioptas
,
Aaron Clauset
,
David Kempe
,
Cristopher Moore
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, STOC'2005 (Baltimore, Maryland, USA, May 22-24, 2005)
, 2005, pp. 694-703
Fearful symmetries: Quantum computing, factoring, and graph isomorphism
Cristopher Moore
Lecture Notes in Computer Science
3669
, 2005, pp. 10-10
Almost all graphs with average degree 4 are 3-colorable
Dimitris Achlioptas
,
Cristopher Moore
Journal of Computer and System Sciences
67
(2), 2003, pp. 441-471
MAX
k
-CUT and approximating the chromatic number of random graphs
Amin Coja-Oghlan
,
Cristopher Moore
,
Vishal Sanwalani
Lecture Notes in Computer Science
2719
, 2003, pp. 200-211
Quantum and stochastic branching programs of bounded width
Farid Ablayev
,
Cristopher Moore
,
Christopher Pollett
Lecture Notes in Computer Science
2380
, 2002, pp. 343-354
Almost all graphs with average degree 4 are 3-colorable
Dimitris Achiloptas
,
Cristopher Moore
Proceedings of the 34th Annual ACM Symposium on Theory of Computing, STOC'2002 (Montreal, Quebec, Canada, May 19-21, 2002)
, 2002, pp. 199-208
The asymptotic order of the random
k
-SAT threshold
Dimitris Achlioptas
,
Cristopher Moore
Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, FOCS'2002 (Vancouver, BC, Canada, November 16-19, 2002)
, 2002, pp. 779-788
An analog characterization of the Grzegorczyk hierarchy
Manuel Lameiras Campagnolo
,
Cristopher Moore
,
José Félix Costa
Journal of Complexity
18
(4), 2002, pp. 977-1000
Ribbon tile invariants from the signed area
Cristopher Moore
,
Igor Pak
Journal of Combinatorial Theory Series A
98
(1), 2002, pp. 1-16
New results on alternating and non-deterministic two-dimensional finite-state automata
Jarkko Kari
,
Cristopher Moore
Lecture Notes in Computer Science
2010
, 2001, pp. 396-406
Parallel quantum computation and quantum codes
Cristopher Moore
,
Martin Nilsson
SIAM Journal on Computing
31
(3), 2001-2002, pp. 799-815
Satisfiability of systems of equations over finite monoids
Cristopher Moore
,
Pascal Tesson
,
Denis Thérien
Lecture Notes in Computer Science
2136
, 2001, pp. 537-547
Equation satisfiability and program satisfiability for finite monoids
David Mix Barrington
,
Pierre McKenzie
,
Cris Moore
,
Pascal Tesson
,
Denis Thérien
Lecture Notes in Computer Science
1893
, 2000, pp. 172-181
Iteration, inequalities, and differentiability in analog computers
Manuel Lameiras Campagnolo
,
Cristopher Moore
,
José Félix Costa
Journal of Complexity
16
(4), 2000, pp. 642-660
Seiten 1
2
>