Reducing the retrieval time of scatter storage techniques

DOI10.1145/361952.361964zbMath0251.68019OpenAlexW2032384657WikidataQ56939415 ScholiaQ56939415MaRDI QIDQ5664801

Richard P. Brent

Publication date: 1973

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/361952.361964

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Related Items (12)

A unified approach to linear probing hashing with buckets ⋮ Minimean optimal key arrangements in hash tables ⋮ Linear open addressing and Peterson's theorem rehashed ⋮ An improved version of cuckoo hashing: average case analysis of construction cost and search operations ⋮ Hashing techniques, a global approach ⋮ The analysis of double hashing ⋮ Large-scale linearly constrained optimization ⋮ The Diagonal Poisson Transform and its application to the analysis of a hashing scheme ⋮ Notes on the derivation of asymptotic expressions from summations ⋮ Analysis of Robin Hood and Other Hashing Algorithms Under the Random Probing Model, With and Without Deletions ⋮ Krylov and steady-state techniques for the solution of the chemical master equation for the mitogen-activated protein kinase cascade ⋮ Quasi-stationary distributions for discrete-state models

This page was built for publication: Reducing the retrieval time of scatter storage techniques