PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Improved distributed algorithms for coloring and network decomposition problems
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Locality in distributed graph algorithms
SIAM Journal on Computing
On the complexity of distributed network decomposition
Journal of Algorithms
On extracting randomness from weak random sources (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Extracting all the randomness and reducing the error in Trevisan's extractors
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
On recycling the randomness of states in space bounded computation
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Deterministic broadcasting in unknown radio networks
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
The wakeup problem in synchronous broadcast systems (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Fast distributed graph coloring with O(&Dgr;) colors
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Loss-less condensers, unbalanced expanders, and extractors
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Splitters and near-optimal derandomization
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Fast broadcasting and gossiping in radio networks
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Pseudorandom generators in propositional proof complexity
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
On adaptive deterministic gossiping in ad hoc radio networks
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
On adaptive deterministic gossiping in ad hoc radio networks
Information Processing Letters
Gossiping with Bounded Size Messages in ad hoc Radio Networks
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Faster Deterministic Broadcasting in Ad Hoc Radio Networks
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
On Randomized Broadcasting and Gossiping in Radio Networks
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Deterministic Communication in Radio Networks with Large Labels
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Distributed broadcast in radio networks of unknown topology
Theoretical Computer Science
The wake-up problem in multi-hop radio networks
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A better wake-up in radio networks
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Improved schedule for radio broadcast
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On selection problem in radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
A mobility-management mechanism for broadcasting in unknown mobile ad hoc networks
PE-WASUN '05 Proceedings of the 2nd ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Deterministic Broadcast and Gossiping Algorithms for Ad hoc Networks
The Journal of Supercomputing
Adversarial queuing on the multiple-access channel
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Broadcasting algorithms in radio networks with unknown topology
Journal of Algorithms
An improved algorithm for radio broadcast
ACM Transactions on Algorithms (TALG)
Centralized asynchronous broadcast in radio networks
Theoretical Computer Science
Time efficient centralized gossiping in radio networks
Theoretical Computer Science
A deterministic sub-linear time sparse fourier algorithm via non-adaptive compressed sensing methods
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Distributed broadcast in unknown radio networks
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Minimum-latency gossiping in multi-hop wireless networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Fast deterministic broadcast and gossiping algorithms for mobile ad hoc networks
Journal of Parallel and Distributed Computing
Centralized Communication in Radio Networks with Strong Interference
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
Faster multi-witnesses for Boolean matrix multiplication
Information Processing Letters
Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
The wireless synchronization problem
Proceedings of the 28th ACM symposium on Principles of distributed computing
Generalized framework for selectors with applications in optimal group testing
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Deterministic communication in the weak sensor model
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Time-efficient broadcasting in radio networks: a review
ICDCIT'07 Proceedings of the 4th international conference on Distributed computing and internet technology
Noise-resilient group testing: limitations and constructions
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Consensus and mutual exclusion in a multiple access channel
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Contention resolution in multiple-access channels: k-selection in radio networks
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
ACM Transactions on Algorithms (TALG)
Deterministic recurrent communication and synchronization in restricted sensor networks
ALGOSENSORS'10 Proceedings of the 6th international conference on Algorithms for sensor systems, wireless adhoc networks, and autonomous mobile entities
Distributed Broadcast in Unknown Radio Networks
SIAM Journal on Computing
Efficiently decodable error-correcting list disjunct matrices and applications
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Adversarial Queuing on the Multiple Access Channel
ACM Transactions on Algorithms (TALG)
Unbounded contention resolution in multiple-access channels
DISC'11 Proceedings of the 25th international conference on Distributed computing
On many-to-many communication in packet radio networks
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Combinatorial algorithms for compressed sensing
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Broadcast and gossiping algorithms for mobile ad hoc networks based on breadth-first traversal
IWDC'04 Proceedings of the 6th international conference on Distributed Computing
On the wake-up problem in radio networks
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Deterministic recurrent communication in restricted Sensor Networks
Theoretical Computer Science
Almost optimal explicit selectors
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
On efficient gossiping in radio networks
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Sketching in Adversarial Environments
SIAM Journal on Computing
Dynamic contention resolution in multiple-access channels
WWIC'12 Proceedings of the 10th international conference on Wired/Wireless Internet Communication
Noise-resilient group testing: Limitations and constructions
Discrete Applied Mathematics
Optimal gossiping in directed geometric radio networks in presence of dynamical faults
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
DISC'07 Proceedings of the 21st international conference on Distributed Computing
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Oblivious k-shot broadcasting in ad hoc radio networks
CATS '11 Proceedings of the Seventeenth Computing: The Australasian Theory Symposium - Volume 119
Oblivious k-shot broadcasting in ad hoc radio networks
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
| Hi-index | 0.00 |
In this paper we present explicit constructions of several combinatorial objects: selectors [CGR00] and selective families [CGGPR00], pseudo-random generators for proof systems [ABRW00] and fixed waking schedules [GPP00]. As a result, we obtain almost optimal deterministic protocols for broadcasting in unknown directed radio networks [CGR00] and wake-up problem [GPP00]. We also show application of selectors (and its variants) to explicit construction of test sets for coin-weighting problems [DH00]. The parameters of our constructions come close to the best known non-constructive bounds. The constructions are achieved using a common technique, which could be of use for other problems.