×

Found 7 Documents (Results 1–7)

Faster online computation of the succinct longest previous factor array. (English) Zbl 07633522

Anselmo, Marcella (ed.) et al., Beyond the horizon of computability. 16th conference on computability in Europe, CiE 2020, Fisciano, Italy, June 29 – July 3, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12098, 339-352 (2020).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI

Optimal rank and select queries on dictionary-compressed text. (English) Zbl 07559172

Pisanti, Nadia (ed.) et al., 30th annual symposium on combinatorial pattern matching, CPM 2019, Pisa, Italy, June 18–20, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 128, Article 4, 12 p. (2019).
MSC:  68W32
PDFBibTeX XMLCite
Full Text: DOI arXiv

Flexible indexing of repetitive collections. (English) Zbl 1489.68056

Kari, Jarkko (ed.) et al., Unveiling dynamics and complexity. 13th conference on computability in Europe, CiE 2017, Turku, Finland, June 12–16, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10307, 162-174 (2017).
MSC:  68P05 68P30 68W32
PDFBibTeX XMLCite
Full Text: DOI Link

Composite repetition-aware data structures. (English) Zbl 1432.68082

Cicalese, Ferdinando (ed.) et al., Combinatorial pattern matching. 26th annual symposium, CPM 2015, Ischia Island, Italy, June 29 – July 1, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9133, 26-39 (2015).
MSC:  68P05 68W32
PDFBibTeX XMLCite
Full Text: DOI arXiv

Filter Results by …

Document Type

all top 5

Year of Publication

Main Field