Expected Length of the Longest Probe Sequence in Hash Code Searching
From MaRDI portal
Publication:3906430
DOI10.1145/322248.322254zbMath0456.68067WikidataQ60960861 ScholiaQ60960861MaRDI QIDQ3906430
Publication date: 1981
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322248.322254
analysis of algorithms; asymptotic analysis; hashing; open addressing; separate chaining; table search; direct chaining
68Q25: Analysis of algorithms and problem complexity
68P10: Searching and sorting
68P05: Data structures
68P20: Information storage and retrieval of data
68N25: Theory of operating systems
Related Items
Two-way chaining for non-uniform distributions, A parallel tree difference algorithm, Maximum queue size and hashing with lazy deletion, On the structure and complexity of worst-case equilibria, Cuckoo hashing: Further analysis, On the \(k\)-orientability of random graphs, Interpolation-based index maintenance, Shortest paths in Euclidean graphs, Analytical depoissonization and its applications, On the average height of trees in digital search and dynamic hashing, Laws of large numbers and tail inequalities for random tries and PATRICIA trees, On the Lambert \(w\) function, Structure and complexity of extreme Nash equilibria, Self‐adjusting trees in practice for large text collections, Hashing with Linear Probing under Nonuniform Probabilities, NON-BACKTRACKING RANDOM WALKS MIX FASTER
