Log-logarithmic protocols for resolving ethernet and semaphore conflicts (preliminary report)

14Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.

Abstract

We propose two protocols for resolving conflicts on ethernetlike mediums in log-logarithmicexpected time and prove our algorithms are optimal up to an additive constant. It is difficult to second-guess the fast-changing electronics industry, but our analysis could be relevant outside the traditional interests of the ethernet literature to semaphore-like problems.

Cite

CITATION STYLE

APA

Willard, D. E. (1984). Log-logarithmic protocols for resolving ethernet and semaphore conflicts (preliminary report). In Proceedings of the Annual ACM Symposium on Theory of Computing (pp. 512–521). Association for Computing Machinery. https://doi.org/10.1145/800057.808721

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free