Laura Giambruno

14 papers B 2C 3Misc 1Journal 8

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