The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Véronique Bruyère: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  40. Equilibria in Quantitative Reachability Games. [Citation Graph (, )][DBLP]


  41. On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases. [Citation Graph (, )][DBLP]


  42. On First-Order Query Rewriting for Incomplete Database Histories. [Citation Graph (, )][DBLP]


  43. Turán Graphs, Stability Number, and Fibonacci Index. [Citation Graph (, )][DBLP]


  44. Turán Graphs, Stability Number, and Fibonacci Index [Citation Graph (, )][DBLP]


  45. Fibonacci Index and Stability Number of Graphs: a Polyhedral Study [Citation Graph (, )][DBLP]


  46. On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases [Citation Graph (, )][DBLP]


  47. Foreword to the Special Issue Dedicated to the 10th "Journées Montoises d'Informatique Théorique". [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002