Independent range sampling, revisited

DOI10.4230/LIPICS.ESA.2017.3zbMATH Open1442.68035MaRDI QIDQ5111686FDOQ5111686

Authors: Peyman Afshani, Zhewei Wei 

Publication date: 27 May 2020

Recommendations

• Succinct sampling from discrete distributions
• Efficient sampling methods for discrete distributions
• Sampling in space restricted settings
• Sampling in space restricted settings
• Weighted random sampling with a reservoir

zbMATH Keywords

data structuresrange searchingrandom samplingrange sampling

Mathematics Subject Classification ID

Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Efficient partition trees
• Random Sampling, Halfspace Range Reporting, and Construction of \lowercase$(\le k)$-Levels in Three Dimensions
• Computational geometry. Algorithms and applications.
• The power of geometric duality
• Time-space trade-offs for predecessor search
• Orthogonal range searching on the RAM, revisited
• Title not available (Why is that?)
• Optimal halfspace range reporting in three dimensions
• Reporting points in halfspaces
• On approximate range counting and depth
• A general approach for cache-oblivious range reporting and approximate range counting

Cited In (2)

• Title not available (Why is that?)
• On sampling by index cases

This page was built for publication: Independent range sampling, revisited

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