A combinatorial analysis of the average time for open-address hash coding insertion

Publication date: 29 August 2012

Abstract: In analysing a well-known hash-coding method, Knuth gave an exact expression for the average number of rejections encountered by players of a variant of musical chairs. We study a variant more closely related to musical chairs itself and deduce the same expression by a purely combinatorial approach.

This page was built for publication: A combinatorial analysis of the average time for open-address hash coding insertion

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