Joffroy Beauquier

According to our database1, Joffroy Beauquier
  • authored at least 92 papers between 1973 and 2017.
  • has a "Dijkstra number"2 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Self-stabilizing Distributed Stable Marriage.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2017

Power-Aware Population Protocols.
Proceedings of the 37th IEEE International Conference on Distributed Computing Systems, 2017

2016
Time and Space Optimal Counting in Population Protocols.
CoRR, 2016

On the Power of Oracle \varOmega ? for Self-Stabilizing Leader Election in Population Protocols.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2016

Time and Space Optimal Counting in Population Protocols.
Proceedings of the 20th International Conference on Principles of Distributed Systems, 2016

2015
Space-Optimal Counting in Population Protocols.
Proceedings of the Distributed Computing - 29th International Symposium, 2015

The Benefits of Entropy in Population Protocols.
Proceedings of the 19th International Conference on Principles of Distributed Systems, 2015

The Weakest Oracle for Symmetric Consensus in Population Protocols.
Proceedings of the Algorithms for Sensor Systems, 2015

2014
Practically Self-stabilizing Paxos Replicated State-Machine.
Proceedings of the Networked Systems - Second International Conference, 2014

2013
Tight complexity analysis of population protocols with cover times - The ZebraNet example.
Theor. Comput. Sci., 2013

Self-Stabilizing Paxos
CoRR, 2013

Self-stabilizing Leader Election in Population Protocols over Arbitrary Communication Graphs.
Proceedings of the Principles of Distributed Systems - 17th International Conference, 2013

2012
Non-deterministic Population Protocols.
Proceedings of the Principles of Distributed Systems, 16th International Conference, 2012

2011
A self-stabilizing transformer for population protocols with covering.
Theor. Comput. Sci., 2011

Computing Time Complexity of Population Protocols with Cover Times - The ZebraNet Example.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2011

Self-stabilizing Mutual Exclusion and Group Mutual Exclusion for Population Protocols with Covering.
Proceedings of the Principles of Distributed Systems - 15th International Conference, 2011

2010
On utilizing speed in networks of mobile agents.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Self-stabilizing Synchronization in Mobile Sensor Networks with Covering.
Proceedings of the Distributed Computing in Sensor Systems, 2010

2009
Making Population Protocols Self-stabilizing.
Proceedings of the Stabilization, 2009

Brief announcement: non-self-stabilizing and self-stabilizing gathering in networks of mobile agents--the notion of speed.
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

2008
Analyze of Probabilistic Algorithms under Indeterministic Scheduler.
Proceedings of the IEEE International Symposium on Parallel and Distributed Processing with Applications, 2008

2007
Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings.
Distributed Computing, 2007

Transient fault detectors.
Distributed Computing, 2007

Self-stabilizing Counting in Mobile Sensor Networks with a Base Station.
Proceedings of the Distributed Computing, 21st International Symposium, 2007

Self-stabilizing counting in mobile sensor networks.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

A Model for Large Scale Self-Stabilization.
Proceedings of the 21th International Parallel and Distributed Processing Symposium (IPDPS 2007), 2007

2006
Observing Locally Self-Stabilization in a Probabilistic Way.
JACIC, 2006

Brief Announcement: Computing Automatically the Stabilization Time Against the Worst and the Best Schedules.
Proceedings of the Distributed Computing, 20th International Symposium, 2006

Brief Announcement: Self-stabilizing Spanning Tree Algorithm for Large Scale Systems.
Proceedings of the Stabilization, 2006

All k -Bounded Policies Are Equivalent for Self-stabilization.
Proceedings of the Stabilization, 2006

A 1-Strong Self-stabilizing Transformer.
Proceedings of the Stabilization, 2006

Necessary and sufficient conditions for 1-adaptivity.
Proceedings of the 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), 2006

2005
Observing locally self-stabilization.
J. High Speed Networks, 2005

Observing Locally Self-stabilization in a Probabilistic Way.
Proceedings of the Distributed Computing, 19th International Conference, 2005

2003
Group Mutual Exclusin in Tree Networks.
J. Inf. Sci. Eng., 2003

2002
Token-Based Self-Stabilizing Uniform Algorithms.
J. Parallel Distrib. Comput., 2002

Self-Stabilizing Local Mutual Exclusion and Daemon Refinement.
Chicago J. Theor. Comput. Sci., 2002

Fault-Local Stabilization: The Shortest Path Tree.
Proceedings of the 21st Symposium on Reliable Distributed Systems (SRDS 2002), 2002

Group Mutual Exclusion In Tree Networks.
Proceedings of the 9th International Conference on Parallel and Distributed Systems, 2002

2001
Proving convergence of self-stabilizing systems using first-order rewriting and regular languages.
Distributed Computing, 2001

Easy Stabilization with an Agent.
Proceedings of the Self-Stabilizing Systems, 5th International Workshop, 2001

Cross-Over Composition - Enforcement of Fairness under Unfair Adversary.
Proceedings of the Self-Stabilizing Systems, 5th International Workshop, 2001

2000
Self-Stabilizing Local Mutual Exclusion and Daemon Refinement.
Proceedings of the Distributed Computing, 14th International Conference, 2000

1999
Self-stabilizing census with cut-through constraint.
Proceedings of the 1999 ICDCS Workshop on Self-stabilizing Systems, 1999

A New Rewrite Method for Convergence of Self-Stabilizing Systems.
Proceedings of the Distributed Computing, 1999

Optimal Reactive k-Stabilization: The Case of Mutual Exclusion.
Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, 1999

Memory Space Requirements for Self-Stabilizing Leader Election Protocols.
Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, 1999

1998
Transient Fault Detectors.
Proceedings of the Distributed Computing, 12th International Symposium, 1998

k-Stabilization of Reactive Tasks.
Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, 1998

Self-Stabilization with Global Rooted Synchronizers.
Proceedings of the 18th International Conference on Distributed Computing Systems, 1998

1997
Fault-tolerance and self-stabilization: impossibility results and solutions using self-stabilizing failure detectors.
Int. J. Systems Science, 1997

On FTSS-solvable distributed problems.
Proceedings of the 3rd Workshop on Self-stabilizing Systems, 1997

Self-Stabilizing Depth-First Token Passing on Rooted Networks.
Proceedings of the Distributed Algorithms, 11th International Workshop, 1997

On FTSS-Solvable Distributed Problems.
Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, 1997

Proving SelfStabilizing Randomized Protocols.
Proceedings of the On Principles Of Distributed Systems, 1997

1996
Fault-Tolerant and Self-Stabilizing Ring Orientation.
Proceedings of the SIROCCO'96, 1996

1994
Probabilistic Self-Stabilizing Mutual Exclusion in Uniform Rings.
Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994

1992
Two Distributed Problems Involving Byzantine Processes.
Theor. Comput. Sci., 1992

1991
Detection of Deadlocks in an Infinite Family of Nets.
Proceedings of the STACS 91, 1991

1990
A Linear Fault-Tolerant Naming Algorithm.
Proceedings of the Distributed Algorithms, 4th International Workshop, 1990

Fault-Tolerant Naming and Mutual Exclusion.
Proceedings of the Semantics of Systems of Concurrent Processes, 1990

1989
Syntactical Properties of Unbounded Nets of Processors.
Proceedings of the TAPSOFT'89: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1989

1988
Distribution of Sequential Processes.
Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

1987
Une Note sur le Théorème de Caractérisation des Générateurs Algébriques.
Theor. Comput. Sci., 1987

On Commutative Context-Free Languages.
J. Comput. Syst. Sci., 1987

1986
On the Equivalence of Synchronization Sets.
Proceedings of the CAAP '86, 1986

1985
On formal languages, probabilities, paging and decoding algorithms.
Proceedings of the Fundamentals of Computation Theory, 1985

1984
Remarques sur les Langages de Parenthèses.
Theor. Comput. Sci., 1984

Bicentres de langages algébriques.
Acta Inf., 1984

Computability of Probabilistic Parameters for Some Classes of Formal Languages.
Proceedings of the Mathematical Foundations of Computer Science 1984, 1984

1983
On Context-Free Generators
Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983

Prefix and Perfect Languages.
Proceedings of the CAAP'83, 1983

1982
Indécidabilité de la Condition IRS.
ITA, 1982

Formes de langages et de grammaires.
Acta Inf., 1982

Substitution of Bounded Rational Cone
Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982

1981
More about the "Geography" of Context-Free Languages
Information and Control, May, 1981

Languages albébriques dominés par des langages unaires
Information and Control, January, 1981

Substitution of Semi-AFL'S.
Theor. Comput. Sci., 1981

A Remark About a Substitution Property.
Mathematical Systems Theory, 1981

More about the "Geography" of Context-Free Languages.
Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981

A New Operation Between Languages.
Proceedings of the Fundamentals of Computation Theory, 1981

1980
Langages sur des alphabets infinis.
Discrete Applied Mathematics, 1980

1979
Deux Familles de Langages Incomparables
Information and Control, November, 1979

Generateurs Algebriques et Systemes de Paires Iterantes.
Theor. Comput. Sci., 1979

Quelques problèmes ouverts en théorie des langages algébriques.
ITA, 1979

Strong Non-Deterministic Context-Free Languages.
Proceedings of the Theoretical Computer Science, 1979

Independence of linear and one-counter generators (extended abstract).
FCT, 1979

1978
Un générateur inhéremment ambigu du cône des languages algébiques.
ITA, 1978

Ambiguite Forte.
Proceedings of the Automata, 1978

1977
Contribution a l'etude de la complexite structurelle des langages algebriques.
PhD thesis, 1977

1976
Générateurs algébriques non-ambigus.
ICALP, 1976

1973
Une caractérisation des langages quasi-rationnels standards.
Proceedings of the 1. Fachtagung über Automatentheorie und Formale Sprachen, 1973


  Loading...