Every string admits a substring equation system representation of size O(χ(w)), providing the first such scheme for the repetitiveness measure χ.
On computing the smallest suffixient set
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DS 2years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
New algorithms compute shortest unique and absent substrings in O(n log σ / sqrt(log n)) time by decomposing on length and period then reducing to geometric queries via synchronizing sets, runs, and wavelet trees.
citing papers explorer
-
String Representation in Suffixient Set Size Space
Every string admits a substring equation system representation of size O(χ(w)), providing the first such scheme for the repetitiveness measure χ.
-
Faster Algorithms for Shortest Unique or Absent Substrings
New algorithms compute shortest unique and absent substrings in O(n log σ / sqrt(log n)) time by decomposing on length and period then reducing to geometric queries via synchronizing sets, runs, and wavelet trees.