Optimal message-passing with noisy beeps
From MaRDI portal
Cites work
- A biological solution to a fundamental distributed computing problem
- A Simple Parallel Algorithm for the Maximal Independent Set Problem
- Almost cover-free codes and designs
- An Improved Distributed Algorithm for Maximal Independent Set
- Beeping a deterministic time-optimal leader election
- Beeping a maximal independent set
- Can Uncoordinated Beeps tell Stories?
- Construction and impromptu repair of an MST in a distributed network with o(m) communication
- Deploying wireless networks with beeps
- Design patterns in beeping algorithms: examples, emulation, and analysis
- Distributed approximate maximum matching in the CONGEST model
- Distributed exact weighted all-pairs shortest paths in near-linear time
- Efficient randomized distributed coloring in CONGEST
- Fundamentals of Error-Correcting Codes
- scientific article; zbMATH DE number 3801449 (Why is no real title available?)
- Leader election in multi-hop radio networks
- Near optimal leader election in multi-hop radio networks
- Noisy beeping networks
- Nonrandom binary superimposed codes
- On r-cover-free families
- On the upper bound of the size of the \(r\)-cover-free families
- Optimal distributed all pairs shortest paths and applications
- Optimal Message-Passing with Noisy Beeps
- Optimal multi-broadcast with beeps using group testing
- Polylogarithmic-time deterministic network decomposition and distributed derandomization
- Reachability and shortest paths in the broadcast CONGEST model
- Some simple distributed algorithms for sparse networks
- The locality of distributed symmetry breaking
This page was built for publication: Optimal message-passing with noisy beeps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6909805)
