| 2008 |
|---|
| 45 | EE | Véronique Bruyère,
Hadrien Mélot:
Turán Graphs, Stability Number, and Fibonacci Index.
COCOA 2008: 127-138 |
| 44 | EE | Bernard Boigelot,
Julien Brusten,
Véronique Bruyère:
On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases.
ICALP (2) 2008: 112-123 |
| 43 | EE | Véronique Bruyère,
Emmanuel Dall'Olio,
Jean-François Raskin:
Durations and parametric model-checking in timed automata.
ACM Trans. Comput. Log. 9(2): (2008) |
| 42 | EE | Véronique Bruyère,
Hadrien Mélot:
Turán Graphs, Stability Number, and Fibonacci Index
CoRR abs/0802.3284: (2008) |
| 41 | EE | Véronique Bruyère,
Hadrien Mélot:
Fibonacci Index and Stability Number of Graphs: a Polyhedral Study
CoRR abs/0811.1449: (2008) |
| 2007 |
|---|
| 40 | EE | Véronique Bruyère,
Jean-François Raskin:
Real-Time Model-Checking: Parameters everywhere
CoRR abs/cs/0701138: (2007) |
| 39 | EE | Patricia Bouyer,
Thomas Brihaye,
Véronique Bruyère,
Jean-François Raskin:
On the optimal reachability problem of weighted timed automata.
Formal Methods in System Design 31(2): 135-175 (2007) |
| 38 | EE | Véronique Bruyère,
Olivier Carton:
Automata on linear orderings.
J. Comput. Syst. Sci. 73(1): 1-24 (2007) |
| 37 | EE | Véronique Bruyère,
Jean-François Raskin:
Real-Time Model-Checking: Parameters everywhere.
Logical Methods in Computer Science 3(1): (2007) |
| 2006 |
|---|
| 36 | EE | Thomas Brihaye,
Véronique Bruyère,
Jean-François Raskin:
On model-checking timed automata with stopwatch observers.
Inf. Comput. 204(3): 408-433 (2006) |
| 2005 |
|---|
| 35 | EE | Isabel M. Araújo,
Véronique Bruyère:
Sturmian Words: Dynamical Systems and Derivated Words.
Developments in Language Theory 2005: 122-133 |
| 34 | EE | Thomas Brihaye,
Véronique Bruyère,
Jean-François Raskin:
On Optimal Timed Strategies.
FORMATS 2005: 49-64 |
| 33 | EE | Isabel M. Araújo,
Véronique Bruyère:
Sturmian words and a criterium by Michaux-Villemaire.
Theor. Comput. Sci. 339(1): 88-102 (2005) |
| 32 | EE | Isabel M. Araújo,
Véronique Bruyère:
Words derivated from Sturmian words.
Theor. Comput. Sci. 340(1): 204-219 (2005) |
| 31 | EE | Véronique Bruyère,
Olivier Carton:
Hierarchy Among Automata on Linear Orderings.
Theory Comput. Syst. 38(5): 593-621 (2005) |
| 2004 |
|---|
| 30 | EE | Thomas Brihaye,
Véronique Bruyère,
Jean-François Raskin:
Model-Checking for Weighted Timed Automata.
FORMATS/FTRTFT 2004: 277-292 |
| 2003 |
|---|
| 29 | EE | Véronique Bruyère,
Jean-François Raskin:
Real-Time Model-Checking: Parameters Everywhere.
FSTTCS 2003: 100-111 |
| 28 | EE | Véronique Bruyère,
Emmanuel Dall'Olio,
Jean-François Raskin:
Durations, Parametric Model-Checking in Timed Automata with Presburger Arithmetic.
STACS 2003: 687-698 |
| 27 | | Véronique Bruyère:
Cumulative defect.
Theor. Comput. Sci. 292(1): 97-109 (2003) |
| 2002 |
|---|
| 26 | EE | Véronique Bruyère,
Olivier Carton:
Automata on Linear Orderings.
Developments in Language Theory 2002: 103-115 |
| 25 | | Véronique Bruyère,
Olivier Carton:
Hierarchy Among Automata on Linear Orderings.
IFIP TCS 2002: 107-118 |
| 2001 |
|---|
| 24 | EE | Véronique Bruyère,
Olivier Carton:
Automata on Linear Orderings.
MFCS 2001: 236-247 |
| 1999 |
|---|
| 23 | | Véronique Bruyère,
Clelia de Felice:
On the Existence of Codings Between Trace Monoids.
Journal of Automata, Languages and Combinatorics 4(2): 87-100 (1999) |
| 22 | EE | Véronique Bruyère,
Christophe Reutenauer:
A Proof of Choffrut's Theorem on Subsequential Functions.
Theor. Comput. Sci. 215(1-2): 329-335 (1999) |
| 21 | EE | Véronique Bruyère,
Dominique Perrin:
Maximal Bifix Codes.
Theor. Comput. Sci. 218(1): 107-121 (1999) |
| 1998 |
|---|
| 20 | EE | Véronique Bruyère,
Denis Derencourt,
Michel Latteux:
The Meet Operation in the Lattice of Codes.
Theor. Comput. Sci. 191(1-2): 117-129 (1998) |
| 19 | EE | Véronique Bruyère:
On Maximal Codes with Bounded Synchronization Delay.
Theor. Comput. Sci. 204(1-2): 11-28 (1998) |
| 1997 |
|---|
| 18 | | Véronique Bruyère:
A Completion Algorithm for Codes with Bounded Synchronization Delay.
ICALP 1997: 87-97 |
| 17 | EE | Véronique Bruyère,
Georges Hansel:
Bertrand Numeration Systems and Recognizability.
Theor. Comput. Sci. 181(1): 17-43 (1997) |
| 16 | | F. Point,
Véronique Bruyère:
On the Cobham-Semenov Theorem.
Theory Comput. Syst. 30(2): 197-220 (1997) |
| 1996 |
|---|
| 15 | | Véronique Bruyère,
Michel Latteux:
Variable-Length Maximal Codes.
ICALP 1996: 24-47 |
| 14 | | Véronique Bruyère,
Clelia de Felice:
Any Lifting of a Trace Coding is a Word Coding.
Inf. Comput. 130(2): 183-193 (1996) |
| 1995 |
|---|
| 13 | | Véronique Bruyère,
Georges Hansel:
Recognizable Sets of Numbers in Nonstandard Bases.
LATIN 1995: 167-179 |
| 12 | | Véronique Bruyère,
Clelia de Felice:
Coding and Strong Coding in Trace Monoids.
STACS 1995: 373-384 |
| 11 | EE | Véronique Bruyère,
Clelia de Felice:
Synchronization and decomposability for a family of codes: Part 2.
Discrete Mathematics 140(1-3): 47-77 (1995) |
| 10 | EE | Véronique Bruyère,
Clelia de Felice,
Giovanna Guaiana:
On Some Decision Problems for Trace Codings.
Theor. Comput. Sci. 148(2): 227-260 (1995) |
| 1994 |
|---|
| 9 | | Véronique Bruyère,
Clelia de Felice,
Giovanna Guaiana:
Coding with Traces.
STACS 1994: 353-364 |
| 1992 |
|---|
| 8 | | Véronique Bruyère:
Automata and Codes with Bounded Deciphering Delay.
LATIN 1992: 99-107 |
| 1991 |
|---|
| 7 | | Véronique Bruyère,
Clelia de Felice:
Degree and Decomposability of Variable-Length Codes.
ICALP 1991: 575-587 |
| 6 | | Véronique Bruyère:
Maximal Codes With Bounded Deciphering Delay.
Theor. Comput. Sci. 84(1): 53-76 (1991) |
| 1989 |
|---|
| 5 | | Véronique Bruyère:
Completion of Finite Codes with Finite Deciphering Delay.
ICALP 1989: 151-163 |
| 4 | | Véronique Bruyère:
Factorisation Des Ensembles Préfixiels.
ITA 23(3): 295-315 (1989) |
| 3 | EE | Véronique Bruyère:
About prefix sets of words.
J. Comb. Theory, Ser. A 51(2): 237-243 (1989) |
| 1988 |
|---|
| 2 | | Véronique Bruyère:
On Maximal Prefix Sets of Words.
MFCS 1988: 201-209 |
| 1 | | Véronique Bruyère:
An Answer to a Question about Finite Maximal Prefix Sets of Words.
Theor. Comput. Sci. 56: 339-344 (1988) |
