1999 |
8 | EE | Armin Bäumker,
Wolfgang Dittrich,
Andrea Pietracaprina:
The Complexity of Parallel Multisearch on Coarse-Grained Machines.
Algorithmica 24(3-4): 209-242 (1999) |
1998 |
7 | EE | 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) |
1997 |
6 | | Armin Bäumker,
Friedhelm Meyer auf der Heide:
Communication Efficient Parallel Searching.
IRREGULAR 1997: 233-254 |
1996 |
5 | | 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 |
4 | EE | Armin Bäumker,
Wolfgang Dittrich:
Parallel Algorithms for Image Processing: Practical Algorithms with Experiments.
IPPS 1996: 429-433 |
3 | | Armin Bäumker,
Wolfgang Dittrich:
Fully Dynamic Search Trees for an Extension of the BSP Model.
SPAA 1996: 233-242 |
2 | | Armin Bäumker,
Wolfgang Dittrich,
Andrea Pietracaprina:
The Deterministic Complexity of Parallel Multisearch (Extended Abstract).
SWAT 1996: 404-415 |
1995 |
1 | | 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 |