Time and space lower bounds for non-blocking implementations (preliminary version)

Authors:
Prasad Jayanti;King Tan;Sam Toueg
Affiliations:
Sudikoff Laboratory for Computer Science, Dartmouth, College, Hanover, NH;Department of Computer Science, Upson Hall, Cornell University, Ithaca, NY;Department of Computer Science, Upson Hall, Cornell University, Ithaca, NY
Venue:
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Year:
1996

Linearizability: a correctness condition for concurrent objects

ACM Transactions on Programming Languages and Systems (TOPLAS)
Time-and space-efficient randomized consensus

PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Atomic snapshots of shared memory

Journal of the ACM (JACM)
On the space complexity of randomized synchronization

PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing

A time complexity lower bound for randomized implementations of some shared objects

PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
On the space complexity of randomized synchronization

Journal of the ACM (JACM)
On the inherent weakness of conditional synchronization primitives

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing

Hi-index	0.01