The analysis of linear probing hashing with buckets
From MaRDI portal
Publication:4595489
DOI10.1007/3-540-61680-2_58zbMATH Open1379.68380OpenAlexW2174990957MaRDI QIDQ4595489FDOQ4595489
Authors: Alfredo Viola, Patricio V. Poblete
Publication date: 5 December 2017
Published in: Algorithms — ESA '96 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-61680-2_58
Recommendations
- The analysis of linear probing hashing with buckets
- A unified approach to linear probing hashing with buckets
- On the analysis of linear probing hashing
- Distributional analysis of Robin Hood linear probing hashing with buckets
- scientific article; zbMATH DE number 1156718
- A unified approach to linear probing hashing
- Hashing with Linear Probing under Nonuniform Probabilities
- An approximate analysis of the performance of extendible hashing with elastic buckets
- Asymptotic distribution for the cost of linear probing hashing
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorics in computer science (68R05) Analysis of algorithms (68W40)
Cited In (6)
- A unified approach to linear probing hashing with buckets
- An approximate analysis of the performance of extendible hashing with elastic buckets
- The cost distribution of clustering in random probing
- Distributional analysis of Robin Hood linear probing hashing with buckets
- Distributional analysis of the parking problem and Robin Hood linear probing hashing with buckets
- A unified approach to linear probing hashing
This page was built for publication: The analysis of linear probing hashing with buckets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4595489)