pith. sign in

Title resolution pending

Blumer, A · 1987 · arXiv 8869.28873

2 Pith papers cite this work. Polarity classification is still indexing.

2 Pith papers citing it
read on arXiv browse 2 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

cs.DS 2

years

2026 2

verdicts

UNVERDICTED 2

representative citing papers

Output-Sensitive Construction of CDAWGs from BWT-Runs

cs.DS · 2026-07-02 · unverdicted · novelty 5.0

Output-sensitive algorithm builds CDAWGs from BWT-runs in O(e_L log n log(n/r)) time and O(r log(n/r) + e_L) space using a compressed suffix tree of size O(r log(n/r)).

citing papers explorer

Showing 2 of 2 citing papers.

  • Computing Smallest Suffixient Arrays in Sublinear Time cs.DS · 2026-06-30 · unverdicted · none · ref 4

    Algorithm computes smallest suffixient arrays in sublinear time O((n log σ)/√log n + min(r, r-bar) log^ε n) when alphabet is small and BWT has few runs.

  • Output-Sensitive Construction of CDAWGs from BWT-Runs cs.DS · 2026-07-02 · unverdicted · none · ref 5

    Output-sensitive algorithm builds CDAWGs from BWT-runs in O(e_L log n log(n/r)) time and O(r log(n/r) + e_L) space using a compressed suffix tree of size O(r log(n/r)).