Group Testing Algorithms: Bounds and Simulations

Aldridge, M orcid.org/0000-0002-9347-1586, Baldassini, L and Johnson, O (2014) Group Testing Algorithms: Bounds and Simulations. IEEE Transactions on Information Theory, 60 (6). pp. 3671-3687. ISSN 0018-9448

Abstract

Metadata

Authors/Creators:
Copyright, Publisher and Additional Information: © 2014, IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Keywords: Algorithm design and analysis; group testing; sparse models
Dates:
  • Published: June 2014
  • Accepted: 5 March 2014
  • Published (online): 31 March 2014
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Maths and Physical Sciences (Leeds) > School of Mathematics (Leeds) > Statistics (Leeds)
Depositing User: Symplectic Publications
Date Deposited: 26 Jun 2019 13:42
Last Modified: 27 Jun 2019 21:34
Status: Published
Publisher: IEEE
Identification Number: https://doi.org/10.1109/TIT.2014.2314472
Related URLs:

Share / Export

Statistics