Generalized framework for group testing: queries, feedbacks and adversaries

DOI10.1016/J.TCS.2022.03.026OpenAlexW3217500917MaRDI QIDQ2136279FDOQ2136279

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

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

zbMATH Keywords

randomized algorithmslower boundgroup testingdeterministic algorithmsqueriesadversariesfeedback functionsnon-adaptive algorithms

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

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

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)