The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Kunal Talwar: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. Uriel Feige, Kunal Talwar
    Approximating the Bandwidth of Caterpillars. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2005, pp:62-73 [Conf]
  3. 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]
  4. 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]
  5. Kamal Jain, Mohammad Taghi Hajiaghayi, Kunal Talwar
    The Generalized Deadlock Resolution Problem. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:853-865 [Conf]
  6. Kunal Talwar
    The Single-Sink Buy-at-Bulk LP Has Constant Integrality Gap. [Citation Graph (0, 0)][DBLP]
    IPCO, 2002, pp:475-486 [Conf]
  7. 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]
  8. 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]
  9. 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]
  10. 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]
  11. Anupam Gupta, Kunal Talwar
    Approximating unique games. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:99-106 [Conf]
  12. Kunal Talwar
    The Price of Truth: Frugality in Truthful Mechanisms. [Citation Graph (0, 0)][DBLP]
    STACS, 2003, pp:608-619 [Conf]
  13. Alex Fabrikant, Christos H. Papadimitriou, Kunal Talwar
    The complexity of pure Nash equilibria. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:604-612 [Conf]
  14. 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]
  15. Kunal Talwar
    Bypassing the embedding: algorithms for low dimensional metrics. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:281-290 [Conf]
  16. 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]
  17. 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]
  18. 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]
  19. 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]
  20. 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]
  21. 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]
  22. Kunal Talwar, Udi Wieder
    Balanced allocations: the weighted case. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:256-265 [Conf]
  23. 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]
  24. 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]
  25. Shuchi Chawla, Cynthia Dwork, Frank McSherry, Kunal Talwar
    On Privacy-Preserving Histograms. [Citation Graph (0, 0)][DBLP]
    UAI, 2005, pp:- [Conf]
  26. 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]

  27. Vertex Sparsifiers: New Results from Old Techniques. [Citation Graph (, )][DBLP]


  28. Improving Integrality Gaps via Chvátal-Gomory Rounding. [Citation Graph (, )][DBLP]


  29. A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match. [Citation Graph (, )][DBLP]


  30. Balloon Popping With Applications to Ascending Auctions. [Citation Graph (, )][DBLP]


  31. Mechanism Design via Differential Privacy. [Citation Graph (, )][DBLP]


  32. A Constant Approximation Algorithm for the a prioriTraveling Salesman Problem. [Citation Graph (, )][DBLP]


  33. How to Complete a Doubling Metric. [Citation Graph (, )][DBLP]


  34. Efficient distributed approximation algorithms via probabilistic tree embeddings. [Citation Graph (, )][DBLP]


  35. Ultra-low-dimensional embeddings for doubling metrics. [Citation Graph (, )][DBLP]


  36. Secretary problems: weights and discounts. [Citation Graph (, )][DBLP]


  37. The (1 + beta)-Choice Process and Weighted Balls-into-Bins. [Citation Graph (, )][DBLP]


  38. Differentially Private Combinatorial Optimization. [Citation Graph (, )][DBLP]


  39. Quincy: fair scheduling for distributed computing clusters. [Citation Graph (, )][DBLP]


  40. On the geometry of differential privacy. [Citation Graph (, )][DBLP]


  41. Virtual Ring Routing Trends. [Citation Graph (, )][DBLP]


  42. Hard Instances for Satisfiability and Quasi-one-way Functions. [Citation Graph (, )][DBLP]


  43. Approximating the Bandwidth of Caterpillars. [Citation Graph (, )][DBLP]


  44. What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs. [Citation Graph (, )][DBLP]


  45. How to Complete a Doubling Metric [Citation Graph (, )][DBLP]


  46. Differentially Private Approximation Algorithms [Citation Graph (, )][DBLP]


  47. On the Geometry of Differential Privacy [Citation Graph (, )][DBLP]


  48. Constrained Non-Monotone Submodular Maximization: Offline and Secretary Algorithms [Citation Graph (, )][DBLP]


  49. Lower Bounds on Near Neighbor Search via Metric Expansion [Citation Graph (, )][DBLP]


  50. Vertex Sparsifiers: New Results from Old Techniques [Citation Graph (, )][DBLP]


  51. Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs. [Citation Graph (, )][DBLP]


  52. Hardness of Low Congestion Routing in Directed Graphs. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002