default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDuc Tu Dao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j2]Duc Tu Dao, Han Mao Kiah
, Tuan Thanh Nguyen:
Efficient Encoding of Binary Constant-Weight Codes: Variable-Length Balancing Schemes à La Knuth. IEEE Trans. Inf. Theory 70(7): 4731-4746 (2024)- [c8]Kok Hao Chen, Duc Tu Dao, Han Mao Kiah, Van Long Phuoc Pham, Eitan Yaakobi:
Noise-Tolerant Codebooks for Semi-Quantitative Group Testing: Application to Spatial Genomics. ISIT 2024: 3023-3028 - [i5]Keshav Goyal, Duc Tu Dao, Mladen Kovacevic, Han Mao Kiah:
Gilbert-Varshamov Bound for Codes in L1 Metric using Multivariate Analytic Combinatorics. CoRR abs/2402.14712 (2024) - [i4]Kok Hao Chen, Duc Tu Dao, Han Mao Kiah, Van Long Phuoc Pham, Eitan Yaakobi:
Noise-Tolerant Codebooks for Semi-Quantitative Group Testing: Application to Spatial Genomics. CoRR abs/2405.06870 (2024) - 2023
- [c7]Tuan Thanh Nguyen, Kui Cai, Han Mao Kiah, Duc Tu Dao, Kees A. Schouhamer Immink:
On the Design of Codes for DNA Computing: Secondary Structure Avoidance Codes. ISIT 2023: 573-578 - [c6]Keshav Goyal, Duc Tu Dao, Han Mao Kiah, Mladen Kovacevic:
Evaluation of the Gilbert-Varshamov Bound using Multivariate Analytic Combinatorics. ISIT 2023: 2458-2463 - [i3]Tuan Thanh Nguyen, Kui Cai, Han Mao Kiah, Duc Tu Dao, Kees A. Schouhamer Immink:
On the Design of Codes for DNA Computing: Secondary Structure Avoidance Codes. CoRR abs/2302.13714 (2023) - 2022
- [c5]Yeow Meng Chee, Duc Tu Dao, Long Nguyen Tien, Duy Hoang Ta, Van Khu Vu:
Run Length Limited de Bruijn Sequences for Quantum Communications. ISIT 2022: 264-269 - [c4]Duc Tu Dao, Han Mao Kiah, Tuan Thanh Nguyen:
Average Redundancy of Variable-Length Balancing Schemes à la Knuth. ISITA 2022: 99-103 - [i2]Duc Tu Dao, Han Mao Kiah, Tuan Thanh Nguyen:
Average Redundancy of Variable-Length Balancing Schemes à la Knuth. CoRR abs/2204.13831 (2022) - 2021
- [c3]Yeow Meng Chee, Duc Tu Dao, Tuvi Etzion, Han Mao Kiah, Hui Zhang:
Regular Multiset Combinatorial Batch Codes over Vector Spaces. ISIT 2021: 3133-3138 - 2020
- [j1]Yeow Meng Chee, Duc Tu Dao, Han Mao Kiah, San Ling, Hengjia Wei:
Robust Positioning Patterns with Low Redundancy. SIAM J. Comput. 49(2): 284-317 (2020) - [c2]Duc Tu Dao, Han Mao Kiah, Hengjia Wei:
Maximum Length of Robust Positioning Sequences. ISIT 2020: 108-113
2010 – 2019
- 2019
- [c1]Yeow Meng Chee, Duc Tu Dao, Han Mao Kiah, San Ling, Hengjia Wei:
Binary Robust Positioning Patterns with Low Redundancy and Efficient Locating Algorithms. SODA 2019: 2171-2184 - [i1]Yeow Meng Chee, Duc Tu Dao, Han Mao Kiah, San Ling, Hengjia Wei:
Robust Positioning Patterns with Low Redundancy. CoRR abs/1912.13301 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-17 21:34 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
