Trinh Huynh

I'm a graduate student in the theory group at UW CSE. I'm advised by Paul Beame.

My Vietnamese name is Huỳnh Ngọc Đăng Trình.

Contact email: some permutation of '@', 'cs.washington.edu', and 'trinh'


Research papers

  1. Hardness Amplification in Proof Complexity (with Paul Beame and Toniann Pitassi)
    pdf
  2. Multiparty Communication Complexity and Threshold Circuit Size of AC0 (with Paul Beame)
    FOCS '09
    10-page pdf, Full version
  3. Longest Common Subsequences in Sets of Permutations (with Paul Beame and Eric Blais)
    pdf
  4. On the Value of Multiple Read/Write Streams for Approximating Frequency Moments (with Paul Beame)
    FOCS '08, pages 499-508
    pdf | slides

Undergraduate works in Bioinformatics:

  1. Constructing a Smallest Refining Galled Phylogenetic Network (with Jesper Jansson, Nguyen Bao Nguyen, and Wing-Kin Sung)
    RECOMB 2005: 265-280
  2. Approximate String Matching Using Compressed Suffix Arrays (with Wing-Kai Hon, Tak Wah Lam, and Wing-Kin Sung)
    Theoretical Computer Science 352(1-3): 240-249 (2006)
  3. Inferring Phylogenetic Relationships Avoiding Forbidden Rooted Triplets (with Ying-Jun He, Jesper Jansson, and Wing-Kin Sung)
    J. Bioinformatics and Computational Biology 4(1): 59-74 (2006)