Near-Optimal Sparsity-Constrained Group Testing: Improved Bounds and Algorithms-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Near-Optimal Sparsity-Constrained Group Testing: Improved Bounds and Algorithms

Published:2022-05 Issue:5 Volume:68 Page:3253-3280
ISSN:0018-9448
Container-title:IEEE Transactions on Information Theory
language:
Short-container-title:IEEE Trans. Inform. Theory

Author:

Gebhard Oliver¹^ORCID,Hahn-Klimroth Max¹^ORCID,Parczyk Olaf²^ORCID,Penschuck Manuel³,Rolvien Maurice¹,Scarlett Jonathan⁴^ORCID,Tan Nelvin⁵^ORCID

Affiliation:

1. Faculty of Computer Science, Technical University Dortmund, Dortmund, Germany

2. Department of Mathematics and Computer Science, FU Berlin, Berlin, Germany

3. Institute of Computer Science, Goethe University Frankfurt, Frankfurt, Germany

4. Department of Computer Science, National University of Singapore, Singapore

5. Department of Engineering, University of Cambridge, Cambridge, U.K.

Funder

German Research Council

Stiftung Polytechnische Gesellschaft

DFG

London School of Economics and Political Science

National University of Singapore (NUS) Early Career Research Award

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Subject

Library and Information Sciences,Computer Science Applications,Information Systems

Link

http://xplorestaging.ieee.org/ielx7/18/9760494/09673739.pdf?arnumber=9673739

Reference44 articles.

1. COMPETITIVE GROUP TESTING AND LEARNING HIDDEN VERTEX COVERS WITH MINIMUM ADAPTIVITY

2. A Method for Detecting all Defective Members in a Population by Group Testing

3. On the optimality of some group testing algorithms

4. Statistical physics of inference: thresholds and algorithms

5. Improved group testing rates with constant column weight designs

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Improved Bounds For Efficiently Decodable Probabilistic Group Testing With Unreliable Items;2023 IEEE Information Theory Workshop (ITW);2023-04-23

2. Performance Bounds for Group Testing With Doubly-Regular Designs;IEEE Transactions on Information Theory;2023-02

3. Fast splitting algorithms for sparsity-constrained and noisy group testing;Information and Inference: A Journal of the IMA;2023-01-07

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3