A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels
- 1 July 1985
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 32 (3) , 589-596
- https://doi.org/10.1145/3828.214125
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Cutoff points for roll call protocols in multiple access systemsIEEE Transactions on Information Theory, 1987
- A new upper bound to the throughput of a multi-access broadcast channelIEEE Transactions on Information Theory, 1982
- On the capacity of infinite population multiple access protocolsIEEE Transactions on Information Theory, 1982
- An Adaptive Technique for Local DistributionIEEE Transactions on Communications, 1978