Fundamentals of Computation Theory

DOI10.1007/11537311zbMath1122.68477OpenAlexW2491671784MaRDI QIDQ5492934

Bogdan S. Chlebus, Dariusz R. Kowalski

Publication date: 20 October 2006

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

Full work available at URL: https://doi.org/10.1007/11537311

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Combinatorics in computer science (68R05) Network protocols (68M12)

Related Items (15)

Distributed bare-bones communication in wireless networks ⋮ Pattern matching with don't cares and few errors ⋮ Restrained medium access control on adversarial shared channels ⋮ Centralized Communication in Radio Networks with Strong Interference ⋮ Deterministic Communication in Radio Networks ⋮ Deterministic \(k\)-set structure ⋮ Unnamed Item ⋮ A new kind of selectors and their applications to conflict resolution in wireless multichannels networks ⋮ Subquadratic non-adaptive threshold group testing ⋮ Low-weight superimposed codes and related combinatorial structures: bounds and applications ⋮ Separable collusion-secure multimedia codes ⋮ Time-Efficient Broadcast in Radio Networks ⋮ On Efficient Gossiping in Radio Networks ⋮ Fast Nonadaptive Deterministic Algorithm for Conflict Resolution in a Dynamic Multiple-Access Channel ⋮ New selectors and locally thin families with applications to multi-access channels supporting simultaneous transmissions

This page was built for publication: Fundamentals of Computation Theory