Journal of Algorithms 14(3), 344–370 (1993)

Berkman, O · 1993 · arXiv 1993.1018

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

representative citing papers

cs.DS · 2026-06-30 · unverdicted · novelty 7.0

A linear-time one-pass practical algorithm for building smallest suffixient sets is presented and empirically shown to dominate prior constructions.

Showing 1 of 1 citing paper after filters.

Practical Linear-Time Computation of Smallest Suffixient Sets cs.DS · 2026-06-30 · unverdicted · none · ref 1
A linear-time one-pass practical algorithm for building smallest suffixient sets is presented and empirically shown to dominate prior constructions.