The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Maurice Herlihy
    The art of multiprocessor programming. [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:1-2 [Conf]
  2. Danny Dolev
    Century papers at the first quarter-century milestone. [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:3-4 [Conf]
  3. Jon M. Kleinberg
    Distributed social systems. [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:5-6 [Conf]
  4. Fabian Kuhn, Roger Wattenhofer
    On the complexity of distributed graph coloring. [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:7-15 [Conf]
  5. Daniel Golovin, Anupam Gupta, Bruce M. Maggs, Florian Oprea, Michael K. Reiter
    Quorum placement in networks: minimizing network congestion. [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:16-25 [Conf]
  6. Amos Korman, Shay Kutten
    Distributed verification of minimum spanning trees. [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:26-34 [Conf]
  7. Thomas Moscibroda, Stefan Schmid, Roger Wattenhofer
    When selfish meets evil: byzantine players in a virus inoculation game. [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:35-44 [Conf]
  8. Avrim Blum, Eyal Even-Dar, Katrina Ligett
    Routing without regret: on convergence to nash equilibria of regret-minimizing algorithms in routing games. [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:45-52 [Conf]
  9. Ittai Abraham, Danny Dolev, Rica Gonen, Joseph Y. Halpern
    Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation. [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:53-62 [Conf]
  10. Idit Keidar, Roie Melamed, Ariel Orda
    EquiCast: scalable multicast with selfish users. [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:63-71 [Conf]
  11. Bogdan Caprita, Jason Nieh, Clifford Stein
    Grouped distributed queues: distributed queue, proportional share multiprocessor scheduling. [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:72-81 [Conf]
  12. Srikanta Tirthapura, Bojian Xu, Costas Busch
    Sketching asynchronous streams over a sliding window. [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:82-91 [Conf]
  13. Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A. Rokicki
    Adversarial queuing on the multiple-access channel. [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:92-101 [Conf]
  14. Yitzhak Birk, Idit Keidar, Liran Liss, Assaf Schuster, Ran Wolff
    Veracity radius: capturing the locality of distributed computations. [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:102-111 [Conf]
  15. Werner Vogels
    Life is not a state-machine: the long road from research to production. [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:112- [Conf]
  16. Damon Mosk-Aoyama, Devavrat Shah
    Computing separable functions via gossip. [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:113-122 [Conf]
  17. Laurent Massoulié, Erwan Le Merrer, Anne-Marie Kermarrec, Ayalvadi J. Ganesh
    Peer counting and sampling in overlay networks: random walk methods. [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:123-132 [Conf]
  18. Thomas Moscibroda, Stefan Schmid, Roger Wattenhofer
    On the topologies formed by selfish peers. [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:133-142 [Conf]
  19. Ariel Daliot, Danny Dolev
    Self-stabilizing byzantine agreement. [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:143-152 [Conf]
  20. Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal, Corentin Travers
    Irreducibility and additivity of set agreement-oriented failure detector classes. [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:153-162 [Conf]
  21. Matthias Fitzi, Martin Hirt
    Optimally efficient multi-valued byzantine agreement. [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:163-168 [Conf]
  22. Idit Keidar, Alexander Shraer
    Timeliness, failure-detectors, and consensus performance. [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:169-178 [Conf]
  23. Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
    Oracle size: a new measure of difficulty for communication tasks. [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:179-187 [Conf]
  24. Ittai Abraham, Cyril Gavoille
    Object location using path separators. [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:188-197 [Conf]
  25. Goran Konjevod, Andréa W. Richa, Donglin Xia
    Optimal-stretch name-independent compact routing in doubling metrics. [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:198-207 [Conf]
  26. Mirela Damian, Saurav Pandit, Sriram V. Pemmaraju
    Local approximation schemes for topology control. [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:208-217 [Conf]
  27. Yehuda Afek, Eli Gafni, Adam Morrison
    Common2 extended to stacks and unbounded concurrency. [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:218-227 [Conf]
  28. Panagiota Fatourou, Nikolaos D. Kallimanis
    Single-scanner multi-writer snapshot implementations are fast! [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:228-237 [Conf]
  29. Wojciech M. Golab, Danny Hendler, Philipp Woelfel
    An O(1) RMRs leader election algorithm. [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:238-247 [Conf]
  30. Rachid Guerraoui, Marko Vukolic
    How fast can a very robust read be? [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:248-257 [Conf]
  31. Chiu-Yuen Koo, Vartika Bhandari, Jonathan Katz, Nitin H. Vaidya
    Reliable broadcast in radio networks: the bounded collision case. [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:258-264 [Conf]
  32. Kannan Srinathan, C. Pandu Rangan
    Possibility and complexity of probabilistic reliable communication in directed networks. [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:265-274 [Conf]
  33. Rui Fan, Nancy A. Lynch
    An Omega (n log n) lower bound on the cost of mutual exclusion. [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:275-284 [Conf]
  34. Dan Holtby, Bruce M. Kapron, Valerie King
    Lower bound for scalable Byzantine Agreement. [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:285-291 [Conf]
  35. Dana Angluin, James Aspnes, David Eisenstat
    Stably computable predicates are semilinear. [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:292-299 [Conf]
  36. Hagit Attiya, Rachid Guerraoui, Danny Hendler, Petr Kouznetsov
    Synchronizing without locks is inherently expensive. [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:300-307 [Conf]
  37. Hagit Attiya, Leah Epstein, Hadas Shachnai, Tami Tamir
    Transactional contention management as a non-clairvoyant scheduling problem. [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:308-315 [Conf]
  38. Rachid Guerraoui, Maurice Herlihy, Bastian Pochon
    Towards a theory of transactional contention managers. [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:316-317 [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