| Author | Title |
| Published Regular Contributions |
|
Sapir Asraf,
Shmuel Tomi Klein and
Dana Shapira | New Compression Schemes for Natural Number Sequences |
|
Tomáš Pecka,
Jan Trávníček and
Jan Janoušek | Conversion of Finite Tree Automata to Regular Tree Expressions By State Elimination |
|
M. Oğuzhan Külekci,
Yasin Öztürk,
Elif Altunok and
Can Yılmaz Altıniğne | Enumerative Data Compression with Non-Uniquely Decodable Codes |
|
Igor O. Zavadskyi | Fast Exact Pattern Matching in a Bitstream and 256-ary Strings |
|
Simone Faro,
Thierry Lecroq and
Kunsoo Park | Fast Practical Computation of the Longest Common Cartesian Substrings of Two Strings |
|
Jan Trávníček,
Robin Obůrka,
Tomáš Pecka and
Jan Janoušek | Forward Linearised Tree Pattern Matching Using Tree Pattern Border Array |
|
Sergio De Agostino | Greedy versus Optimal Analysis of Bounded Size Dictionary Compression and On-the-Fly Distributed Computing |
|
Golnaz Badkobeh and
Maxime Crochemore | Left Lyndon Tree Construction |
|
Jacqueline W. Daykin,
DominikKoppl,
David Kübel and
Florian Stober | On Arithmetically Progressed Suffix Arrays |
|
Shunsuke Inenaga | Pointer-Machine Algorithms for Fully-Online Construction of Suffix Trees and DAWGs on Multiple Strings |
|
Mhaskar and
William F. Smyth | Simple KMP Pattern-Matching on Indeterminate Strings |
|
DominikKoppl,
Tomohiro I,
Isamu Furuya,
Yoshimasa Takabatake,
Kensuke Sakai and
Keisuke Goto | Re-Pair in Small Space |
|
Simone Faro and
Francesco Pio Marino | Reducing Time and Space in Indexed String Matching by Characters Distance Text Sampling |
|
Jorma Tarhio and
Bruce W. Watson | Tune-up for the Dead-Zone Algorithm |
