Conferences in DBLP

International Symposium on Distributed Computing (DISC) (wdag)
2001 (conf/wdag/2001)

1. Yong-Jik Kim, James H. Anderson
   A Time Complexity Bound for Adaptive Mutual Exclusion. [Citation Graph (0, 0)][DBLP]
   DISC, 2001, pp:1-15 [Conf]
   
2. Yuh-Jzer Joung
   Quorum-Based Algorithms for Group Mutual Exclusion. [Citation Graph (0, 0)][DBLP]
   DISC, 2001, pp:16-32 [Conf]
   
3. Paolo Boldi, Sebastiano Vigna
   An Effective Characterization of Computability in Anonymous Networks. [Citation Graph (0, 0)][DBLP]
   DISC, 2001, pp:33-47 [Conf]
   
4. John R. Douceur, Roger Wattenhofer
   Competitive Hill-Climbing Strategies for Replica Placement in a Distributed File System. [Citation Graph (0, 0)][DBLP]
   DISC, 2001, pp:48-62 [Conf]
   
5. Dahlia Malkhi, Elan Pavlov, Yaron Sella
   Optimal Unconditional Information Diffusion. [Citation Graph (0, 0)][DBLP]
   DISC, 2001, pp:63-77 [Conf]
   
6. Neeraj Mittal, Vijay K. Garg
   Computation Slicing: Techniques and Theory. [Citation Graph (0, 0)][DBLP]
   DISC, 2001, pp:78-92 [Conf]
   
7. Ricardo Jiménez-Peris, Marta Patiño-Martínez, Gustavo Alonso, Sergio Arévalo
   A Low-Latency Non-blocking Commit Service. [Citation Graph (0, 0)][DBLP]
   DISC, 2001, pp:93-107 [Conf]
   
8. Marcos Kawazoe Aguilera, Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg
   Stable Leader Election. [Citation Graph (0, 0)][DBLP]
   DISC, 2001, pp:108-122 [Conf]
   
9. Michiko Inoue, Shinya Umetani, Toshimitsu Masuzawa, Hideo Fujiwara
   Adaptive Long-Lived O(k²)-Renaming with O(k²) Steps. [Citation Graph (0, 0)][DBLP]
   DISC, 2001, pp:123-135 [Conf]
   
10. Maurice Herlihy, Sergio Rajsbaum, Mark R. Tuttle
    A New Synchronous Lower Bound for Set Agreement. [Citation Graph (0, 0)][DBLP]
    DISC, 2001, pp:136-150 [Conf]
    
11. Chryssis Georgiou, Alexander Russell, Alexander A. Shvartsman
    The Complexity of Synchronous Iterative Do-All with Crashes. [Citation Graph (0, 0)][DBLP]
    DISC, 2001, pp:151-165 [Conf]
    
12. Stefan Dobrev, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro
    Mobile Search for a Black Hole in an Anonymous Ring. [Citation Graph (0, 0)][DBLP]
    DISC, 2001, pp:166-179 [Conf]
    
13. Jaap-Henk Hoepman
    Randomised Mutual Search for k>2 Agents. [Citation Graph (0, 0)][DBLP]
    DISC, 2001, pp:180-193 [Conf]
    
14. Lisa Higham, Zhiying Liang
    Self-Stabilizing Minimum Spanning Tree Construction on Message-Passing Networks. [Citation Graph (0, 0)][DBLP]
    DISC, 2001, pp:194-208 [Conf]
    
15. Maurice Herlihy, Srikanta Tirthapura
    Self Stabilizing Distributed Queuing. [Citation Graph (0, 0)][DBLP]
    DISC, 2001, pp:209-223 [Conf]
    
16. Faith E. Fich, Colette Johnen
    A Space Optimal, Deterministic, Self-Stabilizing, Leader Election Algorithm for Unidirectional Rings. [Citation Graph (0, 0)][DBLP]
    DISC, 2001, pp:224-239 [Conf]
    
17. Marie Duflot, Laurent Fribourg, Claudine Picaronny
    Randomized Finite-State Distributed Algorithms as Markov Chains. [Citation Graph (0, 0)][DBLP]
    DISC, 2001, pp:240-254 [Conf]
    
18. David Peleg, Uri Pincas
    The Average Hop Count Measure for Virtual Path Layouts. [Citation Graph (0, 0)][DBLP]
    DISC, 2001, pp:255-269 [Conf]
    
19. Lali Barrière, Pierre Fraigniaud, Evangelos Kranakis, Danny Krizanc
    Efficient Routing in Networks with Long Range Contacts. [Citation Graph (0, 0)][DBLP]
    DISC, 2001, pp:270-284 [Conf]
    
20. Ioannis Chatzigiannakis, Sotiris E. Nikoletseas, Paul G. Spirakis
    An Efficient Communication Strategy for Ad-hoc Mobile Networks. [Citation Graph (0, 0)][DBLP]
    DISC, 2001, pp:285-299 [Conf]
    
21. Timothy L. Harris
    A Pragmatic Implementation of Non-blocking Linked-Lists. [Citation Graph (0, 0)][DBLP]
    DISC, 2001, pp:300-314 [Conf]
    
22. Ted Herman, Toshimitsu Masuzawa
    Stabilizing Replicated Search Trees. [Citation Graph (0, 0)][DBLP]
    DISC, 2001, pp:315-329 [Conf]
    
23. Panagiota Fatourou, Maurice Herlihy
    Adding Networks. [Citation Graph (0, 0)][DBLP]
    DISC, 2001, pp:330-342 [Conf]