On the Length of Programs for Computing Finite Binary Sequences
Journal of the ACM (JACM)
A Theory of Program Size Formally Identical to Information Theory
Journal of the ACM (JACM)
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Information Theory and Reliable Communication
Information Theory and Reliable Communication
Universal classes of hash functions (Extended Abstract)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Optimal VLSI circuits for sorting
Journal of the ACM (JACM)
Designing programs that check their work
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Communications of the ACM
Experience with a space efficient way to store a dictionary
Communications of the ACM
Weighted proportional window control of TCP traffic
International Journal of Network Management
Unstructured data bases or very efficient text searching
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Active queue management with flow proportional buffering
International Journal of Network Management
Proceedings of the ACM SIGPLAN SIGOA symposium on Text manipulation
Checking for spelling and typographical errors in computer-based text
Proceedings of the ACM SIGPLAN SIGOA symposium on Text manipulation
An optimal Bloom filter replacement
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On the false-positive rate of Bloom filters
Information Processing Letters
Monotone minimal perfect hashing: searching a sorted table with O(1) accesses
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Secondary indexing in one dimension: beyond b-trees and bitmap indexes
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Fast, All-Purpose State Storage
Proceedings of the 16th International SPIN Workshop on Model Checking Software
Succinct approximate counting of skewed data
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Fast track article: Connectivity monitoring in wireless sensor networks
Pervasive and Mobile Computing
Fast evaluation of union-intersection expressions
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
A locally encodable and decodable compressed data structure
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Approximate membership query over time-decaying windows for event stream processing
Proceedings of the 6th ACM International Conference on Distributed Event-Based Systems
| Hi-index | 0.03 |
In this paper we consider the question of how much space is needed to represent a set. Given a finite universe U and some subset V (called the vocabulary), an exact membership tester is a procedure that for each element s in U determines if s is in V. An approximate membership tester is allowed to make mistakes: we require that the membership tester correctly accepts every element of V, but we allow it to also accept a small fraction of the elements of U - V.