PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Langiu, Alessio"

Author of the publication

copydeleteadd this publication to your clipboard
Algorithms for Longest Common Abelian Factors.

, , , and . Int. J. Found. Comput. Sci., 27 (5): 529-544 (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Renan Pereira Alessio University of Stuttgart

 

Other publications of authors with the same name

On parsing optimality for dictionary-based text compression - the Zip case.. J. Discrete Algorithms, (2013)On-Line Construction of a Small Automaton for a Finite Set of Words., , and . Int. J. Found. Comput. Sci., 23 (2): 281-301 (2012)Compressing Big Data: When the Rate of Convergence to the Entropy Matters., , , , , and . MACIS, volume 9582 of Lecture Notes in Computer Science, page 285-289. Springer, (2015)Abelian Repetitions in Sturmian Words., , , , , and . Developments in Language Theory, volume 7907 of Lecture Notes in Computer Science, page 227-238. Springer, (2013)Algorithms for Longest Common Abelian Factors., , , and . Int. J. Found. Comput. Sci., 27 (5): 529-544 (2016)Dictionary-symbolwise flexible parsing., , , , and . J. Discrete Algorithms, (2012)The longest common substring problem., , , and . Mathematical Structures in Computer Science, 27 (2): 277-295 (2017)The Rightmost Equal-Cost Position Problem, , and . CoRR, (2012)Note on the greedy parsing optimality for dictionary-based text compression., , and . Theor. Comput. Sci., (2014)Abelian Powers and Repetitions in Sturmian Words., , , , , and . CoRR, (2015)