Computer science professional with strong backgrounds in algorithm design and software systems.

Senior Software Engineer @ From November 2015 to Present (2 months) Software Engineer @ From September 2013 to Present (2 years 4 months) Guest Speaker in Graduate and Undergraduate Classes @ • Classes (25-50 students): Combinatorics & Graph Theory; Theory of Computations • Topics: NP completeness; polynomial hierarchy; Ramsey theory; Expander graphs From February 2010 to Present (5 years 11 months) Austin, Texas AreaGraduate Research Assistant @ Study the parallel speed-up and the space complexity of any computation. The followings are some highlights of our results. • Developed the most space-efficient approximation algorithm for the SUBSET SUM problem developed so far • Improved the space complexity of two P-complete Circuit Value Problems from O(n) to O(sqrt(n) log n) • Showed how to parallelize any given Boolean circuit of size O(n) and O(1) separator size to an O(log n)-depth Boolean circuit (Previous best result: O(n/log n)-depth, given in 1976 by Patterson and Valiant) • Showed how to parallelize any given layered Boolean circuit of size O(n) to an O(sqrt(n))-depth Boolean circuit (Previous best result: O(n/log n)-depth, given in 1976 by Patterson and Valiant) From September 2009 to Present (6 years 4 months) Graduate Teaching Assistant @ • Gave class lectures, held recitation sections, and prepared and graded assignments & exams. • Classes: (Graduate) Randomized Algorithms, Theory of Computations, (Undergraduate) Automata Theory, Analysis of Programs From September 2005 to September 2008 (3 years 1 month) Undergraduate Teaching Assistant @ • Classes: Introduction to Programming; Introduction to Automata • Held recitation sections for 15-20 students; graded programs, written assignments, and exams From January 2002 to May 2004 (2 years 5 months) Undergraduate Research Assistant @ • Investigated the space & time optimality of Huffman compression for text. • Supervisor: Professor Jack Lutz From January 2003 to May 2003 (5 months)

Doctor of Philosophy (Ph.D.), Computer Science @ The University of Texas at Austin From 2007 to 2013 Master of Science (M.S.), Computer Science @ The University of Texas at Austin From 2004 to 2007 Bachelor of Science (B.S.), Computer Science @ Iowa State University From 2001 to 2004 Bachelor of Science (B.S.), Mathematics @ Iowa State University From 2001 to 2004 Jing-Tang Jang is skilled in: Complexity Theory, Theoretical Computer Science, Mathematical Logic, Parallel Algorithms, Graph Algorithms, Java, C++, Unix Shell Scripting, Perl, SQL, Eclipse, Android Development, Android SDK, Google App Engine, Google Analytics, Protocol Buffers, Linux, Algorithms