Non-oblivious hashing

Authors:
Amos Fiat;Moni Naor;Jeanette Schmidt;Alan Siegel
Affiliations:
Computer Science Division, University of California at Berkeley, Berkeley, CA;Computer Science Division, University of California at Berkeley, Berkeley, CA;Computer Science Department, Courant Institute, New York University, New York, NY;Computer Science Department, Courant Institute, New York University, New York, NY
Venue:
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Year:
1988

Citing 12
Cited 5

Storing a Sparse Table with 0(1) Worst Case Access Time

Journal of the ACM (JACM)
Two results on tables

Information Processing Letters
Collections of functions for perfect hashing

SIAM Journal on Computing
Searching a two key table under a single key

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Storing and searching a multikey table

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Optimal Arrangement of Keys in a Hash Table

Journal of the ACM (JACM)
Expected Length of the Longest Probe Sequence in Hash Code Searching

Journal of the ACM (JACM)
Should Tables Be Sorted?

Journal of the ACM (JACM)
Storing a sparse table

Communications of the ACM
An Improved Program for Constructing Open Hash Tables

Proceedings of the 7th Colloquium on Automata, Languages and Programming
The program complexity of searching a table (data structures, applied combinatorics)

The program complexity of searching a table (data structures, applied combinatorics)
Robin hood hashing

SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science

Storing and searching a multikey table

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Implicit O(1) probe search

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
On aspects of university and performance for closed hashing

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Error correcting codes, perfect hashing circuits, and deterministic dynamic dictionaries

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
No sorting? better searching!

ACM Transactions on Algorithms (TALG)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Non-oblivious hashing, where the information gathered by performing “unsuccessful” probes determines the probe strategy, is introduced and used to obtain the following results for static lookup on full tables:An &Ogr;(1) worst case scheme that requires only logarithmic additional memory (improving on the [FKS84] linear space upper bound).An almost sure &Ogr;(1) probabilistic worst case scheme, without any additional memory (improving on previous logarithmic time upper bounds).Enhancements to hashing: Solving (a) and (b) in the multikey record environment, search can be performed under any key in time &Ogr;(1); finding the nearest neighbor, the rank, etc. in logarithmic time.Our non-oblivious upper bounds are much better than the appropriate oblivious lower bounds.