Armin Bäumker

According to our database, Armin Bäumker authored at least 10 papers between 1995 and 2010.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2010

Stammdatenverwaltung als Basis für eine Serviceorienterte IT-Architektur: ein subjektiver Projektbericht.

Armin Bäumker, Jürgen Krüll, Carsten Kunert

Proceedings of the Software Engineering 2010, 2010

1999

The Complexity of Parallel Multisearch on Coarse-Grained Machines.

Armin Bäumker, Wolfgang Dittrich, Andrea Pietracaprina

Algorithmica, 1999

1998

Truly Efficient Parallel Algorithms: 1-optimal Multisearch for an Extension of the BSP Model.

Armin Bäumker, Wolfgang Dittrich, Friedhelm Meyer auf der Heide

Theor. Comput. Sci., 1998

1997

Communication efficient parallel searching.

Armin Bäumker

PhD thesis, 1997

Communication Efficient Parallel Searching.

Armin Bäumker, Friedhelm Meyer auf der Heide

Proceedings of the Solving Irregularly Structured Problems in Parallel, 1997

1996

The Deterministic Complexity of Parallel Multisearch (Extended Abstract).

Armin Bäumker, Wolfgang Dittrich, Andrea Pietracaprina

Proceedings of the Algorithm Theory, 1996

Fully Dynamic Search Trees for an Extension of the BSP Model.

Armin Bäumker, Wolfgang Dittrich

Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, 1996

Parallel Algorithms for Image Processing: Practical Algorithms with Experiments.

Armin Bäumker, Wolfgang Dittrich

Proceedings of IPPS '96, 1996

Realistic Parallel Algorithms: Priority Queue Operations and Selection for the BSP Model.

Armin Bäumker, Wolfgang Dittrich, Friedhelm Meyer auf der Heide, Ingo Rieping

Proceedings of the Euro-Par '96 Parallel Processing, 1996

1995

Truly Efficient Parallel Algorithms: c-Optimal Multisearch for an Extension of the BSP Model (Extended Abstract).

Armin Bäumker, Wolfgang Dittrich, Friedhelm Meyer auf der Heide

Proceedings of the Algorithms, 1995