List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| On optimal parsing for LZ78-like compressors Theoretical Computer Science | 2018-02-16 | Paper |
| The longest common substring problem Mathematical Structures in Computer Science | 2017-04-04 | Paper |
| Indexing a sequence for mapping reads with a single mismatch Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences | 2017-01-13 | Paper |
| Algorithms for longest common abelian factors International Journal of Foundations of Computer Science | 2016-11-18 | Paper |
| Order-preserving indexing Theoretical Computer Science | 2016-06-16 | Paper |
| Abelian powers and repetitions in Sturmian words Theoretical Computer Science | 2016-05-26 | Paper |
| Compressing big data: when the rate of convergence to the entropy matters Mathematical Aspects of Computer and Information Sciences | 2016-05-25 | Paper |
| A note on the longest common compatible prefix problem for partial words Journal of Discrete Algorithms | 2015-08-24 | Paper |
| On parsing optimality for dictionary-based text compression -- the \texttt{Zip} case Journal of Discrete Algorithms | 2014-08-13 | Paper |
| Note on the greedy parsing optimality for dictionary-based text compression Theoretical Computer Science | 2014-03-13 | Paper |
| Abelian repetitions in Sturmian words Developments in Language Theory | 2013-06-28 | Paper |
| Dictionary-symbolwise flexible parsing Journal of Discrete Algorithms | 2012-09-13 | Paper |
| On-line construction of a small automaton for a finite set of words International Journal of Foundations of Computer Science | 2012-08-30 | Paper |
| Dictionary-symbolwise flexible parsing Lecture Notes in Computer Science | 2011-05-19 | Paper |
Research outcomes over time
This page was built for person: Alessio Langiu
