On the average complexity of some bucketing algorithms
type: Item
instance of: scholarly article
title: On the average complexity of some bucketing algorithms
zbMATH Open document ID: 0469.65001
DOI: 10.1016/0898-1221(81)90127-9
publication date: 1981-01-01T00:00:00Z
Mathematics Subject Classification ID: 65C10
Mathematics Subject Classification ID: 65C99
Mathematics Subject Classification ID: 62E20
Mathematics Subject Classification ID: 68U20
zbMATH DE Number: 3736879
zbMATH Keywords: average complexity
zbMATH Keywords: bucketing algorithms
zbMATH Keywords: asymptotical behavior
zbMATH Keywords: computational geometry
author: Luc Devroye
MaRDI profile type: Publication
full work available at URL: 0898-1221(81)90127-9
OpenAlex ID: W2088186751
cites work: An efficient algorithm for determining the convex hull of a finite planar set
cites work: Q5736591
cites work: Q5640482
cites work: Q3915690
cites work: Distribution inequalities for the binomial law
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 3736879