Arnaud Lefebvre (Selection)

List of publications from the DBLP Bibliography Server - FAQ

Ask others: ACM DL/Guide -

14 Jean-Pierre Duval, Thierry Lecroq, Arnaud Lefebvre: Efficient validation and construction of border arrays and validation of string matching automata. ITA 43(2): 281-297 (2009)

10 Jean-Pierre Duval, Thierry Lecroq, Arnaud Lefebvre: Border Array on Bounded Alphabet. Journal of Automata, Languages and Combinatorics 10(1): 51-60 (2005)

8 Jean-Pierre Duval, Roman Kolpakov, Gregory Kucherov, Thierry Lecroq, Arnaud Lefebvre: Linear-time computation of local periods. Theor. Comput. Sci. 326(1-3): 229-240 (2004)

7 Jean-Pierre Duval, Roman Kolpakov, Gregory Kucherov, Thierry Lecroq, Arnaud Lefebvre: Linear-Time Computation of Local Periods. MFCS 2003: 388-397

4 Jean-Pierre Duval, Arnaud Lefebvre: Words over an ordered alphabet and suffix permutations. ITA 36(3): 249-259 (2002)

Selection of 5 from 14 records - Arnaud Lefebvre has 14 coauthors

14		Jean-Pierre Duval, Thierry Lecroq, Arnaud Lefebvre: Efficient validation and construction of border arrays and validation of string matching automata. ITA 43(2): 281-297 (2009)
10		Jean-Pierre Duval, Thierry Lecroq, Arnaud Lefebvre: Border Array on Bounded Alphabet. Journal of Automata, Languages and Combinatorics 10(1): 51-60 (2005)
8		Jean-Pierre Duval, Roman Kolpakov, Gregory Kucherov, Thierry Lecroq, Arnaud Lefebvre: Linear-time computation of local periods. Theor. Comput. Sci. 326(1-3): 229-240 (2004)
7		Jean-Pierre Duval, Roman Kolpakov, Gregory Kucherov, Thierry Lecroq, Arnaud Lefebvre: Linear-Time Computation of Local Periods. MFCS 2003: 388-397
4		Jean-Pierre Duval, Arnaud Lefebvre: Words over an ordered alphabet and suffix permutations. ITA 36(3): 249-259 (2002)