Wolfgang Dittrich

	2003
15		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
14		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
13		Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari: Blocking in Parallel Multisearch Problems. Theory Comput. Syst. 34(2): 145-189 (2001)
	1999
12		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
11		Frank K. H. A. Dehne, Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari: Parallel Virtual Memory. SODA 1999: 889-890
10		Armin Bäumker, Wolfgang Dittrich, Andrea Pietracaprina: The Complexity of Parallel Multisearch on Coarse-Grained Machines. Algorithmica 24(3-4): 209-242 (1999)
	1998
9		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
8		Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari: Blocking in Parallel Multisearch Problems (Extended Abstract). SPAA 1998: 98-107
7		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		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
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		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

Coauthor Index

1	Micah Adler	[9]
2	Armin Bäumker	[1] [2] [3] [4] [5] [7] [10]
3	Frank K. H. A. Dehne	[6] [11] [12] [14] [15]
4	Friedhelm Meyer auf der Heide	[1] [5] [7]
5	David A. Hutchinson	[6] [8] [11] [12] [13] [14] [15]
6	Ben H. H. Juurlink	[9]
7	Miroslaw Kutylowski	[9]
8	Anil Maheshwari	[8] [11] [12] [13] [14]
9	Andrea Pietracaprina	[2] [10]
10	Ingo Rieping	[5] [9]