Lattice path combinatorics and linear probing

DOI10.1016/0378-3758(86)90013-3zbMath0591.68095OpenAlexW2001040331MaRDI QIDQ1075065

Haim Mendelson

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

zbMATH Keywords

Ballot theoremdata structureshashingUrn modelsdirect-access filedirect-access storage and retrievallattice-path counting

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial probability (60C05) Information storage and retrieval of data (68P20)

Related Items (2)

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

This page was built for publication: Lattice path combinatorics and linear probing