De Dictionariis Dynamicis Pauco Spatio Utentibus (lat. On Dynamic Dictionaries Using Little Space)

No abstract is available for this paper.

• Publication year

  2005

• Venue

  Latin American Symposium on Theoretical Informatics

• Publication date

  2005-12-20

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/11682462_34
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Derandomized Constructions of k-Wise (Almost) Independent Permutations

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

  2005influential reference
• The Bloomier filter: an efficient data structure for static support lookup tables

  2004influential reference
• Succinct Dynamic Dictionaries and Trees

  2003cited by this paper
• Succinct indexable dictionaries with applications to encoding k-ary trees and multisets

  2002cited by this paper
• LOW REDUNDANCY IN STATIC DICTIONARIES WITH CONSTANT QUERY TIME

  2001cited by this paper
• Optimal static range reporting in one dimension

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

  2001cited by this paper
• Membership in Constant Time and Almost-Minimum Space

  1999cited by this paper
• On Universal Classes of Extremely Random Constant-Time Hash Functions

  1995cited by this paper
• Chernoff-Hoeffding bounds for applications with limited independence

  1995cited by this paper
• Dynamic Perfect Hashing: Upper and Lower Bounds

  1994cited by this paper
• A New Universal Class of Hash Functions and Dynamic Hashing in Real Time

  1990cited by this paper
• On the Size of Separating Systems and Families of Perfect Hash Functions

  1984cited by this paper
• Storing a sparse table with O(1) worst case access time

  1982cited by this paper

• Ribbon: Fast Succinct Static Retrieval and Approximate Membership

  2026cites this paper
• Modern Minimal Perfect Hashing: A Survey

  2025cites this paper
• ε-Cost Sharding: Scaling Hypergraph-Based Static Functions and Filters to Trillions of Keys

  2025cites this paper
• Towards an Analysis of Quadratic Probing

  2024cites this paper
• What if we tried Less Power? - Lessons from studying the power of choices in hashing-based data structures

  2023cites this paper
• Dynamic Dictionary with Subconstant Wasted Bits per Key

  2023cites this paper
• Brief Announcement: A Parallel Architecture for Dynamic Approximate Membership

  2023cites this paper
• Fast and Simple Compact Hashing via Bucketing

  2022cites this paper
• An extendable data structure for incremental stable perfect hashing

  2022influential citation
• Tiny Pointers

  2021influential citation
• On the optimal time/space tradeoff for hash tables

  2021influential citation
• Iceberg Hashing: Optimizing Many Hash-Table Criteria at Once

  2021influential citation
• Linear Probing Revisited: Tombstones Mark the Death of Primary Clustering

  2021cites this paper
• A Space-Efficient Dynamic Dictionary for Multisets with Constant Time Operations

  2020cites this paper
• A Dynamic Space-Efficient Filter with Constant Time Operations

  2020cites this paper
• Fully-Dynamic Space-Efficient Dictionaries and Filters with Constant Number of Memory Accesses

  2019cites this paper
• Space Efficient Algorithms for Breadth-Depth Search

  2019cites this paper
• D S ] 8 A pr 2 01 8 Bloom Filters , Adaptivity , and the Dictionary Problem )

  2018cites this paper
• 1 . 1 Model of Computation : Register Input Model [ 19 ]

  2018influential citation
• Delta-Fast Tries: Local Searches in Bounded Universes with Linear Space

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

  2017cites this paper
• Thresholds for Matchings in Random Bipartite Graphs with Applications to Hashing-Based Data Structures

  2015cites this paper
• On The I/O Complexity of Dynamic Distinct Counting

  2015cites this paper
• An In-Depth Analysis of Data Structures Derived from van-Emde-Boas-Trees

  2015cites this paper
• Retrieval and Perfect Hashing Using Fingerprinting

  2014cites this paper
• I/O-Efficient Dictionary Search with One Edit Error

  2014cites this paper
• Compressed static functions with applications

  2013cites this paper
• Hash-Based Techniques for High-Speed Packet Processing

  2010cites this paper
• De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results

  2009cites this paper
• Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation

  2009cites this paper
• Lower bound techniques for data structures

  2008cites this paper
• Succincter

  2008cites this paper
• Award Proposal : Data Structures

  2008cites this paper
• Perfect Hashing for Data Management Applications

  2007cites this paper
• Design Strategies for Minimal Perfect Hash Functions

  2007cites this paper
• Combinatorics, Probability and Computing

  2006cites this paper
• Dynamic Dictionaries in Constant Worst-Case Time

  2006cites this paper
• Mathematisches Forschungsinstitut Oberwolfach Combinatorics, Probability and Computing

  2006cites this paper
• Maintaining External Memory Efficient Hash Tables

  2006cites this paper
• I/O-Efficient Dictionary Search with One Edit Error

  year unknowncites this paper