From: herlihy@crl.dec.com (Maurice Herlihy)
Subject: PODC '92 accepted papers
Organization: DEC Cambridge Research Lab
Date: Tue, 14 Apr 1992 16:45:42 GMT


		 *********************************************
		 *     Eleventh Annual ACM Symposium on      *
		 *    Principles of Distributed Computing    *
		 *                (PODC'92)                  *
		 *********************************************
			      August 10-12, 1992
		      Vancouver, British Columbia, CANADA

INVITED LECTURE (Monday 9:00 -- 10:00)

AN2: A local area network as a distributed system.
Susan Owicki,
DEC Systems Research Center

BREAK (Monday 10:00 -- 10:30)

SESSION 1 (Monday 10:30 -- 12:10)
Distributed Priority Algorithms Under One-Bit-Delay Constraint,
Reuven Cohen and Adrian Segall,
IBM T.J. Watson Research Center and Technion.

Connection-Based Communcation in Dynamic Networks,
Amir Herzberg,
IBM T.J. Watson Research Center.

Requirements for Deadlock-Free, Adaptive Packet Routing,
Robert Cypher and Luis Gravano,
IBM Almaden Research Center.

The Slide Mechanism with Applications in Dynamic Networks,
Yehuda Afek, Eli Gafni, and Adi Rosen,
Tel-Aviv University and UCLA

LUNCH (Monday 12:10 -- 2:00)

SESSION 2 (Monday 2:00 -- 3:15)
Computing with Faulty Shared Memory,
Yehuda Afek, David S. Greenberg, Michael Merritt, and Gadi Taubenfeld,
Tel-Aviv University and AT\&T Bell Laboratories.

Concurrent Counting
Gadi Taubenfeld, Shlomo Moran, and Irit Yadin,
AT\&T Bell Laboratories and Technion.

Optimal Multi-Writer Multi-Reader Atomic Register,
Amos Israeli and Amnon Shaham,
Technion.

BREAK (Monday 3:15 -- 3:45)

SESSION 3 (Monday 3:45 -- 5:25)
Tolerating Linear Number of Faults in Networks of Bounded Degree,
Eli Upfal,
IBM Almaden Research Center.

Performing Work Efficiently in the Presence of Faults,
Cynthia Dwork, Joseph Y. Halpern, and Orli Waarts,
IBM Almaden Research Center and Stanford University.

On the Complexity of Global Computation in the Presence of Link Failures: The Case of Uni-Directional Faults,
Oded Goldreich and Dror Sneh,
Technion.

Observing Self-Stabilization,
Chengdian Lin and Janos Simon,
University of Chicago.

INVITED LECTURE (Tuesday 9:00 -- 10:00)
Recent Trends in Experimental Operating Systems Research,
Ed Lazowska,
University of Washington.

BREAK (Tuesday 10:00 -- 10:30)

SESSION 4 (Tuesday 10:30 -- 12:10)
Performance Issues in Non-blocking Synchronization on Shared-Memory Multiprocessors,
Juan Alemany and Edward W. Felten,
University of Washington.

Robust Distributed References and Acyclic Garbage Collection
Marc Sharpiro, Peter Dickman and David Plainfosse,
INRIA.

The Weakest Failure Detector for Solving Consensus,
Tushar Deepak Chandra, Vassos Hadzilacos, and Sam Toueg,
Cornell University and University of Toronto.

Improving Fast Mutual Exclusion,
Eugene Styer,
University of Kentucky.

LUNCH (Tuesday 12:10 -- 2:00)

SESSION 5 (Tuesday 2:00 -- 3:15)
Fast Network Decomposition,
Baruch Awerbuch, Bonnie Berger, Lenore Cowen, and David Peleg,
MIT and Weizmann Institute.

Leader Election in Complete Networks,
Gurdip Singh,
Kansas State University.

The Impact of Time on the Session Problem,
Injong Rhee and Jennifer L. Welch,
University of North Carolina at Chapel Hill.

BREAK (Tuesday 3:15 -- 3:45)

SESSION 6 (Tuesday 3:45 -- 5:00)
The Possibility and the Complexity of Achieving Fault-Tolerant Coordination,
Rida Bazzi and Gil Neiger,
Georgia Institute of Technology.

From Sequential Layers to Distributed Processes:
Deriving a Distributed Minimum Weight Spanning Tree Algorithm.
Wil Janssen and Job Zwiers,
University of Twente.

Progress Measures and Stack Assertions for Fair Termination,
Nils Klarlund,
IBM T.J. Watson Research Center.

INVITED LECTURE (Wednesday 9:00 -- 10:00)
Practical Issues in the Design of Highly Parallel Computers,
Marc Snir,
IBM T.J. Watson Research Center.

BREAK (Wednesday 10:00 -- 10:30)

SESSION 7 (Wednesday 10:30 -- 12:10)

A Tradeoff Between Safety and Liveness for Randomized Coordinated Attack Protocols,
George Varghese and Nancy A Lynch,
DEC and MIT

Fast Randomized Algorithms for Distributed Edge Coloring,
Alessandro Panconesi and Aravind Srinivasan,
Cornell University.

Proving Probabilistic Correctness Statements: The Case of Rabin's Algorithm for Mutual Exclusion,
Issac Saias and Nancy Lynch,
MIT.

Randomized Mutual Exclusion Algorithms Revisited,
Eyal Kushilevitz and Michael O. Rabin,
Harvard University and Hebrew University.