Special Issue on Algorithms and Data-Structures for Compressed Computation
1. Introduction
2. Special Issue
Funding
Acknowledgments
Conflicts of Interest
References
- Matsuda, K.; Denzumi, S.; Sadakane, K. Storing Set Families More Compactly with Top ZDDs. Algorithms 2021, 14, 172. [Google Scholar] [CrossRef]
- Köppl, D. Non-Overlapping LZ77 Factorization and LZ78 Substring Compression Queries with Suffix Trees. Algorithms 2021, 14, 44. [Google Scholar] [CrossRef]
- Mitsuya, S.; Nakashima, Y.; Inenaga, S.; Bannai, H.; Takeda, M. Compressed Communication Complexity of Hamming Distance. Algorithms 2021, 14, 116. [Google Scholar] [CrossRef]
- Gibney, D.; Thankachan, S.V. Text Indexing for Regular Expression Matching. Algorithms 2021, 14, 133. [Google Scholar] [CrossRef]
- Hucke, D.; Reh, C.P. Approximation Ratios of RePair, LongestMatch and Greedy on Unary Strings. Algorithms 2021, 14, 65. [Google Scholar] [CrossRef]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2022 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).
Share and Cite
Policriti, A.; Prezza, N. Special Issue on Algorithms and Data-Structures for Compressed Computation. Algorithms 2022, 15, 457. https://doi.org/10.3390/a15120457
Policriti A, Prezza N. Special Issue on Algorithms and Data-Structures for Compressed Computation. Algorithms. 2022; 15(12):457. https://doi.org/10.3390/a15120457
Chicago/Turabian StylePolicriti, Alberto, and Nicola Prezza. 2022. "Special Issue on Algorithms and Data-Structures for Compressed Computation" Algorithms 15, no. 12: 457. https://doi.org/10.3390/a15120457