Noisy beeping networks (Q2105415)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Noisy beeping networks	scientific article

Statements

scholarly article

0 references

Noisy beeping networks (English)

0 references

Yagel Ashkenazi

0 references

0 references

0 references

Information and Computation

0 references

publication date

8 December 2022

0 references

zbMATH Keywords

fault-tolerant distributed computing

0 references

beeping networks

0 references

computation with noise

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.ic.2022.104925

0 references

Beeping a maximal independent set

0 references

A Biological Solution to a Fundamental Distributed Computing Problem

0 references

Multiparty Interactive Communication with Private Channels

0 references

A lower bound for radio broadcast

0 references

Reliable communication over highly connected noisy networks

0 references

Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection

0 references

Multiple Communication in Multihop Radio Networks

0 references

Constant-Rate Coding for Multiparty Interactive Communication Is Impossible

0 references

Counting in one-hop beeping networks

0 references

Design patterns in beeping algorithms: examples, emulation, and analysis

0 references

Making asynchronous distributed computations robust to noise

0 references

Broadcasting in Noisy Radio Networks

0 references

A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

0 references

On Broadcasting in Radio Networks--Problem Analysis and Protocol Design

0 references

Naming a Channel with Beeps

0 references

Deploying Wireless Networks with Beeps

0 references

Leader election in multi-hop radio networks

0 references

Broadcasting algorithms in radio networks with unknown topology

0 references

0 references

Interactive coding over the noisy broadcast channel

0 references

0 references

Finding parity in a simple broadcast network

0 references

Coding for Interactive Communication: A Survey

0 references

Constant-Rate Interactive Coding Is Impossible, Even in Constant-Degree Networks

0 references

Efficient Multiparty Interactive Coding for Insertions, Deletions, and Substitutions

0 references

Efficient Coding for Interactive Communication

0 references

Near Optimal Leader Election in Multi-Hop Radio Networks

0 references

Leader election using loneliness detection

0 references

Fundamentals of Wireless Communication

0 references

Byzantine fireflies

0 references

Global synchronization and consensus using beeps in a fault-prone multiple access channel

0 references

The Adversarial Noise Threshold for Distributed Protocols

0 references

Interactive Coding for Multiparty Protocols

0 references

Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring

0 references

Class of constructive asymptotically good algebraic codes

0 references

Broadcasting in undirected ad hoc radio networks

0 references

An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks

0 references

An optimal bit complexity randomized distributed MIS algorithm

0 references

0 references

A coding theorem for distributed computation

0 references

Polynomial Codes Over Certain Finite Fields

0 references

0 references

Erasure correction for noisy radio networks

0 references

Identifiers

10.1016/j.ic.2022.104925

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2105415

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2105415&oldid=38019751"