A partially persistent data structure for the set-union problem

Gaibisso, C.; Gambosi, G.; Talamo, M.

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Volume 24 (1990) p. 189-202

An application of $m$-ary trees to the design of data structures for geometric searching problems

Talamo, M.; Gambosi, G.

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Volume 23 (1989) p. 165-176

A parametric analysis of the largest induced tree problem in random graphs

Protasi, M.; Talamo, M.

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Volume 20 (1986) p. 211-219

Probabilistic analysis of two euclidean location problems

Marchetti-Spaccamela, A.; Talamo, M.

RAIRO. Informatique théorique, Volume 17 (1983) p. 387-395