Database Paper Browser

Back to papers

Optimal Dynamic Parameterized Subset Sampling

Summary: Optimal DPSS in Word RAM: O(n) preprocessing, O(1+mu_S) per-query, O(1) updates, linear space. Hardness: deletion-only DPSS with float weights would imply sorting; also presents O(1) expected-time Bernoulli and truncated-geometric variate generation. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
1945
Venue
PODS
Year
2024
Pagerank
4.1945683e-05
Overall Rank
10,920 | 24.04%
DOI
10.1145/3695827

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers