• Publications
  • Influence
A New Universal Class of Hash Functions and Dynamic Hashing in Real Time
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 canExpand
  • 119
  • 12
Dynamic perfect hashing: upper and lower bounds
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 forExpand
  • 339
  • 10
Exploiting locality for data management in systems of limited bandwidth
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 sharedExpand
  • 98
  • 6
Dynamic Perfect Hashing: Upper and Lower Bounds
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: aExpand
  • 91
  • 5
Energy, congestion and dilation in radio networks
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 forExpand
  • 97
  • 5
Universal algorithms for store-and-forward and wormhole routing
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 theExpand
  • 53
  • 5
A polynomial linear search algorithm for the n-dimensional knapsack problem
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 fixedExpand
  • 36
  • 5
Efficient PRAM simulation on a distributed memory machine
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 theExpand
  • 73
  • 4
Strongly Adaptive Token Distribution
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 ∈PExpand
  • 27
  • 4