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="K{\"o}nig, J.-C."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Optimal schedules for d-D grid graphs with communication delays
E. Bampis
,
C. Delorme
,
J.-C. König
Parallel Computing
24
(11), 1998, pp. 1653-1664
Optimal schedules for d-D grid graphs with communication delays
E. Bampis
,
C. Delorme
,
J.-C. König
Lecture Notes in Computer Science
1046
, 1996, pp. 655-666
Optimal parallel execution of complete binary trees and grids into most popular interconnection networks
E. Bampis
,
J.-C. König
,
D. Trystram
Theoretical Computer Science
147
(1-2), 1995, pp. 1-18
Optimal parallel execution of complete binary trees and grids into most popular interconnection networks
E. Bampis
,
J.-C. König
,
D. Trustram
Proceedings of the 6th International PARLE Conference. PARLE '94 - Parallel Architectures and Languages Europe (Athens, Greece, July 4-8, 1994)
LNCS 817
, 1994, pp. 122-133
Minimum
k
-broadcast graphs
J.-C. König
,
E. Lazard
Discrete Applied Mathematics
53
, 1994, pp. 199-209
A low overhead schedule for a 3d-grid graph
E. Bampis
,
J.-C. König
,
D. Trystram
Parallel Processing Letters
2
(4), 1992, pp. 363-372