default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRalf Diekmann
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2000
[j8]Ralf Diekmann, Robert Preis, Frank Schlimbach, Chris Walshaw
:
Shape-optimized mesh partitioning and load balancing for parallel adaptive FEM. Parallel Comput. 26(12): 1555-1581 (2000)- [j7]Burkhard Monien, Robert Preis, Ralf Diekmann:
Quality matching and local improvement for multilevel graph-partitioning. Parallel Comput. 26(12): 1609-1634 (2000)
1990 – 1999
- 1999
- [j6]Chris Walshaw, Mark Cross, Ralf Diekmann, Frank Schlimbach:
Multilevel Mesh Partitioning for Optimizing Domain Shape. Int. J. High Perform. Comput. Appl. 13(4): 334-353 (1999) - [j5]Ralf Diekmann, Andreas Frommer, Burkhard Monien:
Efficient schemes for nearest neighbor load balancing. Parallel Comput. 25(7): 789-812 (1999) - 1998
- [b1]Ralf Diekmann:
Load balancing strategies for data parallel applications. University of Paderborn, Germany, Logos-Verlag 1998, ISBN 978-3-89722-124-6, pp. 1-186 - [j4]Ralf Diekmann, Derk Meyer, Burkhard Monien:
Parallel Decomposition of Unstructured FEM-Meshes. Concurr. Pract. Exp. 10(1): 53-72 (1998) - [c20]Ralf Diekmann, Andreas Frommer, Burkhard Monien:
Nearest Neighbor Load Balancing on Graphs. ESA 1998: 429-440 - [c19]Ralf Diekmann, Robert Preis, Frank Schlimbach, Chris Walshaw:
Aspect Radio for Mesh Partitioning. Euro-Par 1998: 347-351 - [c18]Ralf Diekmann, Frank Schlimbach, Chris Walshaw:
Quality Balancing for Parallel Adaptive FEM. IRREGULAR 1998: 170-181 - [c17]Chris Walshaw, Mark Cross, Ralf Diekmann, Frank Schlimbach:
Multilevel Mesh Partitioning for Optimising Aspect Ratio. VECPAR 1998: 285-300 - 1997
- [j3]Cheng-Zhong Xu, Francis C. M. Lau, Ralf Diekmann:
Decentralized Remapping of Data Parallel Applications in Distributed Memory Multiprocessors. Concurr. Pract. Exp. 9(12): 1351-1376 (1997) - [j2]Burkhard Monien, Ralf Diekmann, Reinhard Lüling:
The Construction of Large Scale Reconfigurable Parallel Computing Systems (The Architecture of the SC320). Int. J. Found. Comput. Sci. 8(3): 347-361 (1997) - [c16]Ralf Diekmann, S. Muthukrishnan, Madhu V. Nayakkankuppam:
Engineering Diffusive Load Balancing Algorithms Using Experiments. IRREGULAR 1997: 111-122 - [c15]Thomas Decker, Ralf Diekmann:
Mapping of coarse-grained applications onto workstation clusters. PDP 1997: 5-12 - [c14]Burkhard Monien, Ralf Diekmann:
A Local Graph Partitioning Heuristic Meeting Bisection Bounds. PP 1997 - 1996
- [j1]Ralf Diekmann, Reinhard Lüling, Burkhard Monien, Carsten Spräner:
Combining Helpful Sets and Parallel Simulated Annealing for the Graph-partitioning Problem. Parallel Algorithms Appl. 8(1): 61-84 (1996) - [c13]Ralf Diekmann, Uwe Dralle, Friedhelm Neugebauer, Thomas Römke:
PadFEM: A Portable Parallel FEM-Tool. HPCN Europe 1996: 580-585 - [c12]Ralf Rehrmann, Burkhard Monien, Reinhard Lüling, Ralf Diekmann:
On the Communication Throughput of Buffered Multistage Interconnection Networks. SPAA 1996: 152-161 - 1995
- [c11]Peter Klingebiel, Ralf Diekmann, Ulrich Lefarth, Markus Fischer, Jürgen Seuss:
CAMeL/PVM: An Open, Distributed CAE Environment for Modelling and Simulation Mechatronic Systems. EUROSIM 1995: 645-650 - [c10]Ralf Diekmann, Reinhard Lüling, Burkhard Monien, Carsten Spräner:
A parallel local-search algorithm for the k-partitioning problem. HICSS (2) 1995: 41-50 - [c9]Ralf Diekmann, Derk Meyer, Burkhard Monien:
Parallel Decomposition of Unstructured FEM-Meshes. IRREGULAR 1995: 199-215 - [c8]Jürgen Schulze, Ralf Diekmann, Robert Preis:
Comparing Nested Dissection Orderings for Parallel Sparse Matrix Factorization. PDPTA 1995: 280-289 - [c7]Thomas Decker, Ralf Diekmann, Reinhard Lüling, Burkhard Monien:
Towards developing universal dynamic mapping algorithms. SPDP 1995: 456-459 - [p1]Burkhard Monien, Ralf Diekmann, Rainer Feldmann, Ralf Klasing, Reinhard Lüling, Knut Menzel, Thomas Römke, Ulf-Peter Schroeder:
Efficient Use of Parallel & Distributed Systems: From Theory to Practice. Computer Science Today 1995: 62-77 - 1994
- [c6]Ralf Diekmann, Burkhard Monien, Robert Preis:
Using helpful sets to improve graph bisections. Interconnection Networks and Mapping and Scheduling Parallel Computations 1994: 57-73 - [c5]Burkhard Monien, Ralf Diekmann, Reinhard Lüling:
Communication Throughput of Interconnection Networks. MFCS 1994: 72-86 - [c4]Ralf Diekmann, Knut Menzel, Frank Stangenberg:
Distributed Environments & Distributed Program Design. PDP 1994: 32-39 - [c3]Ralf Diekmann, Jörn Gehring, Reinhard Lüling, Burkhard Monien, Markus Nubel, Rolf Wanka:
Sorting large data sets on a massively parallel system. SPDP 1994: 2-9 - 1992
- [c2]Ralf Diekmann, Reinhard Lüling, Jens Simon:
A General Purpose Distributed Implementation of Simulated Annealing. SPDP 1992: 94-101 - 1991
- [c1]Ralf Diekmann, Reinhard Lüling, Burkhard Monien, Jens Simon:
Implementierung von Simulated Annealing auf Transputer-Systemen. Transputer-Anwender-Treffen 1991: 361-368
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-07-04 21:28 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:
