default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDanny Nguyen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c5]Danny Nguyen, Leo Howard, Hongxin Yan, Fuhua Lin:
Adaptive Sequence Learning: Contextual Multi-armed Bandit Approach. DASC/PiCom/CBDCom/CyberSciTech 2023: 751-756- 2022
- [j7]Danny Nguyen
, Igor Pak:
Short Presburger Arithmetic Is Hard. SIAM J. Comput. 51(2): 1-31 (2022) - 2021
- [j6]Danny Nguyen, Igor Pak:
On the Number of Integer Points in Translated and Expanded Polyhedra. Discret. Comput. Geom. 65(2): 405-424 (2021) - [j5]Philipp Hieronymi, Danny Nguyen, Igor Pak:
Presburger Arithmetic with algebraic scalar multiplications. Log. Methods Comput. Sci. 17(3) (2021) - 2020
- [j4]Danny Nguyen, Igor Pak:
The Computational Complexity of Integer Programming with Alternations. Math. Oper. Res. 45(1): 191-204 (2020)
2010 – 2019
- 2019
- [j3]Danny Nguyen, Igor Pak:
VC-Dimensions of Short Presburger Formulas. Comb. 39(4): 923-932 (2019) - [j2]Tristram Bogart, John Goodrick, Danny Nguyen, Kevin Woods:
Parametric Presburger arithmetic: complexity of counting and quantifier elimination. Math. Log. Q. 65(2): 237-250 (2019) - 2018
- [j1]Danny Nguyen, Igor Pak:
Enumerating Projections of Integer Points in Unbounded Polyhedra. SIAM J. Discret. Math. 32(2): 986-1002 (2018) - [i9]Tristram Bogart, John Goodrick, Danny Nguyen, Kevin Woods:
Parametric Presburger Arithmetic: Complexity of Counting and Quantifier Elimination. CoRR abs/1802.00974 (2018) - [i8]Philipp Hieronymi, Danny Nguyen, Igor Pak:
Presburger Arithmetic with algebraic scalar multiplications. CoRR abs/1805.03624 (2018) - [i7]Danny Nguyen, Igor Pak:
On the number of integer points in translated and expanded polyhedra. CoRR abs/1805.03685 (2018) - 2017
- [c4]Danny Nguyen, Igor Pak:
The Computational Complexity of Integer Programming with Alternations. CCC 2017: 6:1-6:18 - [c3]Danny Nguyen, Igor Pak:
Short Presburger Arithmetic Is Hard. FOCS 2017: 37-48 - [c2]Danny Nguyen, Igor Pak:
Enumeration of Integer Points in Projections of Unbounded Polyhedra. IPCO 2017: 417-429 - [c1]Danny Nguyen, Igor Pak:
Complexity of short Presburger arithmetic. STOC 2017: 812-820 - [i6]Danny Nguyen, Igor Pak:
Complexity of short generating functions. CoRR abs/1702.08660 (2017) - [i5]Danny Nguyen, Igor Pak:
The computational complexity of integer programming with alternations. CoRR abs/1702.08662 (2017) - [i4]Danny Nguyen, Igor Pak:
Complexity of short Presburger arithmetic. CoRR abs/1704.00249 (2017) - [i3]Danny Nguyen, Igor Pak:
Short Presburger arithmetic is hard. CoRR abs/1708.08179 (2017) - [i2]Danny Nguyen, Igor Pak:
VC-dimension of short Presburger formulas. CoRR abs/1710.04171 (2017) - 2016
- [i1]Danny Nguyen, Igor Pak:
Enumeration of integer points in projections of unbounded polyhedra. CoRR abs/1612.08030 (2016)
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-25 05:33 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:
