Items Authored/Edited by Puglisi, Simon J.
Up a level |
Number of items: 4.
Badkobeh, Golnaz; De Luca, Alessandro; Fici, Gabriele and Puglisi, Simon J..
2022.
Maximal Closed Substrings.
Lecture Notes in Computer Science, 13617,
pp. 16-23.
ISSN 0302-9743
[Article]
Badkobeh, Golnaz; Giuliani, Sara; Lipták, Zsuzsanna and Puglisi, Simon J..
2022.
'On Compressing Collections of Substring Samples'.
In: 23rd Italian Conference on Theoretical Computer Science (ICTCS 2022). Rome, Italy 7-9 September 2022.
[Conference or Workshop Item]
Badkobeh, Golnaz; Gawrychowski, Pawel; Kärkkäinen, Juha; Puglisi, Simon J. and Zhukova, Bella.
2021.
Tight Upper and Lower Bounds on Suffix Tree Breadth.
Theoretical Computer Science, 854,
pp. 63-67.
ISSN 0304-3975
[Article]
Alamro, Hayam; Badkobeh, Golnaz; Belazzougui, Djamal; Iliopoulos, Costas S. and Puglisi, Simon J..
2019.
'Computing the Antiperiod(s) of a String'.
In: 30th Annual Symposium on Combinatorial Pattern Matching. Pisa, Italy 18-20 June 2019.
[Conference or Workshop Item]