On adaptive conflict resolution algorithms in a multiple access channel
From MaRDI portal
Publication:809980
zbMATH Open0732.94002MaRDI QIDQ809980
Publication date: 1990
Published in: Problems of Information Transmission (Search for Journal in Brave)
Channel models (including quantum) in information and communication theory (94A40) Communication theory (94A05)
Related Items (2)
A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels โฎ Title not available (Why is that?)
Recommendations
- Title not available (Why is that?) ๐ ๐
- Conflict resolution in a multiple access channel ๐ ๐
- Estimating the multiplicities of conflicts to speed their resolution in multiple access channels ๐ ๐
- Dynamic prioritized conflict resolution on multiple access broadcast networks ๐ ๐
- An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels ๐ ๐
- Optimal prioritized conflict resolution on a multiple access channel ๐ ๐
- Fast Nonadaptive Deterministic Algorithm for Conflict Resolution in a Dynamic Multiple-Access Channel ๐ ๐
- A new kind of selectors and their applications to conflict resolution in wireless multichannels networks ๐ ๐
This page was built for publication: On adaptive conflict resolution algorithms in a multiple access channel
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q809980)