Transmitting once to elect a leader on wireless networks (Q6077889): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00453-023-01095-2 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-023-01095-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4323317281 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beeping a maximal independent set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398822 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple Communication in Multihop Radio Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contention resolution with log-logstar channel accesses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree algorithms for packet broadcast channels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design patterns in beeping algorithms: examples, emulation, and analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential Separations in the Energy Complexity of Leader Election / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations / 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: Deploying Wireless Networks with Beeps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a complexity theory for local distributed computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near Optimal Leader Election in Multi-Hop Radio Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Leader election using loneliness detection / 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: Efficient algorithms for leader election in radio networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak communication in single‐hop radio networks: adjusting algorithms to industrial standards / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Universal Leader Election / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3126969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5075304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472511 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00453-023-01095-2 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:14, 30 December 2024

scientific article; zbMATH DE number 7742463
Language Label Description Also known as
English
Transmitting once to elect a leader on wireless networks
scientific article; zbMATH DE number 7742463

    Statements

    Transmitting once to elect a leader on wireless networks (English)
    0 references
    0 references
    27 September 2023
    0 references
    distributed computing
    0 references
    leader election
    0 references
    energy complexity
    0 references

    Identifiers