Dynamic range minimum queries and updates can be solved in O(log log log n) time on the ultra-wide word RAM with O(n) space.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Dynamic Range Minimum Queries on the Ultra-Wide Word RAM
Dynamic range minimum queries and updates can be solved in O(log log log n) time on the ultra-wide word RAM with O(n) space.