$$\epsilon $$-Almost Selectors and Their Applications
From MaRDI portal
Publication:2947885
DOI10.1007/978-3-319-22177-9_20zbMath1436.94006MaRDI QIDQ2947885
Annalisa De Bonis, Ugo Vaccaro
Publication date: 29 September 2015
Published in: Fundamentals of Computation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-22177-9_20
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
94A05: Communication theory
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A robust randomized algorithm to perform independent tasks
- Families of finite sets in which no set is covered by the union of \(r\) others
- On the ratio of optimal integral and fractional covers
- Locally Thin Set Families
- Efficient Distributed Communication in Ad-Hoc Radio Networks
- Fast broadcasting and gossiping in radio networks
- Single-User Tracing and Disjointly Superimposed Codes
- On Almost Disjunct Matrices for Group Testing
- On selection problem in radio networks
- An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels
- Explicit Nonadaptive Combinatorial Group Testing Schemes
- Optimal Two-Stage Algorithms for Group Testing Problems
- Nonrandom binary superimposed codes