Danny Nguyen

Publication Activity (10 Years)

Years Active: 2016-2023
Publications (10 Years): 21

Top Topics

Computational Complexity

Quantifier Elimination

Presburger Arithmetic

Top Venues

Math. Oper. Res.

Publications

Danny Nguyen, Leo Howard, Hongxin Yan, Fuhua Lin
Adaptive Sequence Learning: Contextual Multi-armed Bandit Approach. DASC/PiCom/CBDCom/CyberSciTech (2023)
Danny Nguyen, Igor Pak
Short Presburger Arithmetic Is Hard. SIAM J. Comput. 51 (2) (2022)
Philipp Hieronymi, Danny Nguyen, Igor Pak
Presburger Arithmetic with algebraic scalar multiplications. Log. Methods Comput. Sci. 17 (3) (2021)
Danny Nguyen, Igor Pak
On the Number of Integer Points in Translated and Expanded Polyhedra. Discret. Comput. Geom. 65 (2) (2021)
Danny Nguyen, Igor Pak
The Computational Complexity of Integer Programming with Alternations. Math. Oper. Res. 45 (1) (2020)
Danny Nguyen, Igor Pak
VC-Dimensions of Short Presburger Formulas. Comb. 39 (4) (2019)
Tristram Bogart, John Goodrick, Danny Nguyen, Kevin Woods
Parametric Presburger arithmetic: complexity of counting and quantifier elimination. Math. Log. Q. 65 (2) (2019)
Danny Nguyen, Igor Pak
On the number of integer points in translated and expanded polyhedra. CoRR (2018)
Tristram Bogart, John Goodrick, Danny Nguyen, Kevin Woods
Parametric Presburger Arithmetic: Complexity of Counting and Quantifier Elimination. CoRR (2018)
Philipp Hieronymi, Danny Nguyen, Igor Pak
Presburger Arithmetic with algebraic scalar multiplications. CoRR (2018)
Danny Nguyen, Igor Pak
Enumerating Projections of Integer Points in Unbounded Polyhedra. SIAM J. Discret. Math. 32 (2) (2018)
Danny Nguyen, Igor Pak
Short Presburger Arithmetic Is Hard. FOCS (2017)
Danny Nguyen, Igor Pak
Complexity of short Presburger arithmetic. CoRR (2017)
Danny Nguyen, Igor Pak
The computational complexity of integer programming with alternations. CoRR (2017)
Danny Nguyen, Igor Pak
Enumeration of Integer Points in Projections of Unbounded Polyhedra. IPCO (2017)
Danny Nguyen, Igor Pak
VC-dimension of short Presburger formulas. CoRR (2017)
Danny Nguyen, Igor Pak
Short Presburger arithmetic is hard. CoRR (2017)
Danny Nguyen, Igor Pak
Complexity of short generating functions. CoRR (2017)
Danny Nguyen, Igor Pak
The Computational Complexity of Integer Programming with Alternations. Computational Complexity Conference (2017)
Danny Nguyen, Igor Pak
Complexity of short Presburger arithmetic. STOC (2017)
Danny Nguyen, Igor Pak
Enumeration of integer points in projections of unbounded polyhedra. CoRR (2016)