default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWolfgang Dittrich
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 1998
[b1]Wolfgang Dittrich:
Communication and I/O efficient parallel data structures. University of Paderborn, Germany, 1998, ISBN 978-3-931466-26-8, pp. 1-191
Journal Articles
- 2003
- [j5]Frank K. H. A. Dehne, Wolfgang Dittrich, David A. Hutchinson:
Efficient External Memory Algorithms by Simulating Coarse-Grained Parallel Algorithms. Algorithmica 36(2): 97-122 (2003) - 2002
- [j4]Frank K. H. A. Dehne, Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari:
Bulk Synchronous Parallel Algorithms for the External Memory Model. Theory Comput. Syst. 35(6): 567-597 (2002) - 2001
- [j3]Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari:
Blocking in Parallel Multisearch Problems. Theory Comput. Syst. 34(2): 145-189 (2001) - 1999
- [j2]Armin Bäumker, Wolfgang Dittrich, Andrea Pietracaprina:
The Complexity of Parallel Multisearch on Coarse-Grained Machines. Algorithmica 24(3-4): 209-242 (1999) - 1998
- [j1]Armin Bäumker, Wolfgang Dittrich, Friedhelm Meyer auf der Heide:
Truly Efficient Parallel Algorithms: 1-optimal Multisearch for an Extension of the BSP Model. Theor. Comput. Sci. 203(2): 175-203 (1998)
Conference and Workshop Papers
- 1999
- [c10]Frank K. H. A. Dehne, David A. Hutchinson, Anil Maheshwari, Wolfgang Dittrich:
Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms. IPPS/SPDP 1999: 14-20 - [c9]Frank K. H. A. Dehne, Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari:
Parallel Virtual Memory. SODA 1999: 889-890 - 1998
- [c8]Micah Adler, Wolfgang Dittrich, Ben H. H. Juurlink, Miroslaw Kutylowski, Ingo Rieping:
Communication-Optimal Parallel Minimum Spanning Tree Algorithms (Extended Abstract). SPAA 1998: 27-36 - [c7]Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari:
Blocking in Parallel Multisearch Problems (Extended Abstract). SPAA 1998: 98-107 - 1997
- [c6]Frank K. H. A. Dehne, Wolfgang Dittrich, David A. Hutchinson:
Efficient External Memory Algorithms by Simulating Coarse-Grained Parallel Algorithms. SPAA 1997: 106-115 - 1996
- [c5]Armin Bäumker, Wolfgang Dittrich, Friedhelm Meyer auf der Heide, Ingo Rieping:
Realistic Parallel Algorithms: Priority Queue Operations and Selection for the BSP Model. Euro-Par, Vol. II 1996: 369-376 - [c4]Armin Bäumker, Wolfgang Dittrich:
Parallel Algorithms for Image Processing: Practical Algorithms with Experiments. IPPS 1996: 429-433 - [c3]Armin Bäumker, Wolfgang Dittrich:
Fully Dynamic Search Trees for an Extension of the BSP Model. SPAA 1996: 233-242 - [c2]Armin Bäumker, Wolfgang Dittrich, Andrea Pietracaprina:
The Deterministic Complexity of Parallel Multisearch (Extended Abstract). SWAT 1996: 404-415 - 1995
- [c1]Armin Bäumker, Wolfgang Dittrich, Friedhelm Meyer auf der Heide:
Truly Efficient Parallel Algorithms: c-Optimal Multisearch for an Extension of the BSP Model (Extended Abstract). ESA 1995: 17-30
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 2025-01-09 12:53 CET 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:
