Presents first linear-space data structures answering path mode and least frequent element queries in O(sqrt(n/w)) time after O(n sqrt(n w)) preprocessing, improving prior O(log log n sqrt(n/w)) bounds, plus faster alpha-minority and a general path maximum g-value color framework.
Scandinavian Workshop on Algorithm Theory , pages=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Faster Linear-Space Data Structures for Path Frequency Queries
Presents first linear-space data structures answering path mode and least frequent element queries in O(sqrt(n/w)) time after O(n sqrt(n w)) preprocessing, improving prior O(log log n sqrt(n/w)) bounds, plus faster alpha-minority and a general path maximum g-value color framework.