Sampling the Leaves of a Tree with Equal Probabilities

DOI10.2307/2291292MaRDI QIDQ4292130zbMATH OpenOpenAlexFDO

Authors Paul R. Rosenbaum

Publication date 10 July 1994

Full work available at URL https://doi.org/10.2307/2291292

zbMATH Keywords

backtrack algorithmsdata structuresfinite population samplingstatistical computing

Mathematics Subject Classification ID

Sampling theory, sample surveys (62D05) Data structures (68P05)

Recommendations

• The properties of random trees
• Uniformly random tree generation
• Faster methods for random sampling
• Counting the leaves of trees
• Trees for algorithmics

Cited in

(1)

• A simple algorithm for worst case optimal join and sampling

This page was built for publication: Sampling the Leaves of a Tree with Equal Probabilities

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