scientific article; zbMATH DE number 1962806
From MaRDI portal
Publication:4418641
zbMath1036.90507MaRDI QIDQ4418641
Andrzej Pelc, Dariusz R. Kowalski
Publication date: 11 August 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2607/26070109.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Communication networks in operations research (90B18)
Related Items (7)
Fast deterministic broadcast and gossiping algorithms for mobile ad hoc networks ⋮ Modeling radio networks ⋮ The abstract MAC layer ⋮ Improved lower bound for deterministic broadcasting in radio networks ⋮ Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism ⋮ Near-optimal radio use for wireless network synchronization ⋮ Efficient \(k\)-shot broadcasting in radio networks
This page was built for publication:
