The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Michael Mitzenmacher
    Digital Fountains and Their Application to Informed Content Delivery over Adaptive Overlay Networks. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:1- [Conf]
  2. Amir Herzberg
    Securing the Net: Challenges, Failures and Directions. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:2- [Conf]
  3. Flavio Paiva Junqueira, Keith Marzullo
    Coterie Availability in Sites. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:3-17 [Conf]
  4. Gal Badishi, Amir Herzberg, Idit Keidar
    Keeping Denial-of-Service Attackers in the Dark. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:18-32 [Conf]
  5. Hagen Völzer
    On Conspiracies and Hyperfairness in Distributed Computing. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:33-47 [Conf]
  6. Amitanand S. Aiyer, Lorenzo Alvisi, Rida A. Bazzi
    On the Availability of Non-strict Quorum Systems. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:48-62 [Conf]
  7. Eli Gafni, Sergio Rajsbaum
    Musical Benches. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:63-77 [Conf]
  8. Faith Ellen Fich, Victor Luchangco, Mark Moir, Nir Shavit
    Obstruction-Free Algorithms Can Be Practically Wait-Free. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:78-92 [Conf]
  9. Neeraj Mittal, Felix C. Freiling, S. Venkatesan, Lucia Draque Penso
    Efficient Reduction for Wait-Free Termination Detection in a Crash-Prone Distributed System. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:93-107 [Conf]
  10. Chris Purcell, Tim Harris
    Non-blocking Hashtables with Open Addressing. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:108-121 [Conf]
  11. Hagit Attiya, Rachid Guerraoui, Petr Kouznetsov
    Computing with Reads and Writes in the Absence of Step Contention. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:122-136 [Conf]
  12. Matei David, Alex Brodsky, Faith Ellen Fich
    Restricted Stack Implementations. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:137-151 [Conf]
  13. Gregory Chockler, Nancy A. Lynch, Sayan Mitra, Joshua A. Tauber
    Proving Atomicity: An Assertional Approach. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:152-168 [Conf]
  14. Hagit Attiya, Danny Hendler
    Time and Space Lower Bounds for Implementations Using k-CAS. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:169-183 [Conf]
  15. Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui
    (Almost) All Objects Are Universal in Message Passing Systems. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:184-198 [Conf]
  16. Dahlia Malkhi, Florian Oprea, Lidong Zhou
    Omega Meets Paxos: Leader Election and Stability Without Eventual Timely Links. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:199-213 [Conf]
  17. Brad T. Moore, Paolo A. G. Sivilotti
    Plausible Clocks with Bounded Inaccuracy. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:214-228 [Conf]
  18. Kai Engelhardt, Yoram Moses
    Causing Communication Closure: Safe Program Composition with Non-FIFO Channels. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:229-243 [Conf]
  19. Rachid Guerraoui, Eric Ruppert
    What Can Be Implemented Anonymously? [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:244-259 [Conf]
  20. Andrzej Pelc
    Waking Up Anonymous Ad Hoc Radio Networks. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:260-272 [Conf]
  21. Fabian Kuhn, Thomas Moscibroda, Tim Nieberg, Roger Wattenhofer
    Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:273-287 [Conf]
  22. Shafi Goldwasser, Madhu Sudan, Vinod Vaikuntanathan
    Distributed Computing with Imperfect Randomness. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:288-302 [Conf]
  23. Rachid Guerraoui, Maurice Herlihy, Bastian Pochon
    Polymorphic Contention Management. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:303-323 [Conf]
  24. Maurice Herlihy, Ye Sun
    Distributed Transactional Memory for Metric-Space Networks. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:324-338 [Conf]
  25. Dahlia Malkhi, Douglas B. Terry
    Concise Version Vectors in WinFS. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:339-353 [Conf]
  26. Virendra J. Marathe, William N. Scherer III, Michael L. Scott
    Adaptive Software Transactional Memory. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:354-368 [Conf]
  27. Piotr Zielinski
    Optimistic Generic Broadcast. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:369-383 [Conf]
  28. Yehuda Afek, Yaron De Levie
    Space and Step Complexity Efficient Adaptive Collect. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:384-398 [Conf]
  29. Joffroy Beauquier, Laurence Pilard, Brigitte Rozoy
    Observing Locally Self-stabilization in a Probabilistic Way. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:399-413 [Conf]
  30. Michele Flammini, Luca Moscardelli, Alfredo Navarra, Stéphane Pérennes
    Asymptotically Optimal Solutions for Small World Graphs. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:414-428 [Conf]
  31. Maria J. Blesa
    Deciding Stability in Packet-Switched FIFO Networks Under the Adversarial Queuing Model in Polynomial Time , . [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:429-441 [Conf]
  32. Ittai Abraham, Cyril Gavoille, Dahlia Malkhi
    Compact Routing for Graphs Excluding a Fixed Minor. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:442-456 [Conf]
  33. Amos Korman
    General Compact Labeling Schemes for Dynamic Trees. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:457-471 [Conf]
  34. Uri Nadav, Moni Naor
    The Dynamic And-Or Quorum System. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:472-486 [Conf]
  35. Barbara Liskov, Rodrigo Rodrigues
    Byzantine Clients Rendered Harmless. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:487-489 [Conf]
  36. Antonio Fernández, Chryssis Georgiou, Luis López, Agustín Santos
    Reliably Executing Tasks in the Presence of Malicious Processors. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:490-492 [Conf]
  37. Faith Ellen Fich, Victor Luchangco, Mark Moir, Nir Shavit
    Obstruction-Free Step Complexity: Lock-Free DCAS as an Example. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:493-494 [Conf]
  38. Mikel Larrea, Alberto Lafuente
    Communication-Efficient Implementation of Failure Detector Classes and. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:495-496 [Conf]
  39. Christian Cachin, Stefano Tessaro
    Optimal Resilience for Erasure-Coded Byzantine Distributed Storage. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:497-498 [Conf]
  40. Michael Okun
    Agreement Among Unacquainted Byzantine Generals. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:499-500 [Conf]
  41. Yuanyuan Zhao, Sumeer Bhola, Daniel C. Sturman
    Subscription Propagation and Content-Based Routing with Delivery Guarantees. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:501-502 [Conf]
  42. Christian Cachin, Stefano Tessaro
    Asynchronous Verifiable Information Dispersal. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:503-504 [Conf]
  43. Emmanuelle Anceaume, Xavier Défago, Maria Gradinariu, Matthieu Roy
    Towards a Theory of Self-organization. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:505-506 [Conf]
  44. Zvi Lotker, Boaz Patt-Shamir, Mark R. Tuttle
    Timing Games and Shared Memory. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:507-508 [Conf]
  45. Yu-Chen Kuo, Huang-Chen Lee
    A Lightweight Group Mutual k-Exclusion Algorithm Using Bi-k-Arbiters. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:509-510 [Conf]
  46. Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar, Nicolas Schabanel
    Could any Graph be Turned into a Small-World?. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:511-513 [Conf]
  47. Ittai Abraham, Dahlia Malkhi, Gurmeet Singh Manku
    Papillon: Greedy Routing in Rings. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:514-515 [Conf]
  48. Burkhard Englert
    An Efficient Long-Lived Adaptive Collect Algorithm. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:516-518 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002