15. PODC 1996:
Philadelphia, Pennsylvania, USA
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing,
Philadelphia, Pennsylvania, USA, May 23-26, 1996. ACM, ISBN 0-89791-800-2
Invited Speakers
Session 1
- Shlomi Dolev, Mohamed G. Gouda, Marco Schneider:
Memory Requirements for Silent Stabilization (Extended Abstract).
27-34 BibTeX
- Adam M. Costello, George Varghese:
Self-Stabilization by Window Washing.
35-44 BibTeX
- Sukumar Ghosh, Arobinda Gupta, Ted Herman, Sriram V. Pemmaraju:
Fault-Containing Self-Stabilizing Algorithms.
45-54 BibTeX
- Roberto Baldoni, Jean-Michel Hélary, Michel Raynal:
About State Recording in Asynchronous Computations (Abstract).
55 BibTeX
- Michael Goldweber, Donald B. Johnson:
Minimizing Access Costs in Replicated Distributed Syste (Abstract).
56 BibTeX
- Nancy A. Lynch, Sergio Rajsbaum:
On the Borowsky-Gafni Simulation Algorithm (Abstract).
57 BibTeX
Session 2
Joint ISCA/PODC Panel and Discussion
Session 3
Session 4
- Wil Janssen:
Refining Knowledge Oriented Actions to Layered Implementations.
91-100 BibTeX
- Nils Klarlund, Mogens Nielsen, Kim Sunesen:
Automated Logical Verification Based on Trace Abstractions.
101-110 BibTeX
- Paul C. Attie, E. Allen Emerson:
Synthesis of Concurrent Systems for an Atomic Read / Atomic Write Model of Computation (Extended Abstract).
111-120 BibTeX
- Evelyn Tumlin Pierce:
Synthesis of Distributed Control Systems (Abstract).
121 BibTeX
- Sandeep K. Shukla, Harry B. Hunt III, Daniel J. Rosenkrantz, S. S. Ravi, Richard Edwin Stearns:
I/O Automata Based Verification of Finite State Distributed Systems: Complexity Issues (Abstract).
122 BibTeX
- Dominique Ambroise, Brigitte Rozoy:
Using Events Structures for the Efficient Analysis of State Graphs (Abstract).
123 BibTeX
- John L. Bruno, Phillip B. Gibbons, Steven Phillips:
Testing Concurrent Data Structures (Abstract).
124 BibTeX
Session 5
- Cyril Gavoille, Stephane Perennes:
Memory Requirements for Routing in Distributed Networks (Extended Abstract).
125-133 BibTeX
- Harry Buhrman, Jaap-Henk Hoepman, Paul M. B. Vitányi:
Optimal Routing Tables.
134-142 BibTeX
- James Aspnes, William Hurwood:
Spreading Rumors Rapidly Despite and Adversary.
143-151 BibTeX
- Mark Moir, Juan A. Garay:
Fast, Long-Lived Renaming Improved and Simplified (Abstract).
152 BibTeX
- Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, David Peleg:
The Complexity of Data Mining on the Web (Abstract).
153 BibTeX
- Esteban Feuerstein, Stefano Leonardi, Alberto Marchetti-Spaccamela, Nicola Santoro:
Efficient Token-Based Control in Rings (Abstract).
154 BibTeX
- Sonne Preminger, Eli Upfal:
Efficient Traffic Laws for Mobile Robots - Work in Progress (Avstract).
155 BibTeX
Session 6
Session 7
Session 8
Session 9
Session 10
- Nancy A. Lynch, Nir Shavit, Alexander A. Shvartsman, Dan Touitou:
Counting Networks are Practically Linearizable.
280-289 BibTeX
- David Peleg, Avishai Wool:
How to be an Efficient Snoop, or the Probe Complexity of Quorum Systems (Extended Abstract).
290-299 BibTeX
- Alan Fekete, David Gupta, Victor Luchangco, Nancy A. Lynch, Alexander A. Shvartsman:
Eventually-Serializable Data Services.
300-309 BibTeX
- Michel Raynal, Gérard Thia-Kime, Mustaque Ahamad:
From Serializable to Causal Transactions (Abstract).
310 BibTeX
- Costas Busch, Marios Mavronicolas:
The Strength of Counting Networks (Abstract).
311 BibTeX
- Peter Auer, Pasquale Caianiello, Nicolò Cesa-Bianchi:
Tight Bounds on the Cumulative Profit of Distributed Voters (Abstract).
312 BibTeX
- Lenore Cowen, Rudolf Mathar:
The Offset Problem (Abstract).
313 BibTeX
Session 11
Copyright © Sat May 16 23:33:36 2009
by Michael Ley (ley@uni-trier.de)