This document is a resume for Dung Tien Nguyen, a software engineer at LogicBlox Inc. It summarizes his education, including a Ph.D. in Computer Science from the University at Buffalo, his research and teaching experience there implementing database join algorithms, his publications in conferences like PODS and STACS, and his technical skills in C++ and Linux programming.

1. Dung TienNguyenSOFTWARE ENGINEER
LogicBlox Inc. 1349 Peachtree Street NW, Atlanta GA 30324
 716-218-0142 |  dnguyenuna@gmail.com |  www.cse.buffalo.edu/ dtn3 |  dnguyen311
Education
University at Buffalo Buffalo, New York USA
PH.D. IN COMPUTER SCIENCE AND ENGINEERING September 2014
• Dissertation Topic: Autoreducibility of Complete Sets for NEXP under Polynomial-Time Reductions
• Advisor: Prof. Alan Selman
University at Buffalo Buffalo, New York USA
M.S. IN COMPUTER SCIENCE AND ENGINEERING June 2010
• Project Topic: Slicing Technique in COB, the Constraint Object Programming Language
• Supervisor: Prof. Bharat Jayaraman
• GPA 4.0
University at Buffalo Buffalo, New York USA
B.S. IN COMPUTER SCIENCE AND ENGINEERING, SUMMA CUM LAUDE June 2010
University of North Alabama Florence, Alabama USA
UNDERGRADUATE STUDENT IN COMPUTER SCIENCE, MATHEMATICS June 2006 - January 2009
• Transferred to University at Buffalo
Vietnam National University - Ho Chi Minh University of Technology Ho Chi Minh, Vietnam
UNDERGRADUATE STUDENT IN TELECOMMUNICATION December 2004 - June 2006
• Enrolled in Programme de Formation d’Ingénieurs d’Excellence au Vietnam
• Left for studying abroad in USA
Honors & Awards
2010-2013 Tuition Scholarship, University at Buffalo Buffalo, NY, USA
2012 Travel Award, Seventh International Conference on Computability, Complexity, and Randomness Cambridge, UK
2006-2010 Dean’s List, University at Buffalo, University of North Alabama USA
2004 Highest score 30/30, National University Entrance Examination Vietnam
2015 First prize, Vietnam National Mathematics Olympiad for Undergraduate Students, Algebra Vietnam
2004 First prize, Vietnam National Mathematics Olympiad for High School Students Vietnam
2003 Third prize, Vietnam National Mathematics Olympiad for High School Students Vietnam
2003, 2004 Odon Vallet scholarship, Odon Vallet scholarship awarded to outstanding Vietnamese students Vietnam
2002,2003 Gold Medal, 30/4 Olympiad in Mathematics, South and Middle Provinces in Vietnam Vietnam
2002,2003 Gold Medal, Mekong Delta Olympiad in Mathematics, South-West provinces in Vietnam Vietnam
Academic Experience
University at Buffalo Buffalo, NY USA
RESEARCH PROJECT ASSISTANT August 2012 - September 2014
• Database join algorithm implementation.
• Supervisors: Hung Q. Ngo, Christopher Ré, and Atri Rudra.
• Implement and benchmark various database join algorithms, including worst-case optimal join algorithm and adaptive-join algo-
rithm, using LogicBlox commercial platform.
• Design an adaptive join algorithm that is theoretically better than many traditional joins.
AUGUST 24, 2016 DUNG T. NGUYEN · RÉSUMÉ 1

