1982/11/01 by Michael L. Fredman, János Komlós, Endre Szemerédi · 1 citation
Computer Science · #Data Management and Algorithms #Algorithms and Data Compression #Advanced Database Systems and Queries
paper · doi:10.1109/sfcs.1982.39
openalex publication_date 1982/11/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29
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.