Programme
Tuesday June 17th
08:30 - 08:50: Registration
08:50 - 09:00 Opening
09:00 - 10:00 Keynote Talk 1
(Chair: Paola Bonizzoni)
Kunihiko Sadakane.
Compressed Suffix Arrays and Suffix Trees Revisited
10:00 - 10:20: Coffee break
10:20 - 12:20: Contributed talks 1 [combinatorics]
(Chair: NN)
|
|
| 10:20 - 10:40 |
Dirk Nowotka, Max Wiedenhöft.
The Equivalence Problem of E-Pattern Languages with Length Constraints is Undecidable |
| 10:40 - 11:00 |
Marcella Anselmo, Giuseppa Castiglione, Manuela Flores, Dora Giammarresi, Maria Madonia, Sabrina Mantaci.
A Family of Partial Cubes with Minimal Fibonacci Dimension |
| 11:00 - 11:20 |
Gabriele Fici, Jeffrey Shallit, Jamie Simpson.
On Palindromic Periodicities |
| 11:20 - 11:40 |
Bowie Liu, Dennis Wong, Chan-Tong Lam, Sio-Kei Im.
Generating a cyclic 2-Gray code for Lucas words in constant amortized time |
| 11:40 - 12:00 |
Peaker Guo, Kaisei Kishi.
Net Occurrences in Fibonacci and Thue-Morse Words |
12:00 - 13:30: Lunch break
13:30 - 14:00: Highlight Talk 1
(Chair: NN)
|
|
|
Michal Koucký.
Almost Linear Size Edit Distance Sketch (STOC 2024) |
14:00 - 15:00: Contributed talks 2 [graphs and automata]
(Chair: NN)
|
|
| 14:00 - 14:20 |
Riccardo Dondi, Alexandru Popa.
Representing Paths in Digraphs |
| 14:20 - 14:40 |
Wiktor Zuba, Oded Lachish, Solon Pissis.
Shortest Undirected Paths in de Bruijn Graphs |
| 14:40 - 15:00 |
Ruben Becker, Nicola Cotumaccio, Sung-Hwan Kim, Nicola Prezza, Carlo Tosoni.
Encoding Co-Lex Orders of Finite-State Automata in Linear Space |
15:00 - 15:30: Coffee break
15:30 - 17:00: Contributed talks 3 [matching and comparison]
(Chair: NN)
|
|
| 15:30 - 16:00 |
Solon Pissis, Jakub Radoszewski Wiktor Zuba (part A); Pawel Gawrychowski, Adam Górkiewicz, Pola Marciniak, Solon Pissis, Karol Pokorski (part B).
Faster Approximate Elastic-Degenerate String Matching |
| 16:00 - 16:20 |
Nicola Cotumaccio.
Improved Circular Dictionary Matching |
| 16:20 - 16:40 |
Nikita Gaevoy, Boris Zolotov, Alexander Tiskin.
Doubly-periodic string comparison |
| 16:40 - 17:00 |
Eric Osterkamp, Dominik Köppl.
Extending the Burrows-Wheeler Transform for Cartesian Tree Matching, Constructing It |
17:00 - 17:15: Break
17:15 - 18:15: Business meeting
Wednesday June 18th
09:00 - 10:00 Keynote Talk 2
(Chair: Veli Mäkinen)
Nicola Prezza.
Suffixient Arrays: a new Efficient Suffix Array Compression Technique
10:00 - 10:20: Coffee break
10:20 - 10:40: Contributed talks 4 [indexing]
(Chair: NN)
|
|
| 10:20 - 10:40 |
Paolo Ferragina, Filippo Lari.
FL-RMQ: A learned approach to range minimum queries |
| 10:40 - 11:00 |
Hideo Bannai, Philip Bille, Inge Li Gørtz, Gad M. Landau, Gonzalo Navarro, Nicola Prezza, Teresa Anna Steiner, Simon Rumle Tarnow.
Text Indexing for Simple Regular Expressions |
| 11:00 - 11:20 |
Waseem Akram, Takuya Mieno.
Sorted Consecutive Occurrence Queries in Substrings |
| 11:20 - 11:40 |
Seungbum Jo, Srinivasa Rao Satti.
Encodings for Range Minimum Queries over Bounded Alphabets |
| 11:40 - 12:00 |
Simon R. Tarnow, Philip Bille, Inge Li Gørtz.
Succinct Data Structures for Segments |
12:00 - 13:00: Lunch break
13:00 - 18:30: Excursion
18:30 - 21:00: Conference dinner
Thursday June 19th
09:00 - 10:00 Keynote Talk 3
(Chair: Gianluca Della Vedova)
Inge Li Gørtz.
Locality Sensitive Hashing and Compressed Computation
10:00 - 10:20: Coffee break
10:20 - 12:00 Contributed talks 5 [space optimization]
(Chair: NN)
|
|
| 10:20 - 10:40 |
Itai Boneh, Shay Golan.
Covers in Optimal Space |
| 10:40 - 11:00 |
Hideo Bannai, Tomohiro I, Yuto Nakashima.
On the compressiveness of the Burrows-Wheeler transform |
| 11:00 - 11:20 |
Takuya Mieno, Shunsuke Inenaga.
Space-Efficient Online Computation of String Net Occurrences |
| 11:20 - 11:40 |
Jarno N. Alanko, Ruben Becker, Davide Cenzato, Travis Gagie, Sung-Hwan Kim, Bojana Kodric, Nicola Prezza.
The Trie Measure, Revisited |
| 11:40 - 12:00 |
Yoshifumi Sakai.
Linear-space LCS enumeration for two strings |
12:00 - 13:30: Lunch break
13:30 - 14:00: Highlight Talk 2
(Chair: NN)
|
|
| 13:30 - 14:00 |
David Koslicki.
Prokrustean Graph: A substring index for rapid k-mer size analysis (RECOMB 2025) |
14:00 - 15:00: Contributed talks 6 [run-length compression]
(Chair: NN)
|
|
| 14:00 - 14:20 |
Gonzalo Navarro, Alejandro Pacheco.
Counting on General Run-Length Grammars |
| 14:20 - 14:40 |
Yuto Iguchi, Ryo Yoshinaka, Ayumi Shinohara.
Pattern Matching on Run-Length Grammar-Compressed Strings in Linear Time |
| 14:40 - 15:00 |
Philip Bille, Inge Li Gørtz, Simon Puglisi, Simon R. Tarnow.
Compressed Dictionary Matching on Run-Length Encoded Strings |
15:00 - 15:30
Coffee break
15:30 - 16:30: Contributed talks 7 [string algorithms]
(Chair: NN)
|
|
| 15:30 - 15:50 |
Shay Golan, Matan Kraus.
String Problems in the Congested Clique Model |
| 15:50 - 16:10 |
Cyril Nicaud, Carine Pivoteau, Stéphane Vialette.
Branch Prediction Analysis of Morris-Pratt and Knuth-Morris-Pratt Algorithms |
| 16:10 - 16:30 |
Jonas Ellert, Paweł Gawrychowski, Tatiana Starikovskaya.
Minimal Generators in Optimal Time |
16:30: Closing
