International Symposium on String Processing and Information Retrieval

SPIRE

CORE rank

CORE rank (raw)

Fields of research

Data Management and Data Science

Papers indexed

857

1998–2025

Best Data Science and Information Retrieval conferences

Papers per year

199845 peak2025

Most published authors

SPIRE papers

857 records sourced from DBLP. Search titles, filter by year, sort by recency.

Year	Title	Authors
2019	Searching Runs in Streams.	Oleg Merkurev, Arseny M. Shur
2019	Inducing the Lyndon Array.	Felipe A. Louza, Sabrina Mantaci, Giovanni Manzini, Marinella Sciortino, Guilherme P. Telles
2019	Run-Length Encoding in a Finite Universe.	N. Jesper Larsson
2019	Space- and Time-Efficient Storage of LiDAR Point Clouds.	Susana Ladra, Miguel R. Luaces, Jos R. Param, Fernando Silva-Coira
2019	Fast Identification of Heavy Hitters by Cached and Packed Group Testing.	Yusaku Kaneta, Takeaki Uno, Hiroki Arimura
2019	On Longest Common Property Preserved Substring Queries.	Kazuki Kai, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Tomasz Kociumaka
2019	Approximation Ratios of RePair, LongestMatch and Greedy on Unary Strings.	Danny Hucke
2019	A New Linear-Time Algorithm for Centroid Decomposition.	Davide Della Giustina, Nicola Prezza, Rossano Venturini
2019	Rpair: Rescaling RePair with Rsync.	Travis Gagie, Tomohiro I, Giovanni Manzini, Gonzalo Navarro, Hiroshi Sakamoto, Yoshimasa Takabatake
2019	Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets.	Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019	Minimal Absent Words in Rooted and Unrooted Trees.	Gabriele Fici, Pawel Gawrychowski
2019	Parallel External Memory Wavelet Tree and Wavelet Matrix Construction.	Jonas Ellert, Florian Kurpicz
2019	Space-Efficient Merging of Succinct de Bruijn Graphs.	Lavinia Egidi, Felipe A. Louza, Giovanni Manzini
2019	An Index for Sequencing Reads Based on the Colored de Bruijn Graph.	Diego Daz-Domnguez
2019	Polynomial-Delay Enumeration of Maximal Common Subsequences.	Alessio Conte, Roberto Grossi, Giulia Punzi, Takeaki Uno
2019	Fast, Small, and Simple Document Listing on Repetitive Text Collections.	Dustin Cobas, Gonzalo Navarro
2019	Weighted Shortest Common Supersequence Problem Revisited.	Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2019	Linear Time Maximum Segmentation Problems in Column Stream Model.	Bastien Cazaux, Dmitry Kosolobov, Veli Mkinen, Tuukka Norri
2019	Faster Repetition-Aware Compressed Suffix Trees Based on Block Trees.	Manuel Cceres, Gonzalo Navarro
2019	COBS: A Compact Bit-Sliced Signature Index.	Timo Bingmann, Phelim Bradley, Florian Gauger, Zamin Iqbal
2019	An Optimal Algorithm to Find Champions of Tournament Graphs.	Lorenzo Beretta, Franco Maria Nardini, Roberto Trani, Rossano Venturini
2019	SACABench: Benchmarking Suffix Array Construction.	Johannes Bahne, Nico Bertram, Marvin Bcker, Jonas Bode, Johannes Fischer, Hermann Foot, Florian Grieskamp, Florian Kurpicz, Marvin Lbel, Oliver Magiera, Rosa Pink, David Piper, Christopher Poeplau
2019	Position Bias Estimation for Unbiased Learning-to-Rank in eCommerce Search.	Grigor Aslanyan, Utkarsh Porwal
2019	A Practical Alphabet-Partitioning Rank/Select Data Structure.	Diego Arroyuelo, Erick Seplveda
2019	Adaptive Succinctness.	Diego Arroyuelo, Rajeev Raman

151–175 of 857← Previous Next →

Comparable venues

Other A*/A conferences filed under the same field of research.