default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTran Thi Thu Huong
Person information
- affiliation: Institute of Mathematics, Hanoi, Vietnam
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j8]Phan-Thuan Do, Thi Thu Huong Tran
, Vincent Vajnovszki:
The equidistribution of some Mahonian statistics over permutations avoiding a pattern of length three. Discret. Math. 345(2): 112684 (2022)- [j7]Tran Thi Thu Huong, Pham Thanh Hiep:
Joint Precoder and Decoder for MIMO Dual-Hop Relay Systems in Delay Spread Channels. Wirel. Pers. Commun. 124(2): 1247-1261 (2022) - 2021
- [i4]Phan-Thuan Do, Thi Thu Huong Tran, Vincent Vajnovszki:
The equidistribution of some Mahonian statistics over permutations avoiding a pattern of length three. CoRR abs/2103.10357 (2021) - 2020
- [c3]Luong Duy Manh, Tran Thi Thu Huong, Bui Quoc Doanh, Vo Quang Son:
A 3-Stacked GaN HEMT Power Amplifier with Independently Biased Technique. INISCOM 2020: 95-104
2010 – 2019
- 2019
- [j6]Phan-Thuan Do, Thi Thu Huong Tran, Vincent Vajnovszki:
Exhaustive generation for permutations avoiding (colored) regular sets of patterns. Discret. Appl. Math. 268: 44-53 (2019) - 2018
- [j5]Hoang-Thach Nguyen, Thi Thu Huong Tran:
A maximizing characteristic for critical configurations of chip-firing games on digraphs. Discret. Appl. Math. 250: 38-46 (2018) - [i3]Phan-Thuan Do, Thi Thu Huong Tran, Vincent Vajnovszki:
Exhaustive generation for permutations avoiding a (colored) regular sets of patterns. CoRR abs/1809.00742 (2018) - 2017
- [c2]Phan-Thuan Do, Thi Thu Huong Tran, Vincent Vajnovszki:
Right-Justified Characterization for Generating Regular Pattern Avoiding Permutations. MACIS 2017: 306-319 - [i2]Hoang-Thach Nguyen, Tran Thi Thu Huong:
A maximizing characteristic for critical configurations of chip-firing games on digraphs. CoRR abs/1711.10805 (2017) - 2016
- [c1]Tran Thi Thu Huong:
G-Strongly Positive Scripts and Critical Configurations of Chip Firing Games on Digraphs. ACOMP 2016: 151-157 - 2014
- [j4]Phan-Thuan Do, Dominique Rossin, Thi Thu Huong Tran:
Permutations weakly avoiding barred patterns and combinatorial bijections to generalized Dyck and Motzkin paths. Discret. Math. 320: 40-50 (2014) - [j3]Enrico Formenti, Van Trung Pham, Thi Ha Duong Phan, Tran Thi Thu Huong:
Fixed-point forms of the parallel symmetric sandpile model. Theor. Comput. Sci. 533: 1-14 (2014) - 2013
- [j2]Robert Cori, Thi Ha Duong Phan, Tran Thi Thu Huong:
Signed Chip Firing Games and symmetric Sandpile Models on the cycles. RAIRO Theor. Informatics Appl. 47(2): 133-146 (2013) - 2011
- [i1]Enrico Formenti, Van Trung Pham, Ha Duong Phan, Tran Thi Thu Huong:
Fixed point forms of the parallel symmetric sandpile model. CoRR abs/1109.0825 (2011) - 2010
- [j1]Thi Ha Duong Phan, Tran Thi Thu Huong:
On the stability of Sand Piles Model. Theor. Comput. Sci. 411(3): 594-601 (2010)
1990 – 1999
- 1990
- [b1]Tran Thi Thu Huong:
Durchgängige Verfahrensweise zur Strukturbestimmung paketvermittelter Datennetze. Hochschule für Verkehrswesen, Dresden, Germany, 1990
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-04-24 23:12 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:
