Marinus Veldhorst

According to our database, Marinus Veldhorst authored at least 6 papers between 1985 and 1996.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

1996

The Complexity of Scheduling Trees with Communication Delays.

Jan Karel Lenstra, Marinus Veldhorst, Bart Veltman

J. Algorithms, 1996

1993

The Complexity of Scheduling Trees with Communication Delays (Extended Abstract).

Jan Karel Lenstra, Marinus Veldhorst

Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993

1989

Gaussian Elimination with Partial Pivoting on an MIMD Computer.

Marinus Veldhorst

J. Parallel Distributed Comput., 1989

1986

The Optimal Representation of Disjoint Iso-Oriented Rectangles in Two-Dimensional Trees.

Marinus Veldhorst

J. Algorithms, 1986

Parallel Dynamic Programming Algorithms.

Marinus Veldhorst

Proceedings of the CONPAR 86: Conference on Algorithms and Hardware for Parallel Processing, 1986

1985

Approximation of the Consecutive Ones Matrix Augmentation Problem.

Marinus Veldhorst

SIAM J. Comput., 1985