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="Veldhorst, Marinus"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The complexity of scheduling trees with communication delays
Jan Karel Lenstra
,
Marinus Veldhorst
,
Bart Veltman
Journal of Algorithms
20
(1), 1996, pp. 157-173
The complexity of scheduling trees with communication delays
Jan Karel Lenstra
,
Marinus Veldhorst
,
Bart Veltman
Lecture Notes in Computer Science
726
, 1993, pp. 284-294
A linear time algorithm to schedule trees with communication delays optimally on two machines
Marinus Veldhorst
Technical Report (RUU-CS-93-04), 1993, January
Gaussian elimination with partial pivoting on an MIMD computer
Marinus Veldhorst
Journal Parallel Distributed Computing
6
, 1989, pp. 62-68
The optimal representation of disjoint iso-oriented rectangles in two-dimensional trees
Marinus Veldhorst
Journal of Algorithms
7
, 1986, pp. 1-34