Li-Yang Tan Department of Computer Science and Engineering Washington University Campus Box 1045 One Brookings Drive St Louis, Missouri 63130 Office: Jolley 521, Computational Logic Group

Curriculum Vitae

[ PDF, PS ]

Publications

• Li-Yang Tan, The Meta-Theory of Q_0 in the Calculus of Inductive Constructions.
  Master's Thesis, Department of Computer Science. Also available as technical report WUCSE-2006-24.

• Li-Yang Tan, The Chromatic Symmetric Function of Trees.
  Senior Thesis, Department of Mathematics.
  Source code for computations: The CSF distinguishes all trees of size at most 23.
  A paper by J. Martin, J. Wagner and M. Morin's describes their recent work on this problem. Please see [MMW].

• Li-Yang Tan, Combinatorial Calculations in the Free Tree Quotient Modules of the Grossman-Larson Hopf Algebra.
  Senior Thesis, Department of Mathematics.
  Source code for computations: The Jacobian Conjecture as a problem in combinatorics
  Joint work with David Wright and John Shareshian.

• Li-Yang Tan, Formalizing the Meta-Theory of Q_0 in Rogue-Sigma-Pi.
  17th European Summer School in Logic, Language and Information, 2005

• Aaron Stump and Li-Yang Tan, The Algebra of Equality Proofs.
  16th International Conference on Rewriting Techniques and Applications, 2005

CSE 7421 Research Seminar in Complexity Theory

This seminar will focus on important classical and modern results in complexity theory. Time and space complexity (Savitch's and Immerman-Szelepcsènyi's theorems), the polynomial hierarchy, probabilistic complexity classes (BPP, RP, ZPP), interactive proof systems (IP, AM, MA), hardness of approximations and the PCP Theorem, counting and #P-completeness, circuit complexity, pseudorandomness and derandomization. If time permits, we will also study other advanced topics such as relativization, natural proofs, and average-case complexity. The exact syllabus of the seminar will depend greatly on the participants' interests.

Spring 2006 Office Hours

• CSE 547T Formal Languages and Automata Theory: Fridays 3-5pm and by appointment
• CSE 241 Algorithms and Data Structures: Sundays 4-6pm, Mondays 3-5pm