Search the dblp DataBase
Wolfgang Dittrich: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Frank K. H. A. Dehne, Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari
Parallel Virtual Memory. [Citation Graph (1, 0)][DBLP]
SODA, 1999, pp:889-890 [Conf] - Frank K. H. A. Dehne, Wolfgang Dittrich, David A. Hutchinson
Efficient External Memory Algorithms by Simulating Coarse-Grained Parallel Algorithms. [Citation Graph (1, 0)][DBLP]
SPAA, 1997, pp:106-115 [Conf] - 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). [Citation Graph (0, 0)][DBLP]
ESA, 1995, pp:17-30 [Conf] - Armin Bäumker, Wolfgang Dittrich, Friedhelm Meyer auf der Heide, Ingo Rieping
Realistic Parallel Algorithms: Priority Queue Operations and Selection for the BSP Model. [Citation Graph (0, 0)][DBLP]
Euro-Par, Vol. II, 1996, pp:369-376 [Conf] - Armin Bäumker, Wolfgang Dittrich
Parallel Algorithms for Image Processing: Practical Algorithms with Experiments. [Citation Graph (0, 0)][DBLP]
IPPS, 1996, pp:429-433 [Conf] - Frank K. H. A. Dehne, David A. Hutchinson, Anil Maheshwari, Wolfgang Dittrich
Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms. [Citation Graph (0, 0)][DBLP]
IPPS/SPDP, 1999, pp:14-20 [Conf] - Micah Adler, Wolfgang Dittrich, Ben H. H. Juurlink, Miroslaw Kutylowski, Ingo Rieping
Communication-Optimal Parallel Minimum Spanning Tree Algorithms (Extended Abstract). [Citation Graph (0, 0)][DBLP]
SPAA, 1998, pp:27-36 [Conf] - Armin Bäumker, Wolfgang Dittrich
Fully Dynamic Search Trees for an Extension of the BSP Model. [Citation Graph (0, 0)][DBLP]
SPAA, 1996, pp:233-242 [Conf] - Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari
Blocking in Parallel Multisearch Problems (Extended Abstract). [Citation Graph (0, 0)][DBLP]
SPAA, 1998, pp:98-107 [Conf] - Armin Bäumker, Wolfgang Dittrich, Andrea Pietracaprina
The Deterministic Complexity of Parallel Multisearch (Extended Abstract). [Citation Graph (0, 0)][DBLP]
SWAT, 1996, pp:404-415 [Conf] - Armin Bäumker, Wolfgang Dittrich, Andrea Pietracaprina
The Complexity of Parallel Multisearch on Coarse-Grained Machines. [Citation Graph (0, 0)][DBLP]
Algorithmica, 1999, v:24, n:3-4, pp:209-242 [Journal] - Frank K. H. A. Dehne, Wolfgang Dittrich, David A. Hutchinson
Efficient External Memory Algorithms by Simulating Coarse-Grained Parallel Algorithms. [Citation Graph (0, 0)][DBLP]
Algorithmica, 2003, v:36, n:2, pp:97-122 [Journal] - Frank K. H. A. Dehne, Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari
Bulk Synchronous Parallel Algorithms for the External Memory Model. [Citation Graph (0, 0)][DBLP]
Theory Comput. Syst., 2002, v:35, n:6, pp:567-597 [Journal] - Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari
Blocking in Parallel Multisearch Problems. [Citation Graph (0, 0)][DBLP]
Theory Comput. Syst., 2001, v:34, n:2, pp:145-189 [Journal] - Armin Bäumker, Wolfgang Dittrich, Friedhelm Meyer auf der Heide
Truly Efficient Parallel Algorithms: 1-optimal Multisearch for an Extension of the BSP Model. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1998, v:203, n:2, pp:175-203 [Journal]
Search in 0.004secs, Finished in 0.004secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002