On the complexity of neighbourhood learning in radio networks
type: Item
instance of: scholarly article
title: On the complexity of neighbourhood learning in radio networks
zbMATH Open document ID: 1333.68078
author: Avery Miller
published in: Theoretical Computer Science
publication date: 2015-12-11T00:00:00Z
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 6520527
zbMATH Keywords: radio networks
zbMATH Keywords: lower bounds
zbMATH Keywords: deterministic algorithms
zbMATH Keywords: neighbourhood learning task
zbMATH Keywords: set families
MaRDI profile type: Publication
full work available at URL: j.tcs.2015.04.027
OpenAlex ID: W2029877651
cites work: Q4228451
cites work: Selective families, superimposed codes, and broadcasting on unknown radio networks. (Extended abstract)
cites work: Optimal Two-Stage Algorithms for Group Testing Problems
cites work: Optimal Algorithms for Two Group Testing Problems, and New Bounds on Generalized Superimposed Codes
cites work: Q4506360
cites work: Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others
cites work: Q4745752
cites work: Q3469037
cites work: Broadcasting in UDG radio networks with unknown topology
cites work: Families of finite sets in which no set is covered by the union of \(r\) others
cites work: On local broadcasting schedules and CONGEST algorithms in the SINR model
cites work: On \(r\)-cover-free families
cites work: Deterministic communication in radio networks with large labels
cites work: The capacity of wireless networks
cites work: Distributed Backbone Structure for Algorithms in the SINR Model of Wireless Networks
cites work: Nonrandom binary superimposed codes
cites work: An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels
cites work: Time-efficient distributed layer-2 auto-configuration for cognitive radio networks
cites work: Distributed Computing: A Locality-Sensitive Approach
cites work: Explicit Nonadaptive Combinatorial Group Testing Schemes
cites work: On the upper bound of the size of the \(r\)-cover-free families
cites work: Generalized cover-free families.
cites work: Round complexity of leader election and gossiping in bidirectional radio networks
DOI: 10.1016/J.TCS.2015.04.027
description: scientific article; zbMATH DE number 6520527