Lower Bounds for Structuring Unreliable Radio Networks

DOI10.1007/978-3-662-45174-8_22zbMath1390.68508arXiv1408.0812OpenAlexW1703357547MaRDI QIDQ5498701

Calvin Newport

Publication date: 10 February 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1408.0812

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Randomized algorithms (68W20)

Related Items (1)

Smoothed analysis of dynamic networks

This page was built for publication: Lower Bounds for Structuring Unreliable Radio Networks