Generalized framework for group testing: queries, feedbacks and adversaries

DOI10.1016/J.TCS.2022.03.026MaRDI QIDQ2136279OpenAlexFDO

Authors Marek Klonowski, Dariusz R. Kowalski, Dominik Pajak

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

randomized algorithmslower boundgroup testingdeterministic algorithmsqueriesadversariesfeedback functionsnon-adaptive algorithms

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Randomized group testing both query-optimal and minimal adaptive
• scientific article; zbMATH DE number 2038701
• Group testing: an information theory perspective
• Subquadratic non-adaptive threshold group testing
• Threshold Group Testing

Cites work

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2136279)