An analysis of optimum caching
Journal of Algorithms
Approximating functions by their Poisson transform
Information Processing Letters
Robin Hood hashing
Last-come-first-served hashing
Journal of Algorithms
Generating functionology
Concrete mathematics: a foundation for computer science
Concrete mathematics: a foundation for computer science
Handbook of algorithms and data structures: in Pascal and C (2nd ed.)
Handbook of algorithms and data structures: in Pascal and C (2nd ed.)
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Mellin transforms and asymptotics: harmonic sums
Theoretical Computer Science - Special volume on mathematical analysis of algorithms (dedicated to D. E. Knuth)
Journal of Computational and Applied Mathematics
An introduction to the analysis of algorithms
An introduction to the analysis of algorithms
Asymptotic enumeration methods
Handbook of combinatorics (vol. 2)
The diagonal Poisson transform and its application to the analysis of a hashing scheme
Random Structures & Algorithms - Special issue: average-case analysis of algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Extendible hashing—a fast access method for dynamic files
ACM Transactions on Database Systems (TODS)
Journal of the ACM (JACM)
Reducing the retrieval time of scatter storage techniques
Communications of the ACM
Algorithms in C: Parts 1-4, Fundamentals, Data Structures, Sorting, and Searching
Algorithms in C: Parts 1-4, Fundamentals, Data Structures, Sorting, and Searching
Trie Partitioning Process: Limiting Distributions
CAAP '86 Proceedings of the 11th Colloquium on Trees in Algebra and Programming
Analysis of hashing algorithms and a new mathematical transform
Analysis of hashing algorithms and a new mathematical transform
Combinatorial Enumeration
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Individual displacements for linear probing hashing with different insertion policies
ACM Transactions on Algorithms (TALG)
Individual displacements for linear probing hashing with different insertion policies
ACM Transactions on Algorithms (TALG)
Efficient data structures for sparse network representation
International Journal of Computer Mathematics - COMPLEX NETWORKS
Individual displacements in hashing with coalesced chains
Combinatorics, Probability and Computing
Synchronizing state with strong similarity between local and remote systems
Proceedings of the third ACM workshop on Mobile cloud computing and services
Usability in designing assistive technology for children with learning disabilities
i-CREATe '11 Proceedings of the 5th International Conference on Rehabilitation Engineering & Assistive Technology
| Hi-index | 0.00 |
This paper studies the distribution of individual displacements for the standard and the Robin Hood linear probing hashing algorithms. When the a table of size m has n elements, the distribution of the search cost of a random element is studied for both algorithms. Specifically, exact distributions for fixed m and n are found as well as when the table is α-full, and α strictly smaller than 1. Moreover, for full tables, limit laws for both algorithms are derived.