Generalized framework for group testing: queries, feedbacks and adversaries

DOI10.1016/j.tcs.2022.03.026OpenAlexW3217500917MaRDI QIDQ2136279

Dariusz R. Kowalski, Dominik Pająk, Marek Klonowski

Publication date: 10 May 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2112.01340

zbMATH Keywords

deterministic algorithmslower boundrandomized algorithmsgroup testingqueriesadversariesfeedback functionsnon-adaptive algorithms

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounded-contention coding for the additive network model
• Pattern matching with don't cares and few errors
• Optimal query complexity bounds for finding graphs
• Families of finite sets in which no set is covered by the union of \(r\) others
• On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
• Optimal static and self-adjusting parameter choices for the \((1+(\lambda ,\lambda ))\) genetic algorithm
• Group Testing Algorithms: Bounds and Simulations
• Tree algorithms for packet broadcast channels
• Threshold Group Testing
• Combinatorial Algorithms for Compressed Sensing
• Born again group testing: Multiaccess communications
• A perspective on multiaccess channels
• A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels
• Estimating the multiplicities of conflicts to speed their resolution in multiple access channels
• $\epsilon $ -Almost Selectors and Their Applications to Multiple-Access Communication
• Performance of Group Testing Algorithms With Near-Constant Tests Per Item
• Sublinear-Time Non-Adaptive Group Testing With O(k log n) Tests via Bit-Mixing Coding
• Sparse Combinatorial Group Testing
• Noisy Non-Adaptive Group Testing: A (Near-)Definite Defectives Approach
• Information-Theoretic and Algorithmic Thresholds for Group Testing
• An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels
• Group Testing: An Information Theory Perspective
• Individual Testing Is Optimal for Nonadaptive Group Testing in the Linear Regime
• Nonrandom binary superimposed codes
• Introduction to Coding Theory
• Optimal reconstruction of graphs under the additive model
• Optimal channel utilization with limited feedback
• Subquadratic non-adaptive threshold group testing

This page was built for publication: Generalized framework for group testing: queries, feedbacks and adversaries