
RESEARCHER
Microsoft Research Silicon Valley
Email: <firstname> at microsoft.com
Phone: (650) 693 2399
Mail: 1065 La Avenida, Mountain View, CA 94043
I graduated from Berkeley in September 2004, where I was working with Satish Rao and Christos Papadimitriou. I was a postdoc in the Theory group at MSR Redmond from September 2004-August 2005.
Michael Isard, Vijayan Prabhakaran, Jon Currey, Udi Wieder, Kunal Talwar, and Andrew Goldberg, Quincy: Fair Scheduling for Distributed Computing Clusters, in Proceedings of 22nd ACM Symposium on Operating Systems Principles, Association for Computing Machinery, Inc., 11 October 2009
Moshe Babaioff, Michael Dinitz, Anupam Gupta, Nicole Immorlica, and Kunal Talwar, Secretary Problems: Weights and Discounts, in Symposium on Discrete Algorithms (SODA'09), January 2009
Rina Panigrahy, Kunal Talwar, and Udi Wieder, A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match, in FOCS '08: Proceedings of the 49th annual IEEE Symposium on Foundaitions of Computer Science, IEEE Computer Society, October 2008
Maleq Kahn, Fabian Kuhn, Dahlia Malkhi, gopal pandurangan, and kunal talwar, Efficient Distributed Approximation Algorithms via Probabilistic Tree Embeddings, in the 27th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), Association for Computing Machinery, Inc., August 2008
David B. Shmoys and Kunal Talwar, A Constant Approximation Algorithm for the a priori Traveling Salesman Problem, in International Conference Integer Programming and Combinatorial Optimization (IPCO), Springer, Bertinoro, Italy, May 2008
Frank McSherry and Kunal Talwar, Mechanism Design via Differential Privacy, in Annual IEEE Symposium on Foundations of Computer Science (FOCS), Association for Computing Machinery, Inc., Providence, RI, October 2007
Nicole Immorlica, Anna R. Karlin, Mohammad Mahdian, and Kunal Talwar, Balloon Popping With Applications to Ascending Auctions, in Annual IEEE Symposium on Foundations of Computer Science (FOCS), IEEE Communications Society, Providence, RI, October 2007
Ittai Abraham, Mahesh Balakrishnan, Fabian Kuhn, Dahlia Malkhi, Kunal Talwar, and Venugopalan (Rama) Ramasubramanian, Reconstructing Approximate Tree Metrics, in 26th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2007), Portland, OR, August 2007
Kunal Talwar and Udi Wieder, Balanced Allocations: The Weighted Case, in ACM Symposium on Theory of Computing (STOC), San Diego, CA, June 2007
Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, and Kunal Talwar, Hardness of Routing with Congestion in Directed Graphs, in 39th ACM Symposium on Theory of Computing (STOC), San Diego, California, June 2007
Anupam Gupta and Kunal Talwar, Approximating Unique Games, in ACM-SIAM Symposium on Discrete Algorithms (SODA), Miami, FL, January 2006
Shuchi Chawla, Cynthia Dwork, Frank McSherry, and Kunal Talwar, On Privacy-Preserving Histograms, in Uncertainty in Artificial Intelligence (UAI), Edinburgh, Scotland, July 2005



