Papers (and projects and reports, in chronological order)
Unless stated otherwise, author names are in alphabetical order.
I'm trying to keep all papers updated but in case some are not, google scholar might be helpful.
How Fast Can You Walk in a Distributed Network ? [abstract]
with Atish Das Sarma, Gopal Pandurangan and Prasad Tetali
Faster Algorithms for Semi-Matching Problems [abstract]
Jittat Fakcharoenphol and Bundit Lekhanukit
Randomized Multi-pass Streaming Skyline Algorithms [abstract, pdf]
with Atish Das Sarma, Ashwin Lall, Jun Xu, VLDB 2009 [wiki]
Fast Distributed Random Walks [abstract, pdf]
with Atish Das Sarma and Gopal Pandurangan, PODC 2009 [wiki].
Best-Order Streaming Model [abstract, pdf]
with Atish Das Sarma and Richard J. Lipton, TAMC 2009.
Invited to Special Issue of Theoretical Computer Science.
Graph Algorithms on New Streaming Models [ps, ppt]
PhD Research Proposal. September, 2008.
A New Approach to the Four Color Theorem [pdf, ps]
with Atish Das Sarma, Amita Gajewar, and Richard J. Lipton, Manuscript, 2007.
A fast algorithm for finding optimal weighted semi-matching [pdf, ps]
with Jittat Fakcharoenphol and Bundit Lekhanukit, Note, 2007
A faster algorithm for finding optimal semi-matching [pdf, ps]
with Jittat Fakcharoenphol and Bundit Lekhanukit, Manuscript, 2005
Detecting and cleaning intruders in sensor networks [pdf, ps]
with Jittat Fakcharoenphol , Bundit Laekhanukit and
Poonna Yospanya, National Comp. Sci. and /Eng. Conf. 2004 (NCSEC'04).
A deterministic nearly linear-time algorithm for finding minimum cuts in planar graphs [pdf, ps, ppt]
with Parinya Chalermsook
and Jittat Fakcharoenphol, SODA 2004
Self Learning Agent Model: General Board Game Player [Details] Senior project 2002-2003
Gnu Go on Cluster [Abstract] Presented in final round of the National Software Contest 2001-2002
Georgia Tech Math Seminar
Theory of Computation Colloquium
Algorithms & Randomness Center (ARC)
ACO Student Seminar