The SCEAS System
| |||||||

## Search the dblp DataBase
Kunal Talwar:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Kamalika Chaudhuri, Satish Rao, Samantha Riesenfeld, Kunal Talwar
**What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2005, pp:26-39 [Conf] - Uriel Feige, Kunal Talwar
**Approximating the Bandwidth of Caterpillars.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2005, pp:62-73 [Conf] - Kamalika Chaudhuri, Brighten Godfrey, Satish Rao, Kunal Talwar
**Paths, Trees, and Minimum Latency Tours.**[Citation Graph (0, 0)][DBLP] FOCS, 2003, pp:36-45 [Conf] - Kamalika Chaudhuri, Satish Rao, Samantha Riesenfeld, Kunal Talwar
**A Push-Relabel Algorithm for Approximating Degree Bounded MSTs.**[Citation Graph (0, 0)][DBLP] ICALP (1), 2006, pp:191-201 [Conf] - Kamal Jain, Mohammad Taghi Hajiaghayi, Kunal Talwar
**The Generalized Deadlock Resolution Problem.**[Citation Graph (0, 0)][DBLP] ICALP, 2005, pp:853-865 [Conf] - Kunal Talwar
**The Single-Sink Buy-at-Bulk LP Has Constant Integrality Gap.**[Citation Graph (0, 0)][DBLP] IPCO, 2002, pp:475-486 [Conf] - Jittat Fakcharoenphol, Kunal Talwar
**An Improved Decomposition Theorem for Graphs Excluding a Fixed Minor.**[Citation Graph (0, 0)][DBLP] RANDOM-APPROX, 2003, pp:36-46 [Conf] - Aaron Archer, Jittat Fakcharoenphol, Chris Harrelson, Robert Krauthgamer, Kunal Talwar, Éva Tardos
**Approximate classification via earthmover metrics.**[Citation Graph (0, 0)][DBLP] SODA, 2004, pp:1079-1087 [Conf] - Aaron Archer, Christos H. Papadimitriou, Kunal Talwar, Éva Tardos
**An approximate truthful mechanism for combinatorial auctions with single parameter agents.**[Citation Graph (0, 0)][DBLP] SODA, 2003, pp:205-214 [Conf] - Jittat Fakcharoenphol, Chris Harrelson, Satish Rao, Kunal Talwar
**An improved approximation algorithm for the 0-extension problem.**[Citation Graph (0, 0)][DBLP] SODA, 2003, pp:257-265 [Conf] - Anupam Gupta, Kunal Talwar
**Approximating unique games.**[Citation Graph (0, 0)][DBLP] SODA, 2006, pp:99-106 [Conf] - Kunal Talwar
**The Price of Truth: Frugality in Truthful Mechanisms.**[Citation Graph (0, 0)][DBLP] STACS, 2003, pp:608-619 [Conf] - Alex Fabrikant, Christos H. Papadimitriou, Kunal Talwar
**The complexity of pure Nash equilibria.**[Citation Graph (0, 0)][DBLP] STOC, 2004, pp:604-612 [Conf] - Jittat Fakcharoenphol, Satish Rao, Kunal Talwar
**A tight bound on approximating arbitrary metrics by tree metrics.**[Citation Graph (0, 0)][DBLP] STOC, 2003, pp:448-455 [Conf] - Kunal Talwar
**Bypassing the embedding: algorithms for low dimensional metrics.**[Citation Graph (0, 0)][DBLP] STOC, 2004, pp:281-290 [Conf] - Nicole Immorlica, Kamal Jain, Mohammad Mahdian, Kunal Talwar
**Click Fraud Resistant Methods for Learning Click-Through Rates.**[Citation Graph (0, 0)][DBLP] WINE, 2005, pp:34-45 [Conf] - Kamal Jain, Aranyak Mehta, Kunal Talwar, Vijay V. Vazirani
**A Simple Characterization for Truth-Revealing Single-Item Auctions.**[Citation Graph (0, 0)][DBLP] WINE, 2005, pp:122-128 [Conf] - Dinesh Garg, Kamal Jain, Kunal Talwar, Vijay V. Vazirani
**A Primal-Dual Algorithm for Computing Fisher Equilibrium in the Absence of Gross Substitutability Property.**[Citation Graph (0, 0)][DBLP] WINE, 2005, pp:24-33 [Conf] - Jittat Fakcharoenphol, Satish Rao, Kunal Talwar
**A tight bound on approximating arbitrary metrics by tree metrics.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2004, v:69, n:3, pp:485-497 [Journal] - Ittai Abraham, Mahesh Balakrishnan, Fabian Kuhn, Dahlia Malkhi, Venugopalan Ramasubramanian, Kunal Talwar
**Reconstructing approximate tree metrics.**[Citation Graph (0, 0)][DBLP] PODC, 2007, pp:43-52 [Conf] - Boaz Barak, Kamalika Chaudhuri, Cynthia Dwork, Satyen Kale, Frank McSherry, Kunal Talwar
**Privacy, accuracy, and consistency too: a holistic solution to contingency table release.**[Citation Graph (0, 0)][DBLP] PODS, 2007, pp:273-282 [Conf] - Kunal Talwar, Udi Wieder
**Balanced allocations: the weighted case.**[Citation Graph (0, 0)][DBLP] STOC, 2007, pp:256-265 [Conf] - Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, Kunal Talwar
**Hardness of routing with congestion in directed graphs.**[Citation Graph (0, 0)][DBLP] STOC, 2007, pp:165-178 [Conf] - Cynthia Dwork, Frank McSherry, Kunal Talwar
**The price of privacy and the limits of LP decoding.**[Citation Graph (0, 0)][DBLP] STOC, 2007, pp:85-94 [Conf] - Shuchi Chawla, Cynthia Dwork, Frank McSherry, Kunal Talwar
**On Privacy-Preserving Histograms.**[Citation Graph (0, 0)][DBLP] UAI, 2005, pp:- [Conf] - Dinesh Garg, Kamal Jain, Kunal Talwar, Vijay V. Vazirani
**A primal-dual algorithm for computing Fisher equilibrium in the absence of gross substitutability property.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2007, v:378, n:2, pp:143-152 [Journal] **Vertex Sparsifiers: New Results from Old Techniques.**[Citation Graph (, )][DBLP]**Improving Integrality Gaps via Chvátal-Gomory Rounding.**[Citation Graph (, )][DBLP]**A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match.**[Citation Graph (, )][DBLP]**Balloon Popping With Applications to Ascending Auctions.**[Citation Graph (, )][DBLP]**Mechanism Design via Differential Privacy.**[Citation Graph (, )][DBLP]**A Constant Approximation Algorithm for the a prioriTraveling Salesman Problem.**[Citation Graph (, )][DBLP]**How to Complete a Doubling Metric.**[Citation Graph (, )][DBLP]**Efficient distributed approximation algorithms via probabilistic tree embeddings.**[Citation Graph (, )][DBLP]**Ultra-low-dimensional embeddings for doubling metrics.**[Citation Graph (, )][DBLP]**Secretary problems: weights and discounts.**[Citation Graph (, )][DBLP]**The (1 + beta)-Choice Process and Weighted Balls-into-Bins.**[Citation Graph (, )][DBLP]**Differentially Private Combinatorial Optimization.**[Citation Graph (, )][DBLP]**Quincy: fair scheduling for distributed computing clusters.**[Citation Graph (, )][DBLP]**On the geometry of differential privacy.**[Citation Graph (, )][DBLP]**Virtual Ring Routing Trends.**[Citation Graph (, )][DBLP]**Hard Instances for Satisfiability and Quasi-one-way Functions.**[Citation Graph (, )][DBLP]**Approximating the Bandwidth of Caterpillars.**[Citation Graph (, )][DBLP]**What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs.**[Citation Graph (, )][DBLP]**How to Complete a Doubling Metric**[Citation Graph (, )][DBLP]**Differentially Private Approximation Algorithms**[Citation Graph (, )][DBLP]**On the Geometry of Differential Privacy**[Citation Graph (, )][DBLP]**Constrained Non-Monotone Submodular Maximization: Offline and Secretary Algorithms**[Citation Graph (, )][DBLP]**Lower Bounds on Near Neighbor Search via Metric Expansion**[Citation Graph (, )][DBLP]**Vertex Sparsifiers: New Results from Old Techniques**[Citation Graph (, )][DBLP]**Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs.**[Citation Graph (, )][DBLP]**Hardness of Low Congestion Routing in Directed Graphs.**[Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.006secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |