Manfred Kunde

According to our database, Manfred Kunde authored at least 27 papers between 1980 and 2007.

Collaborative distances:

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

2007

A New Bound for Pure Greedy Hot Potato Routing.

Manfred Kunde

Proceedings of the STACS 2007, 2007

2003

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

Martin Dietzfelbinger, Manfred Kunde

Bull. EATCS, 2003

1999

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

Manfred Kunde, Rolf Niedermeier, Klaus Reinhardt, Peter Rossmanith

Algorithmica, 1999

1997

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

Manfred Kunde, Kay Guertzig

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

k-k Sorting on the Multi-Mesh.

Alfons Avermiddig, Manfred Kunde, Andre Osterloh

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

1995

Optimal Average Case Sorting on Arrays.

Manfred Kunde, Rolf Niedermeier, Klaus Reinhardt, Peter Rossmanith

Proceedings of the STACS 95, 1995

1993

Faster sorting and routing on grids with diagonals

Manfred Kunde, Rolf Niedermeier, Peter Rossmanith

Forschungsberichte, TU Munich, 1993

Packet Routing on Grids of Processors.

Manfred Kunde

Algorithmica, 1993

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

Manfred Kunde

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

1992

Balanced Strategies for Routing on Meshes.

Manfred Kunde, Thomas Tensi

Proceedings of the Data Structures and Efficient Algorithms, 1992

1991

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

Manfred Kunde, Thomas Tensi

J. Parallel Distributed Comput., 1991

Balanced Routing: Towards the Distance Bound on Grids.

Manfred Kunde

Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, 1991

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

Manfred Kunde

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

1990

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

E. V. Krishnamurthy, Manfred Kunde, Manfred Schimmler, Heiko Schröder

Parallel Comput., 1990

1989

Multi-Packet-Routing on Mesh Connected Arrays.

Manfred Kunde, Thomas Tensi

Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, 1989

1988

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

Manfred Kunde, Hans-Werner Lang, Manfred Schimmler, Hartmut Schmeck, Heiko Schröder

Parallel Comput., 1988

On a Special Case of Uniform Processor Scheduling.

Manfred Kunde, Michael A. Langston, Jin-Ming Liu

J. Algorithms, 1988

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

Manfred Kunde

Proceedings of the Parcella '88, 1988

Routing and Sorting on Mesh-Connected Arrays.

Manfred Kunde

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.

Manfred Kunde, Horst Steppat

Inf. Process. Lett., 1987

Lower Bounds for Sorting on Mesh-Connected Architectures.

Manfred Kunde

Acta Informatica, 1987

Optimal Sorting on Multi-Dimensionally Mesh-Connected Computers.

Manfred Kunde

Proceedings of the STACS 87, 1987

1986

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

Manfred Kunde

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

1985

First fit decreasing scheduling on uniform multiprocessors.

Manfred Kunde, Horst Steppat

Discret. Appl. Math., 1985

1983

A multifit algorithm for uniform multiprocessor scheduling.

Manfred Kunde

Proceedings of the Theoretical Computer Science, 1983

1981

Nonpreemptive LP-Scheduling on Homogeneous Multiprocessor Systems.

Manfred Kunde

SIAM J. Comput., 1981

1980

Deterministische Ablaufplanung in homogenen Mehrprozessorsystemen.

Manfred Kunde

PhD thesis, 1980