A unified approach to linear probing hashing with buckets
From MaRDI portal
Publication:308951
DOI10.1007/s00453-015-0111-xzbMath1350.68307arXiv1410.5967OpenAlexW1856022045MaRDI QIDQ308951
Publication date: 6 September 2016
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1410.5967
Analysis of algorithms (68W40) Searching and sorting (68P10) Information storage and retrieval of data (68P20)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Analysis of linear probing with buckets
- Brownian excursion area, wright's constants in graph enumeration, and other Brownian areas
- On the analysis of linear probing hashing
- Linear probing and graphs
- The analysis of linear probing hashing with buckets
- A Vervaat-like path transformation for the reflected Brownian bridge conditioned on its local time at 0
- On Ramanujan's \(Q\)-function
- Asymptotic distribution for the cost of linear probing hashing
- Analytic Combinatorics in Several Variables
- Individual displacements for linear probing hashing with different insertion policies
- Exact distribution of individual displacements in linear probing hashing
- Analysis of Uniform Hashing
- The Diagonal Poisson Transform and its application to the analysis of a hashing scheme
- Phase transition for Parking blocks, Brownian excursion and coalescence
- Singularity Analysis of Generating Functions
- A Recurrence Related to Trees
- Big Buckets Are (Are Not) Better!
- Efficient Ordering of Hash Tables
- Last-come-first-served hashing
- Ordered hash tables
- An Occupancy Discipline and Applications
- Reducing the retrieval time of scatter storage techniques
- Probability: A Graduate Course
- Quantum calculus
This page was built for publication: A unified approach to linear probing hashing with buckets
