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="Moura, A."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The word problem for
\omega
-terms over DA
A. Moura
Theoretical Computer Science
412
(46), 2011, pp. 6556-6569
Scheduling independent multiprocessor tasks
A.K. Amoura
,
E. Bampis
,
C. Kenyon
,
Y. Manoussakis
Algorithmica
32
(2), 2002, pp. 247-261
A comparison of heuristics for scheduling multiprocessor tasks on three dedicated processors
A.K. Amoura
,
E. Bampis
,
Y. Manoussakis
,
Zs. Tuza
Parallel Computing
25
(1), 1999, pp. 49-61
Scheduling independent multiprocessor tasks
A.K. Amoura
,
E. Bampis
,
C. Kenyon
,
Y. Manoussakis
Lecture Notes in Computer Science
1284
, 1997, pp. 1-12
A note on scheduling multiprocessor tasks with precedence constraints on parallel processors
A.K. Amoura
Information Processing Letters
63
(3), 1997, pp. 119-122
A generalization of Ogden's lemma
C. Bader
,
A. Moura
Journal of the ACM
29
(2), 1982, pp. 404-407
A note on grammatical covers
A. Moura
Information Processing Letters
11
(3), 1980, November, pp. 127-129