Abstract is missing.
- New Compression Schemes for Natural Number SequencesSapir Asraf, Shmuel Tomi Klein, Dana Shapira. 1-10 [doi]
- Conversion of Finite Tree Automata to Regular Tree Expressions By State EliminationTomás Pecka, Jan Trávnícek, Jan Janousek. 11-22 [doi]
- Enumerative Data Compression with Non-Uniquely Decodable CodesM. Oguzhan Külekci, Yasin Öztürk, Elif Altunok, Can Yilmaz Altinigne. 23-32 [doi]
- Fast Exact Pattern Matching in a Bitstream and 256-ary StringsIgor O. Zavadskyi. 33-47 [doi]
- Fast Practical Computation of the Longest Common Cartesian Substrings of Two StringsSimone Faro, Thierry Lecroq, Kunsoo Park. 48-60 [doi]
- Forward Linearised Tree Pattern Matching Using Tree Pattern Border ArrayJan Trávnícek, Robin Oburka, Tomás Pecka, Jan Janousek. 61-73 [doi]
- Greedy versus Optimal Analysis of Bounded Size Dictionary Compression and On-the-Fly Distributed ComputingSergio De Agostino. 74-83 [doi]
- Left Lyndon Tree ConstructionGolnaz Badkobeh, Maxime Crochemore. 84-95 [doi]
- On Arithmetically Progressed Suffix ArraysJacqueline W. Daykin, Dominik Köppl, David Kübel, Florian Stober. 96-110 [doi]
- Pointer-Machine Algorithms for Fully-Online Construction of Suffix Trees and DAWGs on Multiple StringsShunsuke Inenaga. 111-124 [doi]
- Simple KMP Pattern-Matching on Indeterminate StringsMhaskar Neerja, William F. Smyth. 125-133 [doi]
- Re-Pair in Small SpaceDominik Köppl, Tomohiro I, Isamu Furuya, Yoshimasa Takabatake, Kensuke Sakai, Keisuke Goto. 134-147 [doi]
- Reducing Time and Space in Indexed String Matching by Characters Distance Text SamplingSimone Faro, Francesco Pio Marino. 148-159 [doi]
- Tune-up for the Dead-Zone AlgorithmJorma Tarhio, Bruce W. Watson. 160-167 [doi]