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="Weber, R.R."
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
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
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
Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected flowtime
R.R. Weber
,
P. Varaiya
,
J. Walrand
Journal of Applied Probability
23
, 1986, pp. 841-847