Abstract is missing.
- Approximation Ratios of \mathsf RePair , \mathsf LongestMatch and \mathsf Greedy on Unary StringsDanny Hucke. 3-15 [doi]
- Lossless Image Compression Using List Update AlgorithmsArezoo Abdollahi, Neil D. B. Bruce, Shahin Kamali, Rezaul Karim. 16-34 [doi]
- Rpair: Rescaling RePair with RsyncTravis Gagie, Tomohiro I, Giovanni Manzini, Gonzalo Navarro, Hiroshi Sakamoto, Yoshimasa Takabatake. 35-44 [doi]
- Position Bias Estimation for Unbiased Learning-to-Rank in eCommerce SearchGrigor Aslanyan, Utkarsh Porwal. 47-64 [doi]
- BM25 Beyond Query-Document SimilarityBillel Aklouche, Ibrahim Bounhas, Yahya Slimani. 65-79 [doi]
- Network-Based Pooling for Topic Modeling on Microblog ContentAnaïs Ollagnier, Hywel Williams. 80-87 [doi]
- Bounds and Estimates on the Average Edit DistanceMichele Schimd, Gianfranco Bilardi. 91-106 [doi]
- Compact Data Structures for Shortest Unique Substring QueriesTakuya Mieno, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. 107-123 [doi]
- Fast Cartesian Tree MatchingSiwoo Song, Cheol Ryu, Simone Faro, Thierry Lecroq, Kunsoo Park. 124-137 [doi]
- Inducing the Lyndon ArrayFelipe Alves Louza, Sabrina Mantaci, Giovanni Manzini, Marinella Sciortino, Guilherme P. Telles. 138-151 [doi]
- Minimal Absent Words in Rooted and Unrooted TreesGabriele Fici, Pawel Gawrychowski. 152-161 [doi]
- On Longest Common Property Preserved Substring QueriesKazuki Kai, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Tomasz Kociumaka. 162-174 [doi]
- Online Algorithms on Antipowers and AntiperiodsMai Alzamel, Alessio Conte, Daniele Greco, Veronica Guerrini, Costas S. Iliopoulos, Nadia Pisanti, Nicola Prezza, Giulia Punzi, Giovanna Rosone. 175-188 [doi]
- Polynomial-Delay Enumeration of Maximal Common SubsequencesAlessio Conte, Roberto Grossi, Giulia Punzi, Takeaki Uno. 189-202 [doi]
- Searching Runs in StreamsOleg Merkurev, Arseny M. Shur. 203-220 [doi]
- Weighted Shortest Common Supersequence Problem RevisitedPanagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba. 221-238 [doi]
- Fast Identification of Heavy Hitters by Cached and Packed Group TestingYusaku Kaneta, Takeaki Uno, Hiroki Arimura. 241-257 [doi]
- Range Shortest Unique Substring QueriesPaniz Abedin, Arnab Ganguly 0002, Solon P. Pissis, Sharma V. Thankachan. 258-266 [doi]
- An Optimal Algorithm to Find Champions of Tournament GraphsLorenzo Beretta, Franco Maria Nardini, Roberto Trani, Rossano Venturini. 267-273 [doi]
- A New Linear-Time Algorithm for Centroid DecompositionDavide Della Giustina, Nicola Prezza, Rossano Venturini. 274-282 [doi]
- COBS: A Compact Bit-Sliced Signature IndexTimo Bingmann, Phelim Bradley, Florian Gauger, Zamin Iqbal. 285-303 [doi]
- An Index for Sequencing Reads Based on the Colored de Bruijn GraphDiego Díaz-Domínguez. 304-321 [doi]
- Linear Time Maximum Segmentation Problems in Column Stream ModelBastien Cazaux, Dmitry Kosolobov, Veli Mäkinen, Tuukka Norri. 322-336 [doi]
- Space-Efficient Merging of Succinct de Bruijn GraphsLavinia Egidi, Felipe Alves Louza, Giovanni Manzini. 337-351 [doi]
- Run-Length Encoding in a Finite UniverseN. Jesper Larsson. 355-371 [doi]
- On the Computation of Longest Previous Non-overlapping FactorsEnno Ohlebusch, Pascal Weber. 372-381 [doi]
- Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant AlphabetsNoriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. 382-391 [doi]
- Parallel External Memory Wavelet Tree and Wavelet Matrix ConstructionJonas Ellert, Florian Kurpicz. 392-406 [doi]
- SACABench: Benchmarking Suffix Array ConstructionJohannes Bahne, Nico Bertram, Marvin Böcker, Jonas Bode, Johannes Fischer 0001, Hermann Foot, Florian Grieskamp, Florian Kurpicz, Marvin Löbel, Oliver Magiera, Rosa Pink, David Piper, Christopher Poeplau. 407-416 [doi]
- Faster Dynamic Compressed d-ary RelationsDiego Arroyuelo, Guillermo de Bernardo, Travis Gagie, Gonzalo Navarro. 419-433 [doi]
- Faster Repetition-Aware Compressed Suffix Trees Based on Block TreesManuel Cáceres, Gonzalo Navarro. 434-451 [doi]
- A Practical Alphabet-Partitioning Rank/Select Data StructureDiego Arroyuelo, Erick Sepúlveda. 452-466 [doi]
- Adaptive SuccinctnessDiego Arroyuelo, Rajeev Raman. 467-481 [doi]
- Fast, Small, and Simple Document Listing on Repetitive Text CollectionsDustin Cobas, Gonzalo Navarro. 482-498 [doi]
- Implementing the Topological Model SuccinctlyJosé Fuentes Sepúlveda, Gonzalo Navarro, Diego Seco. 499-512 [doi]
- Space- and Time-Efficient Storage of LiDAR Point CloudsSusana Ladra, Miguel R. Luaces, José R. Paramá, Fernando Silva-Coira. 513-527 [doi]