# F. M. A. D. Heide

Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

Proactive Secret Sharing or How to Cope with Perpetual Leakage

- R. Karp, M. Luby, F. M. A. D. Heide
- Computer Science
- 1995

- 308
- 41

A New Universal Class of Hash Functions and Dynamic Hashing in Real Time

- Martin Dietzfelbinger, F. M. A. D. Heide
- Computer Science
- ICALP
- 16 July 1990

The paper presents a new universal class of hash functions which have many desirable features of random functions, but can be (probabilistically) constructed using sublinear time and space, and can… Expand

Dynamic perfect hashing: upper and lower bounds

- Martin Dietzfelbinger, Anna R. Karlin, K. Mehlhorn, F. M. A. D. Heide, H. Rohnert, R. Tarjan
- Mathematics, Computer Science
- [Proceedings ] 29th Annual Symposium on…
- 1988

A randomized algorithm is given for the dictionary problem with O(1) worst-case time for lookup and O(1) amortized expected time for insertion and deletion. An Omega (log n) lower bound is proved for… Expand

Exploiting locality for data management in systems of limited bandwidth

- B. Maggs, F. M. A. D. Heide, Berthold Vöcking, M. Westermann
- Computer Science
- Proceedings 38th Annual Symposium on Foundations…
- 19 October 1997

This paper deals with data management in computer systems in which the computing nodes are connected by a relatively sparse network. We consider the problem of placing and accessing a set of shared… Expand

Dynamic Perfect Hashing: Upper and Lower Bounds

- Martin Dietzfelbinger, Anna R. Karlin, K. Mehlhorn, F. M. A. D. Heide, H. Rohnert, R. Tarjan
- Mathematics, Computer Science
- SIAM J. Comput.
- 1 August 1994

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… Expand

Energy, congestion and dilation in radio networks

- F. M. A. D. Heide, C. Schindelhauer, Klaus Volbert, M. Grünewald
- Computer Science
- SPAA '02
- 10 August 2002

We investigate the problem of path selection in radio networks for a given set of sites in two-dimensional space. For some given static point-to-point communication demand we define measures for… Expand

Universal algorithms for store-and-forward and wormhole routing

- R. Cypher, F. M. A. D. Heide, C. Scheideler, Berthold Vöcking
- Computer Science
- STOC '96
- 1 July 1996

In this paper we present routing algorithms that are tmiversal in the sense that they route messages along arbitrary (simple) paths in arbitrary networks. The algorithms are analyzed in terms of the… Expand

A polynomial linear search algorithm for the n-dimensional knapsack problem

- F. M. A. D. Heide
- Mathematics
- STOC '83
- 1 December 1983

We present a Linear Search Algorithm which decides the n-dimensional knapsack problem in n4log(n) + 0.(n3) steps. This algorithm works for inputs consisting of n numbers for some arbitrary but fixed… Expand

Efficient PRAM simulation on a distributed memory machine

- R. Karp, M. Luby, F. M. A. D. Heide
- Computer Science
- Algorithmica
- 1 April 1996

We present algorithms for the randomized simulation of a shared memory machine (PRAM) on a Distributed Memory Machine (DMM). In a PRAM, memory conflicts occur only through concurrent access to the… Expand

Strongly Adaptive Token Distribution

- F. M. A. D. Heide, B. Oesterdiekhoff, R. Wanka
- Computer Science
- ICALP
- 5 July 1993

The token distribution (TD) problem, an abstract static variant of load balancing, is defined as follows: letM be a (parallel processor) network with setP of processors. Initially, each processorP ∈P… Expand