| Author | Title |
| Invited talk |
|
Avraham N. Trahtman | The Road Coloring and Černy Conjecture |
| Published Regular Contributions |
|
Mikaël Salson,
Thierry Lecroq,
Martine Léonard and
Laurent Mouchard | Dynamic Burrows-Wheeler Transform |
|
Luigi Cinque and
Sergio De Agostino | Lossless Image Compression by Block Matching on Practical Massively Parallel Architectures |
|
Luigi Cinque,
Sergio De Agostino and
Luca Lombardi | Speeding up Lossless Image Compression: Experimental Results on a Parallel Machine |
|
Shmuel Tomi Klein and
Dana Shapira | Huffman Coding with Non-Sorted Frequencies |
|
Matthias Gallé,
Pierre Peterlongo and
François Coste | In-place Update of Suffix Array while Recoding Words |
|
Jie Lin,
Yue Jiang and
Don Adjeroh | The Virtual Suffix Tree: An Efficient Data Structure for Suffix Trees
|
|
Satoshi Deguchi,
Fumihito Higashijima,
Hideo Bannai,
Shunsuke Inenaga and
Masayuki Takeda | Parameterized Suffix Arrays for Binary Strings |
|
William F. Smyth,
Shu Wang and
Mao Yu | An Adaptive Hybrid Pattern-Matching Algorithm on Indeterminate Strings |
|
Pavlos Antoniou,
Maxime Crochemore,
Costas S. Iliopoulos,
Inuka Jayasekera and
Gad M. Landau | Conservative String Covering of Indeterminate Strings |
|
Sébastien Rebecchi and
Jean-Michel Jolion | On the Uniform Distribution of Strings |
|
Geneviève Paquin | Infinite Smooth Lyndon Words |
|
Wataru Matsubara,
Kazuhiko Kusano,
Akira Ishino,
Hideo Bannai and
Ayumi Shinohara | New Lower Bounds for the Maximum Number of Runs in a String |
|
Simone Faro and
Thierry Lecroq | Efficient Variants of the Backward-Oracle-Matching Algorithm |
|
Simon J. Puglisi,
William F. Smyth and
Munina Yusufu | Fast Optimal Algorithms for Computing All the Repeats in a String |
|
Domenico Cantone,
Salvatore Cristofaro and
Simone Faro | New Efficient Bit-Parallel Algorithms for the δ-Matching Problem with α-Bounded Gaps in Musical Sequences |
|
Kazuhiko Kusano,
Wataru Matsubara,
Akira Ishino and
Ayumi Shinohara | Average Value of Sum of Exponents of Runs in Strings |
|
Paweł Baturo,
Marcin Piątkowski and
Wojciech Rytter | Usefulness of Directed Acyclic Subword Graphs in Problems Related to Standard Sturmian Words |
|
Manolis Christodoulakis and
Gerhard Brey | Edit Distance with Single-Symbol Combinations and Splits |
|
Tinus Strauss,
Derrick G. Kourie and
Bruce W. Watson | A Concurrent Specification of an Incremental DFA Minimisation Algorithm |
|
Wikus Coetser,
Derrick G. Kourie and
Bruce W. Watson | On Regular Expression Hashing to Reduce FA Size |
