Laura Giambruno

Publication Activity (10 Years)

Years Active: 2008-2017
Publications (10 Years): 1

Top Topics

Computational Complexity

Top Venues

Int. J. Found. Comput. Sci.

Developments in Language Theory

Math. Struct. Comput. Sci.

Publications

Julien Clément, Laura Giambruno
Representing prefix and border tables: results on enumeration. Math. Struct. Comput. Sci. 27 (2) (2017)
Laura Giambruno, Sabrina Mantaci, Jean Néraud, Carla Selmi
A Generalization of Girod's Bidirectional Decoding Method to Codes with a Finite Deciphering Delay. Int. J. Found. Comput. Sci. 26 (6) (2015)
Julien Clément, Laura Giambruno
On the Number of Prefix and Border Tables. LATIN (2014)
Laura Giambruno, Sabrina Mantaci
On the size of transducers for bidirectional decoding of prefix codes. RAIRO Theor. Informatics Appl. 46 (2) (2012)
Maxime Crochemore, Laura Giambruno, Alessio Langiu, Filippo Mignosi, Antonio Restivo
Dictionary-symbolwise flexible parsing. J. Discrete Algorithms 14 (2012)
Laura Giambruno, Sabrina Mantaci, Jean Néraud, Carla Selmi
A Generalization of Girod's Bidirectional Decoding Method to Codes with a Finite Deciphering Delay. Developments in Language Theory (2012)
Maxime Crochemore, Laura Giambruno, Alessio Langiu
On-Line Construction of a Small Automaton for a Finite Set of Words. Int. J. Found. Comput. Sci. 23 (2) (2012)
Maxime Crochemore, Laura Giambruno, Alessio Langiu, Filippo Mignosi, Antonio Restivo
Dictionary-Symbolwise Flexible Parsing. IWOCA (2010)
Frédérique Bassino, Laura Giambruno, Cyril Nicaud
The Average State Complexity of Rational Operations on Finite Languages. Int. J. Found. Comput. Sci. 21 (4) (2010)
Laura Giambruno, Sabrina Mantaci
Transducers for the bidirectional decoding of prefix codes. Theor. Comput. Sci. 411 (16-18) (2010)
Frédérique Bassino, Laura Giambruno, Cyril Nicaud
Complexity of Operations on Cofinite Languages. LATIN (2010)
Maxime Crochemore, Laura Giambruno
On-line Construction of a Small Automaton for a Finite Set of Words. Stringology (2009)
Laura Giambruno, Antonio Restivo
An automata-theoretic approach to the study of the intersection of two submonoids of a free monoid. RAIRO Theor. Informatics Appl. 42 (3) (2008)
Frédérique Bassino, Laura Giambruno, Cyril Nicaud
The Average State Complexity of the Star of a Finite Set of Words Is Linear. Developments in Language Theory (2008)