<HTML><HEAD><TITLE>Trinh Huynh (Huỳnh Ngọc Đăng Trình)</TITLE></HEAD> 
<BODY> 
<TABLE cellPadding=3> 
<TBODY> 
<TR> 
<TD><IMG src="baby.jpg" height=250 alig="left" valign="mid"></TD> 
<TD> 
<P> 
<H2>Trinh Huynh</H2> 
<P></P> 
<P>I'm a graduate student in the theory group at <A href="http://www.cs.washington.edu/research/computation/">UW CSE</A>. I'm advised by <A href="http://www.cs.washington.edu/homes/beame">Paul Beame</A>. </P> 
<P>My Vietnamese name is Huỳnh Ngọc Đăng Trình. </P> 
<P>Email: some permutation of '@', 'cs.washington.edu', and 'trinh' </P></TD> 
<TR></TR></TBODY></TABLE><BR> 
<P> 
<H2>Research papers</H2> 
<OL reversed> 
<LI> 
<DIV>Hardness Amplification in Proof Complexity <I>(with Paul Beame and Toniann Pitassi)</I> </DIV> 
<DIV>STOC '10 </DIV> 
<A href="Th-k.pdf">pdf</A> 
<LI> 
<DIV>Multiparty Communication Complexity and Threshold Circuit Size of AC<sup>0</sup> <I>(with Paul Beame)</I> </DIV> 
<DIV>FOCS '09 </DIV><A href="ac0-focs.pdf">10-page pdf</A>, <A href="ac0.pdf">Full version</A> 
<LI> 
<DIV>Longest Common Subsequences in Sets of Permutations <I>(with Paul Beame and Eric Blais)</I> </DIV><A href="Permutations.pdf">pdf</A> 
<LI> 
<DIV>On the Value of Multiple Read/Write Streams for Approximating Frequency Moments <I>(with Paul Beame) </I></DIV> 
<DIV>FOCS '08, pages 499-508 </DIV><A href="F_k.pdf">pdf</A> </LI></OL> 
<P></P> 
<P>Undergraduate works in Bioinformatics: 
<OL> 
<LI> 
<DIV>Constructing a Smallest Refining Galled Phylogenetic Network <I>(with Jesper Jansson, Nguyen Bao Nguyen, and Wing-Kin Sung) </I></DIV> 
<DIV>RECOMB 2005: 265-280 </DIV> 
<LI> 
<DIV>Approximate String Matching Using Compressed Suffix Arrays <I>(with Wing-Kai Hon, Tak Wah Lam, and Wing-Kin Sung) </I></DIV> 
<DIV>Theoretical Computer Science 352(1-3): 240-249 (2006) </DIV> 
<LI> 
<DIV>Inferring Phylogenetic Relationships Avoiding Forbidden Rooted Triplets <I>(with Ying-Jun He, Jesper Jansson, and Wing-Kin Sung) </I></DIV> 
<DIV>J. Bioinformatics and Computational Biology 4(1): 59-74 (2006) </DIV></LI></OL> 
<P></P></BODY></HTML>