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
[2]
Hilfe
Suche: Author="Lloyd, E.L."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Generalized river routing -- algorithms and performance bounds
J.R.S. Blair
,
E.L. Lloyd
Lecture Notes in Computer Science
227
, 1986, pp. 317-328
On the worst case performance of buddy systems
E.L. Lloyd
,
M.C. Loui
Acta Informatica
22
(4), 1985, pp. 451-473
Feedback vertex sets and cyclically reducible graphs
C.-C. Wang
,
E.L. Lloyd
,
M.L. Soffa
Journal of the ACM
32
(2), 1985, pp. 296-313
One-layer routing without component constraints
E.L. Lloyd
,
S.S. Ravi
Journal of Computer and System Sciences
28
(3), 1984, June, pp. 420-438
On a simple deadlock recovery problem
E.L. Lloyd
Information Processing Letters
16
(4), 1983, May, pp. 175-178
Critical path scheduling with resource and processor constraints
E.L. Lloyd
Journal of the ACM
29
(3), 1982, pp. 781-811
Coffman-Graham scheduling of UET task systems with 0-1 resources
E.L. Lloyd
Information Processing Letters
12
(1), 1981, February, pp. 40-45
Critical path scheduling of task systems with resource and processor constraints
E.L. Lloyd
Proceedings of the 12th Annual ACM Symposium on Theory of Computing, STOC'80 (Los Angeles, CA, April 28-30, 1980)
, 1980, pp. 436-446
On triangulations of a set of points in the plane
E.L. Lloyd
Proceedings of the 18th Annual IEEE Symposium on Foundations of Computer Science, FOCS'77 (Providence, RI, October 31 - November 2, 1977)
, 1977, pp. 228-240