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
[3]
Hilfe
Suche: Author="Langston, M.A."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Time-space optimal parallel merging and sorting
X. Guan
,
M.A. Langston
Proceedings of the 1989 International Conference on Parallel Processing. Vol.~3 Algorithms and Applications, ICPP'89 (Penn State University, August 8-12, 1989)
, 1989, pp. 1-8
On a special case of uniform processor scheduling
M. Kunde
,
M.A. Langston
,
Jin-Ming Liu
Journal of Algorithms
9
(2), 1988, June, pp. 287-296
Bin packing: On optimizing the number of pieces packed
D.K. Friesen
,
M.A. Langston
BIT
27
, 1987, pp. 148-156
Variable sized bin packing
D.K. Friesen
,
M.A. Langston
SIAM Journal on Computing
15
(1), 1986, February, pp. 222-230
Evaluation of a MULTIFIT-based scheduling algorithm
D.K. Friesen
,
M.A. Langston
Journal of Algorithms
7
(1), 1986, March, pp. 35-59
Bin packing: on optimizing the number of pieces packed
D.K. Friesen
,
M.A. Langston
Technical Report (CS-86-155), 1986, July
A performance guarantee for the greedy set-partitioning algorithm
E.G., Jr. Coffman
,
M.A. Langston
Acta Informatica
21
(4), 1984, pp. 409-415
A storage-size selection problem
D.K. Friesen
,
M.A. Langston
Information Processing Letters
18
(5), 1984, June, pp. 295-296
Performance of heuristics for a computer source allocation problem
M.A. Langston
SIAM Journal on Algebraic Discrete Methods
5
(2), 1984, June, pp. 154-161
Bounds for multifit scheduling on uniform processors
D.K. Friesen
,
M.A. Langston
SIAM Journal on Computing
12
(1), 1983, February, pp. 60-70