25-Year Rump Session

25th Annual ACM SIGACT-SIGOPS Symposium on
Principles Of Distributed Computing

(PODC 2006)

July 23-26, 2006, Denver, Colorado, USA
http://www.podc.org/podc2006/

Dear members of the PODC community,

As part of PODC's 25th Anniversary celebration (afternoon of 23 July 2006), we are planning a "25-year rump session" where students are invited to give 5-minute "rump session" presentations of selected papers representative of the kind of work that has come out of PODC.

This is an excellent chance to hone presentation skills, learn something about PODC's history, and to have fun. Prizes will be awarded for best presentations, best costumes, best use of props, best use of a foreign language, and other categories.

The list of representative papers follows. If you would like to present one, send me (mph@cs.brown.edu) email reserving the one you'd like. First-come-first-served!)

Oh, and we will cheerfully accept non-student volunteers as well.

Maurice Herlihy

  1. Unreliable failure detectors for asynchronous systems,
    Tushar Deepak Chandra and Sam Toueg,
    Proceedings of the tenth annual ACM symposium on Principles of distributed computing, 1991.
  2. Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols,
    Michael Ben-Or,
    Proceedings of the second annual ACM symposium on Principles of distributed computing, 1983.
  3. The slide mechanism with applications in dynamic networks,
    Yehuda Afek, Eli Gafni, and Adi Rosen,
    Proceedings of the eleventh annual ACM symposium on Principles of distributed computing, 1992.
  4. Crash Failures can Drive Protocols to Arbitrary States,
    Mahesh Jayaram and George Varghese,
    Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing, 1996.
  5. Fast network decomposition,
    Baruch Awerbuch, Bonnie Berger, Lenore Cowen, and David Peleg,
    Proceedings of the eleventh annual ACM symposium on Principles of distributed computing, 1992.
  6. Knowledge and common knowledge in a distributed environment,
    Joseph Y. Halpern and Yoram Moses,
    Proceedings of the third annual ACM symposium on Principles of distributed computing, 1984.
  7. Consensus in the Presence of Partial Synchrony (Preliminary Version),
    Cynthia Dwork, Nancy A. Lynch, and Larry J. Stockmeyer,
    Journal of the ACM, 1988. (journal version, conference version is unavailable).
  8. Byzantine clock synchronization,
    Leslie Lamport and P. M. Melliar-Smith,
    Proceedings of the third annual ACM symposium on Principles of distributed computing, 1984.
  9. Easy impossibility proofs for distributed consensus problems,
    Michael J. Fischer, Nancy A. Lynch, and Michael Merritt,
    Proceedings of the fourth annual ACM symposium on Principles of distributed computing, 1985.
  10. Hierarchical correctness proofs for distributed algorithms,
    Nancy A. Lynch and Mark R. Tuttle,
    Proceedings of the sixth annual ACM Symposium on Principles of distributed computing, 1987.
  11. Impossibility and universality results for wait-free synchronization,
    Maurice P. Herlihy,
    Proceedings of the seventh annual ACM Symposium on Principles of distributed computing, 1988.
  12. Memory coherence in shared virtual memory systems,
    Kai Li and Paul Hudak,
    Proceedings of the fifth annual ACM symposium on Principles of distributed computing, 1986.
  13. Software transactional memory,
    Nir Shavit and Dan Touitou,
    Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing, 1995.

[PODC 2006 Main Page]