FeAVL achieves fully persistent dynamic LCE with O(log n) updates and equality, O(log n + log²ℓ) LCE w.h.p., and an AVL grammar version with O(g0 + I + U log n_max) permanent nodes.
Cambridge Uni- versity Press (2023)
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
-
Fully Persistent Dynamic LCE via AVL Trees and AVL Grammars
FeAVL achieves fully persistent dynamic LCE with O(log n) updates and equality, O(log n + log²ℓ) LCE w.h.p., and an AVL grammar version with O(g0 + I + U log n_max) permanent nodes.