Lower bounds for the broadcast problem in mobile radio networks (Q5137335): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s004460050030 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2045376554 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization / 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: The Wakeup Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Ω(<i>D</i> log(<i>N/D</i>)) lower bound for broadcast in radio networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385172 / rank
 
Normal rank

Latest revision as of 02:28, 24 July 2024

scientific article; zbMATH DE number 7280001
Language Label Description Also known as
English
Lower bounds for the broadcast problem in mobile radio networks
scientific article; zbMATH DE number 7280001

    Statements

    Lower bounds for the broadcast problem in mobile radio networks (English)
    0 references
    0 references
    0 references
    2 December 2020
    0 references
    mobile computing
    0 references
    broadcast
    0 references
    distributed algorithms
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references