elcome
to An Zhu's Home Page
I joined Google recently.
This is a talk that I gave recently at UMD and USC.
I graduated with a Ph.D. degree in CS, after spending 5 years in the Computer
Science Dept. (theory division)
at Stanford University.
My advisor is Rajeev Motwani. My coadvisor is Leo Guibas.
I graduated from the University of Maryland at College Park, May 1999. (B.S. in Computer Science and Mathematics)
Publications
Gagan Aggarwal, Tomas Feder, Krishnaram Kenthapadi, Samir Khuller, Rina Panigrahy, Dilys Thomas, and An Zhu. Achieving Anonymity via Clustering in a Metric Space. 25th ACM SIGMOD International Conference on Management of Data (PODS) (Jun 2006).David Liben-Nowell, Erik Vee, and An Zhu. Finding Longest Increasing and Common Subsequences in Streaming Data. 11th International Computing and Combinatorics Conference (COCOON) (Aug 2005). Invited to the special issue of the Journal of Combinatorial Optimization
An Zhu. Online Computations in Scheduling and Network Applications Ph.D. Thesis, submitted Nov. 4, 2004.
Gagan Aggarwal, Tomas Feder, Krishnaram Kenthapadi, Rajeev Motwani, Rina Panigrahy, Dilys Thomas, and An Zhu. Anonymizing Tables. 10th International Conference on Database Theory (ICDT) (Jan 2005). Journal version to appear in J. of Privacy Technology.
Gagan Aggarwal, Tomas Feder, Rajeev Motwani, Rina Panigrahy, and An Zhu. Algorithms for the Database Layout Problem. 10th International Conference on Database Theory (ICDT) (Jan 2005).
Gagan Aggarwal, Tomas Feder, Rajeev Motwani, and An Zhu. Algorithms for Multi-Product Pricing. 31st International Colloquium on Automata, Languages and Programming (ICALP) (July 2004).
Konstantinos Psounis, An Zhu, Balaji Probhakar, and Rajeev Motwani. Modeling Correlations in Web-Traces and Implications for Designing Replacement Policies. Computer Networks, 45(4): 379-398, (July 2004).
David Liben-Nowell, Erik Vee, and An Zhu. Finding Longest Increasing and Common Subsequences in Streaming Data. Technical Report MIT-LCS-931, Laboratory for Computer Science MIT, November 2003.
An Zhu. Analysis of Queueing Policies in QoS Switches. J. of Algorithms.
Tomas Feder, Rajeev Mowani, Steve Seiden, Rob van Stee, and An Zhu. Combining Request Scheduling with Web Caching. Theoretical Computer Science, Special Issue on Online Algorithms, In Memoriam: Steve Seiden.
Gagan Aggarwal, Rajeev Motwani, Devavrat Shah, and An Zhu. Switch Scheduling via Randomized Edge Coloring. 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS), (Oct. 2003), Cambridge.
Gagan Aggarwal, Rajeev Motwani, and An Zhu. The Load Rebalancing Problem. 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA), (Jun. 2003), San Diego. Journal version to appear in J. of Algorithms.
Nir Andelman, Yishay Mansour, and An Zhu. Competitive Queueing Policies for QoS Switches. 14th ACM-SIAM Symposium on Discrete Algorithms (SODA), (Jan. 2003), Baltimore.
Samir Khuller and An Zhu. The General Steiner Tree-Star Problem. Information Processing Letters. 84(4):215-220, (November 2002).
Tomas Feder, Rajeev Motwani, Rina Panigrahy, and An Zhu. Web Caching with Request Reordering. 13th ACM-SIAM Symposium on Discrete Algorithms (SODA), (Jan. 2002), San Francisco.
Jie Gao, Leonidas J. Guibas, John Hershberger, Li Zhang, and An Zhu. Geometric Spanner for Routing in Mobile Networks. The ACM Symposium on Mobile Ad Hoc Networking & Computing (MobiHoc), (Oct 2001), Long Beach, California. Journal version to appear in IEEE Journal on Selected Areas in Communications, wireless ad hoc networks.
Jie Gao, Leonidas J. Guibas, John Hershberger, Li Zhang, and An Zhu. Discrete Mobile Centers. 17th Symposium on Computational Geometry (SoCG), (June 2001), Tufts University, MA. Journal version invited to Discrete & Computational Geometry, 30(1), 2003.
Chandra Chekuri, Sanjeev Khanna, and An Zhu. Algorithms for Minimizing Average Weighted Flow Time. 33rd Symposium on Theory of Computing (STOC), (Jul 2001), Crete, Greece.
Leana Golubchik, Sanjeev Khanna, Samir Khuller, Ramki Thurimella, and An Zhu. Approximation Algorithms for Data Placement on Parallel Disks. 11th Symposium on Discrete Algorithms (SODA), (Jan 2000), San Francisco. Journal version submitted to SICOMP.
Samir Khuller, Balaji Raghavachari, and An Zhu. A Uniform Framework for Approximating Weighted Connectivity Problems. 10th Symposium on Discrete Algorithms (SODA), (Jan '99), Baltimore. (short paper).
Full version also available (Undergraduate Honor's thesis, advisor Samir Khuller).
My personal
page (a few memories and favorites)
After all, I still think it's quite amazing how I ended up here in States. To really "grow up" in a foreign country is not easy, or maybe the process of growing up itself is not easy already. I would like to take this opportunity to thank all the people that helped and cared for me. My life can never be as wonderful as it is right now without them, thanks! And also greetings to all my relatives and friends, while time and distance might keep us apart, we are together always.
ACSSS (Association of
Chinese Students and Scholars at Stanford)
During year 2001-2002 I served the ACSSS Board as VP in charge of Information System.
Stanford Algorithms Seminar AFLB
(Founded in 1986 as the Algorithms For Lunch Bunch)
I was one of the coordinators for scheduling theory talks at Stanford. Visit the link above to learn more.
GeZhi
Page
This is a web page dedicated to my High School in Shanghai. (Official Site, Mailing List, Online Club, etc.)
Fun Stuff
Last quarter (spring 2001) I took a drawing class, here are some of my works.
Some pictures from my trip to London and Greece summer 2001.
My journal on my trip to Korea for the World Cup in 2002.
Future (like this web page, still under construction)
Happy Chinese New Year! It is the year of Rooster, starting Feb. 9th, 2005. Just for fun, you can find out which of the 12 Chinese years you were born in at this site (and also a little Chinese Astrology).
anzhu@cs.stanford.edu
Last Updated: Jan. 21, 2007