# Manfred Kunde

According to our database

^{1}, Manfred Kunde## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### Homepage:

#### On csauthors.net:

## Bibliography

2007

A New Bound for Pure Greedy Hot Potato Routing.

Proceedings of the STACS 2007, 2007

2003

A case against using Stirling's formula (unless you really need it).

Bulletin of the EATCS, 2003

1999

Optimal Deterministic Sorting and Routing on Grids and Tori with Diagonals.

Algorithmica, 1999

1997

Efficient Sorting and Routing on Reconfigurable Meshes Using Restricted Bus Length.

Proceedings of the 11th International Parallel Processing Symposium (IPPS '97), 1997

k-k Sorting on the Multi-Mesh.

Proceedings of the Fundamentals of Computation Theory, 11th International Symposium, 1997

1995

Optimal Average Case Sorting on Arrays.

STACS, 1995

1994

Faster Sorting and Routing on Grids with Diagonals.

Proceedings of the STACS 94, 1994

1993

Packet Routing on Grids of Processors.

Algorithmica, 1993

Block Gossiping on Grids and Tori: Deterministic Sorting and Routing Match the Bisection Bound.

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

1992

Balanced Strategies for Routing on Meshes.

Proceedings of the Data Structures and Efficient Algorithms, 1992

1991

(k-k) Routing on Multidimensional Mesh-Connected Arrays.

J. Parallel Distrib. Comput., 1991

Balanced Routing: Towards the Distance Bound on Grids.

SPAA, 1991

Concentrated Regular Data Streams on Grids: Sorting and Routing Near to the Bisection Bound

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1990

Systolic algorithm for tensor products of matrices: implementation and applications.

Parallel Computing, 1990

1989

Multi-Packet-Routing on Mesh Connected Arrays.

SPAA, 1989

Packet Routing on Grids of Processors.

Proceedings of the Optimal Algorithms, International Symposium, Varna, Bulgaria, May 29, 1989

1988

The instruction systolic array and its relation to other models of parallel computers.

Parallel Computing, 1988

On a Special Case of Uniform Processor Scheduling.

J. Algorithms, 1988

Bounds for 1-selection and related problem on grids of processors.

Proceedings of the Parcella '88, 1988

Routing and Sorting on Mesh-Connected Arrays.

Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988

1987

On the Worst-Case Ratio of a Compound Multiprocessor Scheduling Algorithm.

Inf. Process. Lett., 1987

Lower Bounds for Sorting on Mesh-Connected Architectures.

Acta Inf., 1987

Optimal Sorting on Multi-Dimensionally Mesh-Connected Computers.

Proceedings of the STACS 87, 1987

1986

A General Approach to Sorting on 3-Dimensionally Mesh-Connected Arrays.

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

Lower Bounds for Sorting on Mesh-Connected Architectures.

Proceedings of the VLSI Algorithms and Architectures, 1986

1985

First fit decreasing scheduling on uniform multiprocessors.

Discrete Applied Mathematics, 1985

1983

A multifit algorithm for uniform multiprocessor scheduling.

Proceedings of the Theoretical Computer Science, 1983

1981

Nonpreemptive LP-Scheduling on Homogeneous Multiprocessor Systems.

SIAM J. Comput., 1981

1980

Deterministische Ablaufplanung in homogenen Mehrprozessorsystemen.

PhD thesis, 1980