Deterministic K-Set Structure
Summary: Deterministic k-set algorithm for insertion-deletion streams that outputs the exact (item,frequency) set when distinct items ≤ k and nil otherwise. Space matches the information-theoretic lower bound up to a logarithmic factor, yielding a deterministic near-optimal structure. (summarized by gpt-5-mini on Feb 09 2026)
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 1 of 1 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 865 | What’s Hot and What’s Not: Tracking Most Frequent Items Dynamically | 2003 | PODS | 0.00015808172 |
Previous
Page 1 / 1
Next