Lattice path combinatorics and linear probing
type: Item
instance of: scholarly article
title: Lattice path combinatorics and linear probing
zbMATH Open document ID: 0591.68095
DOI: 10.1016/0378-3758(86)90013-3
author: Haim Mendelson
published in: Journal of Statistical Planning and Inference
publication date: 1986-01-01T00:00:00Z
Mathematics Subject Classification ID: 68P20
Mathematics Subject Classification ID: 60C05
Mathematics Subject Classification ID: 05A15
zbMATH DE Number: 3949760
zbMATH Keywords: data structures
zbMATH Keywords: Ballot theorem
zbMATH Keywords: Urn models
zbMATH Keywords: direct-access storage and retrieval
zbMATH Keywords: direct-access file
zbMATH Keywords: hashing
zbMATH Keywords: lattice-path counting
MaRDI profile type: Publication
full work available at URL: 0378-3758(86)90013-3
OpenAlex ID: W2001040331
cites work: Q4057549
cites work: Performance Measures for Ordered Lists in Random-Access Files
cites work: A New Approach to the Analysis of Linear Probing Schemes
cites work: Optimal Policies for Data Base Reorganization
cites work: A batch-ballot problem and applications
cites work: Analysis of Extendible Hashing
cites work: Q3903764
cites work: The Probability Law of the Busy Period for Two Types of Queuing Processes
cites work: Combinatorial Methods in the Theory of Queues
cites work: Q5583504
description: scientific article; zbMATH DE number 3949760