| 2024 | Faster and Simpler Online/Sliding Rightmost Lempel-Ziv Factorizations. | Wataru Sumiyoshi, Takuya Mieno, Shunsuke Inenaga |
| 2024 | LZ78 Substring Compression with CDAWGs. | Hiroki Shibata, Dominik Kppl |
| 2024 | Computing String Covers in Sublinear Time. | Jakub Radoszewski, Wiktor Zuba |
| 2024 | Faster Algorithms for Ranking/Unranking Bordered and Unbordered Words. | Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2024 | Faster Computation of Chinese Frequent Strings and Their Net Frequencies. | Enno Ohlebusch, Thomas Bchler, Jannik Olbrich |
| 2024 | Greedy Conjecture for the Shortest Common Superstring Problem and Its Strengthenings. | Maksim S. Nikolaev |
| 2024 | Compressed Graph Representations for Evaluating Regular Path Queries. | Gonzalo Navarro, Josefa Robert |
| 2024 | Adaptive Dynamic Bitvectors. | Gonzalo Navarro |
| 2024 | 2d Side-Sharing Tandems with Mismatches. | Shoshana Marcus, Dina Sokol, Sarah Zelikovitz |
| 2024 | All-Pairs Suffix-Prefix on Dynamic Set of Strings. | Masaru Kikuchi, Shunsuke Inenaga |
| 2024 | Another Virtue of Wavelet Forests. | Aaron Hong, Christina Boucher, Travis Gagie, Yansong Li, Norbert Zeh |
| 2024 | On the Number of Non-equivalent Parameterized Squares in a String. | Rikuya Hamai, Kazushi Taketsugu, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai |
| 2024 | Online Computation of String Net Frequency. | Peaker Guo, Seeun William Umboh, Anthony Wirth, Justin Zobel |
| 2024 | Quantum Algorithms for Longest Common Substring with a Gap. | Daniel Gibney, Md. Helal Hossen |
| 2024 | Simultaneously Building and Reconciling a Synteny Tree. | Mathieu Gascon, Matto Delabre, Nadia El-Mabrouk |
| 2024 | Bounded-Ratio Gapped String Indexing. | Arnab Ganguly, Daniel Gibney, Paul Macnichol, Sharma V. Thankachan |
| 2024 | Logarithmic-Time Internal Pattern Matching Queries in Compressed and Dynamic Texts. | Anouk Duyster, Tomasz Kociumaka |
| 2024 | Revisiting the Folklore Algorithm for Random Access to Grammar-Compressed Strings. | Alan M. Cleary, Joseph Winjum, Jordan Dood, Shunsuke Inenaga |
| 2024 | On Computing the Smallest Suffixient Set. | Davide Cenzato, Francisco Olivares, Nicola Prezza |
| 2024 | Generalization of Repetitiveness Measures for Two-Dimensional Strings. | Lorenzo Carfagna, Giovanni Manzini, Giuseppe Romana, Marinella Sciortino, Cristian Urbina |
| 2024 | Burst Edit Distance. | Itai Boneh, Shay Golan, Avivit Levy, Ely Porat, B. Riva Shalom |
| 2024 | Indexing Finite-State Automata Using Forward-Stable Partitions. | Ruben Becker, Sung-Hwan Kim, Nicola Prezza, Carlo Tosoni |
| 2024 | Bijective BWT Based Compression Schemes. | Golnaz Badkobeh, Hideo Bannai, Dominik Kppl |
| 2024 | Linear Time Reconstruction of Parameterized Strings from Parameterized Suffix and LCP Arrays for Constant-Sized Alphabets. | Amihood Amir, Eitan Kondratovsky, Shoshana Marcus, Dina Sokol |
| 2023 | Binary Mixed-Digit Data Compression Codes. | Igor Zavadskyi, Maksym Kovalchuk |