Yves Métivier

90 papers A* 4A 3B 26C 1Misc 1Journal 45Unranked 8

Year	Rank	Type	Title / Venue / Authors
2022	J	`jnl`	Unfoldings and coverings of weighted graphs. CoRR Bruno Courcelle, Yves Métivier
2021	J	`jnl`	Revisiting the Role of Coverings in Anonymous Networks: Spanning Tree Construction and Topology Recognition. CoRR Arnaud Casteigts, Yves Métivier, John Michael Robson
2019	J	`jnl`	Counting in one-hop beeping networks. Theor. Comput. Sci. Arnaud Casteigts, Yves Métivier, J. M. Robson, Akka Zemmari
2019	J	`jnl`	Design patterns in beeping algorithms: Examples, emulation, and analysis. Inf. Comput. Arnaud Casteigts, Yves Métivier, John Michael Robson, Akka Zemmari
2019	J	`jnl`	Deterministic Leader Election Takes Θ(D+log n) Bit Rounds. Algorithmica Arnaud Casteigts, Yves Métivier, J. M. Robson, Akka Zemmari
2016	J	`jnl`	A distributed enumeration algorithm and applications to all pairs shortest paths, diameter... Inf. Comput. Yves Métivier, John Michael Robson, Akka Zemmari
2016	J	`jnl`	Counting in One-Hop Beeping Networks. CoRR Arnaud Casteigts, Yves Métivier, John Michael Robson, Akka Zemmari
2016	B	`conf`	Design Patterns in Beeping Algorithms. OPODIS Arnaud Casteigts, Yves Métivier, John Michael Robson, Akka Zemmari
2016	J	`jnl`	Design Patterns in Beeping Algorithms. CoRR Arnaud Casteigts, Yves Métivier, John Michael Robson, Akka Zemmari
2016	J	`jnl`	Deterministic Leader Election in O(D+ log n) Time with Messages of Size O(1). CoRR Arnaud Casteigts, Yves Métivier, John Michael Robson, Akka Zemmari
2016	A	`conf`	Deterministic Leader Election in O(D+\log n) Time with Messages of Size O(1). DISC Arnaud Casteigts, Yves Métivier, John Michael Robson, Akka Zemmari
2016	J	`jnl`	Randomised distributed MIS and colouring algorithms for rings with oriented edges in O(√(log n)) bit rounds. Inf. Comput. Yves Métivier, J. M. Robson, Akka Zemmari
2015	J	`jnl`	A Distributed Enumeration Algorithm and Applications to All Pairs Shortest Paths, Diameter. CoRR Yves Métivier, John Michael Robson, Akka Zemmari
2015	J	`jnl`	Analysis of fully distributed splitting and naming probabilistic procedures and applications. Theor. Comput. Sci. Yves Métivier, John Michael Robson, Akka Zemmari
2015	J	`jnl`	On Distributed Computing with Beeps. CoRR Yves Métivier, John Michael Robson, Akka Zemmari
2014	B	`conf`	On Lower Bounds for the Time and the Bit Complexity of Some Probabilistic Distributed Graph Algorithms - (Extended Abstract). SOFSEM Allyx Fontaine, Yves Métivier, John Michael Robson, Akka Zemmari
2013	B	`conf`	Analysis of Fully Distributed Splitting and Naming Probabilistic Procedures and Applications - (Extended Abstract). SIROCCO Yves Métivier, John Michael Robson, Akka Zemmari
2013	J	`jnl`	On the time and the bit complexity of distributed randomised anonymous ring colouring. Theor. Comput. Sci. Yves Métivier, J. M. Robson, Nasser Saheb-Djahromi, Akka Zemmari
2013	J	`jnl`	Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings. Inf. Comput. Allyx Fontaine, Yves Métivier, John Michael Robson, Akka Zemmari
2012	J	`jnl`	Election in partially anonymous networks with arbitrary knowledge in message passing systems. Distributed Comput. Jérémie Chalopin, Emmanuel Godard, Yves Métivier
2012	J	`jnl`	Enumeration and Leader Election in Partially Anonymous and Multi-hop Broadcast Networks. Fundam. Informaticae Jérémie Chalopin, Yves Métivier, Thomas Morsellino
2012	B	`conf`	On Snapshots and Stable Properties Detection in Anonymous Fully Distributed Systems (Extended Abstract). SIROCCO Jérémie Chalopin, Yves Métivier, Thomas Morsellino
2011	J	`jnl`	An optimal bit complexity randomized distributed MIS algorithm. Distributed Comput. Yves Métivier, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari
2010	J	`jnl`	About randomised distributed graph colouring and graph partition algorithms. Inf. Comput. Yves Métivier, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari
2010	J	`jnl`	On the power of synchronization between two adjacent processes. Distributed Comput. Jérémie Chalopin, Yves Métivier
2010	J	`jnl`	Termination Detection of Local Computations CoRR Emmanuel Godard, Yves Métivier, Gerard Tel
2009	B	`conf`	An Optimal Bit Complexity Randomized Distributed MIS Algorithm (Extended Abstract). SIROCCO Yves Métivier, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari
2009	B	`conf`	Brief Annoucement: Analysis of an Optimal Bit Complexity Randomised Distributed Vertex Colouring Algorithm. OPODIS Yves Métivier, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari
2008	C	`conf`	Electing a leader in the local computation model using mobile agents. AICCSA Med Amine Haddar, Ahmed Hadj Kacem, Yves Métivier, Mohamed Mosbah, Mohamed Jmaiel
2008	B	`conf`	Labelled (Hyper)Graphs, Negotiations and the Naming Problem. ICGT Jérémie Chalopin, Antoni W. Mazurkiewicz, Yves Métivier
2008	A	`conf`	Local Terminations and Distributed Computability in Anonymous Networks. DISC Jérémie Chalopin, Emmanuel Godard, Yves Métivier
2008	Misc	`conf`	Proving Distributed Algorithms for Mobile Agents: Examples of Spanning Tree Computation in Anonymous Networks. ICDCN Med Amine Haddar, Ahmed Hadj Kacem, Yves Métivier, Mohamed Mosbah, Mohamed Jmaiel
2007	B	`conf`	A Distributed Computational Model for Mobile Agents. PRIMA Med Amine Haddar, Ahmed Hadj Kacem, Yves Métivier, Mohamed Mosbah, Mohamed Jmaiel
2007	—	`conf`	About the Termination Detection in the Asynchronous Message Passing Model. SOFSEM (1) Jérémie Chalopin, Emmanuel Godard, Yves Métivier, Gerard Tel
2007	J	`jnl`	An Efficient Message Passing Election Algorithm based on Mazurkiewicz's Algorithm. Fundam. Informaticae Jérémie Chalopin, Yves Métivier
2006	J	`jnl`	Local Computations in Graphs: The Case of Cellular Edge Local Computations. Fundam. Informaticae Jérémie Chalopin, Yves Métivier, Wieslaw Zielonka
2006	B	`conf`	Mobile Agent Algorithms Versus Message Passing Algorithms. OPODIS Jérémie Chalopin, Emmanuel Godard, Yves Métivier, Rodrigue Ossamy
2006	B	`conf`	Workshop on Graph Computation Models. ICGT Yves Métivier, Mohamed Mosbah
2005	B	`conf`	A Bridge Between the Asynchronous Message Passing Model and Local Computations in Graphs. MFCS Jérémie Chalopin, Yves Métivier
2005	J	`jnl`	Local Computation in Graphs: The Case of Cellular Edge Local Computations. Bull. EATCS Jérémie Chalopin, Yves Métivier, Wieslaw Zielonka
2005	J	`jnl`	Locally guided randomized elections in trees: The totally fair case. Inf. Comput. Yves Métivier, Nasser Saheb-Djahromi, Akka Zemmari
2004	J	`jnl`	Characterizations of Classes of Graphs Recognizable by Local Computations. Theory Comput. Syst. Emmanuel Godard, Yves Métivier, Anca Muscholl
2004	B	`conf`	Election and Local Computations on Edges. FoSSaCS Jérémie Chalopin, Yves Métivier
2004	B	`conf`	Election, Naming and Cellular Edge Local Computations. ICGT Jérémie Chalopin, Yves Métivier, Wieslaw Zielonka
2004	B	`conf`	Synchronizers for Local Computations. ICGT Yves Métivier, Mohamed Mosbah, Rodrigue Ossamy, Afif Sellami
2003	B	`conf`	A uniform randomized election in trees. SIROCCO Yves Métivier, Nasser Saheb-Djahromi, Akka Zemmari
2003	J	`jnl`	Analysis of a randomized rendezvous algorithm. Inf. Comput. Yves Métivier, Nasser Saheb, Akka Zemmari
2003	J	`jnl`	Deducible and Equivalent Structural Knowledges in Distributed Algorithms. Theory Comput. Syst. Emmanuel Godard, Yves Métivier
2002	B	`conf`	A Characterization of Families of Graphs in Which Election Is Possible. FoSSaCS Emmanuel Godard, Yves Métivier
2002	B	`conf`	Equivalence of Structural Knowledges in Distributed Algorithms. SIROCCO Emmanuel Godard, Yves Métivier
2002	J	`jnl`	Randomized local elections. Inf. Process. Lett. Yves Métivier, Nasser Saheb, Akka Zemmari
2002	B	`conf`	Termination Detection of Distributed Algorithms by Graph Relabelling Systems. ICGT Emmanuel Godard, Yves Métivier, Mohamed Mosbah, Afif Sellami
2001	B	`conf`	A Characterization of Classes of GraphsRecognizable by Local Computations with Initial Knowledge. SIROCCO Emmanuel Godard, Yves Métivier
2001	B	`conf`	A Distributed Algorithm for Computing a Spanning Tree in Anonymous Tprime Graph. OPODIS Yves Métivier, Mohamed Mosbah, Pierre-André Wacrenier, Stefan Gruner
2001	—	`conf`	Graph Relabelling Systems: a Tool for Encoding, Proving, Studying and Visualizing - Distributed Algorithms. GETGRATS Closing Workshop Michel Bauderon, Yves Métivier, Mohamed Mosbah, Afif Sellami
2001	—	`conf`	Visualization of Distributed Algorithms Based on Graph Relabelling Systems. GT-VMT@ICALP Michel Bauderon, Stefan Gruner, Yves Métivier, Mohamed Mosbah, Afif Sellami
2000	B	`conf`	Termination detection and universal graph reconstruction. SIROCCO Yves Métivier, Gerard Tel
1998	B	`conf`	Minor Searching, Normal Forms of Graph Relabelling: Two Applications Based on Enumerations by Graph Relabelling. FoSSaCS Anne Bottreau, Yves Métivier
1998	J	`jnl`	Some Remarks on the Kronecker Product of Graphs. Inf. Process. Lett. Anne Bottreau, Yves Métivier
1998	—	`conf`	The Power of Local Computations in Graphs with Initial Knowledge. TAGT Emmanuel Godard, Yves Métivier, Anca Muscholl
1997	B	`conf`	About the local detection of termination of local computations in graphs. SIROCCO Yves Métivier, Anca Muscholl, Pierre-André Wacrenier
1997	J	`jnl`	Graph Relabelling Systems: A General Overview. Comput. Artif. Intell. Yves Métivier, Éric Sopena
1997	—	`ch.`	Partial Commutation and Traces. Handbook of Formal Languages (3) Volker Diekert, Yves Métivier
1996	J	`jnl`	Medians and Centres of Polyominoes. Inf. Process. Lett. Yves Métivier, Nasser Saheb
1996	—	`conf`	The Kronecker Product and Local Computations in Graphs. CAAP Anne Bottreau, Yves Métivier
1995	—	`conf`	Checking global graph properties by means of local computations: the majority problem. SEGRAGRA Igor Litovsky, Yves Métivier, Éric Sopena
1995	A*	`conf`	Computing the Closure of Sets of Words Under Partial Commutations. ICALP Yves Métivier, Gwénaël Richomme, Pierre-André Wacrenier
1995	J	`jnl`	Different Local Controls for Graph Relabeling Systems. Math. Syst. Theory Igor Litovsky, Yves Métivier, Éric Sopena
1995	J	`jnl`	New Results on the Star Problem in Trace Monoids Inf. Comput. Yves Métivier, Gwénaël Richomme
1995	J	`jnl`	On the Recognition of Families of Graphs with Local Computations Inf. Comput. Igor Litovsky, Yves Métivier, Wieslaw Zielonka
1994	J	`jnl`	Coverings and Minors: Application to Local Computations in Graphs. Eur. J. Comb. Bruno Courcelle, Yves Métivier
1994	A	`conf`	On the Star Operation and the Finite Power Property in Free Partially Commutative Monoids (Extended Abstract). STACS Yves Métivier, Gwénaël Richomme
1994	—	`conf`	Probabilistic Analysis of an Election Algorithm in a Tree. CAAP Yves Métivier, Nasser Saheb
1993	J	`jnl`	Asynchronous Mappings and Asynchronous Cellular Automata Inf. Comput. Robert Cori, Yves Métivier, Wieslaw Zielonka
1993	J	`jnl`	Computing with Graph Rewriting Systems with Priorities. Theor. Comput. Sci. Igor Litovsky, Yves Métivier
1992	—	`ch.`	Computing trees with graph rewriting systems with priorities. Tree Automata and Languages Igor Litovsky, Yves Métivier
1992	B	`conf`	Definitions and Comparisons of Local Computations on Graphs. MFCS Igor Litovsky, Yves Métivier, Éric Sopena
1992	B	`conf`	The Power and the Limitations of Local Computations on Graphs. WG Igor Litovsky, Yves Métivier, Wieslaw Zielonka
1991	J	`jnl`	On the Star Operation in Free Partially Commutative Monoids. Int. J. Found. Comput. Sci. Yves Métivier, Brigitte Rozoy
1990	—	`conf`	Computing with Graph Relabelling Systems with Priorities. Graph-Grammars and Their Application to Computer Science Igor Litovsky, Yves Métivier
1989	B	`conf`	Graph Rewriting Systems with Priorities. WG Michel Billaud, Pierre Lafon, Yves Métivier, Éric Sopena
1988	A*	`conf`	Approximation of a TRace, Asynchronous Automata and the Ordering of Events in a Distributed System. ICALP Robert Cori, Yves Métivier
1988	J	`jnl`	On Recognizable Subsets of Free Partially Commutative Monoids. Theor. Comput. Sci. Yves Métivier
1987	A*	`conf`	An Algorithm for Computing Asynchronous Automata in the Case of Acyclic Non-Commutation Graphs. ICALP Yves Métivier
1987	J	`jnl`	On Lexicographic Semi-Commutations. Inf. Process. Lett. Yves Métivier, Edward Ochmanski
1986	A*	`conf`	On Recognizable Subsets of Free Partially Commutative Monoids. ICALP Yves Métivier
1986	J	`jnl`	Une Condition Suffisante de Reconnaissabilité Dans un Monoïde Partiellement Commutatif. RAIRO Theor. Informatics Appl. Yves Métivier
1985	J	`jnl`	Calcul de Longueurs de Chaînes de Réécriture dans le Monoïde Libre. Theor. Comput. Sci. Yves Métivier
1985	J	`jnl`	Recognizable Subsets of Some Partially Abelian Monoids. Theor. Comput. Sci. Robert Cori, Yves Métivier
1983	J	`jnl`	About the Rewriting Systems Produced by the Knuth-Bendix Completion Algorithm. Inf. Process. Lett. Yves Métivier