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="Shor, Peter"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A lower bound for the length of a partial transversal in a Latin square
Pooya Hatami
,
Peter W. Shor
Journal of Combinatorial Theory Series A
115
(7), 2008, pp. 1103-1113
On the sum-of-squares algorithm for bin packing
Janos Csirik
,
David S. Johnson
,
Claire Kenyon
,
James B. Orlin
,
Peter W. Shor
,
Richard R. Weber
Journal of the ACM
53
(1), 2006, pp. 1-65
Why haven't more quantum algorithms been found?
Peter W. Shor
Journal of the ACM
50
(1), 2003, pp. 87-90
On the sum-of-squares algorithm for bin packing
Janos Csirik
,
Davis S. Johnson
,
Claire Kenyon
,
James B. Orlin
,
Peter W. Shor
,
Richard R. Weber
Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC'2000 (Portland, Oregon, May 21-23, 2000)
, 2000, pp. 208-217
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Peter W. Shor
SIAM Review
41
(2), 1999, pp. 303-332
Tight bounds for the maximum acyclic subgraph problem
Bonnie Berger
,
Peter W. Shor
Journal of Algorithms
25
(1), 1997, pp. 1-18
Random debaters and the hardness of approximating stochastic functions
Anne Condon
,
Joan Feigenbaum
,
Carsten Lund
,
Peter Shor
SIAM Journal on Computing
26
(2), 1997, pp. 369-400
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Peter W. Shor
SIAM Journal on Computing
26
(5), 1997, pp. 1484-1509
Fault-tolerant quantum computation
Peter W. Shor
Proceedings of the 37th IEEE Symposium on Foundations of Computer Science, FOCS'96 (Burlington, Vermont, October 14-16, 1996)
, 1996, pp. 56-65
A game-theoretic classification of interactive complexity classes
Joan Feigenbaum
,
Daphne Koller
,
Peter Shor
Proceedings of the Tenth Annual Conference on Structure in Complexity Theory (Minneapolis, Minnesota, June 19-22, 1995)
, 1995, pp. 227-237
A new proof of Cayley's formula for counting labeled trees
Peter W. Shor
Journal of Combinatorial Theory Series A
71
(1), 1995, pp. 154-158
Efficient NC algorithms for set cover with applications to learning and geometry
Bonnie Berger
,
John Rompel
,
Peter W. Shor
Journal of Computer and System Sciences
49
(3), 1994, pp. 454-477
Random debaters and the hardness of approximating stochastic functions
Anne Condon
,
Joan Feigenbaum
,
Carsten Lund
,
Peter Shor
Proceedings of the Ninth Annual Conference on Structure in Complexity Theory (Amsterdam, The Netherlands, June 28 - July 1, 1994)
, 1994, pp. 280-293
Algorithms for quantum computation: Discrete logarithms and factoring
Peter W. Shor
Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, FOCS'94 (Santa Fe, New Mexico, November 20-22, 1994)
, 1994, pp. 124-134
Polynomial time algorithms for discrete logarithms and factoring on a quantum computer
Peter W. Shor
Proceedings of the 1st International Symposium, ANTS-I. Algorithmic Number Theory (Ithaca, NY, USA, May 6-9, 1994)
LNCS 877
, 1994, pp. 289
Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions (extended abstract)
Anne Condon
,
Joan Feigenbaum
,
Carsten Lund
,
Peter Shor
Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC'93 (San Diego, California, May 16--18, 1993)
, 1993, pp. 305-314
The rectilinear Steiner arborescence problem
Sailesh K. Rao
,
P. Sadayappan
,
Frank K. Hwang
,
Peter W. Shor
Algorithmica
7
, 1992, pp. 277-288
Steiner tree problems
Warren D. Smith
,
Peter W. Shor
Algorithmica
7
, 1992, pp. 329-332
Multilayer grid embeddings for VLSI
Alok Aggarwal
,
Maria Klawe
,
Peter Shor
Algorithmica
6
(1), 1991, pp. 129-151
How to pack better than best fit: Tight bounds for average-case on-line bin packing
Peter W. Shor
Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science, FOCS'91 (San Juan, Puerto Rico, October 1-4, 1991)
, 1991, pp. 752-759
Approximation algorithms for the maximum acyclic subgraph problem
Bonnie Berger
,
Peter W. Shor
Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'90 (San Francisco, California, January 22-24, 1990)
, 1990, pp. 236-243
Generalized planar matching
Frank Berman
,
David Johnson
,
Tom Leighton
,
Peter W. Shor
,
Larry Snyder
Journal of Algorithms
11
, 1990, pp. 153-184
Computing the minimum visible vertex distance between two polygons
Alok Aggarwal
,
Shlomo Moran
,
Peter W. Shor
,
Subhash Suri
Lecture Notes in Computer Science
382
, 1989, pp. 115-134
Geometric applications of a matrix-searching algorithm
Alok Aggarwal
,
Maria M. Klawe
,
Shlomo Moran
,
Peter Shor
,
Robert Wilber
Algorithmica
2
, 1987, pp. 195-208
Tight bounds for minimax grid matching, with applications to the average case analysis of algorithms
Tom Leighton
,
Peter Shor
misc, 1986
Seiten 1
2
>