Faster broadcasting in unknown radio networks
type: Item
instance of: scholarly article
title: Faster broadcasting in unknown radio networks
zbMATH Open document ID: 0998.68222
DOI: 10.1016/S0020-0190(00)00178-2
published in: Information Processing Letters
publication date: 2002-07-14T00:00:00Z
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 68M10
zbMATH DE Number: 1767322
zbMATH Keywords: algorithms
zbMATH Keywords: broadcasting
zbMATH Keywords: radio network
zbMATH Keywords: selective family
author: Gianluca De Marco
author: Andrzej Pelc
MaRDI profile type: Publication
cites work: A lower bound for radio broadcast
cites work: On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
cites work: Multiple Communication in Multihop Radio Networks
cites work: Lower bounds for the broadcast problem in mobile radio networks
cites work: On Broadcasting in Radio Networks--Problem Analysis and Protocol Design
cites work: Q4952711
cites work: Q2754190
cites work: Fast broadcasting and gossiping in radio networks
cites work: Q4857782
cites work: Families of finite sets in which no set is covered by the union of \(r\) others
cites work: Q4886093
cites work: A perspective on multiaccess channels
cites work: Q3780312
cites work: An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
cites work: Deterministic Sampling–A New Technique for Fast Pattern Matching
full work available at URL: s0020-0190(00)00178-2
OpenAlex ID: W2021893324
description: scientific article; zbMATH DE number 1767322