The SCEAS System
| |||||||

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

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |