On the performance of balanced hashing functions when the keys are not equiprobable

DOI10.1145/357084.357089zbMATH Open0461.68075OpenAlexW2016643759MaRDI QIDQ3911417

Philip A. Bernstein, Christos Papadimitriou

Publication date: 1980

Published in: ACM Transactions on Programming Languages and Systems (Search for Journal in Brave)

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

zbMATH Keywords

performance bounds

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Theory of operating systems (68N25) Discrete mathematics in relation to computer science (68R99)

This page was built for publication: On the performance of balanced hashing functions when the keys are not equiprobable

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