CONTENTION RESOLUTION IN MULTIPLE-ACCESS CHANNELS: k-SELECTION IN RADIO NETWORKS (Q3084678): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Tree algorithms for packet broadcast channels / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Probability and Computing / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel / rank | |||
Normal rank | |||
Revision as of 22:25, 3 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | CONTENTION RESOLUTION IN MULTIPLE-ACCESS CHANNELS: k-SELECTION IN RADIO NETWORKS |
scientific article |
Statements
CONTENTION RESOLUTION IN MULTIPLE-ACCESS CHANNELS: k-SELECTION IN RADIO NETWORKS (English)
0 references
25 March 2011
0 references
contention resolution
0 references
selection
0 references
radio networks
0 references
multiple-access channels
0 references
0 references
