default search action
Manfred Kunde
Person information
- affiliation: Technische Universität Ilmenau, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2007
- [c17]Manfred Kunde:
A New Bound for Pure Greedy Hot Potato Routing. STACS 2007: 49-60 - 2003
- [j11]Martin Dietzfelbinger, Manfred Kunde:
A case against using Stirling's formula (unless you really need it). Bull. EATCS 80: 153-158 (2003)
1990 – 1999
- 1999
- [j10]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
- [c16]Alfons Avermiddig, Manfred Kunde, Andre Osterloh:
k-k Sorting on the Multi-Mesh. FCT 1997: 93-104 - [c15]Manfred Kunde, Kay Guertzig:
Efficient Sorting and Routing on Reconfigurable Meshes Using Restricted Bus Length. IPPS 1997: 713-720 - 1995
- [c14]Manfred Kunde, Rolf Niedermeier, Klaus Reinhardt, Peter Rossmanith:
Optimal Average Case Sorting on Arrays. STACS 1995: 503-514 - 1994
- [c13]Manfred Kunde, Rolf Niedermeier, Peter Rossmanith:
Faster Sorting and Routing on Grids with Diagonals. STACS 1994: 225-236 - 1993
- [j9]Manfred Kunde:
Packet Routing on Grids of Processors. Algorithmica 9(1): 32-46 (1993) - [c12]Manfred Kunde:
Block Gossiping on Grids and Tori: Deterministic Sorting and Routing Match the Bisection Bound. ESA 1993: 272-283 - [i1]Manfred Kunde, Rolf Niedermeier, Peter Rossmanith:
Faster sorting and routing on grids with diagonals. Forschungsberichte, TU Munich TUM I 9313: 1-31 (1993) - 1992
- [c11]Manfred Kunde, Thomas Tensi:
Balanced Strategies for Routing on Meshes. Data Structures and Efficient Algorithms 1992: 289-308 - 1991
- [j8]Manfred Kunde, Thomas Tensi:
(k-k) Routing on Multidimensional Mesh-Connected Arrays. J. Parallel Distributed Comput. 11(2): 146-155 (1991) - [c10]Manfred Kunde:
Concentrated Regular Data Streams on Grids: Sorting and Routing Near to the Bisection Bound. FOCS 1991: 141-150 - [c9]Manfred Kunde:
Balanced Routing: Towards the Distance Bound on Grids. SPAA 1991: 260-271 - 1990
- [j7]E. V. Krishnamurthy, Manfred Kunde, Manfred Schimmler, Heiko Schröder:
Systolic algorithm for tensor products of matrices: implementation and applications. Parallel Comput. 13(3): 301-308 (1990)
1980 – 1989
- 1989
- [c8]Manfred Kunde:
Packet Routing on Grids of Processors. Optimal Algorithms 1989: 254-265 - [c7]Manfred Kunde, Thomas Tensi:
Multi-Packet-Routing on Mesh Connected Arrays. SPAA 1989: 336-343 - 1988
- [j6]Manfred Kunde, Michael A. Langston, Jin-Ming Liu:
On a Special Case of Uniform Processor Scheduling. J. Algorithms 9(2): 287-296 (1988) - [j5]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 Comput. 7(1): 25-39 (1988) - [c6]Manfred Kunde:
Routing and Sorting on Mesh-Connected Arrays. AWOC 1988: 423-433 - [c5]Manfred Kunde:
Bounds for 1-selection and related problem on grids of processors. Parcella 1988: 298-307 - 1987
- [j4]Manfred Kunde:
Lower Bounds for Sorting on Mesh-Connected Architectures. Acta Informatica 24(2): 121-130 (1987) - [j3]Manfred Kunde, Horst Steppat:
On the Worst-Case Ratio of a Compound Multiprocessor Scheduling Algorithm. Inf. Process. Lett. 25(6): 389-396 (1987) - [c4]Manfred Kunde:
Optimal Sorting on Multi-Dimensionally Mesh-Connected Computers. STACS 1987: 408-419 - 1986
- [c3]Manfred Kunde:
Lower Bounds for Sorting on Mesh-Connected Architectures. Aegean Workshop on Computing 1986: 84-95 - [c2]Manfred Kunde:
A General Approach to Sorting on 3-Dimensionally Mesh-Connected Arrays. CONPAR 1986: 329-337 - 1985
- [j2]Manfred Kunde, Horst Steppat:
First fit decreasing scheduling on uniform multiprocessors. Discret. Appl. Math. 10(2): 165-177 (1985) - 1983
- [c1]Manfred Kunde:
A multifit algorithm for uniform multiprocessor scheduling. Theoretical Computer Science 1983: 175-185 - 1981
- [j1]Manfred Kunde:
Nonpreemptive LP-Scheduling on Homogeneous Multiprocessor Systems. SIAM J. Comput. 10(1): 151-173 (1981) - 1980
- [b1]Manfred Kunde:
Deterministische Ablaufplanung in homogenen Mehrprozessorsystemen. University of Kiel, Germany, 1980, pp. 1-77
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: