Lecturer
PhD. Dao Duc Tu completed his undergraduate degree in Applied Mathematics at Nanyang Technological University, Singapore in 2017. He will continue to complete his PhD in Applied Mathematics at Nanyang Technological University, Singapore in 2023.
PhD. Dao Duc Tu completed his undergraduate program in Applied Mathematics at Nanyang Technological University, Singapore, in 2017. He went on to earn his PhD in Applied Mathematics from Nanyang Technological University, Singapore, in 2023.
STT | Tên bài báo | Nhà xuất bản | Năm |
---|---|---|---|
1 | Noise-tolerant codebooks for semi-quantitative group testing: Application to spatial genomics | 2024 IEEE International Symposium on Information Theory (ISIT), 3023-3028, 2024 | 2024 |
2 | Efficient Encoding of Binary Constant-Weight Codes: Variable-Length Balancing Schemes à la Knuth | IEEE Transactions on Information Theory, 2024 | 2024 |
3 | On the design of codes for DNA computing: Secondary structure avoidance codes | 2023 IEEE International Symposium on Information Theory (ISIT), 573-578, 2023 | 2023 |
4 | Evaluation of the Gilbert–Varshamov bound using multivariate analytic combinatorics | 2023 IEEE International Symposium on Information Theory (ISIT), 2458-2463, 2023 | 2023 |
5 | Run length limited de Bruijn sequences for quantum communications | 2022 IEEE International Symposium on Information Theory (ISIT), 264-269, 2022 | 2022 |
6 | Regular multiset combinatorial batch codes over vector spaces | 2021 IEEE International Symposium on Information Theory (ISIT), 3133-3138, 2021 | 2021 |
7 | Robust positioning patterns with low redundancy | SIAM Journal on Computing 49 (2), 284-317, 2020 | 2020 |
8 | Maximum length of robust positioning sequences | 2020 IEEE International Symposium on Information Theory (ISIT), 108-113, 2020 | 2020 |
9 | Binary robust positioning patterns with low redundancy and efficient locating algorithms | Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 2019 |