Occupancy urn models in the analysis of algorithms
type: Item
instance of: scholarly article
title: Occupancy urn models in the analysis of algorithms
zbMATH Open document ID: 0994.60006
DOI: 10.1016/S0378-3758(01)00156-2
published in: Journal of Statistical Planning and Inference
publication date: 2002-05-15T00:00:00Z
Mathematics Subject Classification ID: 60C05
Mathematics Subject Classification ID: 60F05
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 05A15
Mathematics Subject Classification ID: 68R99
zbMATH DE Number: 1741592
zbMATH Keywords: random allocations
zbMATH Keywords: urn model
zbMATH Keywords: analysis of algorithms
author: Danièle Gardy
MaRDI profile type: Publication
cites work: Two Applications of Urn Processes The Fringe Analysis of Search Trees and The Simulation of Quasi-Stationary Distributions of Markov Chains
cites work: Central and local limit theorems applied to asymptotic enumeration. II: Multivariate generating functions
cites work: An urn model from learning theory
cites work: Analysis and performance of inverted data base structures
cites work: A bivariate asymptotic expansion of coefficients of powers of generating functions
cites work: A unified presentation of some urn models
cites work: Birthday paradox, coupon collectors, caching algorithms and self- organizing search
cites work: Q4855565
cites work: Normal Limiting Distributions for Projection and Semijoin Sizes
cites work: Join sizes, urn models and normal limiting distributions
cites work: Dynamic analysis of some relational databases parameters
cites work: Q3740279
cites work: Q3692527
cites work: A unified approach to limit theorems for urn models
cites work: On convergence rates in the central limit theorems for combinatorial structures
cites work: On some generalized farlie-gumbel-morgenstern distributions-II regression, correlation and further generalizations
cites work: Q3915689
cites work: Q4353164
cites work: Trie size in a dynamic list structure
cites work: On rotations in fringe-balanced binary trees
cites work: Statistical profile estimation in database systems
cites work: Approximating block accesses in database organizations
Wikidata QID: Q126981807
full work available at URL: s0378-3758(01)00156-2
OpenAlex ID: W2011545707
Recommended article: Random-allocation and urn models
Recommended article: Fully Analyzing an Algebraic Pólya Urn Model
Recommended article: Q4021033
Recommended article: Average case analysis of Gosper's algorithm for a class of urn model inputs
Recommended article: Randomized urn models revisited using stochastic approximation
Recommended article: Q3610929
Recommended article: An urn model with applications to database performance evaluation
Recommended article: Q4002885
Recommended article: Q4458154
description: scientific article; zbMATH DE number 1741592