Manfred Kunde - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 29 from 29

2007

A New Bound for Pure Greedy Hot Potato RoutingManfred Kunde. STACS 2007: 49-60 [doi]

2003

A case against using Stirling s formula (unless you really need it)Martin Dietzfelbinger, Manfred Kunde. eatcs, 80:153-158, 2003.

1999

Optimal Deterministic Sorting and Routing on Grids and Tori with DiagonalsManfred Kunde, Rolf Niedermeier, Klaus Reinhardt, Peter Rossmanith. algorithmica, 25(4):438-458, 1999. [doi]

1997

k-k Sorting on the Multi-MeshAlfons Avermiddig, Manfred Kunde, Andre Osterloh. fct 1997: 93-104

Efficient Sorting and Routing on Reconfigurable Meshes Using Restricted Bus LengthManfred Kunde, Kay Guertzig. ipps 1997: 713-720 [doi]

1995

Optimal Average Case Sorting on ArraysManfred Kunde, Rolf Niedermeier, Klaus Reinhardt, Peter Rossmanith. STACS 1995: 503-514

1994

Faster Sorting and Routing on Grids with DiagonalsManfred Kunde, Rolf Niedermeier, Peter Rossmanith. STACS 1994: 225-236

1993

Packet Routing on Grids of ProcessorsManfred Kunde. algorithmica, 9(1):32-46, 1993.

Block Gossiping on Grids and Tori: Deterministic Sorting and Routing Match the Bisection BoundManfred Kunde. esa 1993: 272-283

1992

Balanced Strategies for Routing on MeshesManfred Kunde, Thomas Tensi. dfg 1992: 289-308

1991

(k-k) Routing on Multidimensional Mesh-Connected ArraysManfred Kunde, Thomas Tensi. jpdc, 11(2):146-155, 1991.

Concentrated Regular Data Streams on Grids: Sorting and Routing Near to the Bisection BoundManfred Kunde. focs 1991: 141-150

Balanced Routing: Towards the Distance Bound on GridsManfred Kunde. spaa 1991: 260-271 [doi]

1990

Systolic algorithm for tensor products of matrices: implementation and applicationsE. V. Krishnamurthy, Manfred Kunde, Manfred Schimmler, Heiko Schröder. pc, 13(3):301-308, 1990.

1989

Multi-Packet-Routing on Mesh Connected ArraysManfred Kunde, Thomas Tensi. spaa 1989: 336-343 [doi]

Packet Routing on Grids of ProcessorsManfred Kunde. oa 1989: 254-265

1988

Routing and Sorting on Mesh-Connected ArraysManfred Kunde. awoc 1988: 423-433

Bounds for 1-selection and related problem on grids of processorsManfred Kunde. parcella 1989: 298-307

On a Special Case of Uniform Processor SchedulingManfred Kunde, Michael A. Langston, Jin-Ming Liu. jal, 9(2):287-296, 1988.

The instruction systolic array and its relation to other models of parallel computersManfred Kunde, Hans-Werner Lang, Manfred Schimmler, Hartmut Schmeck, Heiko Schröder. pc, 7(1):25-39, 1988. [doi]

1987

Lower Bounds for Sorting on Mesh-Connected ArchitecturesManfred Kunde. ACTA, 24(2):121-130, 1987.

Optimal Sorting on Multi-Dimensionally Mesh-Connected ComputersManfred Kunde. STACS 1987: 408-419

On the Worst-Case Ratio of a Compound Multiprocessor Scheduling AlgorithmManfred Kunde, Horst Steppat. ipl, 25(6):389-396, 1987.

1986

Lower Bounds for Sorting on Mesh-Connected ArchitecturesManfred Kunde. awoc 1986: 84-95

A General Approach to Sorting on 3-Dimensionally Mesh-Connected ArraysManfred Kunde. conpar 1986: 329-337

1985

First fit decreasing scheduling on uniform multiprocessorsManfred Kunde, Horst Steppat. DAM, 10(2):165-177, 1985. [doi]

1983

A multifit algorithm for uniform multiprocessor schedulingManfred Kunde. tcs 1982: 175-185

1981

Nonpreemptive LP-Scheduling on Homogeneous Multiprocessor SystemsManfred Kunde. SICOMP, 10(1):151-173, 1981.

1980

Deterministische Ablaufplanung in homogenen MehrprozessorsystemenManfred Kunde. PhD thesis, University of Kiel, Germany, 1980. [doi]

Sign in or sign up to see more results.

runs on WebDSL