Distributed Computing

25th International Symposium, DISC 2011, Rome, Italy, September 20-22, 2011. Proceedings

  • David Peleg
Conference proceedings DISC 2011
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6950)

Table of contents

  1. Brief Announcements II (Session 1f)

    1. Siddhartha Sen, Sunghwan Ihm, Kay Ousterhout, Michael J. Freedman
      Pages 205-207
  2. Invited Lecture: Paxos Plus (Session 2a)

    1. Mahesh Balakrishnan, Dahlia Malkhi, Vijayan Prabhakaran, Ted Wobber
      Pages 208-210
    2. Leslie Lamport
      Pages 211-224
  3. Wireless (Session 2b)

    1. Antonio Fernández Anta, Miguel A. Mosteiro, Jorge Ramón Muñoz
      Pages 225-236
    2. Leonid Barenboim, Shlomi Dolev, Rafail Ostrovsky
      Pages 237-251
    3. Shlomi Dolev, Seth Gilbert, Majid Khabbazian, Calvin Newport
      Pages 252-267
    4. Mohsen Ghaffari, Nancy Lynch, Srikanth Sastry
      Pages 268-282
  4. Network algorithms I (Session 2c)

    1. Srikanta Tirthapura, David P. Woodruff
      Pages 283-297
    2. Andrea E. F. Clementi, Riccardo Silvestri
      Pages 298-310
    3. Yvonne Anne Pignolet, Stefan Schmid, Gilles Tredan
      Pages 311-325
  5. Brief Announcements III (Session 2d)

    1. Meg Walraed-Sullivan, Radhika Niranjan Mysore, Keith Marzullo, Amin Vahdat
      Pages 326-327
    2. Taisuke Izumi, Zohir Bouzid, Sébastien Tixeuil, Koichi Wada
      Pages 330-331
  6. Invited Lecture & Best Paper: Aspects of Locality (Session 3a)

  7. Consensus (Session 3b)

    1. Hagit Attiya, Fatemeh Borran, Martin Hutle, Zarko Milosevic, André Schiper
      Pages 374-388
    2. Piyush Bansal, Prasant Gopal, Anuj Gupta, Kannan Srinathan, Pranav Kumar Vasishta
      Pages 389-403
  8. Network algorithms II (Session 3c)

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 25th International Symposium on Distributed Computing, DISC 2011, held in Rome, Italy, in September 2011. The 31 revised full papers presented together with invited lectures and brief announcements were carefully reviewed and selected from 136 submissions. The papers are organized in topical sections on distributed graph algorithms; shared memory; brief announcements; fault-tolerance and security; paxos plus; wireless; network algorithms; aspects of locality; consensus; concurrency.

Keywords

communication complexity distributed algorithms finite state automata local computing reliable communication

Editors and affiliations

  • David Peleg
    • 1
  1. 1.Department of Computer ScienceWeizmann Institute of ScienceRehovotIsrael

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-24100-0
  • Copyright Information Springer-Verlag GmbH Berlin Heidelberg 2011
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-24099-7
  • Online ISBN 978-3-642-24100-0
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349