Dynamic perfect hashing: upper and lower bounds

Authors:
M. Dietzfelbinger;A. Karlin;K. Mehlhorn;F. M. auf der Heide;H. Rohnert;R. E. Tarjan
Affiliations:
Dortmund Univ., West Germany;-;-;-;-;-
Venue:
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Year:
1988

Citing 0
Cited 7

Time and Space Efficient Multi-method Dispatching

SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Design and Analysis of Dynamic Processes: A Stocastic Approach

ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
The Runabout

Software—Practice & Experience
Divide and discriminate: algorithm for deterministic and fast hash lookups

Proceedings of the 5th ACM/IEEE Symposium on Architectures for Networking and Communications Systems
Topics in data structures

Algorithms and theory of computation handbook
Flash memory efficient LTL model checking

Science of Computer Programming
Various improvements to text fingerprinting

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

A simple construction for a pseudorandom bit generator is presented. It stretches a short string of truly random bits into a long string that looks random to any algorithm from a complexity class C (e.g. P, NC, PSPACE, etc.), using an arbitrary function ...