Ordered hash tables, The Computer Journal, vol.17, issue.2, pp.135-142, 1974. ,
DOI : 10.1093/comjnl/17.2.135
Big Buckets Are (Are Not) Better!, Journal of the ACM, vol.24, issue.4, pp.591-606, 1977. ,
DOI : 10.1145/322033.322038
Reducing the retrieval time of scatter storage techniques, Communications of the ACM, vol.16, issue.2, pp.105-109, 1973. ,
DOI : 10.1145/361952.361964
On linear probing hashing, 1987. ,
Robin hood hashing, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), 1986. ,
DOI : 10.1109/SFCS.1985.48
Robin hood hashing, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), pp.281-288, 1985. ,
DOI : 10.1109/SFCS.1985.48
Extendible hashing---a fast access method for dynamic files, ACM Transactions on Database Systems, vol.4, issue.3, pp.315-344, 1979. ,
DOI : 10.1145/320083.320092
Mellin transforms and asymptotics: Harmonic sums, Theoretical Computer Science, vol.144, issue.1-2, pp.3-58, 1995. ,
DOI : 10.1016/0304-3975(95)00002-E
URL : https://hal.archives-ouvertes.fr/inria-00074307
On the Analysis of Linear Probing Hashing, Algorithmica, vol.22, issue.4, pp.490-515, 1998. ,
DOI : 10.1007/PL00009236
URL : https://hal.archives-ouvertes.fr/inria-00073424
Efficient Ordering of Hash Tables, SIAM Journal on Computing, vol.8, issue.3, pp.463-478, 1979. ,
DOI : 10.1137/0208038
The analysis of linear probing sort by the use of a new mathematical transform, Journal of Algorithms, vol.5, issue.4, pp.451-470, 1984. ,
DOI : 10.1016/0196-6774(84)90001-4
Handbook of Algorithms and Data Structures, 1991. ,
Trie partitioning process: Limiting distributions, Proceedings of the 11th Colloquium on Trees in Algebra and Programming, pp.196-210, 1986. ,
DOI : 10.1007/BFb0022669
Individual displacements for linear probing hashing with different insertion policies, 2003. ,
Notes on " open " addressing. Unpublished memorandum With annotation " My first analysis of an algorithm, originally done during Summer 1962 in Madison " . Also conjectures the asymptotics of the Q-function, with annotation, 1963. ,
The Art of Computer Programming, volume 3 Sorting and Searching, 1998. ,
Linear Probing and Graphs, Algorithmica, vol.22, issue.4, pp.561-568, 1998. ,
DOI : 10.1007/PL00009240
URL : http://arxiv.org/abs/cs/9801103
An Occupancy Discipline and Applications, SIAM Journal on Applied Mathematics, vol.14, issue.6, pp.1266-1274, 1966. ,
DOI : 10.1137/0114101
Analysis of Uniform Hashing, Journal of the ACM, vol.30, issue.4, pp.805-819, 1983. ,
DOI : 10.1145/2157.322407
Analysis of linear probing with buckets, Information Systems, vol.8, issue.3, pp.207-216, 1983. ,
DOI : 10.1016/0306-4379(83)90007-8
Addressing for Random-Access Storage, IBM Journal of Research and Development, vol.1, issue.2, pp.130-146, 1957. ,
DOI : 10.1147/rd.12.0130
Last-come-first-served hashing, Journal of Algorithms, vol.10, issue.2, pp.228-248, 1989. ,
DOI : 10.1016/0196-6774(89)90014-X
Algorithms in C, Parts 1-4: Fundamentals, Data Structures, Sorting, Searching, 1998. ,
Exact distribution of individual displacements in linear probing hashing, ACM Transactions on Algorithms, vol.1, issue.2, 2004. ,
DOI : 10.1145/1103963.1103965
The Analysis of Linear Probing Hashing with Buckets, Algorithmica, vol.21, issue.1, pp.37-71, 1998. ,
DOI : 10.1007/PL00009208
URL : https://hal.archives-ouvertes.fr/hal-00990469