Manfred Kunde

Publication Activity (10 Years)

Years Active: 1981-2007
Publications (10 Years): 0

University of Kiel, Germany (PHD)

Education History

University of Kiel, Germany

PHD

Publications

Manfred Kunde
A New Bound for Pure Greedy Hot Potato Routing. STACS (2007)
Martin Dietzfelbinger, Manfred Kunde
A case against using Stirling's formula (unless you really need it). Bull. EATCS 80 (2003)
Manfred Kunde, Rolf Niedermeier, Klaus Reinhardt, Peter Rossmanith
Optimal Deterministic Sorting and Routing on Grids and Tori with Diagonals. Algorithmica 25 (4) (1999)
Manfred Kunde, Kay Guertzig
Efficient Sorting and Routing on Reconfigurable Meshes Using Restricted Bus Length. IPPS (1997)
Alfons Avermiddig, Manfred Kunde, Andre Osterloh
k-k Sorting on the Multi-Mesh. FCT (1997)
Manfred Kunde, Rolf Niedermeier, Klaus Reinhardt, Peter Rossmanith
Optimal Average Case Sorting on Arrays. STACS (1995)
Manfred Kunde, Rolf Niedermeier, Peter Rossmanith
Faster Sorting and Routing on Grids with Diagonals. STACS (1994)
Manfred Kunde, Rolf Niedermeier, Peter Rossmanith
Faster sorting and routing on grids with diagonals Forschungsberichte, TU Munich (1993)
Manfred Kunde
Block Gossiping on Grids and Tori: Deterministic Sorting and Routing Match the Bisection Bound. ESA (1993)
Manfred Kunde
Packet Routing on Grids of Processors. Algorithmica 9 (1) (1993)
Manfred Kunde, Thomas Tensi
Balanced Strategies for Routing on Meshes. Data Structures and Efficient Algorithms (1992)
Manfred Kunde, Thomas Tensi
(k-k) Routing on Multidimensional Mesh-Connected Arrays. J. Parallel Distributed Comput. 11 (2) (1991)
Manfred Kunde
Concentrated Regular Data Streams on Grids: Sorting and Routing Near to the Bisection Bound FOCS (1991)
Manfred Kunde
Balanced Routing: Towards the Distance Bound on Grids. SPAA (1991)
E. V. Krishnamurthy, Manfred Kunde, Manfred Schimmler, Heiko Schröder
Systolic algorithm for tensor products of matrices: implementation and applications. Parallel Comput. 13 (3) (1990)
Manfred Kunde, Thomas Tensi
Multi-Packet-Routing on Mesh Connected Arrays. SPAA (1989)
Manfred Kunde
Packet Routing on Grids of Processors. Optimal Algorithms (1989)
Manfred Kunde, Michael A. Langston, Jin-Ming Liu
On a Special Case of Uniform Processor Scheduling. J. Algorithms 9 (2) (1988)
Manfred Kunde, Hans-Werner Lang, Manfred Schimmler, Hartmut Schmeck, Heiko Schröder
The instruction systolic array and its relation to other models of parallel computers. Parallel Comput. 7 (1) (1988)
Manfred Kunde
Bounds for 1-selection and related problem on grids of processors. Parcella (1988)
Manfred Kunde
Routing and Sorting on Mesh-Connected Arrays. AWOC (1988)
Manfred Kunde, Horst Steppat
On the Worst-Case Ratio of a Compound Multiprocessor Scheduling Algorithm. Inf. Process. Lett. 25 (6) (1987)
Manfred Kunde
Lower Bounds for Sorting on Mesh-Connected Architectures. Acta Informatica 24 (2) (1987)
Manfred Kunde
Optimal Sorting on Multi-Dimensionally Mesh-Connected Computers. STACS (1987)
Manfred Kunde
A General Approach to Sorting on 3-Dimensionally Mesh-Connected Arrays. CONPAR (1986)
Manfred Kunde
Lower Bounds for Sorting on Mesh-Connected Architectures. Aegean Workshop on Computing (1986)
Manfred Kunde, Horst Steppat
First fit decreasing scheduling on uniform multiprocessors. Discret. Appl. Math. 10 (2) (1985)
Manfred Kunde
A multifit algorithm for uniform multiprocessor scheduling. Theoretical Computer Science (1983)
Manfred Kunde
Nonpreemptive LP-Scheduling on Homogeneous Multiprocessor Systems. SIAM J. Comput. 10 (1) (1981)

Manfred Kunde.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Manfred Kunde