2008 | ||
---|---|---|
69 | EE | Joffroy Beauquier, Colette Johnen: Analyze of Probabilistic Algorithms under Indeterministic Scheduler. ISPA 2008: 553-558 |
2007 | ||
68 | EE | Joffroy Beauquier, Julien Clement, Stéphane Messika, Laurent Rosaz, Brigitte Rozoy: Self-stabilizing Counting in Mobile Sensor Networks with a Base Station. DISC 2007: 63-76 |
67 | EE | Thomas Hérault, Pierre Lemarinier, Olivier Peres, Laurence Pilard, Joffroy Beauquier: A Model for Large Scale Self-Stabilization. IPDPS 2007: 1-10 |
66 | EE | Joffroy Beauquier, Julien Clement, Stéphane Messika, Laurent Rosaz, Brigitte Rozoy: Self-stabilizing counting in mobile sensor networks. PODC 2007: 396-397 |
65 | EE | Joffroy Beauquier, Sylvie Delaët, Shlomi Dolev, Sébastien Tixeuil: Transient fault detectors. Distributed Computing 20(1): 39-51 (2007) |
64 | EE | Joffroy Beauquier, Maria Gradinariu, Colette Johnen: Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings. Distributed Computing 20(1): 75-93 (2007) |
2006 | ||
63 | EE | Joffroy Beauquier, Colette Johnen, Stéphane Messika: Brief Announcement: Computing Automatically the Stabilization Time Against the Worst and the Best Schedules. DISC 2006: 543-547 |
62 | EE | Joffroy Beauquier, Sylvie Delaët, Sammy Haddad: Necessary and sufficient conditions for 1-adaptivity. IPDPS 2006 |
61 | EE | Thomas Hérault, Pierre Lemarinier, Olivier Peres, Laurence Pilard, Joffroy Beauquier: Brief Announcement: Self-stabilizing Spanning Tree Algorithm for Large Scale Systems. SSS 2006: 574-575 |
60 | EE | Joffroy Beauquier, Colette Johnen, Stéphane Messika: All k -Bounded Policies Are Equivalent for Self-stabilization. SSS 2006: 82-94 |
59 | EE | Joffroy Beauquier, Sylvie Delaët, Sammy Haddad: A 1-Strong Self-stabilizing Transformer. SSS 2006: 95-109 |
2005 | ||
58 | EE | Joffroy Beauquier, Laurence Pilard, Brigitte Rozoy: Observing Locally Self-stabilization in a Probabilistic Way. DISC 2005: 399-413 |
57 | EE | Joffroy Beauquier, Laurence Pilard, Brigitte Rozoy: Observing locally self-stabilization. J. High Speed Networks 14(1): 3-19 (2005) |
2003 | ||
56 | EE | Joffroy Beauquier, Sébastien Cantarell, Ajoy Kumar Datta: Group Mutual Exclusin in Tree Networks. J. Inf. Sci. Eng. 19(3): 415-432 (2003) |
2002 | ||
55 | EE | Joffroy Beauquier, Sébastien Cantarell, Ajoy Kumar Datta, Franck Petit: Group Mutual Exclusion In Tree Networks. ICPADS 2002: 111-116 |
54 | EE | Joffroy Beauquier, Thomas Hérault: Fault-Local Stabilization: The Shortest Path Tree. SRDS 2002: 62-69 |
53 | EE | Joffroy Beauquier, Ajoy Kumar Datta, Maria Gradinariu, Frédéric Magniette: Self-Stabilizing Local Mutual Exclusion and Daemon Refinement. Chicago J. Theor. Comput. Sci. 2002: (2002) |
52 | EE | Joffroy Beauquier, Maria Gradinariu, Colette Johnen, Jérôme Olivier Durand-Lose: Token-Based Self-Stabilizing Uniform Algorithms. J. Parallel Distrib. Comput. 62(5): 899-921 (2002) |
2001 | ||
51 | EE | Joffroy Beauquier, Maria Gradinariu, Colette Johnen: Cross-Over Composition - Enforcement of Fairness under Unfair Adversary. WSS 2001: 19-34 |
50 | EE | Joffroy Beauquier, Thomas Hérault, Elad Schiller: Easy Stabilization with an Agent. WSS 2001: 35-50 |
49 | EE | Joffroy Beauquier, Béatrice Bérard, Laurent Fribourg, Frédéric Magniette: Proving convergence of self-stabilizing systems using first-order rewriting and regular languages. Distributed Computing 14(2): 83-95 (2001) |
2000 | ||
48 | EE | Joffroy Beauquier, Ajoy Kumar Datta, Maria Gradinariu, Frédéric Magniette: Self-Stabilizing Local Mutual Exclusion and Daemon Refinement. DISC 2000: 223-237 |
1999 | ||
47 | EE | Joffroy Beauquier, Béatrice Bérard, Laurent Fribourg: A New Rewrite Method for Convergence of Self-Stabilizing Systems. DISC 1999: 240-253 |
46 | EE | Joffroy Beauquier, Maria Gradinariu, Colette Johnen: Memory Space Requirements for Self-Stabilizing Leader Election Protocols. PODC 1999: 199-207 |
45 | EE | Joffroy Beauquier, Christophe Genolini, Shay Kutten: Optimal Reactive k-Stabilization: The Case of Mutual Exclusion. PODC 1999: 209-218 |
44 | Joffroy Beauquier, Ajoy Kumar Datta, Sébastien Tixeuil: Self-stabilizing census with cut-through constraint. WSS 1999: 70-77 | |
1998 | ||
43 | EE | Joffroy Beauquier, Sylvie Delaët, Shlomi Dolev, Sébastien Tixeuil: Transient Fault Detectors. DISC 1998: 62-74 |
42 | EE | Luc Onana Alima, Joffroy Beauquier, Ajoy Kumar Datta, Sébastien Tixeuil: Self-Stabilization with Global Rooted Synchronizers. ICDCS 1998: 102-109 |
41 | EE | Joffroy Beauquier, Christophe Genolini, Shay Kutten: k-Stabilization of Reactive Tasks. PODC 1998: 318 |
1997 | ||
40 | Joffroy Beauquier: Proving SelfStabilizing Randomized Protocols. OPODIS 1997: 279-284 | |
39 | Joffroy Beauquier, Synnöve Kekkonen-Moneta: On FTSS-Solvable Distributed Problems. PODC 1997: 290 | |
38 | Colette Johnen, Gianluigi Alari, Joffroy Beauquier, Ajoy Kumar Datta: Self-Stabilizing Depth-First Token Passing on Rooted Networks. WDAG 1997: 260-274 | |
37 | Joffroy Beauquier, Synnöve Kekkonen-Moneta: On FTSS-solvable distributed problems. WSS 1997: 64-79 | |
36 | EE | Joffroy Beauquier, Synnöve Kekkonen-Moneta: Fault-tolerance and self-stabilization: impossibility results and solutions using self-stabilizing failure detectors. Int. J. Systems Science 28(11): 1177-1187 (1997) |
1996 | ||
35 | Joffroy Beauquier, Oliver Debas, Synnöve Kekkonen-Moneta: Fault-Tolerant and Self-Stabilizing Ring Orientation. SIROCCO 1996: 59-72 | |
1994 | ||
34 | Joffroy Beauquier, Sylvie Delaët: Probabilistic Self-Stabilizing Mutual Exclusion in Uniform Rings. PODC 1994: 378 | |
1992 | ||
33 | Joffroy Beauquier: Two Distributed Problems Involving Byzantine Processes. Theor. Comput. Sci. 95(1): 169-185 (1992) | |
1991 | ||
32 | Joffroy Beauquier, Annie Choquet, Antoine Petit, Guy Vidal-Naquet: Detection of Deadlocks in an Infinite Family of Nets. STACS 1991: 334-347 | |
1990 | ||
31 | Joffroy Beauquier: Fault-Tolerant Naming and Mutual Exclusion. Semantics of Systems of Concurrent Processes 1990: 50-61 | |
30 | Joffroy Beauquier, Paul Gastin, Vincent Villain: A Linear Fault-Tolerant Naming Algorithm. WDAG 1990: 57-70 | |
1989 | ||
29 | Joffroy Beauquier, Annie Choquet, Antoine Petit, Guy Vidal-Naquet: Syntactical Properties of Unbounded Nets of Processors. TAPSOFT, Vol.1 1989: 119-133 | |
1988 | ||
28 | Joffroy Beauquier, Antoine Petit: Distribution of Sequential Processes. MFCS 1988: 180-189 | |
1987 | ||
27 | Joffroy Beauquier, Meera Blattner, Michel Latteux: On Commutative Context-Free Languages. J. Comput. Syst. Sci. 35(3): 311-320 (1987) | |
26 | Joffroy Beauquier, Françoise Gire: Une Note sur le Théorème de Caractérisation des Générateurs Algébriques. Theor. Comput. Sci. 51: 117-127 (1987) | |
1986 | ||
25 | Joffroy Beauquier, Béatrice Bérard: On the Equivalence of Synchronization Sets. CAAP 1986: 17-29 | |
1985 | ||
24 | Joffroy Beauquier, Loÿs Thimonier: On formal languages, probabilities, paging and decoding algorithms. FCT 1985: 44-52 | |
1984 | ||
23 | Joffroy Beauquier, Loÿs Thimonier: Computability of Probabilistic Parameters for Some Classes of Formal Languages. MFCS 1984: 194-204 | |
22 | Jean-Michel Autebert, Joffroy Beauquier, Luc Boasson, Françoise Gire: Bicentres de langages algébriques. Acta Inf. 21: 209-227 (1984) | |
21 | Jean-Michel Autebert, Joffroy Beauquier, Luc Boasson, Géraud Sénizergues: Remarques sur les Langages de Parenthèses. Theor. Comput. Sci. 31: 337-349 (1984) | |
1983 | ||
20 | Joffroy Beauquier: Prefix and Perfect Languages. CAAP 1983: 129-140 | |
19 | Joffroy Beauquier, Françoise Gire: On Context-Free Generators FOCS 1983: 215 | |
1982 | ||
18 | Joffroy Beauquier, Michel Latteux: Substitution of Bounded Rational Cone FOCS 1982: 236-243 | |
17 | Jean-Michel Autebert, Joffroy Beauquier, Luc Boasson: Formes de langages et de grammaires. Acta Inf. 17: 193-213 (1982) | |
16 | Jean-Michel Autebert, Joffroy Beauquier, Luc Boasson, Michel Latteux: Indécidabilité de la Condition IRS. ITA 16(2): 129-138 (1982) | |
1981 | ||
15 | Joffroy Beauquier: A New Operation Between Languages. FCT 1981: 400-409 | |
14 | Joffroy Beauquier, Jean Berstel: More about the ``Geography'' of Context-Free Languages. MFCS 1981: 183-192 | |
13 | Jean-Michel Autebert, Joffroy Beauquier, Luc Boasson, Michel Latteux: Languages albébriques dominés par des langages unaires Information and Control 48(1): 49-53 (1981) | |
12 | Joffroy Beauquier, Jean Berstel: More about the ``Geography'' of Context-Free Languages Information and Control 49(2): 91-108 (1981) | |
11 | Joffroy Beauquier: A Remark About a Substitution Property. Mathematical Systems Theory 14: 189-191 (1981) | |
10 | Joffroy Beauquier: Substitution of Semi-AFL'S. Theor. Comput. Sci. 14: 187-193 (1981) | |
1979 | ||
9 | Joffroy Beauquier: Independence of linear and one-counter generators (extended abstract). FCT 1979: 45-51 | |
8 | Joffroy Beauquier: Strong Non-Deterministic Context-Free Languages. Theoretical Computer Science 1979: 47-57 | |
7 | Jean-Michel Autebert, Joffroy Beauquier, Luc Boasson, Maurice Nivat: Quelques problèmes ouverts en théorie des langages algébriques. ITA 13(4): (1979) | |
6 | Joffroy Beauquier: Deux Familles de Langages Incomparables Information and Control 43(2): 101-122 (1979) | |
5 | Joffroy Beauquier: Generateurs Algebriques et Systemes de Paires Iterantes. Theor. Comput. Sci. 8: 293-323 (1979) | |
1978 | ||
4 | Joffroy Beauquier: Ambiguite Forte. ICALP 1978: 52-62 | |
3 | Joffroy Beauquier: Un générateur inhéremment ambigu du cône des languages algébiques. ITA 12(2): (1978) | |
1976 | ||
2 | Joffroy Beauquier: Générateurs algébriques non-ambigus. ICALP 1976: 66-73 | |
1973 | ||
1 | Joffroy Beauquier: Une caractérisation des langages quasi-rationnels standards. Automatentheorie und Formale Sprachen 1973: 132-138 |