The following pages link to Yves Métivier (Q690236):
Displaying 50 items.
- (Q259057) (redirect page) (← links)
- A distributed enumeration algorithm and applications to all pairs shortest paths, diameter\dots (Q259059) (← links)
- Some remarks on the Kronecker product of graphs (Q293407) (← links)
- Randomised distributed MIS and colouring algorithms for rings with oriented edges in \(O(\sqrt{\log n})\) bit rounds (Q342718) (← links)
- On the time and the bit complexity of distributed randomised anonymous ring colouring (Q391396) (← links)
- Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings (Q391647) (← links)
- Petri net languages revisited (Q418794) (← links)
- An optimal bit complexity randomized distributed MIS algorithm (Q658666) (← links)
- On the power of synchronization between two adjacent processes (Q660989) (← links)
- Medians and centres of polyominoes (Q672091) (← links)
- Asynchronous mappings and asynchronous cellular automata (Q690237) (← links)
- How to prove impossibility under global fairness: on space complexity of self-stabilizing leader election on a population protocol model (Q692907) (← links)
- About randomised distributed graph colouring and graph partition algorithms (Q710742) (← links)
- Nonatomic dual bakery algorithm with bounded tokens (Q766163) (← links)
- On lexicographic semi-commutations (Q1108811) (← links)
- On recognizable subsets of free partially commutative monoids (Q1111703) (← links)
- Computing with graph rewriting systems with priorities (Q1261464) (← links)
- Coverings and minors: Application to local computations in graphs (Q1317492) (← links)
- Analysis of a randomized rendezvous algorithm (Q1398376) (← links)
- Design patterns in beeping algorithms: examples, emulation, and analysis (Q1633808) (← links)
- Deterministic leader election in \(O(D+\log n)\) time with messages of size \(O(1)\) (Q1660914) (← links)
- Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds (Q1741851) (← links)
- Deducible and equivalent structural knowledges in distributed algorithms (Q1762994) (← links)
- Locally guided randomized elections in trees: The totally fair case (Q1775889) (← links)
- (Q1836977) (redirect page) (← links)
- About the rewriting systems produced by the Knuth-Bendix completion algorithm (Q1836978) (← links)
- Randomized local elections. (Q1853021) (← links)
- Characterizations of classes of graphs recognizable by local computations (Q1879372) (← links)
- On the recognition of families of graphs with local computations (Q1891139) (← links)
- New results on the star problem in trace monoids (Q1893738) (← links)
- Election in partially anonymous networks with arbitrary knowledge in message passing systems (Q1938371) (← links)
- Renaming and the weakest family of failure detectors (Q1938384) (← links)
- Recognizable subsets of some partially Abelian monoids (Q2266128) (← links)
- Calcul de longueurs de chaînes de réécriture dans le monoïde libre (Q2266711) (← links)
- Analysis of fully distributed splitting and naming probabilistic procedures and applications (Q2345463) (← links)
- Counting in one-hop beeping networks (Q2420611) (← links)
- Ping pong in dangerous graphs: optimal black hole search with pebbles (Q2429323) (← links)
- Analysis of Fully Distributed Splitting and Naming Probabilistic Procedures and Applications (Q2868641) (← links)
- On Lower Bounds for the Time and the Bit Complexity of Some Probabilistic Distributed Graph Algorithms (Q2938103) (← links)
- (Q3077352) (← links)
- Enumeration and Leader Election in Partially Anonymous and Multi-hop Broadcast Networks (Q3168518) (← links)
- Design Patterns in Beeping Algorithms. (Q3174939) (← links)
- (Q3416074) (← links)
- (Q3504346) (← links)
- Local Terminations and Distributed Computability in Anonymous Networks (Q3540220) (← links)
- Labelled (Hyper)Graphs, Negotiations and the Naming Problem (Q3540388) (← links)
- (Q3725561) (← links)
- Une condition suffisante de reconnaissabilité dans un monoïde partiellement commutatif (Q3734730) (← links)
- (Q3783583) (← links)
- (Q3804201) (← links)
