| 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 | 12 | 2022 |
| Near-optimal sparse adaptive group testing N Tan, J Scarlett 2020 IEEE International Symposium on Information Theory (ISIT), 1420-1425, 2020 | 8 | 2020 |
| Fast splitting algorithms for sparsity-constrained and noisy group testing E Price, J Scarlett, N Tan Information and Inference: A Journal of the IMA 12 (2), 1141-1171, 2023 | 4 | 2023 |
| Performance bounds for group testing with doubly-regular designs N Tan, W Tan, J Scarlett IEEE Transactions on Information Theory 69 (2), 1224-1243, 2022 | 4 | 2022 |
| Mixed regression via approximate message passing N Tan, R Venkataramanan Journal of Machine Learning Research 24 (317), 1-44, 2023 | 3 | 2023 |
| Approximate message passing with rigorous guarantees for pooled data and quantitative group testing N Tan, J Scarlett, R Venkataramanan arXiv preprint arXiv:2309.15507, 2023 | 2 | 2023 |
| 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 | 2 | 2021 |
| Mixed linear regression via approximate message passing N Tan, R Venkataramanan International Conference on Artificial Intelligence and Statistics, 2116-2131, 2023 | 1 | 2023 |
| Improved bounds and algorithms for sparsity-constrained group testing N Tan, J Scarlett arXiv preprint arXiv:2004.03119, 2020 | 1 | 2020 |
| Quantitative Group Testing and Pooled Data with Sublinear Number of Tests N Tan, PP Cobo, R Venkataramanan International Zurich Seminar on Information and Communication (IZS 2024), 13, 2024 | | 2024 |
Jonathan ScarlettAssociate Professor, Computer Science and Mathematics, National University of SingaporeVerified email at comp.nus.edu.sg
