Accepted Papers

First round

Yoshifumi Sakai. Linear-space LCS enumeration for two strings
Shay Golan and Matan Kraus. String Problems in the Congested Clique Model
Paolo Ferragina and Filippo Lari. FL-RMQ: A learned approach to range minimum queries
Solon Pissis, Jakub Radoszewski and Wiktor Zuba. Faster Approximate Elastic-Degenerate String Matching
Wiktor Zuba, Oded Lachish and Solon Pissis. Shortest Undirected Paths in de Bruijn Graphs
Nikita Gaevoy, Boris Zolotov and Alexander Tiskin. Doubly-periodic string comparison
Jonas Ellert, Paweł Gawrychowski and Tatiana Starikovskaya. Minimal Generators in Optimal Time
Hideo Bannai, Tomohiro I and Yuto Nakashima. On the compressiveness of the Burrows-Wheeler transform
Jarno N. Alanko, Ruben Becker, Davide Cenzato, Travis Gagie, Sung-Hwan Kim, Bojana Kodric and Nicola Prezza. The Trie Measure, Revisited
Philip Bille, Inge Li Gørtz, Simon Puglisi and Simon R. Tarnow. Compressed Dictionary Matching on Run-Length Encoded Strings
Takuya Mieno and Shunsuke Inenaga. Space-Efficient Online Computation of String Net Occurrences
Waseem Akram and Takuya Mieno. Sorted Consecutive Occurrence Queries in Substrings
Eric Osterkamp and Dominik Köppl. Extending the Burrows-Wheeler Transform for Cartesian Tree Matching and Constructing It
Simon R. Tarnow, Philip Bille and Inge Li Gørtz. Succinct Data Structures for Segments

TBA