Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism
type: Item
instance of: scholarly article
title: Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism
zbMATH Open document ID: 1070.68009
author: Dariusz R. Kowalski
author: Andrzej Pelc
published in: Theoretical Computer Science
publication date: 2005-04-06T00:00:00Z
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W20
zbMATH DE Number: 2153171
zbMATH Keywords: Radio broadcasting
zbMATH Keywords: Adaptiveness
zbMATH Keywords: Randomization
MaRDI profile type: Publication
full work available at URL: j.tcs.2004.04.017
OpenAlex ID: W1973843421
cites work: A lower bound for radio broadcast
cites work: A new distributed depth-first-search algorithm
cites work: On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
cites work: Lower bounds for the broadcast problem in mobile radio networks
cites work: Deterministic broadcasting in ad hoc radio networks
cites work: Q2754190
cites work: Selective families, superimposed codes, and broadcasting on unknown radio networks. (Extended abstract)
cites work: Q4796195
cites work: Faster broadcasting in unknown radio networks
cites work: Families of finite sets in which no set is covered by the union of \(r\) others
cites work: Q4886093
cites work: Nonrandom binary superimposed codes
cites work: Q4418641
cites work: Broadcasting in undirected ad hoc radio networks
cites work: An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
DOI: 10.1016/J.TCS.2004.04.017
description: scientific article; zbMATH DE number 2153171