Noisy beeping networks
type: Item
instance of: scholarly article
title: Noisy beeping networks
author: Yagel Ashkenazi
author: Ran Gelles
author: Amir Leshem
published in: Information and Computation
publication date: 2022-12-08T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7629129
zbMATH Keywords: fault-tolerant distributed computing
zbMATH Keywords: beeping networks
zbMATH Keywords: computation with noise
MaRDI profile type: Publication
full work available at URL: j.ic.2022.104925
OpenAlex ID: W4281651169
cites work: Beeping a maximal independent set
cites work: A Biological Solution to a Fundamental Distributed Computing Problem
cites work: Multiparty Interactive Communication with Private Channels
cites work: A lower bound for radio broadcast
cites work: Reliable communication over highly connected noisy networks
cites work: Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection
cites work: Multiple Communication in Multihop Radio Networks
cites work: Constant-Rate Coding for Multiparty Interactive Communication Is Impossible
cites work: Counting in one-hop beeping networks
cites work: Design patterns in beeping algorithms: examples, emulation, and analysis
cites work: Making asynchronous distributed computations robust to noise
cites work: Broadcasting in Noisy Radio Networks
cites work: A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
cites work: On Broadcasting in Radio Networks--Problem Analysis and Protocol Design
cites work: Naming a Channel with Beeps
cites work: Deploying Wireless Networks with Beeps
cites work: Leader election in multi-hop radio networks
cites work: Broadcasting algorithms in radio networks with unknown topology
cites work: Q5090911
cites work: Interactive coding over the noisy broadcast channel
cites work: Noisy Beeps
cites work: Finding parity in a simple broadcast network
cites work: Coding for Interactive Communication: A Survey
cites work: Constant-Rate Interactive Coding Is Impossible, Even in Constant-Degree Networks
cites work: Efficient Multiparty Interactive Coding for Insertions, Deletions, and Substitutions
cites work: Efficient Coding for Interactive Communication
cites work: Near Optimal Leader Election in Multi-Hop Radio Networks
cites work: Leader election using loneliness detection
cites work: Fundamentals of Wireless Communication
cites work: Byzantine fireflies
cites work: Global synchronization and consensus using beeps in a fault-prone multiple access channel
cites work: The Adversarial Noise Threshold for Distributed Protocols
cites work: Interactive Coding for Multiparty Protocols
cites work: Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring
cites work: Class of constructive asymptotically good algebraic codes
cites work: Broadcasting in undirected ad hoc radio networks
cites work: An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
cites work: An optimal bit complexity randomized distributed MIS algorithm
cites work: Probability and computing. Randomization and probabilistic techniques in algorithms and data analysis
cites work: A coding theorem for distributed computation
cites work: Polynomial Codes Over Certain Finite Fields
cites work: Q3250141
cites work: Erasure correction for noisy radio networks
DOI: 10.1016/J.IC.2022.104925
description: scientific article; zbMATH DE number 7629129