| Near-optimal sparsity-constrained group testing: Improved bounds and algorithms O Gebhard, M Hahn-Klimroth, O Parczyk, M Penschuck, M Rolvien, ... IEEE Transactions on Information Theory 68 (5), 3253-3280, 2022 | 9 | 2022 |
| Near-optimal sparse adaptive group testing N Tan, J Scarlett 2020 IEEE International Symposium on Information Theory (ISIT), 1420-1425, 2020 | 6 | 2020 |
| Fast splitting algorithms for sparsity-constrained and noisy group testing E Price, J Scarlett, N Tan arXiv preprint arXiv:2106.00308, 2021 | 2 | 2021 |
| Performance bounds for group testing with doubly-regular designs N Tan, W Tan, J Scarlett IEEE Transactions on Information Theory, 2022 | 1 | 2022 |
| An analysis of the DD algorithm for group testing with size-constrained tests N Tan, J Scarlett 2021 IEEE International Symposium on Information Theory (ISIT), 1967-1972, 2021 | 1 | 2021 |
| Improved Bounds and Algorithms for Sparsity-Constrained Group Testing N Tan, J Scarlett arXiv preprint arXiv:2004.03119, 2020 | | 2020 |
Jonathan ScarlettAssistant Professor, Computer Science and Mathematics, National University of SingaporeVerified email at comp.nus.edu.sg
