STOC 1989
Implicit O(1) Probe Search
Abstract
Given a set of n elements from the domain 1, …, m , we investigate how to arrange them in a table of size n , so that searching for an element in the table can be done in constant time.
Authors
Keywords
No keywords are indexed for this paper.
Context
- Venue
- ACM Symposium on Theory of Computing
- Archive span
- 1969-2025
- Indexed papers
- 4364
- Paper id
- 54545113697338802