default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID31st SPIRE 2024: Puerto Vallarta, Mexico
- Zsuzsanna Lipták
, Edleno Silva de Moura, Karina Figueroa, Ricardo Baeza-Yates:
String Processing and Information Retrieval - 31st International Symposium, SPIRE 2024, Puerto Vallarta, Mexico, September 23-25, 2024, Proceedings. Lecture Notes in Computer Science 14899, Springer 2025, ISBN 978-3-031-72199-1 - Amihood Amir, Eitan Kondratovsky, Shoshana Marcus, Dina Sokol:
Linear Time Reconstruction of Parameterized Strings from Parameterized Suffix and LCP Arrays for Constant-Sized Alphabets. 1-15 - Golnaz Badkobeh, Hideo Bannai, Dominik Köppl:
Bijective BWT Based Compression Schemes. 16-25 - Ruben Becker, Sung-Hwan Kim, Nicola Prezza, Carlo Tosoni:
Indexing Finite-State Automata Using Forward-Stable Partitions. 26-40 - Itai Boneh, Shay Golan, Avivit Levy, Ely Porat, B. Riva Shalom:
Burst Edit Distance. 41-56 - Lorenzo Carfagna, Giovanni Manzini, Giuseppe Romana, Marinella Sciortino, Cristian Urbina:
Generalization of Repetitiveness Measures for Two-Dimensional Strings. 57-72 - Davide Cenzato, Francisco Olivares, Nicola Prezza:
On Computing the Smallest Suffixient Set. 73-87 - Alan M. Cleary, Joseph Winjum, Jordan Dood, Shunsuke Inenaga:
Revisiting the Folklore Algorithm for Random Access to Grammar-Compressed Strings. 88-101 - Anouk Duyster, Tomasz Kociumaka:
Logarithmic-Time Internal Pattern Matching Queries in Compressed and Dynamic Texts. 102-117 - Arnab Ganguly, Daniel Gibney, Paul Macnichol, Sharma V. Thankachan:
Bounded-Ratio Gapped String Indexing. 118-126 - Mathieu Gascon, Mattéo Delabre, Nadia El-Mabrouk:
Simultaneously Building and Reconciling a Synteny Tree. 127-142 - Daniel Gibney, Md. Helal Hossen:
Quantum Algorithms for Longest Common Substring with a Gap. 143-158 - Peaker Guo, Seeun William Umboh, Anthony Wirth, Justin Zobel:
Online Computation of String Net Frequency. 159-173 - Rikuya Hamai, Kazushi Taketsugu, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai:
On the Number of Non-equivalent Parameterized Squares in a String. 174-183 - Aaron Hong, Christina Boucher, Travis Gagie, Yansong Li, Norbert Zeh:
Another Virtue of Wavelet Forests. 184-191 - Masaru Kikuchi, Shunsuke Inenaga:
All-Pairs Suffix-Prefix on Dynamic Set of Strings. 192-203 - Gonzalo Navarro:
Adaptive Dynamic Bitvectors. 204-217 - Gonzalo Navarro, Josefa Robert:
Compressed Graph Representations for Evaluating Regular Path Queries. 218-232 - Maksim S. Nikolaev:
Greedy Conjecture for the Shortest Common Superstring Problem and Its Strengthenings. 233-248 - Enno Ohlebusch, Thomas Büchler, Jannik Olbrich:
Faster Computation of Chinese Frequent Strings and Their Net Frequencies. 249-256 - Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Faster Algorithms for Ranking/Unranking Bordered and Unbordered Words. 257-271 - Jakub Radoszewski, Wiktor Zuba:
Computing String Covers in Sublinear Time. 272-288 - Hiroki Shibata, Dominik Köppl:
LZ78 Substring Compression with CDAWGs. 289-305 - Shoshana Marcus, Dina Sokol, Sarah Zelikovitz:
2d Side-Sharing Tandems with Mismatches. 306-320 - Wataru Sumiyoshi, Takuya Mieno, Shunsuke Inenaga:
Faster and Simpler Online/Sliding Rightmost Lempel-Ziv Factorizations. 321-335 - Akito Takasaka, Tomohiro I:
Space-Efficient SLP Encoding for O(log N)-Time Random Access. 336-347 - Yuki Yonemoto, Shunsuke Inenaga:
Simple Linear-Time Repetition Factorization. 348-361
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 2025-06-16 11:43 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:
