Travelled to:1 × Austria
1 × Finland
1 × Poland
1 × Switzerland
1 × United Kingdom
2 × Italy
2 × USA
Collaborated with:S.A.Cook ∅ B.Benatallah K.Aehlig O.Maillard R.Ortner D.Ryabko A.Ada A.Chattopadhyay O.Fawzi L.Zeng A.H.H.Ngu M.Mahdavi Q.Z.Sheng L.Port B.McIver C.Wang M.Danilevsky N.Desai Y.Zhang T.Taula J.Han
Talks about:complex (3) theori (2) system (2) prove (2) manag (2) like (2) multiparti (1) represent (1) infinitud (1) hierarchi (1)
Person: Phuong Nguyen
DBLP: Nguyen:Phuong
Contributed to:
2013
2013
2012
20082007
20072004
2003
2001Wrote 10 papers:
- ICML-c1-2013-MaillardNOR #bound #learning #representation
- Optimal Regret Bounds for Selecting the State Representation in Reinforcement Learning (OAM, PN, RO, DR), pp. 543–551.
- KDD-2013-WangDDZNTH #framework #mining #recursion #topic
- A phrase mining framework for recursive construction of a topical hierarchy (CW, MD, ND, YZ, PN, TT, JH), pp. 437–445.
- ICALP-v1-2012-AdaCFN #communication #complexity #multi
- The NOF Multiparty Communication Complexity of Composed Functions (AA, AC, OF, PN), pp. 13–24.
- CSL-2008-Nguyen #proving #using
- Proving Infinitude of Prime Numbers Using Binomial Coefficients (PN), pp. 184–198.
- CSL-2007-AehligCN #complexity
- Relativizing Small Complexity Classes and Their Theories (KA, SAC, PN), pp. 374–388.
- LICS-2007-Nguyen #proving
- Separating DAG-Like and Tree-Like Proof Systems (PN), pp. 235–244.
- LICS-2007-NguyenC #complexity #proving #theorem
- The Complexity of Proving the Discrete Jordan Curve Theorem (PN, SAC), pp. 245–256.
- LICS-2004-NguyenC #higher-order
- VTC circ: A Second-Order Theory for TCcirc (PN, SAC), pp. 378–387.
- CAiSE-2003-BenatallahMNSPM #adaptation #documentation
- An Adaptive Document Version Management Scheme (BB, MM, PN, QZS, LP, BM), pp. 46–62.
- VLDB-2001-ZengBNN #named #workflow
- AgFlow: Agent-based Cross-Enterprise Workflow Management System (LZ, BB, PN, AHHN), pp. 697–698.