Efficient algorithms for multiple access channels

One, two, three . . . infinity: lower bounds for parallel computation

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing

Estimating the multiplicities of conflicts to speed their resolution in multiple access channels

Journal of the ACM (JACM)

A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels

Journal of the ACM (JACM)

Log-logarithmic protocols for resolving ethernet and semaphore conflicts

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing

Incomparability in parallel computation

SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science