DUNG TIEN NGUYEN, PhD Candidate
Advisor: Prof. Alan Selman

Contact Information Dung Tien Nguyen Department of Computer Science and Engineering University at Buffalo, SUNY Office: 203 Davis Hall Email:

Current Research Interest

• Computational complexity: Autoreducibility
• Database join algorithms

Education

• BS/MS Computer Science 06/2010, University at Buffalo.

Teaching Activities

• T.A. for CSE191 Discrete Structures, Fall 2010
• T.A. for CSE505 Programming System Fundamentals, Fall 2010
• T.A. for CSE305 Programming Languages, Spring 2011
• T.A. for CSE596 Theory of Computation, Fall 2011
• T.A. for CSE462 Database Concepts, Spring 2012

Papers/Presentations

1. Dung T. Nguyen, Alan L. Selman, "Non-autoreducible Sets for NEXP." Submitted. [ECCC]
2. Hung Q. Ngo, Dung T. Nguyen, Christopher Ré, Atri Rudra, "Instance Optimal Join Algorithms for Data in Indexes," Manuscript 2013[Arxiv]
3. Christian Glasser, Dung T. Nguyen, Christian Reitwiessner, Alan L. Selman, Maximilian Witek, "Autoreducibility of Complete Sets for Log-Space and Polynomial-Time Reductions," ICALP 2013
4. Dung T. Nguyen, Alan L. Selman, "Autoreducibility for NEXP," Seventh International Conference on Computability, Complexity, and Randomness CCR 2012