Fastest pattern matching in stringsCOLUSSI, L.Journal of algorithms (Print). 1994, Vol 16, Num 2, pp 163-189, issn 0196-6774Article

SUL CALCOLO DI SERBATOI A PIU CELLE CON IL METODO DEGLI ELEMENTI FINITI = CALCUL DES RESERVOIRS A CELLULES MULTIPLES PAR LA METHODE DES ELEMENTS FINISCOLUSSI L; SCHREFLER B.1978; G. GENIO CIV.; ITA; DA. 1978; VOL. 116; NO 7-9; PP. 271-278; ABS. FRE/ENG/GER; BIBL. 11 REF.Article

Correctness and efficiency of pattern matching algorithmsCOLUSSI, L.Information and computation (Print). 1991, Vol 95, Num 2, pp 225-251, issn 0890-5401Article

A DIVIDE-AND-CONQUER APPROACH TO GENERAL CONTEXT-FREE PARSINGBOSSI A; COCCO N; COLUSSI L et al.1983; INFORMATION PROCESSING LETTERS; ISSN 0020-0190; NLD; DA. 1983; VOL. 16; NO 4; PP. 203-208; BIBL. 5 REF.Article

A time and space efficient data structure for string searching on large textsCOLUSSI, L; DE COL, A.Information processing letters. 1996, Vol 58, Num 5, pp 217-222, issn 0020-0190Article

Tight comparison bounds for the string prefix-matching problemBRESLAUER, D; COLUSSI, L; TONIOLO, L et al.Information processing letters. 1993, Vol 47, Num 1, pp 51-57, issn 0020-0190Article

On the comparison complexity of the string prefix-matching problemBRESLAUER, D; COLUSSI, L; TONIOLO, L et al.Journal of algorithms (Print). 1998, Vol 29, Num 1, pp 18-67, issn 0196-6774Article