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
2022	The Complexity of the Co-occurrence Problem.	Philip Bille, Inge Li Grtz, Tord Stordalen
2022	Maximal Closed Substrings.	Golnaz Badkobeh, Alessandro De Luca, Gabriele Fici, Simon J. Puglisi
2022	Reconstructing Parameterized Strings from Parameterized Suffix and LCP Arrays.	Amihood Amir, Concettina Guerra, Eitan Kondratovsky, Gad M. Landau, Shoshana Marcus, Dina Sokol
2021	findere: Fast and Precise Approximate Membership Query.	Lucas Robidou, Pierre Peterlongo
2021	String Covers of a Tree.	Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2021	Position Heaps for Cartesian-Tree Matching on Strings and Tries.	Akio Nishimoto, Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga
2021	All Instantiations of the Greedy Algorithm for the Shortest Common Superstring Problem are Equivalent.	Maksim S. Nikolaev
2021	On Stricter Reachable Repetitiveness Measures.	Gonzalo Navarro, Cristian Urbina
2021	Exploiting Pseudo-locality of Interchange Distance.	Avivit Levy
2021	Unicode at Gigabytes per Second.	Daniel Lemire
2021	Permutation-Constrained Common String Partitions with Applications.	Manuel Lafond, Binhai Zhu
2021	Extracting the Sparse Longest Common Prefix Array from the Suffix Binary Search Tree.	Tomohiro I, Robert W. Irving, Dominik Kppl, Lorna Love
2021	On the Approximation Ratio of LZ-End to LZ77.	Takumi Ideue, Takuya Mieno, Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda
2021	Lower Bounds for the Number of Repetitions in 2D Strings.	Pawel Gawrychowski, Samah Ghazawi, Gad M. Landau
2021	Minimal Unique Palindromic Substrings After Single-Character Substitution.	Mitsuru Funakoshi, Takuya Mieno
2021	Longest Common Rollercoasters.	Kosuke Fujita, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2021	An LMS-Based Grammar Self-index with Local Consistency Properties.	Diego Daz-Domnguez, Gonzalo Navarro, Alejandro Pacheco
2021	TSXor: A Simple Time Series Compression Algorithm.	Andrea Bruno, Franco Maria Nardini, Giulio Ermanno Pibiri, Roberto Trani, Rossano Venturini
2021	Computing the Original eBWT Faster, Simpler, and with Less Memory.	Christina Boucher, Davide Cenzato, Zsuzsanna Liptk, Massimiliano Rossi, Marinella Sciortino
2021	r-Indexing the eBWT.	Christina Boucher, Davide Cenzato, Zsuzsanna Liptk, Massimiliano Rossi, Marinella Sciortino
2021	A Separation of γ and b via Thue-Morse Words.	Hideo Bannai, Mitsuru Funakoshi, Tomohiro I, Dominik Kppl, Takuya Mieno, Takaaki Nishimoto
2021	Improved Topic Modeling in Twitter Through Community Pooling.	Federico Albanese, Esteban Feuerstein
2021	Grammar Index by Induced Suffix Sorting.	Tooru Akagi, Dominik Kppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2020	Measuring Controversy in Social Networks Through NLP.	Juan Manuel Ortiz de Zarate, Marco Di Giovanni, Esteban Zindel Feuerstein, Marco Brambilla
2020	Navigating Forest Straight-Line Programs in Constant Time.	Carl Philipp Reh, Kurt Sieber

101–125 of 857← Previous Next →

Comparable venues

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