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, P.W."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Perfect packing theorems and the average-case behavior of optimal and online bin packing
E.G., Jr. Coffman
,
C. Courcoubetis
,
M.R. Garey
,
D.S. Johnson
,
P.W. Shor
,
R.R. Weber
,
M. Yannakakis
SIAM Review
44
(1), 2002, pp. 95-108
Local rule mechanism for selecting icosahedral shell geometry
B. Berger
,
J. King
,
R. Schwartz
,
P.W. Shor
Discrete Applied Mathematics
104
(1-3), 2000, pp. 97-111
Bin packing with discrete item sizes, Part I: Perfect packing theorems and the average case behavior of optimal packings
E.G., Jr. Coffman
,
C. Courcoubetis
,
M.R. Garey
,
D.S. Johnson
,
P.W. Shor
,
R.R. Weber
,
M. Yannakakis
SIAM Journal on Discrete Mathematics
13
(3), 2000, pp. 384-402
Markov chains, computer proofs, and average-case analysis of best fit bin packing
E.G., Jr. Coffman
,
D.S. Johnson
,
P.W. Shor
,
R.R. Weber
Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC'93 (San Diego, California, May 16--18, 1993)
, 1993, pp. 412-421
Packings in two dimensions: Asymptotic average-case analysis of algorithms
E.G., Jr. Coffman
,
P.W. Shor
Algorithmica
9
, 1993, pp. 253-277
Fundamental discrepancies between average-case analyses under discrete and continuous distributions: A bin packing case study
E.G., Jr. Coffman
,
C. Courcoubetis
,
M.R. Garey
,
D.S. Johnson
,
L.A. McGeoch
,
P.W. Shor
,
R.R. Weber
,
M. Yannakakis
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, STOC'91 (New Orleans, Louisiana, May 6-8, 1991)
, 1991, pp. 230-240
A simple proof of the
O(\sqrt{n} log^{3/4}n)
upright matching bound
E.G., Jr. Coffman
,
P.W. Shor
SIAM Journal on Discrete Mathematics
4
(1), 1991, February, pp. 48-57
Efficient
NC
algorithms for set cover with applications to learning and geometry
B. Berger
,
J. Rompel
,
P.W. Shor
Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, FOCS'89 (Research Triangle Park, NC, October 30 - November 1, 1989)
, 1989, pp. 54-59
The average-case analysis of some on-line algorithms for bin packing
P.W. Shor
Combinatorica
6
(2), 1986, pp. 179-200
A counterexample to the triangle conjecture
P.W. Shor
Journal of Combinatorial Theory Series A
38
, 1985, pp. 110-112
The average-case analysis of some on-line algorithms for bin packing
P.W. Shor
Proceedings of the 25th Annual IEEE Symposium on Foundations of Computer Science, FOCS'84 (Singer Island, FL, October 24-26, 1984)
, 1984, pp. 193-200
A lower bound for the length of a partial transversal in a Latin square
P.W. Shor
Journal of Combinatorial Theory Series A
33
, 1982, pp. 1-8