Lattice path combinatorics and linear probing
From MaRDI portal
Publication:1075065
DOI10.1016/0378-3758(86)90013-3zbMath0591.68095MaRDI QIDQ1075065
Publication date: 1986
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0378-3758(86)90013-3
Ballot theorem; data structures; hashing; Urn models; direct-access file; direct-access storage and retrieval; lattice-path counting
05A15: Exact enumeration problems, generating functions
60C05: Combinatorial probability
68P20: Information storage and retrieval of data
Related Items
Plasticity-triggered architectural effects in periodic multilayers with wavy microstructures, Plastic deformation modes in perforated sheets and their relation to yield and limit surfaces
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Probability Law of the Busy Period for Two Types of Queuing Processes
- Performance Measures for Ordered Lists in Random-Access Files
- Optimal Policies for Data Base Reorganization
- A New Approach to the Analysis of Linear Probing Schemes
- A batch-ballot problem and applications
- Analysis of Extendible Hashing
- Combinatorial Methods in the Theory of Queues