default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVéronique Bruyère
Person information
- affiliation: Université de Mons, Belgium
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j48]Swen Jacobs, Guillermo A. Pérez
, Remco Abraham, Véronique Bruyère, Michaël Cadilhac, Maximilien Colange, Charly Delfosse, Tom van Dijk, Alexandre Duret-Lutz, Peter Faymonville, Bernd Finkbeiner, Ayrat Khalimov, Felix Klein, Michael Luttenberger, Klara J. Meyer, Thibaud Michaud, Adrien Pommellet, Florian Renkin, Philipp Schlehuber-Caissier, Mouhammad Sakr, Salomon Sickert, Gaëtan Staquet, Clément Tamines, Leander Tentrup, Adam Walker:
The Reactive Synthesis Competition (SYNTCOMP): 2018-2021. Int. J. Softw. Tools Technol. Transf. 26(5): 551-567 (2024)- [j47]Véronique Bruyère, Baptiste Fievet, Jean-François Raskin, Clément Tamines:
Stackelberg-Pareto Synthesis. ACM Trans. Comput. Log. 25(2): 14:1-14:49 (2024) - [c50]Véronique Bruyère, Christophe Grandmont, Jean-François Raskin:
As Soon as Possible but Rationally. CONCUR 2024: 14:1-14:20 - [i31]Véronique Bruyère, Christophe Grandmont, Jean-François Raskin:
As Soon as Possible but Rationally. CoRR abs/2403.00399 (2024) - [i30]Véronique Bruyère, Bharat Garhewal, Guillermo A. Pérez, Gaëtan Staquet, Frits W. Vaandrager:
Active Learning of Mealy Machines with Timers. CoRR abs/2403.02019 (2024) - [i29]Véronique Bruyère, Jean-François Raskin, Alexis Reynouard, Marie van den Bogaard:
The Non-Cooperative Rational Synthesis Problem for Subgame Perfect Equilibria and omega-regular Objectives. CoRR abs/2412.08547 (2024) - 2023
- [c49]Véronique Bruyère, Guillermo A. Pérez, Gaëtan Staquet, Frits W. Vaandrager:
Automata with Timers. FORMATS 2023: 33-49 - [c48]Thomas Brihaye, Véronique Bruyère, Gaspard Reghem:
Quantitative Reachability Stackelberg-Pareto Synthesis Is NEXPTIME-Complete. RP 2023: 70-84 - [c47]Véronique Bruyère, Guillermo A. Pérez, Gaëtan Staquet:
Validating Streaming JSON Documents with Learned VPAs. TACAS (1) 2023: 271-289 - [i28]Véronique Bruyère, Guillermo A. Pérez, Gaëtan Staquet, Frits W. Vaandrager:
Automata with Timers. CoRR abs/2305.07451 (2023) - [i27]Thomas Brihaye, Véronique Bruyère, Gaspard Reghem:
Quantitative Reachability Stackelberg-Pareto Synthesis is NEXPTIME-Complete. CoRR abs/2308.09443 (2023) - 2022
- [c46]Véronique Bruyère:
A Game-Theoretic Approach for the Synthesis of Complex Systems. CiE 2022: 52-63 - [c45]Véronique Bruyère, Jean-François Raskin, Clément Tamines:
Pareto-Rational Verification. CONCUR 2022: 33:1-33:20 - [c44]Véronique Bruyère, Guillermo A. Pérez, Gaëtan Staquet:
Learning Realtime One-Counter Automata. TACAS (1) 2022: 244-262 - [i26]Véronique Bruyère, Jean-François Raskin, Clément Tamines:
Pareto-Rational Verification. CoRR abs/2202.13485 (2022) - [i25]Véronique Bruyère, Baptiste Fievet, Jean-François Raskin, Clément Tamines:
Stackelberg-Pareto Synthesis (Extended Version). CoRR abs/2203.01285 (2022) - [i24]Swen Jacobs, Guillermo A. Pérez, Remco Abraham, Véronique Bruyère, Michaël Cadilhac, Maximilien Colange, Charly Delfosse, Tom van Dijk, Alexandre Duret-Lutz, Peter Faymonville, Bernd Finkbeiner, Ayrat Khalimov, Felix Klein, Michael Luttenberger, Klara J. Meyer, Thibaud Michaud, Adrien Pommellet, Florian Renkin, Philipp Schlehuber-Caissier, Mouhammad Sakr, Salomon Sickert, Gaëtan Staquet, Clément Tamines, Leander Tentrup, Adam Walker:
The Reactive Synthesis Competition (SYNTCOMP): 2018-2021. CoRR abs/2206.00251 (2022) - [i23]Véronique Bruyère, Guillermo A. Pérez, Gaëtan Staquet:
Validating Streaming JSON Documents with Learned VPAs. CoRR abs/2211.08891 (2022) - 2021
- [j46]Véronique Bruyère, Stéphane Le Roux, Arno Pauly, Jean-François Raskin:
On the existence of weak subgame perfect equilibria. Inf. Comput. 276: 104553 (2021) - [j45]Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin:
Constrained existence problem for weak subgame perfect equilibria with ω-regular Boolean objectives. Inf. Comput. 278: 104594 (2021) - [j44]Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Nathan Thomasset:
On relevant equilibria in reachability games. J. Comput. Syst. Sci. 119: 211-230 (2021) - [j43]Véronique Bruyère:
Synthesis of equilibria in infinite-duration games on graphs. ACM SIGLOG News 8(2): 4-29 (2021) - [c43]Véronique Bruyère, Jean-François Raskin, Clément Tamines:
Stackelberg-Pareto Synthesis. CONCUR 2021: 27:1-27:17 - [i22]Véronique Bruyère, Jean-François Raskin, Clément Tamines:
Stackelberg-Pareto Synthesis (Full Version). CoRR abs/2102.08925 (2021) - [i21]Véronique Bruyère, Guillermo A. Pérez, Gaëtan Staquet:
Learning Realtime One-Counter Automata. CoRR abs/2110.09434 (2021) - 2020
- [j42]Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin, Marie van den Bogaard:
The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games. Log. Methods Comput. Sci. 16(4) (2020)
2010 – 2019
- 2019
- [c42]Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin, Marie van den Bogaard:
The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games. CONCUR 2019: 13:1-13:16 - [c41]Véronique Bruyère, Quentin Hautem, Mickael Randour, Jean-François Raskin:
Energy Mean-Payoff Games. CONCUR 2019: 21:1-21:17 - [c40]Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Nathan Thomasset:
On Relevant Equilibria in Reachability Games. RP 2019: 48-62 - [c39]Véronique Bruyère, Guillermo A. Pérez, Jean-François Raskin, Clément Tamines:
Partial Solvers for Generalized Parity Games. RP 2019: 63-78 - [i20]Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin, Marie van den Bogaard:
The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games (full version). CoRR abs/1905.00784 (2019) - [i19]Véronique Bruyère, Quentin Hautem, Mickael Randour, Jean-François Raskin:
Energy mean-payoff games. CoRR abs/1907.01359 (2019) - [i18]Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Nathan Thomasset:
On Relevant Equilibria in Reachability Games. CoRR abs/1907.05481 (2019) - [i17]Véronique Bruyère, Guillermo A. Pérez, Jean-François Raskin, Clément Tamines:
Partial Solvers for Generalized Parity Games. CoRR abs/1907.06913 (2019) - 2018
- [c38]Véronique Bruyère, Quentin Hautem, Jean-François Raskin:
Parameterized complexity of games with monotonically ordered omega-regular objectives. CONCUR 2018: 29:1-29:16 - [c37]Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin:
Constrained Existence Problem for Weak Subgame Perfect Equilibria with ω-Regular Boolean Objectives. GandALF 2018: 16-29 - [i16]Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin:
Constrained existence problem for weak subgame perfect equilibria with omega-regular Boolean objectives. CoRR abs/1806.05544 (2018) - 2017
- [j41]Aaron Bohy, Véronique Bruyère, Jean-François Raskin, Nathalie Bertrand:
Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes. Acta Informatica 54(6): 545-587 (2017) - [j40]Véronique Bruyère, Emmanuel Filiot, Mickael Randour, Jean-François Raskin:
Meet your expectations with guarantees: Beyond worst-case synthesis in quantitative games. Inf. Comput. 254: 259-295 (2017) - [c36]Véronique Bruyère:
Computer Aided Synthesis: A Game-Theoretic Approach. DLT 2017: 3-35 - [c35]Véronique Bruyère, Stéphane Le Roux, Arno Pauly, Jean-François Raskin:
On the Existence of Weak Subgame Perfect Equilibria. FoSSaCS 2017: 145-161 - [i15]Véronique Bruyère:
Computer aided synthesis: a game theoretic approach. CoRR abs/1706.00652 (2017) - [i14]Véronique Bruyère, Quentin Hautem, Jean-François Raskin:
Games with lexicographically ordered $ω$-regular objectives. CoRR abs/1707.05968 (2017) - 2016
- [c34]Véronique Bruyère, Quentin Hautem, Jean-François Raskin:
On the Complexity of Heterogeneous Multidimensional Games. CONCUR 2016: 11:1-11:15 - [c33]Véronique Bruyère, Quentin Hautem, Mickael Randour:
Window parity games: an alternative approach toward parity games with time bounds. GandALF 2016: 135-148 - [i13]Véronique Bruyère, Quentin Hautem, Mickael Randour:
Window Parity Games: An Alternative Approach Toward Parity Games with Time Bounds (Full Version). CoRR abs/1609.05952 (2016) - [i12]Véronique Bruyère, Stéphane Le Roux, Arno Pauly, Jean-François Raskin:
On the existence of weak subgame perfect equilibria. CoRR abs/1612.01402 (2016) - 2015
- [c32]Thomas Brihaye, Véronique Bruyère, Noémie Meunier, Jean-François Raskin:
Weak Subgame Perfect Equilibria and their Application to Quantitative Reachability. CSL 2015: 504-518 - [i11]Thomas Brihaye, Véronique Bruyère, Noémie Meunier, Jean-François Raskin:
Weak Subgame Perfect Equilibria and their Application to Quantitative Reachability. CoRR abs/1504.01557 (2015) - [i10]Véronique Bruyère, Quentin Hautem, Jean-François Raskin:
On the complexity of heterogeneous multidimensional quantitative games. CoRR abs/1511.08334 (2015) - 2014
- [j39]Caroline Battaglia, Véronique Bruyère, Olivier Gauwin, Cristel Pelsser, Bruno Quoitin:
Reasoning on BGP routing filters using tree automata. Comput. Networks 65: 232-254 (2014) - [j38]Raphaël M. Jungers, Véronique Bruyère, Romain Hollanders, Michel Rigo:
Special issue in the honor of the 14th "Journées Montoises d'Informatique Théorique" - Foreword. RAIRO Theor. Informatics Appl. 48(3): 247 (2014) - [j37]Thomas Brihaye, Véronique Bruyère, Julie De Pril:
On Equilibria in Quantitative Games with Reachability/Safety Objectives. Theory Comput. Syst. 54(2): 150-189 (2014) - [c31]Véronique Bruyère, Noémie Meunier, Jean-François Raskin:
Secure equilibria in weighted games. CSL-LICS 2014: 26:1-26:26 - [c30]Véronique Bruyère, Emmanuel Filiot, Mickael Randour, Jean-François Raskin:
Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games. STACS 2014: 199-213 - [c29]Véronique Bruyère, Emmanuel Filiot, Mickael Randour, Jean-François Raskin:
Expectations or Guarantees? I Want It All! A crossroad between games and MDPs. SR 2014: 1-8 - [c28]Aaron Bohy, Véronique Bruyère, Jean-François Raskin:
Symblicit algorithms for optimal strategy synthesis in monotonic Markov decision processes. SYNT 2014: 51-67 - [i9]Aaron Bohy, Véronique Bruyère, Jean-François Raskin:
Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes. CoRR abs/1402.1076 (2014) - [i8]Véronique Bruyère, Noémie Meunier, Jean-François Raskin:
Secure Equilibria in Weighted Games. CoRR abs/1402.3962 (2014) - 2013
- [c27]Véronique Bruyère, Marc Ducobu, Olivier Gauwin:
Visibly Pushdown Automata: Universality and Inclusion via Antichains. LATA 2013: 190-201 - [c26]Véronique Bruyère, Marc Ducobu, Olivier Gauwin:
Right-Universality of Visibly Pushdown Automata. RV 2013: 76-93 - [c25]Aaron Bohy, Véronique Bruyère, Emmanuel Filiot, Jean-François Raskin:
Synthesis from LTL Specifications with Mean-Payoff Objectives. TACAS 2013: 169-184 - [i7]Véronique Bruyère, Emmanuel Filiot, Mickael Randour, Jean-François Raskin:
Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games. CoRR abs/1309.5439 (2013) - 2012
- [j36]Thomas Brihaye, Véronique Bruyère, Julie De Pril, Hugo Gimbert:
On Subgame Perfection in Quantitative Reachability Games. Log. Methods Comput. Sci. 9(1) (2012) - [j35]Véronique Bruyère, Gwenaël Joret, Hadrien Mélot:
Trees with Given Stability Number and Minimum Number of Stable Sets. Graphs Comb. 28(2): 167-187 (2012) - [j34]Véronique Bruyère, Olivier Carton, Alexandre Decan, Olivier Gauwin, Jef Wijsen:
An aperiodicity problem for multiwords. RAIRO Theor. Informatics Appl. 46(1): 33-50 (2012) - [c24]Aaron Bohy, Véronique Bruyère, Emmanuel Filiot, Naiyong Jin, Jean-François Raskin:
Acacia+, a Tool for LTL Synthesis. CAV 2012: 652-657 - [c23]Thomas Brihaye, Véronique Bruyère, Julie De Pril, Hugo Gimbert:
Subgame Perfection for Equilibria in Quantitative Reachability Games. FoSSaCS 2012: 286-300 - [i6]Véronique Bruyère, Marc Ducobu, Olivier Gauwin:
Visibly pushdown automata on trees: universality and u-universality. CoRR abs/1205.2841 (2012) - [i5]Thomas Brihaye, Véronique Bruyère, Julie De Pril:
On Equilibria in Quantitative Games with Reachability/Safety Objectives. CoRR abs/1205.4889 (2012) - [i4]Aaron Bohy, Véronique Bruyère, Emmanuel Filiot, Jean-François Raskin:
Synthesis from LTL Specifications with Mean-Payoff Objectives. CoRR abs/1210.3539 (2012) - 2011
- [c22]Thomas Brihaye, Véronique Bruyère, Laurent Doyen, Marc Ducobu, Jean-François Raskin:
Antichain-Based QBF Solving. ATVA 2011: 183-197 - 2010
- [j33]Bernard Boigelot, Julien Brusten, Véronique Bruyère:
On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases. Log. Methods Comput. Sci. 6(1) (2010) - [j32]Véronique Bruyère, Michel Rigo:
Foreword. RAIRO Theor. Informatics Appl. 44(1): 1 (2010) - [j31]Thomas Brihaye, Véronique Bruyère, Elaine Render:
Formal language properties of hybrid systems with strong resets. RAIRO Theor. Informatics Appl. 44(1): 79-111 (2010) - [c21]Thomas Brihaye, Véronique Bruyère, Julie De Pril:
Equilibria in Quantitative Reachability Games. CSR 2010: 72-83
2000 – 2009
- 2009
- [j30]Véronique Bruyère, Olivier Carton, Géraud Sénizergues:
Tree Automata and Automata on Linear Orderings. RAIRO Theor. Informatics Appl. 43(2): 321-338 (2009) - [j29]Véronique Bruyère, Hadrien Mélot:
Fibonacci index and stability number of graphs: a polyhedral study. J. Comb. Optim. 18(3): 207-228 (2009) - [j28]Ricardo Baeza-Yates, Véronique Bruyère, Olivier Delgrange, Rodrigo Scheihing:
On the size of Boyer-Moore automata. Theor. Comput. Sci. 410(43): 4432-4443 (2009) - [c20]Véronique Bruyère, Alexandre Decan, Jef Wijsen:
On First-Order Query Rewriting for Incomplete Database Histories. TIME 2009: 54-61 - 2008
- [j27]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): 12:1-12:23 (2008) - [c19]Véronique Bruyère, Hadrien Mélot:
Turán Graphs, Stability Number, and Fibonacci Index. COCOA 2008: 127-138 - [c18]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 - [i3]Véronique Bruyère, Hadrien Mélot:
Turán Graphs, Stability Number, and Fibonacci Index. CoRR abs/0802.3284 (2008) - [i2]Véronique Bruyère, Hadrien Mélot:
Fibonacci Index and Stability Number of Graphs: a Polyhedral Study. CoRR abs/0811.1449 (2008) - 2007
- [j26]Michel Rigo, Véronique Bruyère:
Foreword to the Special Issue Dedicated to the 10th "Journées Montoises d'Informatique Théorique". Discret. Math. Theor. Comput. Sci. 9(2) (2007) - [j25]Patricia Bouyer, Thomas Brihaye, Véronique Bruyère, Jean-François Raskin:
On the optimal reachability problem of weighted timed automata. Formal Methods Syst. Des. 31(2): 135-175 (2007) - [j24]Véronique Bruyère, Olivier Carton:
Automata on linear orderings. J. Comput. Syst. Sci. 73(1): 1-24 (2007) - [j23]Véronique Bruyère, Jean-François Raskin:
Real-Time Model-Checking: Parameters everywhere. Log. Methods Comput. Sci. 3(1) (2007) - [i1]Véronique Bruyère, Jean-François Raskin:
Real-Time Model-Checking: Parameters everywhere. CoRR abs/cs/0701138 (2007) - 2006
- [j22]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
- [j21]Véronique Bruyère, Olivier Carton:
Hierarchy Among Automata on Linear Orderings. Theory Comput. Syst. 38(5): 593-621 (2005) - [j20]Isabel M. Araújo, Véronique Bruyère:
Sturmian words and a criterium by Michaux-Villemaire. Theor. Comput. Sci. 339(1): 88-102 (2005) - [j19]Isabel M. Araújo, Véronique Bruyère:
Words derivated from Sturmian words. Theor. Comput. Sci. 340(1): 204-219 (2005) - [c17]Isabel M. Araújo, Véronique Bruyère:
Sturmian Words: Dynamical Systems and Derivated Words. Developments in Language Theory 2005: 122-133 - [c16]Thomas Brihaye, Véronique Bruyère, Jean-François Raskin:
On Optimal Timed Strategies. FORMATS 2005: 49-64 - 2004
- [c15]Thomas Brihaye, Véronique Bruyère, Jean-François Raskin:
Model-Checking for Weighted Timed Automata. FORMATS/FTRTFT 2004: 277-292 - 2003
- [j18]Véronique Bruyère:
Cumulative defect. Theor. Comput. Sci. 292(1): 97-109 (2003) - [c14]Véronique Bruyère, Jean-François Raskin:
Real-Time Model-Checking: Parameters Everywhere. FSTTCS 2003: 100-111 - [c13]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 - 2002
- [c12]Véronique Bruyère, Olivier Carton:
Automata on Linear Orderings. Developments in Language Theory 2002: 103-115 - [c11]Véronique Bruyère, Olivier Carton:
Hierarchy Among Automata on Linear Orderings. IFIP TCS 2002: 107-118 - 2001
- [c10]Véronique Bruyère, Olivier Carton:
Automata on Linear Orderings. MFCS 2001: 236-247
1990 – 1999
- 1999
- [j17]Véronique Bruyère, Clelia de Felice:
On the Existence of Codings Between Trace Monoids. J. Autom. Lang. Comb. 4(2): 87-100 (1999) - [j16]Véronique Bruyère:
Editorial. J. Autom. Lang. Comb. 4(3): 149-151 (1999) - [j15]Véronique Bruyère, Christophe Reutenauer:
A Proof of Choffrut's Theorem on Subsequential Functions. Theor. Comput. Sci. 215(1-2): 329-335 (1999) - [j14]Véronique Bruyère, Dominique Perrin:
Maximal Bifix Codes. Theor. Comput. Sci. 218(1): 107-121 (1999) - 1998
- [j13]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) - [j12]Véronique Bruyère:
On Maximal Codes with Bounded Synchronization Delay. Theor. Comput. Sci. 204(1-2): 11-28 (1998) - 1997
- [j11]Françoise Point, Véronique Bruyère:
On the Cobham-Semenov Theorem. Theory Comput. Syst. 30(2): 197-220 (1997) - [j10]Véronique Bruyère, Georges Hansel:
Bertrand Numeration Systems and Recognizability. Theor. Comput. Sci. 181(1): 17-43 (1997) - [c9]Véronique Bruyère:
A Completion Algorithm for Codes with Bounded Synchronization Delay. ICALP 1997: 87-97 - 1996
- [j9]Véronique Bruyère, Clelia de Felice:
Any Lifting of a Trace Coding is a Word Coding. Inf. Comput. 130(2): 183-193 (1996) - [c8]Véronique Bruyère, Michel Latteux:
Variable-Length Maximal Codes. ICALP 1996: 24-47 - 1995
- [j8]Véronique Bruyère, Clelia de Felice:
Synchronization and decomposability for a family of codes: Part 2. Discret. Math. 140(1-3): 47-77 (1995) - [j7]Véronique Bruyère, Clelia de Felice, Giovanna Guaiana:
On Some Decision Problems for Trace Codings. Theor. Comput. Sci. 148(2): 227-260 (1995) - [c7]Véronique Bruyère, Georges Hansel:
Recognizable Sets of Numbers in Nonstandard Bases. LATIN 1995: 167-179 - [c6]Véronique Bruyère, Clelia de Felice:
Coding and Strong Coding in Trace Monoids. STACS 1995: 373-384 - 1994
- [c5]Véronique Bruyère, Clelia de Felice, Giovanna Guaiana:
Coding with Traces. STACS 1994: 353-364 - 1992
- [j6]Véronique Bruyère, Clelia de Felice:
Synchronization and Decomposability for a Family of Codes. Int. J. Algebra Comput. 2(4): 367-394 (1992) - [c4]Véronique Bruyère:
Automata and Codes with Bounded Deciphering Delay. LATIN 1992: 99-107 - 1991
- [j5]Véronique Bruyère:
Maximal Codes With Bounded Deciphering Delay. Theor. Comput. Sci. 84(1): 53-76 (1991) - [c3]Véronique Bruyère, Clelia de Felice:
Degree and Decomposability of Variable-Length Codes. ICALP 1991: 575-587 - 1990
- [j4]Véronique Bruyère, Limin Wang, Liang Zhang:
On Completion of Codes with Finite Deciphering Delay. Eur. J. Comb. 11(6): 513-521 (1990)
1980 – 1989
- 1989
- [j3]Véronique Bruyère:
Factorisation Des Ensembles Préfixiels. RAIRO Theor. Informatics Appl. 23(3): 295-315 (1989) - [j2]Véronique Bruyère:
About prefix sets of words. J. Comb. Theory A 51(2): 237-243 (1989) - [c2]Véronique Bruyère:
Completion of Finite Codes with Finite Deciphering Delay. ICALP 1989: 151-163 - 1988
- [j1]Véronique Bruyère:
An Answer to a Question about Finite Maximal Prefix Sets of Words. Theor. Comput. Sci. 56: 339-344 (1988) - [c1]Véronique Bruyère:
On Maximal Prefix Sets of Words. MFCS 1988: 201-209
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 20:14 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
