Storing a sparse table with O(1) worst case access time

Authors:
Michael L. Fredman;Janos Komlos;Endre Szemeredi
Affiliations:
-;-;-
Venue:
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Year:
1982

Citing 0
Cited 5

Efficient Searching for Multi-dimensional Data Made Simple

ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Cache-oblivious hashing

Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Flash memory efficient LTL model checking

Science of Computer Programming
Divide-and-color

WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Range aggregate maximal points in the plane

WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe a data structure for representing a set of n items from a universe of m items, which uses space n+o(n) and accommodates membership queries in constant time. Both the data structure and the query algorithm are easy to implement.