Parallel and Distributed Computation
(Selected papers)

-----

Time-lapse snapshots.
C. Dwork, M. P. Herlihy, S. Plotkin, and O. Waarts.
Full version of the ISTCS 1992 paper.
A sublinear parallel algorithm for stable matching.
T. Feder, N. Megiddo, and S. Plotkin.
In SODA 1994.
Network Decomposition and Locality in Distributed Computation .
B. Awerbuch, A. Goldberg, M. Luby, and S. Plotkin.
In FOCS 1989.
Interior Point Methods in Parallel Computation.
A. Goldberg, S. Plotkin, D. Shmoys, and E. Tardos.
SICOMP Feb. 1992. Prelim. version in FOCS 1989.
Sticky Bits and Universality of Consensus.
S. Plotkin.
Full version of the PODC 1989 paper.
Sublinear-Time Parallel Algorithms for Matching and Related Problems.
A. Goldberg, S. Plotkin, and P. Vaidya.
J. Alg. 1993. Prelim. version in FOCS 1988.
Local Management of a Global Resource in a Communication Network.
Y. Afek, B. Awerbuch, S. Plotkin, and M. Saks.
To appear in JACM. Preliminary version in FOCS 1987.
Parallel Symmetry Breaking in Sparse Graphs.
A. Goldberg, S. Plotkin, and G. Shannon.
SIAM J. Discr. Math. 1988. Prelim. version in STOC 1987.

-----