A static dictionary can now use OPT + n^ε bits for any constant ε > 0 and still answer every query in worst-case constant time.
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
-
Optimal Static Dictionary with Worst-Case Constant Query Time
A static dictionary can now use OPT + n^ε bits for any constant ε > 0 and still answer every query in worst-case constant time.