default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID26th SPIRE 2019: Segovia, Spain
- Nieves R. Brisaboa, Simon J. Puglisi:
String Processing and Information Retrieval - 26th International Symposium, SPIRE 2019, Segovia, Spain, October 7-9, 2019, Proceedings. Lecture Notes in Computer Science 11811, Springer 2019, ISBN 978-3-030-32685-2
Data Compression
- Danny Hucke:
Approximation Ratios of RePair, LongestMatch and Greedy on Unary Strings. 3-15 - Arezoo Abdollahi, Neil D. B. Bruce, Shahin Kamali
, Rezaul Karim:
Lossless Image Compression Using List Update Algorithms. 16-34 - Travis Gagie, Tomohiro I, Giovanni Manzini, Gonzalo Navarro, Hiroshi Sakamoto, Yoshimasa Takabatake:
Rpair: Rescaling RePair with Rsync. 35-44
Information Retrieval
- Grigor Aslanyan, Utkarsh Porwal:
Position Bias Estimation for Unbiased Learning-to-Rank in eCommerce Search. 47-64 - Billel Aklouche, Ibrahim Bounhas, Yahya Slimani:
BM25 Beyond Query-Document Similarity. 65-79 - Anaïs Ollagnier, Hywel T. P. Williams:
Network-Based Pooling for Topic Modeling on Microblog Content. 80-87
String Algorithms
- Michele Schimd, Gianfranco Bilardi:
Bounds and Estimates on the Average Edit Distance. 91-106 - Takuya Mieno, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Compact Data Structures for Shortest Unique Substring Queries. 107-123 - Siwoo Song, Cheol Ryu, Simone Faro, Thierry Lecroq, Kunsoo Park:
Fast Cartesian Tree Matching. 124-137 - Felipe A. Louza, Sabrina Mantaci, Giovanni Manzini, Marinella Sciortino, Guilherme P. Telles:
Inducing the Lyndon Array. 138-151 - Gabriele Fici, Pawel Gawrychowski:
Minimal Absent Words in Rooted and Unrooted Trees. 152-161 - Kazuki Kai, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Tomasz Kociumaka:
On Longest Common Property Preserved Substring Queries. 162-174 - Mai Alzamel, Alessio Conte, Daniele Greco, Veronica Guerrini, Costas S. Iliopoulos, Nadia Pisanti, Nicola Prezza, Giulia Punzi, Giovanna Rosone:
Online Algorithms on Antipowers and Antiperiods. 175-188 - Alessio Conte, Roberto Grossi, Giulia Punzi, Takeaki Uno:
Polynomial-Delay Enumeration of Maximal Common Subsequences. 189-202 - Oleg Merkurev, Arseny M. Shur:
Searching Runs in Streams. 203-220 - Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Weighted Shortest Common Supersequence Problem Revisited. 221-238
Algorithms
- Yusaku Kaneta, Takeaki Uno, Hiroki Arimura:
Fast Identification of Heavy Hitters by Cached and Packed Group Testing. 241-257 - Paniz Abedin, Arnab Ganguly, Solon P. Pissis, Sharma V. Thankachan:
Range Shortest Unique Substring Queries. 258-266 - Lorenzo Beretta, Franco Maria Nardini, Roberto Trani, Rossano Venturini:
An Optimal Algorithm to Find Champions of Tournament Graphs. 267-273 - Davide Della Giustina, Nicola Prezza, Rossano Venturini:
A New Linear-Time Algorithm for Centroid Decomposition. 274-282
Computational Biology
- Timo Bingmann, Phelim Bradley, Florian Gauger, Zamin Iqbal:
COBS: A Compact Bit-Sliced Signature Index. 285-303 - Diego Díaz-Domínguez:
An Index for Sequencing Reads Based on the Colored de Bruijn Graph. 304-321 - Bastien Cazaux, Dmitry Kosolobov, Veli Mäkinen, Tuukka Norri:
Linear Time Maximum Segmentation Problems in Column Stream Model. 322-336 - Lavinia Egidi, Felipe A. Louza, Giovanni Manzini:
Space-Efficient Merging of Succinct de Bruijn Graphs. 337-351
Indexing and Compression
- N. Jesper Larsson:
Run-Length Encoding in a Finite Universe. 355-371 - Enno Ohlebusch, Pascal Weber:
On the Computation of Longest Previous Non-overlapping Factors. 372-381 - Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets. 382-391 - Jonas Ellert, Florian Kurpicz:
Parallel External Memory Wavelet Tree and Wavelet Matrix Construction. 392-406 - Johannes Bahne, Nico Bertram, Marvin Böcker, Jonas Bode, Johannes Fischer, Hermann Foot, Florian Grieskamp, Florian Kurpicz, Marvin Löbel, Oliver Magiera, Rosa Pink, David Piper, Christopher Poeplau:
SACABench: Benchmarking Suffix Array Construction. 407-416
Compressed Data Structures
- Diego Arroyuelo, Guillermo de Bernardo, Travis Gagie, Gonzalo Navarro:
Faster Dynamic Compressed d-ary Relations. 419-433 - Manuel Cáceres, Gonzalo Navarro:
Faster Repetition-Aware Compressed Suffix Trees Based on Block Trees. 434-451 - Diego Arroyuelo, Erick Sepúlveda:
A Practical Alphabet-Partitioning Rank/Select Data Structure. 452-466 - Diego Arroyuelo, Rajeev Raman:
Adaptive Succinctness. 467-481 - Dustin Cobas, Gonzalo Navarro:
Fast, Small, and Simple Document Listing on Repetitive Text Collections. 482-498 - José Fuentes-Sepúlveda, Gonzalo Navarro, Diego Seco:
Implementing the Topological Model Succinctly. 499-512 - Susana Ladra, Miguel R. Luaces, José R. Paramá, Fernando Silva-Coira:
Space- and Time-Efficient Storage of LiDAR Point Clouds. 513-527
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 2026-02-11 23:46 CET 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:
