| 2007 |
|---|
| 27 | EE | Manfred Kunde:
A New Bound for Pure Greedy Hot Potato Routing.
STACS 2007: 49-60 |
| 2003 |
|---|
| 26 | | Martin Dietzfelbinger,
Manfred Kunde:
A case against using Stirling's formula (unless you really need it).
Bulletin of the EATCS 80: 153-158 (2003) |
| 1999 |
|---|
| 25 | EE | Manfred Kunde,
Rolf Niedermeier,
Klaus Reinhardt,
Peter Rossmanith:
Optimal Deterministic Sorting and Routing on Grids and Tori with Diagonals.
Algorithmica 25(4): 438-458 (1999) |
| 1997 |
|---|
| 24 | | Alfons Avermiddig,
Manfred Kunde,
Andre Osterloh:
k-k Sorting on the Multi-Mesh.
FCT 1997: 93-104 |
| 23 | EE | Manfred Kunde,
Kay Guertzig:
Efficient Sorting and Routing on Reconfigurable Meshes Using Restricted Bus Length.
IPPS 1997: 713-720 |
| 1995 |
|---|
| 22 | | Manfred Kunde,
Rolf Niedermeier,
Klaus Reinhardt,
Peter Rossmanith:
Optimal Average Case Sorting on Arrays.
STACS 1995: 503-514 |
| 1994 |
|---|
| 21 | | Manfred Kunde,
Rolf Niedermeier,
Peter Rossmanith:
Faster Sorting and Routing on Grids with Diagonals.
STACS 1994: 225-236 |
| 1993 |
|---|
| 20 | | Manfred Kunde:
Block Gossiping on Grids and Tori: Deterministic Sorting and Routing Match the Bisection Bound.
ESA 1993: 272-283 |
| 19 | | Manfred Kunde:
Packet Routing on Grids of Processors.
Algorithmica 9(1): 32-46 (1993) |
| 1992 |
|---|
| 18 | | Manfred Kunde,
Thomas Tensi:
Balanced Strategies for Routing on Meshes.
Data Structures and Efficient Algorithms 1992: 289-308 |
| 1991 |
|---|
| 17 | | Manfred Kunde:
Concentrated Regular Data Streams on Grids: Sorting and Routing Near to the Bisection Bound
FOCS 1991: 141-150 |
| 16 | EE | Manfred Kunde:
Balanced Routing: Towards the Distance Bound on Grids.
SPAA 1991: 260-271 |
| 15 | | Manfred Kunde,
Thomas Tensi:
(k-k) Routing on Multidimensional Mesh-Connected Arrays.
J. Parallel Distrib. Comput. 11(2): 146-155 (1991) |
| 1990 |
|---|
| 14 | | E. V. Krishnamurthy,
Manfred Kunde,
Manfred Schimmler,
Heiko Schröder:
Systolic algorithm for tensor products of matrices: implementation and applications.
Parallel Computing 13(3): 301-308 (1990) |
| 1989 |
|---|
| 13 | | Manfred Kunde:
Packet Routing on Grids of Processors.
Optimal Algorithms 1989: 254-265 |
| 12 | EE | Manfred Kunde,
Thomas Tensi:
Multi-Packet-Routing on Mesh Connected Arrays.
SPAA 1989: 336-343 |
| 1988 |
|---|
| 11 | | Manfred Kunde:
Routing and Sorting on Mesh-Connected Arrays.
AWOC 1988: 423-433 |
| 10 | | Manfred Kunde:
Bounds for 1-selection and related problem on grids of processors.
Parcella 1988: 298-307 |
| 9 | | Manfred Kunde,
Michael A. Langston,
Jin-Ming Liu:
On a Special Case of Uniform Processor Scheduling.
J. Algorithms 9(2): 287-296 (1988) |
| 8 | EE | 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 Computing 7(1): 25-39 (1988) |
| 1987 |
|---|
| 7 | | Manfred Kunde:
Optimal Sorting on Multi-Dimensionally Mesh-Connected Computers.
STACS 1987: 408-419 |
| 6 | | Manfred Kunde:
Lower Bounds for Sorting on Mesh-Connected Architectures.
Acta Inf. 24(2): 121-130 (1987) |
| 5 | | Manfred Kunde,
Horst Steppat:
On the Worst-Case Ratio of a Compound Multiprocessor Scheduling Algorithm.
Inf. Process. Lett. 25(6): 389-396 (1987) |
| 1986 |
|---|
| 4 | | Manfred Kunde:
Lower Bounds for Sorting on Mesh-Connected Architectures.
Aegean Workshop on Computing 1986: 84-95 |
| 3 | | Manfred Kunde:
A General Approach to Sorting on 3-Dimensionally Mesh-Connected Arrays.
CONPAR 1986: 329-337 |
| 1983 |
|---|
| 2 | | Manfred Kunde:
A multifit algorithm for uniform multiprocessor scheduling.
Theoretical Computer Science 1983: 175-185 |
| 1981 |
|---|
| 1 | | Manfred Kunde:
Nonpreemptive LP-Scheduling on Homogeneous Multiprocessor Systems.
SIAM J. Comput. 10(1): 151-173 (1981) |
