PODC 2006
Subtitle: proceedings of the 25th Annual ACM Symposium on Principles of Distributed Computing : July 23-26, 2006, Denver, Colorado, USA
By: sponsored by ACM SIGACT & ACM SIGOPS, with support from Google, Hewlett-Packard, Intel & Microsoft Research
Contributors: ACM Special Interest Group for Algorithms and Computation Theory; ACM Special Interest Group in Operating Systems
Publisher: Association for Computing Machinery
Published: 2006
Place of publication: New York, N.Y
Language: eng
Number of pages: 318
ISBN-13: 9781595933843
Copyright date: 2006
Subjects: Electronic data processing; Congresses; Distributed processing
Other titles: 25th Annual ACM Symposium on Principles of Distributed Computing; Twenty-fifth Annual ACM Symposium on Principles of Distributed Computing; ACM Symposium on Principles of Distributed Computing; PODC '06
Notes: "ACM order number 536060"--P. ii.

Includes bibliographical references and index.
Table of contents: title: The art of multiprocessor programming  -- M. Herlihy; title: Century papers at the first quarter-century milestone  -- D. Dolev; title: Distributed social systems  -- J. Kleinberg; title: On the complexity of distributed graph coloring  -- F. Kuhn and R. Wattenhofer; title: Quorum placement in networks : minimizing network congestion  -- D. Golovin, A. Gupta, B. M. Maggs, F. Oprea and M. K. Reiter; title: Distributed verification of minimum spanning trees  -- A. Korman and S. Kutten; title: When selfish meets evil : Byzantine players in a virus inoculation game  -- T. Moscibroda, S. Schmid and R. Wattenhofer; title: Routing without regret : on convergence to Nash equilibria of regret-minimizing algorithms in routing games  -- A. Blum, E. Even-Dar and K. Ligett; title: Distributed computing meets game theory : robust mechanisms for rational secret sharing and multiparty computation  -- I. Abraham, D. Dolev, R. Gonen and J. Halpern; title: EquiCast : scalable multicast with selfish users  -- I. Keidar, R. Melamed and A. Orda; title: Grouped distributed queues : distributed queue, proportional share multiprocessor scheduling  -- B. Caprita, J. Nieh and C. Stein; title: Sketching asynchronous streams over a sliding window  -- S. Tirthapura, B. Xu and C. Busch; title: Adversarial queuing on the multiple-access channel  -- B. S. Chlebus, D. R. Kowalski and M. A. Rokicki; title: Veracity radius - capturing the locality of distributed computations  -- Y. Birk, I. Keidar, L. Liss, A. Schuster and R. Wolff; title: Life is not a state-machine : the long road from research to production  -- W. Vogels; title: Computing separable functions via gossip  -- D. Mosk-Aoyama and D. Shah; title: Peer counting and sampling in overlay networks : random walk methods  -- L. Massoulie, E. Le Merrer, A.-M. Kermarrec and A. Ganesh; title: On the topologies formed by selfish peers  -- T. Moscibroda, S. Schmid and R. Wattenhofer; title: Self-stabilizing Byzantine agreement  -- A. Daliot and D. Dolev; title: Irreducibility and additivity of set agreement-oriented failure detector classes  -- A. Mostefaoui, S. Rajsbaum, M. Rayna and C. Travers; title: Optimally efficient multi-valued Byzantine agreement  -- M. Fitzi and M. Hirt; title: Timeliness, failure-detectors, and consensus performance  -- I. Keidar and A. Shraer; title: Oracle size : a new measure of difficulty for communication tasks  -- P. Fraigniaud, D. Ilcinkas and A. Pelc; title: Object location using path separators  -- I. Abraham and C. Gavoille; title: Optimal-stretch name-independent compact routing in doubling metrics  -- G. Konjevod, A. W. Richa and D. Xia; title: Local approximation schemes for topology control  -- M. Damian, S. Pandit and S. Pemmaraju; title: Common2 extended to stacks and unbounded concurrency  -- Y. Afek, E. Gafni and A. Morrison; title: Single-scanner multi-writer snapshot implementations are fast!  -- P. Fatourou and N. D. Kallimanis; title: An O(1) RMRs leader election algorithm  -- W. Golab, D. Hendler and P. Woelfel; title: How fast can a very robust read be?  -- R. Guerraoui and M. Vukolic; title: Reliable broadcast in radio networks : the bounded collision case  -- C.-Y. Koo, V. Bhandari, J. Katz and N. H. Vaidya; title: Possibility and complexity of probabilistic reliable communication in directed networks  -- K. Srinathan and C. P. Rangan; title: An [omega] (n log n) lower bound on the cost of mutual exclustion  -- R. Fan and N. Lynch; title: Lower bound for scalable Byzantine agreement  -- D. Holtby, B. M. Kapron and V. King; title: Stably computable predicates are semilinear  -- D. Angluin, J. Aspnes and D. Eisenstat; title: Synchronizing without locks is inherently expensive  -- H. Attiya, R. Guerraoui, D. Hendler and P. Kouznetsov; title: Transactional contention management as a non-clairvoyant scheduling problem  -- H. Attiya, L. Epstein, H. Shachnai and T. Tamir; title: Towards a theory of transactional contention managers (errata for a PODC 2005 paper) -- R. Guerraoui and M. Herlihy.