(For those who cannot pronounce my name, I go with Nu and Dan.) Before coming to Georgia Tech, I got a Bachelor of Computer Engineering from Kasetsart University, Thailand, in 2003. I was very fortunate to work with Jittat Fakcharoenphol and people in Theory group at Kasetsart University. My research interest is applied algorithms: I am generally interested in the design and analysis of algorithms with applications. I am currently working on the following topics. (Related papers are listed. See all papers and publications on the research page.) Distributed Random Walks How many rounds do you need to sample points from a network in a random walk style? Near-Optimal Sublinear Time Bounds for Distributed Random Walks [details, pdf, arxiv] with Atish Das Sarma, Gogal Pandurangan and Prasad Tetali Submitted Fast Distributed Random Walks [details, pdf, slides] with Atish Das Sarma and Gogal Pandurangan PODC 2009: 28th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing [wiki] Representative Database How to present a huge database to a user so that she can easily find a desired tuple? Regret-Minimizing Representative Databases Danupon Nanongkai, Atish Das Sarma, Ashwin Lall, Richard J. Lipton, Jun Xu (Names in this paper are not in alphabetical order.) Coming soon Randomized Multi-pass Streaming Skyline Algorithms [details, pdf, slides] with Atish Das Sarma, Ashwin Lall, and Jun Xu VLDB 2009: Proceedings of the VLDB Endowment, Vol 2, No. 1-2, pp 85-96, 2009 [wiki] Approximation Algorithms I am working on Stackelberg problems. Stackelberg Pricing is Hard to Approximate within 2−ε [details, pdf, arXiv] with Parinya Chalermsook and Bundit Lekhanukit Submitted Select papers in other topics Faster Algorithms for Semi-Matching Problems [details] Best-Order Streaming Model [details, pdf, slides] A deterministic nearly linear-time algorithm for finding minimum cuts in planar graphs [details, pdf, ps, slides] |
   |
About |