scientific article; zbMATH DE number 7561272
From MaRDI portal
Publication:5090911
DOI10.4230/LIPIcs.DISC.2018.20zbMath1497.68042MaRDI QIDQ5090911
Fabien Dufoulon, Joffroy Beauquier, Janna Burman
Publication date: 21 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
deterministic algorithmstime complexitydistributed algorithmswireless networksleader electionbeeping model
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Distributed algorithms (68W15)
Related Items (3)
Optimal Message-Passing with Noisy Beeps ⋮ Beep-and-sleep: message and energy efficient set cover ⋮ Noisy beeping networks
Cites Work
- Deterministic leader election in \(O(D+\log n)\) time with messages of size \(O(1)\)
- The computational power of beeps
- Byzantine fireflies
- Analysis of fully distributed splitting and naming probabilistic procedures and applications
- Beeping a maximal independent set
- Design Patterns in Beeping Algorithms.
- What Is the Use of Collision Detection (in Wireless Networks)?
- Deploying Wireless Networks with Beeps
- On Broadcasting in Radio Networks--Problem Analysis and Protocol Design
- On the complexity of universal leader election
- Feedback from nature
- Brief Announcement
- Communicating with Beeps
- Structural Information and Communication Complexity
- Near Optimal Leader Election in Multi-Hop Radio Networks
This page was built for publication:
