Compressed static functions with applications

No abstract is available for this paper.

• Publication year

  2013

• Venue

  ACM-SIAM Symposium on Discrete Algorithms

• Publication date

  2013-01-06

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1137/1.9781611973105.17
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Changing base without losing space

  2010cited by this paper
• Monotone minimal perfect hashing: searching a sorted table with O(1) accesses

  2009cited by this paper
• Storing a Compressed Function with Constant Time Access

  2009cited by this paper
• Alphabet Partitioning for Compressed Rank/Select and Applications

  2009influential reference
• Experimental Variations of a Theoretically Good Retrieval Data Structure

  2009cited by this paper
• Bloomier Filters: A second look

  2008influential reference
• Succinct Data Structures for Retrieval and Approximate Membership

  2008influential reference
• An Optimal Bloom Filter Replacement Based on Matrix Solving

  2008influential reference
• A simple storage scheme for strings achieving entropy bounds

  2007cited by this paper
• On dynamic range reporting in one dimension

  2005cited by this paper
• An optimal Bloom filter replacement

  2005cited by this paper
• De Dictionariis Dynamicis Pauco Spatio Utentibus (lat. On Dynamic Dictionaries Using Little Space)

  2005cited by this paper
• The Bloomier filter: an efficient data structure for static support lookup tables

  2004cited by this paper
• Efficient Minimal Perfect Hashing in Nearly Minimal Space

  2001influential reference
• Dispersing hash functions

  2000cited by this paper
• Examining Computational Geometry, Van Emde Boas Trees, and Hashing from the Perspective of the Fusion Tree

  1999cited by this paper
• Data structures and algorithms. Volume 1 : Sorting and searching

  1984cited by this paper
• Data Structures and Algorithms 1

  1984cited by this paper
• Space/time trade-offs in hash coding with allowable errors

  1970cited by this paper

• Ribbon: Fast Succinct Static Retrieval and Approximate Membership

  2026influential citation
• Learned Static Function Data Structures

  2025influential citation
• Combined Search and Encoding for Seeds, with an Application to Minimal Perfect Hashing

  2025cites this paper
• COPR -- Efficient, large-scale log storage and retrieval

  2024cites this paper
• CARAMEL: A Succinct Read-Only Lookup Table via Compressed Static Functions

  2023influential citation
• What if we tried Less Power? - Lessons from studying the power of choices in hashing-based data structures

  2023cites this paper
• Space-efficient representation of genomic k-mer count tables

  2022influential citation
• Approximate Membership Query Filters with a False Positive Free Set

  2021cites this paper
• Fast Succinct Retrieval and Approximate Membership using Ribbon

  2021influential citation
• Fast scalable construction of ([compressed] static | minimal perfect hash) functions

  2020cites this paper
• Near-Optimal Data Structure for Approximate Range Emptiness Problem in Information-Centric Internet of Things

  2019cites this paper
• Engineering Compressed Static Functions

  2018cites this paper
• A resource-frugal probabilistic dictionary and applications in bioinformatics

  2017cites this paper
• Compact Dynamic Rewritable (CDRW) Arrays

  2017cites this paper
• A Resource-frugal Probabilistic Dictionary and Applications in (Meta)Genomics

  2016cites this paper
• Linear Time Succinct Indexable Dictionary Construction with Applications

  2016cites this paper
• Compressed String Dictionary Search with Edit Distance One

  2016cites this paper
• Fast Scalable Construction of (Minimal Perfect Hash) Functions

  2016cites this paper
• Approximate Range Emptiness in Constant Time and Optimal Space

  2014cites this paper
• Cache-Oblivious Peeling of Random Hypergraphs

  2013cites this paper
• Dynamic Retrievals

  year unknowncites this paper