Maximum queue size and hashing with lazy deletion
type: Item
instance of: scholarly article
title: Maximum queue size and hashing with lazy deletion
zbMATH Open document ID: 0726.68021
DOI: 10.1007/BF01759063
author: Claire Kenyon
author: Jeffrey Scott Vitter
published in: Algorithmica
publication date: 1991-01-01T00:00:00Z
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 4199611
zbMATH Keywords: hasing with lazy deletion
zbMATH Keywords: linear lists
zbMATH Keywords: symbol tables
zbMATH Keywords: continued fractions
zbMATH Keywords: orthogonal polynomials
zbMATH Keywords: queues
zbMATH Keywords: birth-and-death processes
zbMATH Keywords: file histories
zbMATH Keywords: M/G/\(\infty \)
zbMATH Keywords: M/M/\(\infty \)
MaRDI profile type: Publication
cites work: Sequence of operations analysis for dynamic data structures
cites work: Expected Length of the Longest Probe Sequence in Hash Code Searching
cites work: Q3266049
cites work: Q3855869
cites work: The Maximum Size of Dynamic Data Structures
cites work: Q4101255
cites work: Q3915689
cites work: A Queueing Analysis of Hashing with Lazy Deletion
cites work: The complexity of hashing with lazy deletion
full work available at URL: https://doi.org/10.1007/bf01759063
OpenAlex ID: W2023189876
description: scientific article; zbMATH DE number 4199611