default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHang T. Dinh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j4]Hang T. Dinh, Cristopher Moore, Alexander Russell:
Limitations of single coset states and quantum algorithms for code equivalence. Quantum Inf. Comput. 15(3&4): 260-294 (2015)- 2014
- [c6]Hang Dinh:
Inconsistency versus Accuracy of Heuristics. Canadian AI 2014: 71-82 - 2013
- [c5]Tuyen X. Tran, Nghi H. Tran, Hamid-Reza Bahrami
, Hang Dinh, Shivakumar Sastry:
On Achievable Rate and Ergodic Capacity of OAF Multiple-Relay Networks with CSI. VTC Spring 2013: 1-6 - [i4]Hang T. Dinh, Hieu T. Dinh:
Inconsistency and Accuracy of Heuristics with A* Search. CoRR abs/1307.2200 (2013) - 2012
- [j3]Hang Dinh, Hieu T. Dinh, Laurent Michel, Alexander Russell:
The Time Complexity of A* with Approximate Heuristics on Multiple-Solution Search Spaces. J. Artif. Intell. Res. 45: 685-729 (2012) - 2011
- [c4]Hang Dinh, Cristopher Moore, Alexander Russell:
McEliece and Niederreiter Cryptosystems That Resist Quantum Fourier Sampling Attacks. CRYPTO 2011: 761-779 - [i3]Hang Dinh, Cristopher Moore, Alexander Russell:
Quantum Fourier sampling, Code Equivalence, and the quantum security of the McEliece and Sidelnikov cryptosystems. CoRR abs/1111.4382 (2011) - 2010
- [j2]Hang T. Dinh, Alexander Russell:
Quantum and randomized lower bounds for local search on vertex-transitive graphs. Quantum Inf. Comput. 10(7&8): 636-652 (2010) - [i2]Hang Dinh, Cristopher Moore, Alexander Russell:
The McEliece Cryptosystem Resists Quantum Fourier Sampling Attacks. CoRR abs/1008.2390 (2010)
2000 – 2009
- 2008
- [j1]Eugene Santos Jr., Hang T. Dinh:
On automatic knowledge validation for Bayesian knowledge bases. Data Knowl. Eng. 64(1): 218-241 (2008) - [c3]Hang Dinh, Alexander Russell:
Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs. APPROX-RANDOM 2008: 385-401 - [i1]Hang Dinh, Alexander Russell:
Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs. CoRR abs/0806.3437 (2008) - 2007
- [c2]Hang T. Dinh, Alexander Russell, Yuan Su:
On the Value of Good Advice: The Complexity of A* Search with Accurate Heuristics. AAAI 2007: 1140-1145 - 2004
- [c1]Eugene Santos Jr., Hang T. Dinh:
Consistency of Test Cases in Validation of Bayesian Knowledge-Bases. ICTAI 2004: 468-475
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:05 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:
