| Author | Title |
| Invited talk |
|
Bořivoj Melichar | Graphs and Automata |
| Published Regular Contributions |
|
Simone Faro | Swap Matching in Strings by Simulating Reactive Automata |
|
Stavros Konstantinidis and
Joshua Young | Deciding the Density Type of a Given Regular Language |
|
Kazuhiko Kusano,
Kazuyuki Narisawa and
Ayumi Shinohara | On Morphisms Generating Run-Rich Strings |
|
Marcin Piątkowski | The Sum of Exponents of Maximal Repetitions in Standard Sturmian Words |
|
Dmitry Kosolobov,
Mikhail Rubinchik and
Arseny M. Shur | Finding Distinct Subpalindromes Online |
|
Ali Alatabbi,
Costas S. Iliopoulos and
Mohammad Sohel Rahman | Maximal Palindromic Factorization |
|
Simone Faro and
M. Oğuzhan Külekci | Towards a Very Fast Multiple String Matching Algorithm for Short Patterns |
|
Domenico Cantone and
Simone Faro | Improved and Self-Tuned Occurrence Heuristics |
|
Shiho Sugimoto,
Tomohiro I,
Shunsuke Inenaga,
Hideo Bannai and
Masayuki Takeda | Computing Reversed Lempel-Ziv Factorization Online |
|
Sabrina Mantaci,
Antonio Restivo,
Giovanna Rosone and
Marinella Sciortino | Sorting Suffixes of a Text via its Lyndon Factorization |
|
Michael Hirsch,
Ariel Ish-Shalom and
Shmuel Tomi Klein | Optimal Partitioning of Data Chunks in Deduplication Systems |
|
Matthew Felice Pace and
Alexander Tiskin | Parallel Suffix Array Construction by Accelerated Sampling |
|
Shuhei Denzumi,
Koji Tsuda,
Hiroki Arimura and
Shin-ichi Minato | Compact Complete Inverted Files for Texts and Directed Acyclic Graphs Based on Sequence Binary Decision Diagrams |
|
Juha Kärkkäinen,
Dominik Kempa and
Simon J. Puglisi | Crochemore's String Matching Algorithm: Simplification, Extensions, Applications |
|
Loek Cleophas,
Derrick G. Kourie and
Bruce W. Watson | Weak Factor Automata: Comparing (Failure) Oracles and Storacles |
|
Dipankar Ranjan Baisya,
Mir Md. Faysal and
Mohammad Sohel Rahman | Degenerate String Reconstruction from Cover Arrays |
