Welcome to my corner (node?) of the web! I graduated from Stanford University in 2005, and am now working at Google as a research scientist. At Stanford, I was part of the Computer Science theory group and worked on my Ph.D. thesis under the advisorship of Prof. Rajeev Motwani. Before joining Stanford, I spent four wonderful years studying Computer Science and Engineering at IIT, Delhi.
My research interests can be broadly classified as design and analysis of combinatorial algorithms. I have worked on problems related to a variety of application areas including online auctions, privacy protection, streaming models, scheduling, load balancing and self-assembly.
Some representative papers
Truthful Auctions for Pricing Search Keywords.
Gagan Aggarwal, Ashish Goel and Rajeev Motwani, ACM Conference on Electronic Commerce (EC06), June 2006.
(truthful auctions for selling online advertisements)
Secure Computation of the
k-th Ranked Element. Gagan Aggarwal, Nina Mishra, Benny Pinkas,
Eurocrypt (EUROCRYPT04), May 2004.
(efficient two-party and multi-party
protocols that provide security against malicious parties)
Anonymizing
Tables.
Gagan Aggarwal, Tomas Feder, Krishnaram Kenthapadi,
Rajeev Motwani, Rina Panigrahy, Dilys Thomas, An Zhu,
International Conference on Database Theory (ICDT05), January
2005.
(approximation algorithms for
k-anonymity, a privacy framework for releasing databases
containing sensitive information)
Switch Scheduling via
Randomized Edge Coloring. Gagan Aggarwal, Rajeev Motwani,
Devavrat Shah , An Zhu, Symposium on Foundations of Computer
Science (FOCS03), October 2003.
(a fast, decentralized and
implementable algorithm for switching packets inside an internet
router.)