The complexity of selection resolution, conflict resolution and maximum finding on multiple access channels
- 3 August 2006
- book chapter
- Published by Springer Nature
- p. 401-410
- https://doi.org/10.1007/bfb0040407
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A fast parallel quicksort algorithmInformation Processing Letters, 1989
- Estimating the multiplicities of conflicts to speed their resolution in multiple access channelsJournal of the ACM, 1987
- Log-Logarithmic Selection Resolution Protocols in a Multiple Access ChannelSIAM Journal on Computing, 1986
- A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channelsJournal of the ACM, 1985
- An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channelsIEEE Transactions on Information Theory, 1985
- Simple, efficient asynchronous parallel algorithms for maximizationPublished by Association for Computing Machinery (ACM) ,1985
- Finding an extremum in a networkACM SIGARCH Computer Architecture News, 1982
- Tree algorithms for packet broadcast channelsIEEE Transactions on Information Theory, 1979
- An Adaptive Technique for Local DistributionIEEE Transactions on Communications, 1978
- EthernetCommunications of the ACM, 1976