Deterministische Ablaufplanung in homogenen Mehrprozessorsystemen. - Manfred Kunde (1980)

Nonpreemptive LP-Scheduling on Homogeneous Multiprocessor Systems. - Manfred Kunde (SIAM J. Comput., 1981)

A multifit algorithm for uniform multiprocessor scheduling. - Manfred Kunde (Theoretical Computer Science, 1983)

First fit decreasing scheduling on uniform multiprocessors. - Manfred Kunde; Horst Steppat (Discret. Appl. Math., 1985)

A General Approach to Sorting on 3-Dimensionally Mesh-Connected Arrays. - Manfred Kunde (CONPAR, 1986)

Optimal Sorting on Multi-Dimensionally Mesh-Connected Computers. - Manfred Kunde (STACS, 1987)

Lower Bounds for Sorting on Mesh-Connected Architectures. - Manfred Kunde (Acta Informatica, 1987)

On the Worst-Case Ratio of a Compound Multiprocessor Scheduling Algorithm. - Manfred Kunde; Horst Steppat (Inf. Process. Lett., 1987)

Routing and Sorting on Mesh-Connected Arrays. - Manfred Kunde (AWOC, 1988)

Bounds for 1-selection and related problem on grids of processors. - Manfred Kunde (Parcella, 1988)

On a Special Case of Uniform Processor Scheduling. - Manfred Kunde; Michael A. Langston; Jin-Ming Liu (J. Algorithms, 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 001 (Parallel Comput., 1988)

Multi-Packet-Routing on Mesh Connected Arrays. - Manfred Kunde; Thomas Tensi (SPAA, 1989)

Systolic algorithm for tensor products of matrices: implementation and applications. - E. V. Krishnamurthy; Manfred Kunde; Manfred Schimmler; Heiko Schröder 001 (Parallel Comput., 1990)

Concentrated Regular Data Streams on Grids: Sorting and Routing Near to the Bisection Bound - Manfred Kunde (FOCS, 1991)

Balanced Routing: Towards the Distance Bound on Grids. - Manfred Kunde (SPAA, 1991)

(k-k) Routing on Multidimensional Mesh-Connected Arrays. - Manfred Kunde; Thomas Tensi (J. Parallel Distributed Comput., 1991)

Balanced Strategies for Routing on Meshes. - Manfred Kunde; Thomas Tensi (Data Structures and Efficient Algorithms, 1992)

Block Gossiping on Grids and Tori: Deterministic Sorting and Routing Match the Bisection Bound. - Manfred Kunde (ESA, 1993)

Packet Routing on Grids of Processors. - Manfred Kunde (Algorithmica, 1993)

Faster sorting and routing on grids with diagonals - Manfred Kunde; Rolf Niedermeier; Peter Rossmanith (Forschungsberichte, TU Munich, 1993)

Optimal Average Case Sorting on Arrays. - Manfred Kunde; Rolf Niedermeier; Klaus Reinhardt; Peter Rossmanith (STACS, 1995)

k-k Sorting on the Multi-Mesh. - Alfons Avermiddig; Manfred Kunde; Andre Osterloh (FCT, 1997)

Efficient Sorting and Routing on Reconfigurable Meshes Using Restricted Bus Length. - Manfred Kunde; Kay Guertzig (IPPS, 1997)

Optimal Deterministic Sorting and Routing on Grids and Tori with Diagonals. - Manfred Kunde; Rolf Niedermeier; Klaus Reinhardt; Peter Rossmanith (Algorithmica, 1999)

A case against using Stirling's formula (unless you really need it). - Martin Dietzfelbinger; Manfred Kunde (Bull. EATCS, 2003)

A New Bound for Pure Greedy Hot Potato Routing. - Manfred Kunde (STACS, 2007)