Enumeration of Integer Points in Projections of Unbounded Polyhedra. - Danny Nguyen; Igor Pak (IPCO, 2017)

Complexity of short Presburger arithmetic. - Danny Nguyen; Igor Pak (STOC, 2017)

Complexity of short generating functions. - Danny Nguyen; Igor Pak (CoRR, 2017)

VC-dimension of short Presburger formulas. - Danny Nguyen; Igor Pak (CoRR, 2017)

Enumerating Projections of Integer Points in Unbounded Polyhedra. - Danny Nguyen; Igor Pak (SIAM J. Discret. Math., 2018)

VC-Dimensions of Short Presburger Formulas. - Danny Nguyen; Igor Pak (Comb., 2019)

Parametric Presburger arithmetic: complexity of counting and quantifier elimination. - Tristram Bogart; John Goodrick; Danny Nguyen; Kevin Woods (Math. Log. Q., 2019)

The Computational Complexity of Integer Programming with Alternations. - Danny Nguyen; Igor Pak (Math. Oper. Res., 2020)

On the Number of Integer Points in Translated and Expanded Polyhedra. - Danny Nguyen; Igor Pak (Discret. Comput. Geom., 2021)

Presburger Arithmetic with algebraic scalar multiplications. - Philipp Hieronymi; Danny Nguyen; Igor Pak (Log. Methods Comput. Sci., 2021)

Short Presburger Arithmetic Is Hard. - Danny Nguyen; Igor Pak (SIAM J. Comput., 2022)

Adaptive Sequence Learning: Contextual Multi-armed Bandit Approach. - Danny Nguyen; Leo Howard; Hongxin Yan; Fuhua Lin 001 (DASC/PiCom/CBDCom/CyberSciTech, 2023)