default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPhan Trung Huy
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[j7]Nguyen Dinh Han, Ho Ngoc Vinh, Dang Quyet Thang, Phan Trung Huy:
Quadratic Algorithms for Testing of Codes and ◊-Codes. Fundam. Informaticae 130(2): 163-177 (2014)- 2013
- [j6]Phan Trung Huy
, Cheonshik Kim:
Binary Image Data Hiding Using Matrix Encoding Technique in Sensors. Int. J. Distributed Sens. Networks 9 (2013) - [j5]Phan Trung Huy, Nguyen Hai Thanh, Cheonshik Kim, Ching-Nung Yang:
Data-Hiding for Halftone Images Using an Improved CPT scheme. KSII Trans. Internet Inf. Syst. 7(2): 405-424 (2013) - [c15]Phan Trung Huy, Nguyen Hai Thanh, Le Quang Hoa, Do Van Tuan:
A New Data Hiding Scheme for Small Blocks of Twelve Pixels on Binary Images by Module Approach. ACIIDS (1) 2013: 424-434 - [c14]Nguyen Dinh Han, Dang Quyet Thang, Phan Trung Huy:
A Quadratic Algorithm for Testing of Z-Codes. ACIIDS (1) 2013: 455-464 - [c13]Phan Trung Huy, Cheonshik Kim, Nguyen Tuan Anh, Le Quang Hoa, Ching-Nung Yang:
Data Hiding Based on Palette Images Using Weak Bases of Z2-Modules. GPC 2013: 649-658 - 2012
- [c12]Phan Trung Huy, Nguyen Hai Thanh, Tran Manh Thang, Nguyen Tien Dat:
On Fastest Optimal Parity Assignments in Palette Images. ACIIDS (2) 2012: 234-244 - [c11]Nguyen Dinh Han, Phan Trung Huy, Dang Quyet Thang:
A Quadratic Algorithm for Testing of Omega-Codes. ACIIDS (1) 2012: 338-347 - [c10]Bui Vu Anh, Phan Trung Huy:
An Algebraic Structure for Duration Automata. ICCCI (2) 2012: 413-422 - [c9]Nguyen Dinh Han, Ho Ngoc Vinh, Phan Trung Huy:
An Extension of Codes by Unambiguity of Languages. IIH-MSP 2012: 490-493 - [c8]Phan Trung Huy, Nguyen Hai Thanh, Cheonsick Kim:
Relationship between Correcting Code and Module Technique in Hiding Secret Data. NPC 2012: 297-307 - [c7]Dang Quyet Thang, Nguyen Dinh Han, Phan Trung Huy:
Algorithms Based on Finite Automata for Testing of Z-codes. NPC 2012: 625-635 - [c6]Nguyen Dinh Han, Ho Ngoc Vinh, Dang Quyet Thang, Phan Trung Huy:
Algorithms for Testing of Codes and Lozenge-Codes. RIVF 2012: 1-6 - 2011
- [c5]Phan Trung Huy, Nguyen Hai Thanh:
On the Maximality of Secret Data Ratio in CPTE Schemes. ACIIDS (1) 2011: 88-99 - 2010
- [c4]Nguyen Hai Thanh, Phan Trung Huy:
Fast and Near Optimal Parity Assignment in Palette Images with Enhanced CPT Scheme. ACIIDS (2) 2010: 450-459 - [c3]Ho Ngoc Vinh, Vu Thanh Nam, Phan Trung Huy:
Codes Base on Unambiguous Products. ICCCI (3) 2010: 252-262 - [c2]Dang Quyet Thang, Phan Trung Huy:
Determining Restricted Damerau-Levenshtein Edit-Distance of Two Languages by Extended Automata. RIVF 2010: 1-6
2000 – 2009
- 2005
- [c1]Do Long Van, Kieu Van Hung, Phan Trung Huy:
Codes and Length-Increasing Transitive Binary Relations. ICTAC 2005: 29-48
1990 – 1999
- 1999
- [j4]Phan Trung Huy, Nguyen Huong Lam:
Unavoidable set: extension and reduction. RAIRO Theor. Informatics Appl. 33(3): 213-226 (1999) - 1993
- [j3]Do Long Van, Nguyen Huong Lam, Phan Trung Huy:
On Codes of Bi-Infinite Words. Acta Cybern. 11(1-2): 97-109 (1993) - 1992
- [j2]Phan Trung Huy, Igor Livotsky, Do Long Van:
Which Finite Monoids are Syntactic Monoids of Rational omega-Languages. Inf. Process. Lett. 42(3): 127-132 (1992) - [j1]Do Long Van, Phan Trung Huy:
Varieties of Finite Monoids and Buchi-McNaughton Theorem. Theor. Comput. Sci. 98(2): 321-337 (1992)
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 2025-01-09 13:01 CET 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:
