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	Faster Dynamic Compressed d-ary Relations.	Diego Arroyuelo, Guillermo de Bernardo, Travis Gagie, Gonzalo Navarro
2019	Online Algorithms on Antipowers and Antiperiods.	Mai Alzamel, Alessio Conte, Daniele Greco, Veronica Guerrini, Costas S. Iliopoulos, Nadia Pisanti, Nicola Prezza, Giulia Punzi, Giovanna Rosone
2019	BM25 Beyond Query-Document Similarity.	Billel Aklouche, Ibrahim Bounhas, Yahya Slimani
2019	Range Shortest Unique Substring Queries.	Paniz Abedin, Arnab Ganguly, Solon P. Pissis, Sharma V. Thankachan
2019	Lossless Image Compression Using List Update Algorithms.	Arezoo Abdollahi, Neil D. B. Bruce, Shahin Kamali, Rezaul Karim
2018	Faster and Smaller Two-Level Index for Network-Based Trajectories.	Rodrigo Rivera, M. Andrea Rodrguez, Diego Seco
2018	Fast and Effective Neural Networks for Translating Natural Language into Denotations.	Tiago Pimentel, Juliano Viana, Adriano Veloso, Nivio Ziviani
2018	Trickier XBWT Tricks.	Enno Ohlebusch, Stefan Stau, Uwe Baier
2018	Linear-Time Online Algorithm Inferring the Shortest Path from a Walk.	Shintaro Narisada, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
2018	Better Heuristic Algorithms for the Repetition Free LCS and Other Variants.	Radu Stefan Mincu, Alexandru Popa
2018	Computing Burrows-Wheeler Similarity Distributions for String Collections.	Felipe A. Louza, Guilherme P. Telles, Simon Gog, Liang Zhao
2018	Optimal In-Place Suffix Sorting.	Zhize Li, Jian Li, Hongwei Huo
2018	Recovering, Counting and Enumerating Strings from Forward and Backward Suffix Arrays.	Yuki Kuhara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2018	Faster Recovery of Approximate Periods over Edit Distance.	Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2018	Fast Wavelet Tree Construction in Practice.	Yusaku Kaneta
2018	Compressed Range Minimum Queries.	Seungbum Jo, Shay Mozes, Oren Weimann
2018	Maximal Motif Discovery in a Sliding Window.	Costas S. Iliopoulos, Manal Mohamed, Solon P. Pissis, Fatima Vayani
2018	Block Palindromes: A New Generalization of Palindromes.	Keisuke Goto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga
2018	Early Commenting Features for Emotional Reactions Prediction.	Anastasia Giachanou, Paolo Rosso, Ida Mele, Fabio Crestani
2018	The Colored Longest Common Prefix Array Computed via Sequential Scans.	Fabio Garofalo, Giovanna Rosone, Marinella Sciortino, Davide Verzotto
2018	Truncated DAWGs and Their Application to Minimal Absent Word Problem.	Yuta Fujishige, Takuya Takagi, Diptarama Hendrian
2018	On Extended Special Factors of a Word.	Panagiotis Charalampopoulos, Maxime Crochemore, Solon P. Pissis
2018	Towards a Compact Representation of Temporal Rasters.	Ana Cerdeira-Pena, Guillermo de Bernardo, Antonio Faria, Jos R. Param, Fernando Silva-Coira
2018	3DGraCT: A Grammar-Based Compressed Representation of 3D Trajectories.	Nieves R. Brisaboa, Adrin Gmez-Brandn, Miguel A. Martnez-Prieto, Jos R. Param
2018	New Structures to Solve Aggregated Queries for Trips over Public Transportation Networks.	Nieves R. Brisaboa, Antonio Faria, Daniil Galaktionov, Tirso V. Rodeiro, M. Andrea Rodrguez

176–200 of 857← Previous Next →

Comparable venues

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