Name
Papers
Collaborators
VINCENT VILLAIN
64
30
Citations 
PageRank 
Referers 
544
45.77
411
Referees 
References 
333
666
Search Limit
100411
Title
Citations
PageRank
Year
A Self-stabilizing One-To-Many Node Disjoint Paths Routing Algorithm in Star Networks.00.342020
Self-Stabilizing Weak Leader Election in Anonymous Trees Using Constant Memory per Edge.00.342017
A Stabilizing Algorithm For Finding Two Node-Disjoint Paths In Arbitrary Networks00.342017
Snap-Stabilizing PIF on Arbitrary Connected Networks in Message Passing Model.00.342016
The expressive power of snap-stabilization.10.362016
Snap-Stabilizing PIF on Non-oriented Trees and Message Passing Model.30.382014
How to meet asynchronously at polynomial cost150.552013
Deterministic geoleader election in disoriented anonymous systems50.472013
Deterministic Leader Election Among Disoriented Anonymous Sensors00.342012
Snap-Stabilizing message forwarding algorithm on tree topologies10.352012
Autour de l'autostabilisation. 2. Techniques spécialisant l'approche.20.382011
The first fully polynomial stabilizing algorithm for BFS tree construction120.552011
How to improve snap-stabilizing point-to-point communication space complexity?30.422011
Autour de l'autostabilisation. 1. Techniques généralisant l'approche.10.362011
Brief announcement: leader election vs pattern formation40.392010
Snap-stabilizing linear message forwarding30.412010
Leader election problem versus pattern formation problem230.972010
Light enabling snap-stabilization of fundamental protocols20.382009
A snap-stabilizing point-to-point communication protocol in message-switched networks60.482009
Une CNS pour l'acheminement de messages instantanément stabilisant00.342009
Synchronous vs. Asynchronous Unison140.622008
Optimal snap-stabilizing depth-first token circulation in tree networks70.432007
Self-Stabilizing Local Routing in Ad Hoc Networks10.362007
Snap-stabilization and PIF in tree networks361.282007
Snap-Stabilizing Depth-First Search on Arbitrary Networks60.472006
Toward a time-optimal odd phase clock unison in trees00.342006
Snap-stabilizing PIF and useless computations130.632006
From Self- to Snap- Stabilization60.462006
A snap-stabilizing DFS with a lower space requirement80.482005
Snap-Stabilizing detection of cutsets20.372005
A Self-stabilizing Link-Cluster Algorithm in Mobile Ad Hoc Networks160.782005
Snap-Stabilizing optimal binary search tree80.582005
Optimal snap-stabilizing PIF algorithms in un-oriented trees100.552005
Self-Stablizing Pivot Interval Routing in General Networks20.422005
Self-Stabilizing Optimal Local Routing in Ad Hoc Networks00.342005
When graph theory helps self-stabilization301.152004
A new self-stabilizing k-out-of-l exclusion algorithm on rings50.462003
An improved snap-stabilizing PIF algorithm140.672003
A Self-stabilizing Token-Based k-out-of-l Exclusion Algorithm20.422002
Special Issue on Self-Stabilizing Distributed Systems - Guest Editors' Introduction00.342002
Protocole universel auto-stabilisant de synchronisation d'horloges de phases00.342002
Snap-stabilizing PIF algorithm in arbitrary networks201.152002
Group Mutual Exclusion in Token Rings60.492001
A New Efficient Tool for the Design of Self-Stabilizing l-Exclusion Algorithms: The Controller90.622001
Token Based Group Mutual Exclusion for Asynchronous Rings160.852001
Self-Stabilizing PIF Algorithm in Arbitrary Rooted Networks150.842001
Self-Stabilizing Network Orientation Algorithms In Arbitrary Rooted Networks130.732001
Optimal Snap-Stabilizing PIF in Un-Oriented Trees80.852001
Optimality and Self-Stabilization in Rooted Tree Networks.80.512000
Limits and Power of the Simplest Uniform and Self-Stabilizing Phase Clock Algorithm00.342000
  • 1
  • 2