#### Filter Results:

- Full text PDF available (41)

#### Publication Year

1976

2016

- This year (0)
- Last 5 years (16)
- Last 10 years (29)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Robert Cori, Yves Métivier, Wieslaw Zielonka
- Inf. Comput.
- 1993

- Yves Métivier, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari
- Distributed Computing
- 2010

We present a randomized distributed maximal independent set (MIS) algorithm for arbitrary graphs of size n that halts in time O(log n) with probability 1 − o(n −1), and only needs messages containing 1 bit. Thus, its bit complexity par channel is O(log n). We assume that the graph is anonymous: unique identities are not available to distinguish between the… (More)

- Yves Métivier, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari
- SIROCCO
- 2009

- Yves Métivier
- Inf. Process. Lett.
- 1983

- Jérémie Chalopin, Emmanuel Godard, Yves Métivier, Rodrigue Ossamy
- OPODIS
- 2006

The mobile agent paradigm has been developed to solve problems in dynamic and heterogeneous environment [8]. The agent model of this paper is quite general. It is based on the concepts of agents, communication links and places. An agent is an entity which executes an algorithm: it can move from place to place (with some data and its algorithm) through… (More)

- Igor Litovsky, Yves Métivier, Wieslaw Zielonka
- Inf. Comput.
- 1995

- Yves Métivier, Gwénaël Richomme
- Inf. Comput.
- 1995

- Yves Métivier, Éric Sopena
- Computers and Artificial Intelligence
- 1997

Graph relabelling systems have been introduced as a suitable model for expressing and studying distributed algorithms on a network of communicating processors. We recall the basic ideas underlying that model and we survey the main questions that have been considered and the main results that have been obtained in that framework.

- Jérémie Chalopin, Emmanuel Godard, Yves Métivier
- DISC
- 2008

We investigate the computability of distributed tasks in reliable anonymous networks with arbitrary knowledge. More precisely, we consider tasks computable with local termination, i.e., a node knows when to stop to participate in a distributed algorithm, even though the algorithm is not necessarily terminated elsewhere. We also study weak local termination,… (More)