default search action
Joffroy Beauquier
Person information
- affiliation: University of Paris-Sud, Laboratory for Computer Science (LRI), France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
- [c72]Evangelos Bampas, Joffroy Beauquier, Janna Burman, William Guy-Obé:
Treasure Hunt with Volatile Pheromones. DISC 2023: 8:1-8:21 - 2020
- [j29]Chuan Xu, Joffroy Beauquier, Janna Burman, Shay Kutten, Thomas Nowak:
Data collection in population protocols with non-uniformly random scheduler. Theor. Comput. Sci. 806: 516-530 (2020) - [c71]Fabien Dufoulon
, Janna Burman, Joffroy Beauquier:
Can Uncoordinated Beeps tell Stories? PODC 2020: 408-417
2010 – 2019
- 2019
- [c70]Joffroy Beauquier, Janna Burman, Peter Davies
Optimal Multi-broadcast with Beeps Using Group Testing. SIROCCO 2019: 66-80 - [c69]Janna Burman, Joffroy Beauquier, Devan Sohier:
Space-Optimal Naming in Population Protocols. DISC 2019: 9:1-9:16 - 2018
- [c68]Joffroy Beauquier, Janna Burman, Fabien Dufoulon
Fast Beeping Protocols for Deterministic MIS and (Δ + 1)-Coloring in Sparse Graphs. INFOCOM 2018: 1754-1762 - [c67]Fabien Dufoulon, Janna Burman, Joffroy Beauquier:
Brief Announcement: Beeping a Time-Optimal Leader Election. PODC 2018: 237-239 - [c66]Janna Burman, Joffroy Beauquier, Devan Sohier:
Brief Announcement: Space-Optimal Naming in Population Protocols. PODC 2018: 479-481 - [c65]Joffroy Beauquier, Thibault Bernard, Janna Burman, Shay Kutten, Marie Laveau:
Brief Announcement: Time Efficient Self-stabilizing Stable Marriage. SSS 2018: 387-392 - [c64]Fabien Dufoulon
Beeping a Deterministic Time-Optimal Leader Election. DISC 2018: 20:1-20:17 - 2017
- [c63]Joffroy Beauquier, Janna Burman, Shay Kutten, Thomas Nowak
Data Collection in Population Protocols with Non-uniformly Random Scheduler. ALGOSENSORS 2017: 13-25 - [c62]Chuan Xu, Janna Burman, Joffroy Beauquier:
Power-Aware Population Protocols. ICDCS 2017: 2067-2074 - [c61]Marie Laveau
Self-stabilizing Distributed Stable Marriage. SSS 2017: 46-61 - 2016
- [c60]James Aspnes, Joffroy Beauquier, Janna Burman, Devan Sohier:
Time and Space Optimal Counting in Population Protocols. OPODIS 2016: 13:1-13:17 - [c59]Joffroy Beauquier, Peva Blanchard, Janna Burman, Oksana Denysyuk:
On the Power of Oracle \varOmega ? for Self-Stabilizing Leader Election in Population Protocols. SSS 2016: 20-35 - [i2]James Aspnes, Joffroy Beauquier, Janna Burman, Devan Sohier:
Time and Space Optimal Counting in Population Protocols. CoRR abs/1611.07238 (2016) - 2015
- [c58]Joffroy Beauquier, Peva Blanchard, Janna Burman, Shay Kutten:
The Weakest Oracle for Symmetric Consensus in Population Protocols. ALGOSENSORS 2015: 41-56 - [c57]Joffroy Beauquier, Peva Blanchard, Janna Burman, Rachid Guerraoui
The Benefits of Entropy in Population Protocols. OPODIS 2015: 21:1-21:15 - [c56]Joffroy Beauquier, Janna Burman, Simon Clavière, Devan Sohier:
Space-Optimal Counting in Population Protocols. DISC 2015: 631-646 - 2014
- [c55]Peva Blanchard, Shlomi Dolev, Joffroy Beauquier, Sylvie Delaët:
Practically Self-stabilizing Paxos Replicated State-Machine. NETYS 2014: 99-121 - 2013
- [j28]Joffroy Beauquier, Peva Blanchard, Janna Burman, Sylvie Delaët:
Tight complexity analysis of population protocols with cover times - The ZebraNet example. Theor. Comput. Sci. 512: 15-27 (2013) - [c54]Joffroy Beauquier, Peva Blanchard, Janna Burman:
Self-stabilizing Leader Election in Population Protocols over Arbitrary Communication Graphs. OPODIS 2013: 38-52 - [i1]Peva Blanchard, Shlomi Dolev, Joffroy Beauquier, Sylvie Delaët:
Self-Stabilizing Paxos. CoRR abs/1305.4263 (2013) - 2012
- [c53]Joffroy Beauquier, Janna Burman, Laurent Rosaz, Brigitte Rozoy:
Non-deterministic Population Protocols. OPODIS 2012: 61-75 - 2011
- [j27]Joffroy Beauquier, Janna Burman, Shay Kutten:
A self-stabilizing transformer for population protocols with covering. Theor. Comput. Sci. 412(33): 4247-4259 (2011) - [c52]Joffroy Beauquier, Janna Burman:
Self-stabilizing Mutual Exclusion and Group Mutual Exclusion for Population Protocols with Covering. OPODIS 2011: 235-250 - [c51]Joffroy Beauquier, Peva Blanchard, Janna Burman, Sylvie Delaët:
Computing Time Complexity of Population Protocols with Cover Times - The ZebraNet Example. SSS 2011: 47-61 - 2010
- [c50]Joffroy Beauquier, Janna Burman:
Self-stabilizing Synchronization in Mobile Sensor Networks with Covering. DCOSS 2010: 362-378 - [c49]Joffroy Beauquier, Janna Burman, Julien Clément, Shay Kutten:
On utilizing speed in networks of mobile agents. PODC 2010: 305-314
2000 – 2009
- 2009
- [c48]Joffroy Beauquier, Janna Burman, Julien Clément, Shay Kutten:
Brief announcement: non-self-stabilizing and self-stabilizing gathering in networks of mobile agents--the notion of speed. PODC 2009: 286-287 - [c47]Joffroy Beauquier, Janna Burman, Shay Kutten:
Making Population Protocols Self-stabilizing. SSS 2009: 90-104 - 2008
- [c46]Joffroy Beauquier, Colette Johnen:
Analyze of Probabilistic Algorithms under Indeterministic Scheduler. ISPA 2008: 553-558 - 2007
- [j26]Joffroy Beauquier, Sylvie Delaët, Shlomi Dolev
Transient fault detectors. Distributed Comput. 20(1): 39-51 (2007) - [j25]Joffroy Beauquier, Maria Gradinariu, Colette Johnen:
Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings. Distributed Comput. 20(1): 75-93 (2007) - [c45]Thomas Hérault
A Model for Large Scale Self-Stabilization. IPDPS 2007: 1-10 - [c44]Joffroy Beauquier, Julien Clément, Stéphane Messika, Laurent Rosaz, Brigitte Rozoy:
Self-stabilizing counting in mobile sensor networks. PODC 2007: 396-397 - [c43]Joffroy Beauquier, Julien Clément, Stéphane Messika, Laurent Rosaz, Brigitte Rozoy:
Self-stabilizing Counting in Mobile Sensor Networks with a Base Station. DISC 2007: 63-76 - 2006
- [j24]Joffroy Beauquier, Laurence Pilard, Brigitte Rozoy:
Observing Locally Self-Stabilization in a Probabilistic Way. J. Aerosp. Comput. Inf. Commun. 3(10): 516-537 (2006) - [c42]Joffroy Beauquier, Sylvie Delaët, Sammy Haddad:
Necessary and sufficient conditions for 1-adaptivity. IPDPS 2006 - [c41]Joffroy Beauquier, Colette Johnen, Stéphane Messika:
All k -Bounded Policies Are Equivalent for Self-stabilization. SSS 2006: 82-94 - [c40]Joffroy Beauquier, Sylvie Delaët, Sammy Haddad:
A 1-Strong Self-stabilizing Transformer. SSS 2006: 95-109 - [c39]Thomas Hérault
Brief Announcement: Self-stabilizing Spanning Tree Algorithm for Large Scale Systems. SSS 2006: 574-575 - [c38]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 - 2005
- [j23]Joffroy Beauquier, Laurence Pilard, Brigitte Rozoy:
Observing locally self-stabilization. J. High Speed Networks 14(1): 3-19 (2005) - [c37]Joffroy Beauquier, Laurence Pilard, Brigitte Rozoy:
Observing Locally Self-stabilization in a Probabilistic Way. DISC 2005: 399-413 - 2003
- [j22]Joffroy Beauquier, Sébastien Cantarell, Ajoy Kumar Datta:
Group Mutual Exclusin in Tree Networks. J. Inf. Sci. Eng. 19(3): 415-432 (2003) - 2002
- [j21]Joffroy Beauquier, Ajoy Kumar Datta, Maria Gradinariu, Frédéric Magniette:
Self-Stabilizing Local Mutual Exclusion and Daemon Refinement. Chic. J. Theor. Comput. Sci. 2002 (2002) - [j20]Joffroy Beauquier, Maria Gradinariu, Colette Johnen, Jérôme Olivier Durand-Lose:
Token-Based Self-Stabilizing Uniform Algorithms. J. Parallel Distributed Comput. 62(5): 899-921 (2002) - [c36]Joffroy Beauquier, Sébastien Cantarell, Ajoy Kumar Datta, Franck Petit
Group Mutual Exclusion In Tree Networks. ICPADS 2002: 111-116 - [c35]Joffroy Beauquier, Thomas Hérault
Fault-Local Stabilization: The Shortest Path Tree. SRDS 2002: 62-69 - 2001
- [j19]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 Comput. 14(2): 83-95 (2001) - [c34]Joffroy Beauquier, Maria Gradinariu, Colette Johnen:
Cross-Over Composition - Enforcement of Fairness under Unfair Adversary. WSS 2001: 19-34 - [c33]Joffroy Beauquier, Thomas Hérault
Easy Stabilization with an Agent. WSS 2001: 35-50 - 2000
- [c32]Joffroy Beauquier, Ajoy Kumar Datta, Maria Gradinariu, Frédéric Magniette
Self-Stabilizing Local Mutual Exclusion and Daemon Refinement. DISC 2000: 223-237
1990 – 1999
- 1999
- [c31]Joffroy Beauquier, Maria Gradinariu, Colette Johnen:
Memory Space Requirements for Self-Stabilizing Leader Election Protocols. PODC 1999: 199-207 - [c30]Joffroy Beauquier, Christophe Genolini, Shay Kutten:
Optimal Reactive k-Stabilization: The Case of Mutual Exclusion. PODC 1999: 209-218 - [c29]Joffroy Beauquier, Béatrice Bérard, Laurent Fribourg:
A New Rewrite Method for Convergence of Self-Stabilizing Systems. DISC 1999: 240-253 - [c28]Joffroy Beauquier, Ajoy Kumar Datta, Sébastien Tixeuil:
Self-stabilizing census with cut-through constraint. WSS 1999: 70-77 - 1998
- [c27]Luc Onana Alima, Joffroy Beauquier, Ajoy Kumar Datta, Sébastien Tixeuil:
Self-Stabilization with Global Rooted Synchronizers. ICDCS 1998: 102-109 - [c26]Joffroy Beauquier, Christophe Genolini, Shay Kutten:
k-Stabilization of Reactive Tasks. PODC 1998: 318 - [c25]Joffroy Beauquier, Sylvie Delaët, Shlomi Dolev
Transient Fault Detectors. DISC 1998: 62-74 - 1997
- [j18]Joffroy Beauquier, Synnöve Kekkonen-Moneta:
Fault-tolerance and self-stabilization: impossibility results and solutions using self-stabilizing failure detectors. Int. J. Syst. Sci. 28(11): 1177-1187 (1997) - [c24]Joffroy Beauquier:
Proving SelfStabilizing Randomized Protocols. OPODIS 1997: 279-284 - [c23]Joffroy Beauquier, Synnöve Kekkonen-Moneta:
On FTSS-Solvable Distributed Problems. PODC 1997: 290 - [c22]Colette Johnen, Gianluigi Alari, Joffroy Beauquier, Ajoy Kumar Datta:
Self-Stabilizing Depth-First Token Passing on Rooted Networks. WDAG 1997: 260-274 - [c21]Joffroy Beauquier, Synnöve Kekkonen-Moneta:
On FTSS-solvable distributed problems. WSS 1997: 64-79 - 1996
- [c20]Joffroy Beauquier, Oliver Debas, Synnöve Kekkonen-Moneta:
Fault-Tolerant and Self-Stabilizing Ring Orientation. SIROCCO 1996: 59-72 - 1994
- [c19]Joffroy Beauquier, Sylvie Delaët:
Probabilistic Self-Stabilizing Mutual Exclusion in Uniform Rings. PODC 1994: 378 - 1992
- [j17]Joffroy Beauquier:
Two Distributed Problems Involving Byzantine Processes. Theor. Comput. Sci. 95(1): 169-185 (1992) - 1991
- [c18]Joffroy Beauquier, Annie Choquet, Antoine Petit, Guy Vidal-Naquet:
Detection of Deadlocks in an Infinite Family of Nets. STACS 1991: 334-347 - 1990
- [c17]Joffroy Beauquier:
Fault-Tolerant Naming and Mutual Exclusion. Semantics of Systems of Concurrent Processes 1990: 50-61 - [c16]Joffroy Beauquier, Paul Gastin, Vincent Villain:
A Linear Fault-Tolerant Naming Algorithm. WDAG 1990: 57-70
1980 – 1989
- 1989
- [c15]Joffroy Beauquier, Annie Choquet, Antoine Petit, Guy Vidal-Naquet:
Syntactical Properties of Unbounded Nets of Processors. TAPSOFT, Vol.1 1989: 119-133 - 1988
- [c14]Joffroy Beauquier, Antoine Petit:
Distribution of Sequential Processes. MFCS 1988: 180-189 - 1987
- [j16]Joffroy Beauquier, Meera Blattner, Michel Latteux:
On Commutative Context-Free Languages. J. Comput. Syst. Sci. 35(3): 311-320 (1987) - [j15]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
- [c13]Joffroy Beauquier, Béatrice Bérard:
On the Equivalence of Synchronization Sets. CAAP 1986: 17-29 - 1985
- [c12]Joffroy Beauquier, Loÿs Thimonier:
On formal languages, probabilities, paging and decoding algorithms. FCT 1985: 44-52 - 1984
- [j14]Jean-Michel Autebert, Joffroy Beauquier, Luc Boasson, Françoise Gire:
Bicentres de langages algébriques. Acta Informatica 21: 209-227 (1984) - [j13]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) - [c11]Joffroy Beauquier, Loÿs Thimonier:
Computability of Probabilistic Parameters for Some Classes of Formal Languages. MFCS 1984: 194-204 - 1983
- [c10]Joffroy Beauquier:
Prefix and Perfect Languages. CAAP 1983: 129-140 - [c9]Joffroy Beauquier, Françoise Gire:
On Context-Free Generators. FOCS 1983: 215 - 1982
- [j12]Jean-Michel Autebert, Joffroy Beauquier, Luc Boasson:
Formes de langages et de grammaires. Acta Informatica 17: 193-213 (1982) - [j11]Jean-Michel Autebert, Joffroy Beauquier, Luc Boasson, Michel Latteux:
Indécidabilité de la Condition IRS. RAIRO Theor. Informatics Appl. 16(2): 129-138 (1982) - [c8]Joffroy Beauquier, Michel Latteux:
Substitution of Bounded Rational Cone. FOCS 1982: 236-243 - 1981
- [j10]Jean-Michel Autebert, Joffroy Beauquier, Luc Boasson, Michel Latteux:
Languages albébriques dominés par des langages unaires. Inf. Control. 48(1): 49-53 (1981) - [j9]Joffroy Beauquier, Jean Berstel:
More about the "Geography" of Context-Free Languages. Inf. Control. 49(2): 91-108 (1981) - [j8]Joffroy Beauquier:
A Remark About a Substitution Property. Math. Syst. Theory 14: 189-191 (1981) - [j7]Joffroy Beauquier:
Substitution of Semi-AFL'S. Theor. Comput. Sci. 14: 187-193 (1981) - [c7]Joffroy Beauquier:
A New Operation Between Languages. FCT 1981: 400-409 - [c6]Joffroy Beauquier, Jean Berstel:
More about the "Geography" of Context-Free Languages. MFCS 1981: 183-192 - 1980
- [j6]Jean-Michel Autebert, Joffroy Beauquier, Luc Boasson:
Langages sur des alphabets infinis. Discret. Appl. Math. 2(1): 1-20 (1980)
1970 – 1979
- 1979
- [j5]Joffroy Beauquier:
Deux Familles de Langages Incomparables. Inf. Control. 43(2): 101-122 (1979) - [j4]Jean-Michel Autebert, Joffroy Beauquier, Luc Boasson, Maurice Nivat:
Quelques problèmes ouverts en théorie des langages algébriques. RAIRO Theor. Informatics Appl. 13(4): 363-378 (1979) - [j3]Joffroy Beauquier:
Generateurs Algebriques et Systemes de Paires Iterantes. Theor. Comput. Sci. 8: 293-323 (1979) - [c5]Joffroy Beauquier:
Independence of linear and one-counter generators (extended abstract). FCT 1979: 45-51 - [c4]Joffroy Beauquier:
Strong Non-Deterministic Context-Free Languages. Theoretical Computer Science 1979: 47-57 - 1978
- [j2]Joffroy Beauquier:
Un générateur inhéremment ambigu du cône des languages algébiques. RAIRO Theor. Informatics Appl. 12(2): 99-108 (1978) - [c3]Joffroy Beauquier:
Ambiguite Forte. ICALP 1978: 52-62 - 1977
- [b1]Joffroy Beauquier:
Contribution a l'etude de la complexite structurelle des langages algebriques. Univ. Paris VII, 1977, pp. 1-161 - 1976
- [c2]Joffroy Beauquier:
Générateurs algébriques non-ambigus. ICALP 1976: 66-73 - 1974
- [j1]Jean-Michel Autebert, Joffroy Beauquier:
Une caractérisation des générateurs standard. RAIRO Theor. Informatics Appl. 8(1): 63-83 (1974) - 1973
- [c1]Joffroy Beauquier:
Une caractérisation des langages quasi-rationnels standards. Automatentheorie und Formale Sprachen 1973: 132-138
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 2024-05-08 20:57 CEST 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: