Optimal Arrangement of Keys in a Hash Table

DOI10.1145/322063.322065zbMATH Open0372.68011OpenAlexW2420766135MaRDI QIDQ4148945FDOQ4148945

Authors: Ronald L. Rivest 

Publication date: 1978

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

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.62.4549

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Information storage and retrieval of data (68P20) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Cited In (4)

• Linear open addressing and Peterson's theorem rehashed
• Minimean optimal key arrangements in hash tables
• A time-space tradeoff for language recognition
• Frequency loading and linear probing

This page was built for publication: Optimal Arrangement of Keys in a Hash Table

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4148945)