Search the dblp DataBase

Publications of Author

1. Alain Cournier, Stéphane Devismes, Vincent Villain
   Snap-Stabilizing Detection of Cutsets. [Citation Graph (0, 0)][DBLP]
   HiPC, 2005, pp:488-497 [Conf]
   
2. Alain Cournier, Stéphane Devismes, Vincent Villain
   Snap-Stabilizing PIF and Useless Computations. [Citation Graph (0, 0)][DBLP]
   ICPADS (1), 2006, pp:39-48 [Conf]
   
3. Alain Cournier, Stéphane Devismes, Franck Petit, Vincent Villain
   Snap-Stabilizing Depth-First Search on Arbitrary Networks. [Citation Graph (0, 0)][DBLP]
   OPODIS, 2004, pp:267-282 [Conf]
   
4. Alain Cournier, Stéphane Devismes, Vincent Villain
   A Snap-Stabilizing DFS with a Lower Space Requirement. [Citation Graph (0, 0)][DBLP]
   Self-Stabilizing Systems, 2005, pp:33-47 [Conf]
   
5. Alain Cournier, Stéphane Devismes, Franck Petit, Vincent Villain
   Snap-Stabilizing Depth-First Search on Arbitrary Networks. [Citation Graph (0, 0)][DBLP]
   Comput. J., 2006, v:49, n:3, pp:268-280 [Journal]
   
6. Stéphane Devismes
   A Silent Self-stabilizing Algorithm for Finding Cut-nodes and Bridges. [Citation Graph (0, 0)][DBLP]
   Parallel Processing Letters, 2005, v:15, n:1-2, pp:183-198 [Journal]
   
7. Carole Delporte-Gallet, Stéphane Devismes, Hugues Fauconnier
   Robust Stabilizing Leader Election. [Citation Graph (0, 0)][DBLP]
   SSS, 2007, pp:219-233 [Conf]
   
8. Alain Cournier, Stéphane Devismes, Vincent Villain
   From Self- to Snap- Stabilization. [Citation Graph (0, 0)][DBLP]
   SSS, 2006, pp:199-213 [Conf]
   
9. 
   A Self-stabilizing 3-Approximation for the Maximum Leaf Spanning Tree Problem in Arbitrary Networks. [Citation Graph (, )][DBLP]
   
   
10. 
    Weak vs. Self vs. Probabilistic Stabilization. [Citation Graph (, )][DBLP]
    
    
11. 
    Communication Efficiency in Self-Stabilizing Silent Protocols. [Citation Graph (, )][DBLP]
    
    
12. 
    Self-Stabilizing k-out-of-l exclusion on tree networks. [Citation Graph (, )][DBLP]
    
    
13. 
    Optimal deterministic self-stabilizing vertex coloring in unidirectional anonymous networks. [Citation Graph (, )][DBLP]
    
    
14. 
    With Finite Memory Consensus Is Easier Than Reliable Broadcast. [Citation Graph (, )][DBLP]
    
    
15. 
    Space-Optimal Deterministic Rendezvous. [Citation Graph (, )][DBLP]
    
    
16. 
    Snap-stabilization in message-passing systems. [Citation Graph (, )][DBLP]
    
    
17. 
    Optimal Probabilistic Ring Exploration by Semi-synchronous Oblivious Robots. [Citation Graph (, )][DBLP]
    
    
18. 
    Algorithms for Extracting Timeliness Graphs. [Citation Graph (, )][DBLP]
    
    
19. 
    Approximation of delta-Timeliness. [Citation Graph (, )][DBLP]
    
    
20. 
    Snap-Stabilization in Message-Passing Systems. [Citation Graph (, )][DBLP]
    
    
21. 
    Probabilistic Self-stabilizing Vertex Coloring in Unidirectional Anonymous Networks. [Citation Graph (, )][DBLP]
    
    
22. 
    Weak vs. Self vs. Probabilistic Stabilization [Citation Graph (, )][DBLP]
    
    
23. 
    Snap-Stabilization in Message-Passing Systems [Citation Graph (, )][DBLP]
    
    
24. 
    Bounds for self-stabilization in unidirectional networks [Citation Graph (, )][DBLP]
    
    
25. 
    Communication Efficiency in Self-stabilizing Silent Protocols [Citation Graph (, )][DBLP]
    
    
26. 
    Self-stabilizing K-out-of-L exclusion on tree network [Citation Graph (, )][DBLP]
    
    
27. 
    Optimal Probabilistic Ring Exploration by Asynchronous Oblivious Robots [Citation Graph (, )][DBLP]
    
    
28. 
    Algorithms For Extracting Timeliness Graphs [Citation Graph (, )][DBLP]