The SCEAS System
Navigation Menu

Search the dblp DataBase


Manfred Kunde: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Manfred Kunde
    Lower Bounds for Sorting on Mesh-Connected Architectures. [Citation Graph (0, 0)][DBLP]
    Aegean Workshop on Computing, 1986, pp:84-95 [Conf]
  2. Manfred Kunde
    Routing and Sorting on Mesh-Connected Arrays. [Citation Graph (0, 0)][DBLP]
    AWOC, 1988, pp:423-433 [Conf]
  3. Manfred Kunde
    A General Approach to Sorting on 3-Dimensionally Mesh-Connected Arrays. [Citation Graph (0, 0)][DBLP]
    CONPAR, 1986, pp:329-337 [Conf]
  4. 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]
  5. 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]
  6. Alfons Avermiddig, Manfred Kunde, Andre Osterloh
    k-k Sorting on the Multi-Mesh. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:93-104 [Conf]
  7. 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]
  8. 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]
  9. Manfred Kunde
    Packet Routing on Grids of Processors. [Citation Graph (0, 0)][DBLP]
    Optimal Algorithms, 1989, pp:254-265 [Conf]
  10. Manfred Kunde
    Bounds for 1-selection and related problem on grids of processors. [Citation Graph (0, 0)][DBLP]
    Parcella, 1988, pp:298-307 [Conf]
  11. Manfred Kunde
    Balanced Routing: Towards the Distance Bound on Grids. [Citation Graph (0, 0)][DBLP]
    SPAA, 1991, pp:260-271 [Conf]
  12. Manfred Kunde, Thomas Tensi
    Multi-Packet-Routing on Mesh Connected Arrays. [Citation Graph (0, 0)][DBLP]
    SPAA, 1989, pp:336-343 [Conf]
  13. Manfred Kunde
    Optimal Sorting on Multi-Dimensionally Mesh-Connected Computers. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:408-419 [Conf]
  14. 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]
  15. 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]
  16. Manfred Kunde
    A New Bound for Pure Greedy Hot Potato Routing. [Citation Graph (0, 0)][DBLP]
    STACS, 2007, pp:49-60 [Conf]
  17. Manfred Kunde
    A multifit algorithm for uniform multiprocessor scheduling. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1983, pp:175-185 [Conf]
  18. 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]
  19. Manfred Kunde
    Packet Routing on Grids of Processors. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1993, v:9, n:1, pp:32-46 [Journal]
  20. 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]
  21. 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]
  22. 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]
  23. 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]
  24. 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]
  25. 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]
  26. 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]
  27. 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 may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002