An O(n_A + m_A + n_D + m_D) algorithm for Wheeler determinization given the order, shown tight via a family of minimum-size maximum-output instances for any n and sigma.
In: 37th Annual Symposium on Combinatorial Pattern Matching (CPM 2026)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Tighter Bounds for Wheeler Determinization
An O(n_A + m_A + n_D + m_D) algorithm for Wheeler determinization given the order, shown tight via a family of minimum-size maximum-output instances for any n and sigma.