On the analysis of linear probing hashing
From MaRDI portal
Publication:1277378
Recommendations
Cited in
(55)- Linear probing and graphs
- Q-grammars and wall polyominoes
- Generalized covariances of multi-dimensional Brownian excursion local times.
- Exact formulas for moments of sums of classical parking functions
- Singularity analysis, Hadamard products, and tree recurrences
- Reflected Brownian bridge local time conditioned on its local time at the origin
- A Vervaat-like path transformation for the reflected Brownian bridge conditioned on its local time at 0
- Gončarov polynomials and parking functions
- Forbidden subgraphs in connected graphs
- Limiting distributions for the number of inversions in labelled tree families
- Conditional large and moderate deviations for sums of discrete random variables. Combinatoric applications
- The sum of powers of subtree sizes for conditioned Galton-Watson trees
- Cycle structure of random parking functions
- Deviation results for sparse tables in hashing with linear probing
- Trees, parking functions and factorizations of full cycles
- Embedding small digraphs and permutations in binary trees and split trees
- Probabilizing parking functions
- Parking distributions on trees
- Airy distribution function: from the area under a Brownian excursion to the maximal height of fluctuating interfaces
- Parking with density
- D E K=(100)_8
- Random maps, coalescing saddles, singularity analysis, and Airy phenomena
- Asymptotic distribution for the cost of linear probing hashing
- Parking functions for mappings
- Psi-series method for equality of random trees and quadratic convolution recurrences
- Area limit laws for symmetry classes of staircase polygons
- A unified approach to linear probing hashing with buckets
- Effective Langevin equations for constrained stochastic processes
- Asymptotic properties of the number of inversions in a random forest
- The cost distribution of clustering in random probing
- On the Joint Path Length Distribution in Random Binary Trees
- The analysis of linear probing sort by the use of a new mathematical transform
- scientific article; zbMATH DE number 4047207 (Why is no real title available?)
- Asymptotics and random sampling for BCI and BCK lambda terms
- The analysis of linear probing hashing with buckets
- The maximum displacement for linear probing hashing
- A conditional Berry-Esseen inequality
- Inversions in split trees and conditional Galton-Watson trees
- Large fluctuations of the area under a constrained Brownian excursion
- Generating stochastic trajectories with global dynamical constraints
- Expected maximum of bridge random walks & Lévy flights
- Analysis of Robin Hood and Other Hashing Algorithms Under the Random Probing Model, With and Without Deletions
- Inversions in split trees and conditional Galton-Watson trees
- Distribution of the time at which the deviation of a Brownian motion is maximum before its first-passage time
- Local asymptotics for the area of random walk excursions
- On probabilistic analysis of a coalesced hashing algorithm
- Where should you park your car? The $\frac{1}{2}$ rule
- Area fluctuations on a subinterval of Brownian excursion
- Distribution of the size of random hash trees, pebbled hash trees and N-trees
- On a model for the storage of files on a hardware: statistics at a fixed time and asymptotic regimes
- A robust image encryption scheme using chaotic tent map and cellular automata
- Parking functions: from combinatorics to probability
- Gelation in coagulating systems
- On certain functionals of the maximum of Brownian motion and their applications
- On \(q\)-functional equations and excursion moments
This page was built for publication: On the analysis of linear probing hashing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1277378)
