scientific article; zbMATH DE number 6850408
From MaRDI portal
Publication:4607988
zbMath1403.68372arXiv1511.02612MaRDI QIDQ4607988
Paweł Gawrychowski, Piotr Sankowski, Adam Karczmarz, Tomasz Kociumaka, Jakub Łącki
Publication date: 15 March 2018
Full work available at URL: https://arxiv.org/abs/1511.02612
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05) Algorithms on strings (68W32)
Related Items (12)
Dynamic layers of maxima with applications to dominating queries ⋮ Shortest unique palindromic substring queries in semi-dynamic settings ⋮ Data structures for computing unique palindromes in static and non-static strings ⋮ Sensitivity of string compressors and repetitiveness measures ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Dynamic and internal longest common substring ⋮ Practical Performance of Space Efficient Data Structures for Longest Common Extensions. ⋮ Repetition Detection in a Dynamic String ⋮ Dynamic index and LZ factorization in compressed space ⋮ Longest common substring made fully dynamic ⋮ Online algorithms for constructing linear-size suffix trie
This page was built for publication: