Yves Métivier

Affiliations:
  • LaBRI, Bordeaux, France


According to our database1, Yves Métivier authored at least 84 papers between 1983 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Revisiting the Role of Coverings in Anonymous Networks: Spanning Tree Construction and Topology Recognition.
CoRR, 2021

2019
Counting in one-hop beeping networks.
Theor. Comput. Sci., 2019

Design patterns in beeping algorithms: Examples, emulation, and analysis.
Inf. Comput., 2019

Deterministic Leader Election Takes Θ(D+log n) Bit Rounds.
Algorithmica, 2019

2016
Randomised distributed MIS and colouring algorithms for rings with oriented edges in O(√(log n)) bit rounds.
Inf. Comput., 2016

A distributed enumeration algorithm and applications to all pairs shortest paths, diameter...
Inf. Comput., 2016

Deterministic Leader Election in O(D+\log n) Time with Messages of Size O(1).
Proceedings of the Distributed Computing - 30th International Symposium, 2016

Design Patterns in Beeping Algorithms.
Proceedings of the 20th International Conference on Principles of Distributed Systems, 2016

2015
Analysis of fully distributed splitting and naming probabilistic procedures and applications.
Theor. Comput. Sci., 2015

On Distributed Computing with Beeps.
CoRR, 2015

2014
On Lower Bounds for the Time and the Bit Complexity of Some Probabilistic Distributed Graph Algorithms - (Extended Abstract).
Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014

2013
On the time and the bit complexity of distributed randomised anonymous ring colouring.
Theor. Comput. Sci., 2013

Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings.
Inf. Comput., 2013

Analysis of Fully Distributed Splitting and Naming Probabilistic Procedures and Applications - (Extended Abstract).
Proceedings of the Structural Information and Communication Complexity, 2013

2012
Enumeration and Leader Election in Partially Anonymous and Multi-hop Broadcast Networks.
Fundam. Informaticae, 2012

Election in partially anonymous networks with arbitrary knowledge in message passing systems.
Distributed Comput., 2012

On Snapshots and Stable Properties Detection in Anonymous Fully Distributed Systems (Extended Abstract).
Proceedings of the Structural Information and Communication Complexity, 2012

2011
An optimal bit complexity randomized distributed MIS algorithm.
Distributed Comput., 2011

2010
About randomised distributed graph colouring and graph partition algorithms.
Inf. Comput., 2010

On the power of synchronization between two adjacent processes.
Distributed Comput., 2010

Termination Detection of Local Computations
CoRR, 2010

2009
An Optimal Bit Complexity Randomized Distributed MIS Algorithm (Extended Abstract).
Proceedings of the Structural Information and Communication Complexity, 2009

Brief Annoucement: Analysis of an Optimal Bit Complexity Randomised Distributed Vertex Colouring Algorithm.
Proceedings of the Principles of Distributed Systems, 13th International Conference, 2009

2008
Local Terminations and Distributed Computability in Anonymous Networks.
Proceedings of the Distributed Computing, 22nd International Symposium, 2008

Proving Distributed Algorithms for Mobile Agents: Examples of Spanning Tree Computation in Anonymous Networks.
Proceedings of the Distributed Computing and Networking, 9th International Conference, 2008

Labelled (Hyper)Graphs, Negotiations and the Naming Problem.
Proceedings of the Graph Transformations, 4th International Conference, 2008

Electing a leader in the local computation model using mobile agents.
Proceedings of the 6th ACS/IEEE International Conference on Computer Systems and Applications, 2008

2007
An Efficient Message Passing Election Algorithm based on Mazurkiewicz's Algorithm.
Fundam. Informaticae, 2007

About the Termination Detection in the Asynchronous Message Passing Model.
Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007

A Distributed Computational Model for Mobile Agents.
Proceedings of the Agent Computing and Multi-Agent Systems, 2007

2006
Local Computations in Graphs: The Case of Cellular Edge Local Computations.
Fundam. Informaticae, 2006

Mobile Agent Algorithms Versus Message Passing Algorithms.
Proceedings of the Principles of Distributed Systems, 10th International Conference, 2006

Workshop on Graph Computation Models.
Proceedings of the Graph Transformations, Third International Conference, 2006

2005
Locally guided randomized elections in trees: The totally fair case.
Inf. Comput., 2005

Local Computation in Graphs: The Case of Cellular Edge Local Computations.
Bull. EATCS, 2005

A Bridge Between the Asynchronous Message Passing Model and Local Computations in Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

2004
Characterizations of Classes of Graphs Recognizable by Local Computations.
Theory Comput. Syst., 2004

Synchronizers for Local Computations.
Proceedings of the Graph Transformations, Second International Conference, 2004

Election, Naming and Cellular Edge Local Computations.
Proceedings of the Graph Transformations, Second International Conference, 2004

Election and Local Computations on Edges.
Proceedings of the Foundations of Software Science and Computation Structures, 2004

2003
Deducible and Equivalent Structural Knowledges in Distributed Algorithms.
Theory Comput. Syst., 2003

Analysis of a randomized rendezvous algorithm.
Inf. Comput., 2003

A uniform randomized election in trees.
Proceedings of the SIROCCO 10: Proceedings of the 10th Internaltional Colloquium on Structural Information Complexity, 2003

2002
Randomized local elections.
Inf. Process. Lett., 2002

Equivalence of Structural Knowledges in Distributed Algorithms.
Proceedings of the SIROCCO 9, 2002

Termination Detection of Distributed Algorithms by Graph Relabelling Systems.
Proceedings of the Graph Transformation, First International Conference, 2002

A Characterization of Families of Graphs in Which Election Is Possible.
Proceedings of the Foundations of Software Science and Computation Structures, 2002

2001
Graph Relabelling Systems: a Tool for Encoding, Proving, Studying and Visualizing - Distributed Algorithms.
Electron. Notes Theor. Comput. Sci., 2001

Visualization of Distributed Algorithms Based on Graph Relabelling Systems.
Electron. Notes Theor. Comput. Sci., 2001

A Characterization of Classes of GraphsRecognizable by Local Computations with Initial Knowledge.
Proceedings of the SIROCCO 8, 2001

A Distributed Algorithm for Computing a Spanning Tree in Anonymous Tprime Graph.
Proceedings of the Procedings of the 5th International Conference on Principles of Distributed Systems. OPODIS 2001, 2001

2000
Termination detection and universal graph reconstruction.
Proceedings of the SIROCCO 7, 2000

1998
Some Remarks on the Kronecker Product of Graphs.
Inf. Process. Lett., 1998

The Power of Local Computations in Graphs with Initial Knowledge.
Proceedings of the Theory and Application of Graph Transformations, 1998

Minor Searching, Normal Forms of Graph Relabelling: Two Applications Based on Enumerations by Graph Relabelling.
Proceedings of the Foundations of Software Science and Computation Structure, 1998

1997
Partial Commutation and Traces.
Proceedings of the Handbook of Formal Languages, Volume 3: Beyond Words., 1997

Graph Relabelling Systems: A General Overview.
Comput. Artif. Intell., 1997

About the local detection of termination of local computations in graphs.
Proceedings of the SIROCCO'97, 1997

1996
Medians and Centres of Polyominoes.
Inf. Process. Lett., 1996

The Kronecker Product and Local Computations in Graphs.
Proceedings of the Trees in Algebra and Programming, 1996

1995
New Results on the Star Problem in Trace Monoids
Inf. Comput., June, 1995

On the Recognition of Families of Graphs with Local Computations
Inf. Comput., April, 1995

Different Local Controls for Graph Relabeling Systems.
Math. Syst. Theory, 1995

Checking global graph properties by means of local computations: the majority problem.
Electron. Notes Theor. Comput. Sci., 1995

Computing the Closure of Sets of Words Under Partial Commutations.
Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

1994
Coverings and Minors: Application to Local Computations in Graphs.
Eur. J. Comb., 1994

On the Star Operation and the Finite Power Property in Free Partially Commutative Monoids (Extended Abstract).
Proceedings of the STACS 94, 1994

Probabilistic Analysis of an Election Algorithm in a Tree.
Proceedings of the Trees in Algebra and Programming, 1994

1993
Asynchronous Mappings and Asynchronous Cellular Automata
Inf. Comput., October, 1993

Computing with Graph Rewriting Systems with Priorities.
Theor. Comput. Sci., 1993

1992
The Power and the Limitations of Local Computations on Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1992

Definitions and Comparisons of Local Computations on Graphs.
Proceedings of the Mathematical Foundations of Computer Science 1992, 1992

Computing trees with graph rewriting systems with priorities.
Proceedings of the Tree Automata and Languages., 1992

1991
On the Star Operation in Free Partially Commutative Monoids.
Int. J. Found. Comput. Sci., 1991

1990
Computing with Graph Relabelling Systems with Priorities.
Proceedings of the Graph-Grammars and Their Application to Computer Science, 1990

1989
Graph Rewriting Systems with Priorities.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1989

1988
On Recognizable Subsets of Free Partially Commutative Monoids.
Theor. Comput. Sci., 1988

Approximation of a TRace, Asynchronous Automata and the Ordering of Events in a Distributed System.
Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

1987
On Lexicographic Semi-Commutations.
Inf. Process. Lett., 1987

An Algorithm for Computing Asynchronous Automata in the Case of Acyclic Non-Commutation Graphs.
Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

1986
Une Condition Suffisante de Reconnaissabilité Dans un Monoïde Partiellement Commutatif.
RAIRO Theor. Informatics Appl., 1986

1985
Calcul de Longueurs de Chaînes de Réécriture dans le Monoïde Libre.
Theor. Comput. Sci., 1985

Recognizable Subsets of Some Partially Abelian Monoids.
Theor. Comput. Sci., 1985

1983
About the Rewriting Systems Produced by the Knuth-Bendix Completion Algorithm.
Inf. Process. Lett., 1983


  Loading...