Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID28th SPIRE 2021: Lille, France
- Thierry Lecroq
, Hélène Touzet:
String Processing and Information Retrieval - 28th International Symposium, SPIRE 2021, Lille, France, October 4-6, 2021, Proceedings. Lecture Notes in Computer Science 12944, Springer 2021, ISBN 978-3-030-86691-4
Invited Papers
- Christina Boucher, Davide Cenzato, Zsuzsanna Lipták, Massimiliano Rossi, Marinella Sciortino:
r-Indexing the eBWT. 3-12 - Daniel Lemire:
Unicode at Gigabytes per Second. 13-18
Combinatorics
- Kosuke Fujita, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Longest Common Rollercoasters. 21-32 - Mitsuru Funakoshi, Takuya Mieno:
Minimal Unique Palindromic Substrings After Single-Character Substitution. 33-46 - Manuel Lafond, Binhai Zhu:
Permutation-Constrained Common String Partitions with Applications. 47-60 - Maksim S. Nikolaev:
All Instantiations of the Greedy Algorithm for the Shortest Common Superstring Problem are Equivalent. 61-67 - Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
String Covers of a Tree. 68-82
Compression
- Tooru Akagi, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Grammar Index by Induced Suffix Sorting. 85-99 - Diego Díaz-Domínguez, Gonzalo Navarro, Alejandro Pacheco:
An LMS-Based Grammar Self-index with Local Consistency Properties. 100-113 - Takumi Ideue, Takuya Mieno, Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda:
On the Approximation Ratio of LZ-End to LZ77. 114-126
Data Structures
- Christina Boucher, Davide Cenzato, Zsuzsanna Lipták, Massimiliano Rossi, Marinella Sciortino:
Computing the Original eBWT Faster, Simpler, and with Less Memory. 129-142 - Tomohiro I, Robert W. Irving, Dominik Köppl, Lorna Love:
Extracting the Sparse Longest Common Prefix Array from the Suffix Binary Search Tree. 143-150 - Lucas Robidou, Pierre Peterlongo:
findere: Fast and Precise Approximate Membership Query. 151-163
Repeats
- Hideo Bannai, Mitsuru Funakoshi, Tomohiro I, Dominik Köppl, Takuya Mieno, Takaaki Nishimoto:
A Separation of γ and b via Thue-Morse Words. 167-178 - Pawel Gawrychowski, Samah Ghazawi, Gad M. Landau:
Lower Bounds for the Number of Repetitions in 2D Strings. 179-192 - Gonzalo Navarro, Cristian Urbina:
On Stricter Reachable Repetitiveness Measures. 193-206
Information Retrieval
- Federico Albanese, Esteban Feuerstein:
Improved Topic Modeling in Twitter Through Community Pooling. 209-216 - Andrea Bruno, Franco Maria Nardini, Giulio Ermanno Pibiri, Roberto Trani, Rossano Venturini:
TSXor: A Simple Time Series Compression Algorithm. 217-223
Pattern Matching
- Avivit Levy:
Exploiting Pseudo-locality of Interchange Distance. 227-240 - Akio Nishimoto, Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga:
Position Heaps for Cartesian-Tree Matching on Strings and Tries. 241-254
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-05-15 21:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
