The SCEAS System
Navigation Menu

Conferences in DBLP

ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC) (podc)
2002 (conf/podc/2002)

  1. James H. Anderson, Yong-Jik Kim
    Nonatomic mutual exclusion with local spinning. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:3-12 [Conf]
  2. Panagiota Fatourou, Faith Ellen Fich, Eric Ruppert
    Space-optimal multi-writer snapshot objects are slow. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:13-20 [Conf]
  3. Maged M. Michael
    Safe memory reclamation for dynamic lock-free objects using atomic reads and writes. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:21-30 [Conf]
  4. Michael L. Scott
    Non-blocking timeout in scalable queue-based spin locks. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:31-40 [Conf]
  5. Amotz Bar-Noy, Grzegorz Malewicz
    Establishing wireless conference calls under delay constraints. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:41-50 [Conf]
  6. Tomasz Jurdzinski, Miroslaw Kutylowski, Jan Zatopianski
    Efficient algorithms for leader election in radio networks. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:51-57 [Conf]
  7. Hongwei Zhang, Anish Arora
    GS3: scalable self-configuration and self-healing in wireless networks. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:58-67 [Conf]
  8. Stergios V. Anastasiadis, Peter J. Varman, Jeffrey Scott Vitter, Ke Yi
    Lexicographically optimal smoothing for broadband traffic multiplexing. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:68-77 [Conf]
  9. Gregory Chockler, Dahlia Malkhi
    Active disk paxos with infinitely many processes. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:78-87 [Conf]
  10. Partha Dutta, Rachid Guerraoui
    The inherent price of indulgence. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:88-97 [Conf]
  11. Haifeng Yu, Amin Vahdat
    Minimal replication cost for availability. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:98-107 [Conf]
  12. David Mazières, Dennis Shasha
    Building secure file systems out of byantine storage. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:108-117 [Conf]
  13. Matthias Fitzi, Daniel Gottesman, Martin Hirt, Thomas Holenstein, Adam Smith
    Detectable byzantine agreement secure against faulty majorities. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:118-126 [Conf]
  14. Paul D. Ezhilchelvan, Jean-Michel Hélary, Michel Raynal
    Building responseive TMR-based servers in presence of timing constraints. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:127- [Conf]
  15. Ugur Çetintemel, Peter J. Keleher, Yanif Ahmad
    Exploiting precision vs. efficiency tradeoffs in symmetric replication environments. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:128- [Conf]
  16. Achour Mostéfaoui, Michel Raynal, Matthieu Roy, Divyakant Agrawal, Amr El Abbadi
    Towards a formal model for view maintenance in data warehouses. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:129- [Conf]
  17. K. Vidyasankar
    A highly concurrent group mutual /-exclusion algorithm0. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:130- [Conf]
  18. Maurice Herlihy, Victor Luchangco, Paul A. Martin, Mark Moir
    Dynamic-sized lock-free data structures. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:131- [Conf]
  19. Chryssis Georgiou, Alexander Russell, Alexander A. Shvartsman
    Optimally work-competitive scheduling for cooperative computing with merging groups. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:132- [Conf]
  20. Yongqiang Huang, Hector Garcia-Molina
    Assignment-based partitioning in a condition monitoring system. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:133- [Conf]
  21. Zvi Lotker, Boaz Patt-Shamir
    Nearly optimal FIFO buffer management for DiffServ. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:134-142 [Conf]
  22. Andrei Z. Broder, Michael Mitzenmacher
    Optmial plans for aggregation. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:144-152 [Conf]
  23. Stefan Dobrev, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro
    Searching for a black hole in arbitrary networks: optimal mobile agent protocols. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:153-161 [Conf]
  24. Zvika Brakerski, Aviv Nisgav, Boaz Patt-Shamir
    General perfectly periodic scheduling. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:163-172 [Conf]
  25. Joan Feigenbaum, Christos H. Papadimitriou, Rahul Sami, Scott Shenker
    A BGP-based mechanism for lowest-cost routing. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:173-182 [Conf]
  26. Dahlia Malkhi, Moni Naor, David Ratajczak
    Viceroy: a scalable and dynamic emulation of the butterfly. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:183-192 [Conf]
  27. M. V. N. Ashwin Kumar, Pranava R. Goundan, K. Srinathan, C. Pandu Rangan
    On perfectly secure cmmunication over arbitrary networks. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:193-202 [Conf]
  28. Yehuda Lindell, Anna Lysyanskaya, Tal Rabin
    Sequential composition of protocols without simultaneous termination. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:203-212 [Conf]
  29. Sitaram Iyer, Antony I. T. Rowstron, Peter Druschel
    Squirrel: a decentralized peer-to-peer web cache. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:213-222 [Conf]
  30. James Aspnes, Zoë Diamadi, Gauri Shah
    Fault-tolerant routing in peer-to-peer systems. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:223-232 [Conf]
  31. David Liben-Nowell, Hari Balakrishnan, David R. Karger
    Analysis of the evolution of peer-to-peer systems. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:233-242 [Conf]
  32. Omar Bakr, Idit Keidar
    Evaluating the running time of a communication round over the internet. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:243-252 [Conf]
  33. Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal
    Asynchronous interactive consistency and its relation with error-correcting codes. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:253- [Conf]
  34. Weibin Zhao, Henning Schulzrinne
    Selective anti-entropy. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:254- [Conf]
  35. Kazuo Iwama, Masaki Okita
    Compact routing for average-case networks. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:255- [Conf]
  36. Michael Greenwald
    How to wait when you are not going to block. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:256- [Conf]
  37. Mikel Larrea
    Understanding perfect failure detectors. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:257- [Conf]
  38. Carole Delporte-Gallet, Hugues Fauconnier, Jean-Michel Hélary, Michel Raynal
    Early stopping in aglobal data computation. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:258- [Conf]
  39. Shlomi Dolev, Elad Schiller, Jennifer L. Welch
    Random walk for self-stabilitzing group communication in ad hoc networks. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:259- [Conf]
  40. Michael Greenwald
    Two-handed emulation: how to build non-blocking implementation of complex data-structures using DCAS. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:260-269 [Conf]
  41. Prasad Jayanti
    f-arrays: implementation and applications. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:270-279 [Conf]
  42. Danny Hendler, Nir Shavit
    Non-blocking steal-half work queues. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:280-289 [Conf]
  43. Subhendu Chattopadhyay, Lisa Higham, Karen Seyffarth
    Dynamic and self-stabilizing distributed matching. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:290-297 [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