Abstract is missing.
- Theoretical Perspectives on Algorithmic Choices Made in Programming LanguagesCyril Nicaud. 1 [doi]
- Computing SEQ-IC-LCS of Labeled GraphsYuuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga. 3-17 [doi]
- Tandem Duplication Parameterized by the Length DifferencePeter Damaschke. 18-29 [doi]
- Improved Practical Algorithms to Compute Maximal CoversHolly Koponen, Mhaskar Neerja, William F. Smyth. 30-41 [doi]
- Periodicity of Degenerate StringsEstéban Gabory, Eric Rivals, Michelle Sweering, Hilde Verbeek, Pengfei Wang. 42-56 [doi]
- Approximate String Searching with AVX2 and AVX-512Tamanna Chhabra, Sukhpal Singh Ghuman, Jorma Tarhio. 57-67 [doi]
- On Expressive Power of Regular Expressions with Subroutine Calls and Lookaround AssertionsOndrej Guth. 68-82 [doi]
- Efficient Integer Retrieval from Unordered Compressed SequencesIgor O. Zavadskyi. 83-96 [doi]
- Selective Weighted Adaptive CodingYoav Gross, Shmuel Tomi Klein, Elina Opalinsky, Dana Shapira. 97-106 [doi]
- A Worst Case Analysis of the LZ2 Compression Algorithm with Bounded Size DictionariesSergio De Agostino. 107-113 [doi]
- Turning Compression Schemes into Crypto-SystemsKfir Cohen, Yonatan Feigel, Shmuel Tomi Klein, Dana Shapira. 114-123 [doi]