2. University at Buffalo Buffalo, NY USA
TEACHING ASSISTANT August 2010 - May 2012
• Responsibilities: leading recitation sessions, drafting quizzes, grading homework, quizzes, and exams, and holding office hours.
• CSE462 Database Concepts, Spring 2012
• CSE596 Theory of Computation, Fall 2011
• CSE305 Programming Languages, Spring 2011
• CSE505 Programming System Fundamentals, Fall 2010
• CSE191 Discrete Structures, Fall 2010
Professional Experience
LogicBlox Inc. Atlanta, GA USA
SOFTWARE ENGINEER October 2014 - Present
• Building large-scaled, high-performance, cloud-hosted retail applications at LogicBlox.
LogicBlox Inc. Atlanta, GA USA
SUMMER RESEARCH INTERN May 2013 - August 2013
• Using the LogicBlox platform, implemented the engine of adaptive join Minesweeper algorithm. Implemented some tunings to opti-
mize the algorithm. A lot of functionalities of join were also incorporated, including built-in predicates, aggregation, etc. Also carried
out a number of benchmarks to compare performances of many different database join implementations.
LogicBlox Inc. Atlanta, GA USA
SUMMER RESEARCH INTERN June 2012- August 2012
• Using the LogicBlox platform, implemented the engine of worst-case optimal join. Also carried out a number of benchmarks to com-
pare performances of many different database join implementations.
Publications
2016
Christian Glasser, Dung T. Nguyen, Christian Reitwiessner, Alan L. Selman, Maximilian Witek,
“Autoreducibility of Complete Sets for Log-Space and Polynomial-Time Reductions.”
Submitted
2017
Christian Glasser, Dung T. Nguyen, Alan L. Selman, Maximilian Witek, “Introduction to
Autoreducibility and Mitoticity.” To appear in the Downey Festschrift for the Computability and
Complexity Symposium 2017.
CCS
2016
Dung T. Nguyen, Alan Selman, “Structural Properties of Nonautoreducible Sets,” ACM
Transactions on Computation Theory, pp. 11:1-11:24 (TOCT 2016).
TOCT
2015
Dung T. Nguyen, Molham Aref, Martin Bravenboer, George Kollias, Hung Q. Ngo, Christopher
Ré, Atri Rudra, “Join Processing for Graph Patterns: An Old Dog with New Tricks,” in Proceedings of
the Graph Data-management Experiences and Systems Workshop 2015, co-located with
SIGMOD-PODS (GRADES), pp. 2:1-2:8, Melbourne, VIC, Australia, May 31, 2015.
GRADES
2014
Hung Q. Ngo, Dung T. Nguyen, Christopher Ré, Atri Rudra, “Beyond Worst-case Analysis for
Joins with Minesweeper,” in Proceedings of the 31st ACM SIGMOD-SIGACT-SIGART
Symposium on Principles of Database Systems (PODS), pp. 234-245, Utah, USA, June 22-27,
2014.
PODS
2014
Dung T. Nguyen, Alan L. Selman, “Non-autoreducible Sets for NEXP,” in Proceedings of the
31st Symposium on Theoretical Aspects of Computer Science (STACS), pp. 590-601, Lyon,
France, March 5-8, 2014.
STACS
2013
Christian Glasser, Dung T. Nguyen, Christian Reitwiessner, Alan L. Selman, Maximilian Witek,
“Autoreducibility of Complete Sets for Log-Space and Polynomial-Time Reductions,” in Proceedings
of the 40th International Colloquium on Automata, Languages and Programming (ICALP), pp.
473-484, Riga, Latvia, July 8-12, 2013.
ICALP
Presentation
31st Symposium on Principles of Database Systems Utah, USA
POSTER PRESENTATION June 2014
• Beyond Worst-case Analysis for Joins with Minesweeper
AUGUST 24, 2016 DUNG T. NGUYEN · RÉSUMÉ 2

3. 31st Symposium on Theoretical Aspects of Computer Science Lyon, France
ORAL PRESENTATION March 2014
• Non-autoreducible Sets for NEXP
Seventh International Conference on Computability, Complexity, and
Randomness
Cambridge, UK
ORAL PRESENTATION July 2012
• Autoreducibility for NEXP
Technical Skills
PROGRAMMING LANGUAGES
• Excellent Skill in C++, C. Have good working knowledge in Linux programming, socket programming, Linux shell scripting, and object
oriented design.
PROGRAMMING EXPERIENCE
• Implement Minesweeper Join algorithm in Logicblox database platform in C++. (Logicblox 2012-2014).
• Also have some experience by completing projects in Master of Science courses, including Database System Implementation (in Java),
Operating System Implementation (in C), Computer Vision (in Matlab), Network Programming (in C), Knowledge Representation (in
Lisp), and other small programming language projects (Prolog, Ruby, Lisp).
SKILLS
• Excellent problem solving skills, data structure, and algorithm design and analysis.
AUGUST 24, 2016 DUNG T. NGUYEN · RÉSUMÉ 3