On the average complexity of some bucketing algorithms

DOI10.1016/0898-1221(81)90127-9zbMATH Open0469.65001OpenAlexW2088186751MaRDI QIDQ1157091FDOQ1157091

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

• An efficient algorithm for determining the convex hull of a finite planar set
• Title not available (Why is that?)
• Title not available (Why is that?)
• Distribution inequalities for the binomial law
• Title not available (Why is that?)

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)