On the average complexity of some bucketing algorithms

DOI10.1016/0898-1221(81)90127-9MaRDI QIDQ1157091zbMATH OpenOpenAlexFDO

Authors Luc Devroye

Publication date 1981

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0898-1221(81)90127-9

zbMATH Keywords

computational geometryaverage complexityasymptotical behaviorbucketing algorithms

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Probabilistic methods, stochastic differential equations (65C99) Asymptotic distribution theory in statistics (62E20)

Cites work

• scientific article; zbMATH DE number 3727274 (Why is no real title available?)
• scientific article; zbMATH DE number 3367907 (Why is no real title available?)
• scientific article; zbMATH DE number 3200203 (Why is no real title available?)
• An efficient algorithm for determining the convex hull of a finite planar set
• Distribution inequalities for the binomial law

Cited in

(1)

• On the computer generation of random convex hulls

This page was built for publication: On the average complexity of some bucketing algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1157091)