scientific article; zbMATH DE number 2119730

zbMath1093.68540MaRDI QIDQ4829004

Piotr Indyk

Publication date: 29 November 2004

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

fixed waking schedulespseudo-random generators for proof systems

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (26)

Performing work in broadcast networks ⋮ Exact learning from an honest teacher that answers membership queries ⋮ Centralized asynchronous broadcast in radio networks ⋮ Time efficient centralized gossiping in radio networks ⋮ Unbounded contention resolution in multiple-access channels ⋮ Leader election in ad hoc radio networks: a keen ear helps ⋮ Deterministic non-adaptive contention resolution on a shared channel ⋮ Distributed broadcast in radio networks of unknown topology. ⋮ Restrained medium access control on adversarial shared channels ⋮ New combinatorial structures with applications to efficient group testing with inhibitors ⋮ Centralized Communication in Radio Networks with Strong Interference ⋮ Deterministic Communication in Radio Networks ⋮ Fast deterministic broadcast and gossiping algorithms for mobile ad hoc networks ⋮ Coordination Problems in Ad Hoc Radio Networks ⋮ Efficiently Decodable Error-Correcting List Disjunct Matrices and Applications ⋮ Energy-efficient broadcasting in ad hoc wireless networks ⋮ Combinatorial sublinear-time Fourier algorithms ⋮ Faster multi-witnesses for Boolean matrix multiplication ⋮ Unnamed Item ⋮ Many-to-many communication in radio networks ⋮ Unbounded Contention Resolution in Multiple-Access Channels ⋮ Deterministic recurrent communication in restricted sensor networks ⋮ 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 ⋮ On adaptive deterministic gossiping in ad hoc radio networks.

This page was built for publication: