Hans Rohnert

Details der Publikationsliste

Zeitraum

1988 - 2007

Anzahl

9

Co-Autoren

z Max-Planck-Institut (2007)

Lower Bounds, Martin Dietzfelbinger, Anna Karlin, Kurt Mehlhorn, Fur Informatik, ...

The dynamic dictionary problem is considered: provide an algorithm for storing a dynamic set, allowing the operations insert, delete, and lookup. A dynamic perfect hashing strategy is given: a...

On-line Graph Algorithms for Incremental Compilation (2007)

Hans Rohnert, Umberto Nanni T

(preliminary version) Compilers usually construct various data structures which often vary only slightly fi'om compilation run to compilation run. This paper gives various solutions to the...

Proactor - An Architectural Pattern for Demultiplexing and Dispatching Handlers for Asynchronous Events (1999)

Irfan Pyarali, Tim Harrison, Douglas C. Schmidt, Thomas D. Jordan, Neil Harrison, Hans Rohnert

Modern operating systems provide multiple mechanisms for developing concurrent applications. Synchronous multithreading is a popular mechanism for developing applications that perform multiple...

A Parallel Object-Oriented System for Realizing Reusable and Efficient Data Abstractions (1993)

Chu-Cheow Lim, Franco Mazzanti, Stephan Murer, Steve Omohundro, Thomas Rauber, ...

ions and Applications 182 4.1 Workbag : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 182 4.1.1 Overview : : : : : : : : : : : : : : : : : : : : : : : : : : : :...

Dynamic Perfect Hashing: Upper and Lower Bounds (1991)

Dietzfelbinger, Martin, Karlin, Anna, Mehlhorn, Kurt, Rohnert, Hans, Tarjan, Robert E.

The dynamic dictionary problem is considered: provide an algorithm for storing a dynamic set, allowing the operations insert, delete, and lookup. A dynamic perfect hashing strategy is given: a...