Locality in distributed graph algorithms
SIAM Journal on Computing
Deterministic restrictions in circuit complexity
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Adaptive versus nonadaptive attribute-efficient learning
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Selective families, superimposed codes, and broadcasting on unknown radio networks
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Coding Constructions for Blacklisting Problems without Computational Assumptions
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Deterministic Superimposed Coding with Applications to Pattern Matching
FOCS '97 Proceedings of the 38th 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
Optimal Two-Stage Algorithms for Group Testing Problems
SIAM Journal on Computing
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes
SIAM Journal on Computing
Explicit Non-adaptive Combinatorial Group Testing Schemes
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Data Stream Algorithms via Expander Graphs
ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation
Exact and Approximate Pattern Matching in the Streaming Model
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
IEEE Transactions on Information Theory
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Noise-resilient group testing: limitations and constructions
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Efficiently decodable non-adaptive group testing
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Combinatorial algorithms for compressed sensing
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Almost optimal explicit selectors
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Tracing Many Users With Almost No Rate Penalty
IEEE Transactions on Information Theory
Deterministic history-independent strategies for storing information on write-once memories
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
| Hi-index | 0.00 |
We introduce a new combinatorial structure: superselectors. We show that superselectors subsume several important combinatorial structures used in the past few years to solve problems in group testing, compressed sensing, multi-channel conflict resolution and data security. We prove close upper and lower bounds on the size of superselectors and we provide efficient algorithms for their constructions. Albeit our bounds are very general, when they are instantiated on the combinatorial structures that are particular cases of superselectors (e.g., (p, k, n)-selectors [15], (d, l)-list-disjunct matrices [25], MUTk(r)-families [28], FUT(k, α)- families [2], etc.) they match the best known bounds in terms of size of the structures (the relevant parameter in the applications). For appropriate values of parameters, our results also provide the first efficient deterministic algorithms for the construction of such structures.