On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization (Q1198663): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1130167
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Reuven Bar Yehuda / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Broadcasting in Radio Networks--Problem Analysis and Protocol Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4065548 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A perspective on multiaccess 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: Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Born again group testing: Multiaccess communications / rank
 
Normal rank

Latest revision as of 14:16, 16 May 2024

scientific article
Language Label Description Also known as
English
On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
scientific article

    Statements

    Identifiers