Manfred Kunde

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