City Research Online

Items where Author is "Badkobeh, G."

Up a level
Group by: Type | No Grouping
Number of items: 5.


Badkobeh, G. ORCID: 0000-0001-5550-7149, Harju, T. ORCID: 0000-0002-9640-6309, Ochem, P. ORCID: 0000-0001-5504-4586 & Rosenfeld, M. (2022). Avoiding square-free words on free groups. Theoretical Computer Science, 922, pp. 206-217. doi: 10.1016/j.tcs.2022.04.025

Badkobeh, G. ORCID: 0000-0001-5550-7149, Charalampopoulos, P., Kosolobov, D. & Pissis, S. P. (2022). Internal shortest absent word queries in constant time and linear space. Theoretical Computer Science, 922, pp. 271-282. doi: 10.1016/j.tcs.2022.04.029

Badkobeh, G. ORCID: 0000-0001-5550-7149 & Crochemore, M. (2022). Linear construction of a left Lyndon tree. Information and Computation, 285(Part B), article number 104884. doi: 10.1016/j.ic.2022.104884

Conference or Workshop Item

Badkobeh, G. ORCID: 0000-0001-5550-7149, De Luca, A., Fici, G. & Puglisi, S. J. (2022). Maximal Closed Substrings. In: Arroyuelo, D. & Poblete, B. (Eds.), SPIRE 2022: String Processing and Information Retrieval. 29th International Symposium, SPIRE 2022, 8-10 Nov 2022, ConcepciĆ³n, Chile. doi: 10.1007/978-3-031-20643-6_2

Badkobeh, G. ORCID: 0000-0001-5550-7149, Crochemore, M., Ellert, J. & Nicaud, C. (2022). Back-To-Front Online Lyndon Forest Construction. In: 33rd Annual Symposium on Combinatorial Pattern Matching (CPM 2022). 33rd Annual Symposium on Combinatorial Pattern Matching (CPM 2022), 27-29 Jun 2022, Czech Republic. doi: 10.4230/LIPIcs.CPM.2022.13

This list was generated on Wed Jun 12 03:18:56 2024 UTC.