VTC circ: A Second-Order Theory for TCcirc. - Phuong Nguyen 001; Stephen A. Cook (LICS, 2004)

Theories for TC0 and Other Small Complexity Classes. - Phuong Nguyen 001; Stephen A. Cook (Log. Methods Comput. Sci., 2006)

Proving Infinitude of Prime Numbers Using Binomial Coefficients. - Phuong Nguyen 001 (CSL, 2008)

Bounded reverse mathematics. - Phuong Nguyen 001 (2008)

The equivalence of theories that characterize ALogTime. - Phuong Nguyen 001 (Arch. Math. Log., 2009)

Computationally Limited Randomness. - Matei David; Phuong Nguyen 001; Periklis A. Papakonstantinou; Anastasios Sidiropoulos (ICS, 2011)

The provably total NP search problems of weak second order bounded arithmetic. - Leszek Aleksander Kolodziejczyk; Phuong Nguyen 001; Neil Thapen (Ann. Pure Appl. Log., 2011)

Simulating non-prenex cuts in quantified propositional calculus. - Emil Jerábek; Phuong Nguyen 001 (Math. Log. Q., 2011)

The Complexity of Proving the Discrete Jordan Curve Theorem. - Phuong Nguyen 001; Stephen A. Cook (ACM Trans. Comput. Log., 2012)

Lifting lower bounds for tree-like proofs. - Alexis Maciel; Phuong Nguyen 001; Toniann Pitassi (Comput. Complex., 2014)

The NOF Multiparty Communication Complexity of Composed Functions. - Anil Ada; Arkadev Chattopadhyay; Omar Fawzi; Phuong Nguyen 001 (Comput. Complex., 2015)

Relativizing small complexity classes and their theories. - Klaus Aehlig; Stephen A. Cook; Phuong Nguyen 001 (Comput. Complex., 2016)