On the average-case complexity of “bucketing” algorithms

DOI10.1016/0196-6774(82)90003-7MaRDI QIDQ3933740zbMATH OpenOpenAlexFDO

Authors Selim G. Akl, Henk Meijer

Publication date 1982

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(82)90003-7

zbMATH Keywords

bucketsworst-case timeaverage-case behaviorlinear expected time

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited in

(3)

• Search performance of double-linked coalesced hashing can not exceed bucketing
• On search by address computation
• Analysis of N-trees

This page was built for publication: On the average-case complexity of “bucketing” algorithms

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