Research Catalog

Title

PODC 2006 : proceedings of the 25th Annual ACM Symposium on Principles of Distributed Computing : July 23-26, 2006, Denver, Colorado, USA / sponsored by ACM SIGACT & ACM SIGOPS, with support from Google, Hewlett-Packard, Intel & Microsoft Research.

Author

ACM Symposium on Principles of Distributed Computing (25th : 2006 : Denver, Colo.)

Publication

New York, N.Y. : Association for Computing Machinery, [2006], ©2006.

Items in the Library & Off-site

Holdings

Details

Additional Authors

• ACM Special Interest Group for Algorithms and Computation Theory.
• ACM Special Interest Group in Operating Systems.

Description

xi, 318 pages : illustrations; 28 cm

Alternative Title

• 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

Subject

• Electronic data processing > Distributed processing > Congresses

Note

• "ACM order number 536060"--P. ii.

Bibliography (note)

• Includes bibliographical references and index.

Contents

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

ISBN

• 1595933840
• 9781595933843

OCLC

• ocm75389443
• SCSB-5293635

Owning Institutions

Columbia University Libraries