Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel
- 1 May 1986
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 15 (2) , 468-477
- https://doi.org/10.1137/0215032
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channelsJournal of the ACM, 1985
- Universal coding, information, prediction, and estimationIEEE Transactions on Information Theory, 1984
- Measured performance of an Ethernet local networkCommunications of the ACM, 1980
- Improved prefix encodings of the natural numbers (Corresp.)IEEE Transactions on Information Theory, 1980
- Optimal unbounded search strategiesPublished by Springer Nature ,1980
- Tree algorithms for packet broadcast channelsIEEE Transactions on Information Theory, 1979
- An almost optimal algorithm for unbounded searchingInformation Processing Letters, 1976
- EthernetCommunications of the ACM, 1976
- Additional comments on a problem in concurrent programming controlCommunications of the ACM, 1966
- Solution of a problem in concurrent programming controlCommunications of the ACM, 1965