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="Lai, T.-H."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Scheduling independent jobs on hypercubes
G.-I. Chen
,
T.-H. Lai
Lecture Notes in Computer Science
294
, 1988, pp. 273-280
On the routability of a convex grid
T.-H. Lai
,
A. Sprague
Journal of Algorithms
8
(3), 1987, September, pp. 372-384
A note on anomalies in parallel branch-and-bound algorithms with one-to-one bounding functions
T.-H. Lai
,
A. Sprague
Information Processing Letters
23
(3), 1986, October, pp. 119-122
Preemptive scheduling of a multiprocessor system with memories to minimize maximum lateness
T.-H. Lai
,
S. Sahni
SIAM Journal on Computing
13
(4), 1984, November, pp. 690-704
Nearly on-line scheduling of multiprocessor systems with memories
T.-H. Lai
,
S. Sahni
Journal of Algorithms
4
(4), 1983, December, pp. 353-362
Nearly on line scheduling of multiprocessor systems with memories
T.-H. Lai
,
Sartaj Sahni
Technical Report (82-11), 1982, April