Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Kunal Talwar
2010 – today
- 2013
[c49]Aditya Bhaskara, Ravishankar Krishnaswamy, Kunal Talwar, Udi Wieder: Minimum Makespan Scheduling with Low Rank Processing Times. SODA 2013: 937-947- [c48]Michael Kapralov, Kunal Talwar: On differentially private low rank approximation. SODA 2013: 1395-1414
- [c47]Anupam Gupta, Kunal Talwar, David Witmer: Sparsest cut on bounded treewidth graphs: algorithms and hardness results. STOC 2013: 281-290
- [c46]Aleksandar Nikolov, Kunal Talwar, Li Zhang: The geometry of differential privacy: the sparse and approximate cases. STOC 2013: 351-360
- [i12]Anupam Gupta, Kunal Talwar, David Witmer: Sparsest Cut on Bounded Treewidth Graphs: Algorithms and Hardness Results. CoRR abs/1305.1347 (2013)
- 2012
- [j11]Maleq Khan, Fabian Kuhn, Dahlia Malkhi, Gopal Pandurangan, Kunal Talwar: Efficient distributed approximation algorithms via probabilistic tree embeddings. Distributed Computing 25(3): 189-205 (2012)
- [c45]Aditya Bhaskara, Daniel Dadush, Ravishankar Krishnaswamy, Kunal Talwar: Unconditional differentially private mechanisms for linear queries. STOC 2012: 1269-1284
- [i11]Shuchi Chawla, Cynthia Dwork, Frank McSherry, Kunal Talwar: On Privacy-Preserving Histograms. CoRR abs/1207.1371 (2012)
- [i10]Aleksandar Nikolov, Kunal Talwar, Li Zhang: The Geometry of Differential Privacy: the Sparse and Approximate Cases. CoRR abs/1212.0297 (2012)
- 2011
- [j10]
- [i9]Andrew McGregor, Ilya Mironov, Toniann Pitassi, Omer Reingold, Kunal Talwar, Salil P. Vadhan: The Limits of Two-Party Differential Privacy. Electronic Colloquium on Computational Complexity (ECCC) 18: 106 (2011)
- 2010
- [j9]Matthew Andrews, Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, Kunal Talwar, Lisa Zhang: Inapproximability of Edge-Disjoint Paths and low congestion routing on undirected graphs. Combinatorica 30(5): 485-520 (2010)
- [j8]T.-H. Hubert Chan, Anupam Gupta, Kunal Talwar: Ultra-low-dimensional embeddings for doubling metrics. J. ACM 57(4) (2010)
- [c44]Matthias Englert, Anupam Gupta, Robert Krauthgamer, Harald Räcke, Inbal Talgam-Cohen, Kunal Talwar: Vertex Sparsifiers: New Results from Old Techniques. APPROX-RANDOM 2010: 152-165
- [c43]Mohit Singh, Kunal Talwar: Improving Integrality Gaps via Chvátal-Gomory Rounding. APPROX-RANDOM 2010: 366-379
- [c42]Andrew McGregor, Ilya Mironov, Toniann Pitassi, Omer Reingold, Kunal Talwar, Salil P. Vadhan: The Limits of Two-Party Differential Privacy. FOCS 2010: 81-90
- [c41]Rina Panigrahy, Kunal Talwar, Udi Wieder: Lower Bounds on Near Neighbor Search via Metric Expansion. FOCS 2010: 805-814
- [c40]Andrej Bogdanov, Kunal Talwar, Andrew Wan: Hard Instances for Satisfiability and Quasi-one-way Functions. ICS 2010: 290-300
- [c39]Anupam Gupta, Katrina Ligett, Frank McSherry, Aaron Roth, Kunal Talwar: Differentially Private Combinatorial Optimization. SODA 2010: 1106-1125
- [c38]Yuval Peres, Kunal Talwar, Udi Wieder: The (1 + beta)-Choice Process and Weighted Balls-into-Bins. SODA 2010: 1613-1619
- [c37]
- [c36]Anupam Gupta, Aaron Roth, Grant Schoenebeck, Kunal Talwar: Constrained Non-monotone Submodular Maximization: Offline and Secretary Algorithms. WINE 2010: 246-257
- [i8]Anupam Gupta, Aaron Roth, Grant Schoenebeck, Kunal Talwar: Constrained Non-Monotone Submodular Maximization: Offline and Secretary Algorithms. CoRR abs/1003.1517 (2010)
- [i7]Rina Panigrahy, Kunal Talwar, Udi Wieder: Lower Bounds on Near Neighbor Search via Metric Expansion. CoRR abs/1005.0418 (2010)
- [i6]Matthias Englert, Anupam Gupta, Robert Krauthgamer, Harald Räcke, Inbal Talgam-Cohen, Kunal Talwar: Vertex Sparsifiers: New Results from Old Techniques. CoRR abs/1006.4586 (2010)
2000 – 2009
- 2009
- [j7]Kamalika Chaudhuri, Satish Rao, Samantha Riesenfeld, Kunal Talwar: What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs. Algorithmica 55(1): 157-189 (2009)
- [j6]Uriel Feige, Kunal Talwar: Approximating the Bandwidth of Caterpillars. Algorithmica 55(1): 190-204 (2009)
- [j5]Kamalika Chaudhuri, Satish Rao, Samantha Riesenfeld, Kunal Talwar: A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids. Theor. Comput. Sci. 410(44): 4489-4503 (2009)
- [c35]Moshe Babaioff, Michael Dinitz, Anupam Gupta, Nicole Immorlica, Kunal Talwar: Secretary problems: weights and discounts. SODA 2009: 1245-1254
- [c34]Michael Isard, Vijayan Prabhakaran, Jon Currey, Udi Wieder, Kunal Talwar, Andrew Goldberg: Quincy: fair scheduling for distributed computing clusters. SOSP 2009: 261-276
- [c33]Dahlia Malkhi, Siddhartha Sen, Kunal Talwar, Renato Fonseca F. Werneck, Udi Wieder: Virtual Ring Routing Trends. DISC 2009: 392-406
- [i5]Anupam Gupta, Katrina Ligett, Frank McSherry, Aaron Roth, Kunal Talwar: Differentially Private Approximation Algorithms. CoRR abs/0903.4510 (2009)
- [i4]
- 2008
- [c32]Rina Panigrahy, Kunal Talwar, Udi Wieder: A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match. FOCS 2008: 414-423
- [c31]David B. Shmoys, Kunal Talwar: A Constant Approximation Algorithm for the a prioriTraveling Salesman Problem. IPCO 2008: 331-343
- [c30]
- [c29]Maleq Khan, Fabian Kuhn, Dahlia Malkhi, Gopal Pandurangan, Kunal Talwar: Efficient distributed approximation algorithms via probabilistic tree embeddings. PODC 2008: 263-272
- [c28]T.-H. Hubert Chan, Anupam Gupta, Kunal Talwar: Ultra-low-dimensional embeddings for doubling metrics. SODA 2008: 333-342
- [r1]Jittat Fakcharoenphol, Satish Rao, Kunal Talwar: Approximating Metric Spaces by Tree Metrics. Encyclopedia of Algorithms 2008
- 2007
- [j4]Dinesh Garg, Kamal Jain, Kunal Talwar, Vijay V. Vazirani: A primal-dual algorithm for computing Fisher equilibrium in the absence of gross substitutability property. Theor. Comput. Sci. 378(2): 143-152 (2007)
- [c27]
- [c26]Nicole Immorlica, Anna R. Karlin, Mohammad Mahdian, Kunal Talwar: Balloon Popping With Applications to Ascending Auctions. FOCS 2007: 104-112
- [c25]Ittai Abraham, Mahesh Balakrishnan, Fabian Kuhn, Dahlia Malkhi, Venugopalan Ramasubramanian, Kunal Talwar: Reconstructing approximate tree metrics. PODC 2007: 43-52
- [c24]Boaz Barak, Kamalika Chaudhuri, Cynthia Dwork, Satyen Kale, Frank McSherry, Kunal Talwar: Privacy, accuracy, and consistency too: a holistic solution to contingency table release. PODS 2007: 273-282
- [c23]Cynthia Dwork, Frank McSherry, Kunal Talwar: The price of privacy and the limits of LP decoding. STOC 2007: 85-94
- [c22]Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, Kunal Talwar: Hardness of routing with congestion in directed graphs. STOC 2007: 165-178
- [c21]
- [i3]
- [i2]Matthew Andrews, Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, Kunal Talwar, Lisa Zhang: Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs. Electronic Colloquium on Computational Complexity (ECCC) 14(113) (2007)
- 2006
- [c20]Kamalika Chaudhuri, Satish Rao, Samantha Riesenfeld, Kunal Talwar: A Push-Relabel Algorithm for Approximating Degree Bounded MSTs. ICALP (1) 2006: 191-201
- [c19]
- [i1]Venkatesan Guruswami, Kunal Talwar: Hardness of Low Congestion Routing in Directed Graphs. Electronic Colloquium on Computational Complexity (ECCC) 13(141) (2006)
- 2005
- [c18]Kamalika Chaudhuri, Satish Rao, Samantha Riesenfeld, Kunal Talwar: What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs. APPROX-RANDOM 2005: 26-39
- [c17]
- [c16]Kamal Jain, Mohammad Taghi Hajiaghayi, Kunal Talwar: The Generalized Deadlock Resolution Problem. ICALP 2005: 853-865
- [c15]Shuchi Chawla, Cynthia Dwork, Frank McSherry, Kunal Talwar: On Privacy-Preserving Histograms. UAI 2005
- [c14]Dinesh Garg, Kamal Jain, Kunal Talwar, Vijay V. Vazirani: A Primal-Dual Algorithm for Computing Fisher Equilibrium in the Absence of Gross Substitutability Property. WINE 2005: 24-33
- [c13]Nicole Immorlica, Kamal Jain, Mohammad Mahdian, Kunal Talwar: Click Fraud Resistant Methods for Learning Click-Through Rates. WINE 2005: 34-45
- [c12]Kamal Jain, Aranyak Mehta, Kunal Talwar, Vijay V. Vazirani: A Simple Characterization for Truth-Revealing Single-Item Auctions. WINE 2005: 122-128
- 2004
- [j3]Jittat Fakcharoenphol, Satish Rao, Kunal Talwar: A tight bound on approximating arbitrary metrics by tree metrics. J. Comput. Syst. Sci. 69(3): 485-497 (2004)
- [j2]Jittat Fakcharoenphol, Satish Rao, Kunal Talwar: Approximating metrics by tree metrics. SIGACT News 35(2): 60-70 (2004)
- [c11]Aaron Archer, Jittat Fakcharoenphol, Chris Harrelson, Robert Krauthgamer, Kunal Talwar, Éva Tardos: Approximate classification via earthmover metrics. SODA 2004: 1079-1087
- [c10]
- [c9]Alex Fabrikant, Christos H. Papadimitriou, Kunal Talwar: The complexity of pure Nash equilibria. STOC 2004: 604-612
- 2003
- [j1]Aaron Archer, Christos H. Papadimitriou, Kunal Talwar, Éva Tardos: An Approximate Truthful Mechanism for Combinatorial Auctions with Single Parameter Agents. Internet Mathematics 1(2): 129-150 (2003)
- [c8]Kamalika Chaudhuri, Brighten Godfrey, Satish Rao, Kunal Talwar: Paths, Trees, and Minimum Latency Tours. FOCS 2003: 36-45
- [c7]Jittat Fakcharoenphol, Kunal Talwar: An Improved Decomposition Theorem for Graphs Excluding a Fixed Minor. RANDOM-APPROX 2003: 36-46
- [c6]Aaron Archer, Christos H. Papadimitriou, Kunal Talwar, Éva Tardos: An approximate truthful mechanism for combinatorial auctions with single parameter agents. SODA 2003: 205-214
- [c5]Jittat Fakcharoenphol, Chris Harrelson, Satish Rao, Kunal Talwar: An improved approximation algorithm for the 0-extension problem. SODA 2003: 257-265
- [c4]
- [c3]Jittat Fakcharoenphol, Satish Rao, Kunal Talwar: A tight bound on approximating arbitrary metrics by tree metrics. STOC 2003: 448-455
- 2002
- [c2]
- 2001
- [c1]Umesh Shankar, Kunal Talwar, Jeffrey S. Foster, David Wagner: Detecting Format String Vulnerabilities with Type Qualifiers. USENIX Security Symposium 2001
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-03 20:09 CEST by the dblp team