|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 39 occurrences of 34 keywords
|
|
|
|
|
Results
Found 65 publication records. Showing 65 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Aditya Bhaskara, Daniel Dadush, Ravishankar Krishnaswamy, Kunal Talwar |
Unconditional differentially private mechanisms for linear queries.  |
STOC  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | 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) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Anupam Gupta, Kunal Talwar |
Making Doubling Metrics Geodesic. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | T.-H. Hubert Chan, Anupam Gupta, Kunal Talwar |
Ultra-low-dimensional embeddings for doubling metrics. |
J. ACM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Englert, Anupam Gupta, Robert Krauthgamer, Harald Räcke, Inbal Talgam-Cohen, Kunal Talwar |
Vertex Sparsifiers: New Results from Old Techniques |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Anupam Gupta, Aaron Roth, Grant Schoenebeck, Kunal Talwar |
Constrained Non-Monotone Submodular Maximization: Offline and Secretary Algorithms |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Rina Panigrahy, Kunal Talwar, Udi Wieder |
Lower Bounds on Near Neighbor Search via Metric Expansion |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Anupam Gupta, Katrina Ligett, Frank McSherry, Aaron Roth, Kunal Talwar |
Differentially Private Combinatorial Optimization. |
SODA |
2010 |
DBLP BibTeX RDF |
|
| 1 | Yuval Peres, Kunal Talwar, Udi Wieder |
The (1 + beta)-Choice Process and Weighted Balls-into-Bins. |
SODA |
2010 |
DBLP BibTeX RDF |
|
| 1 | Anupam Gupta, Aaron Roth, Grant Schoenebeck, Kunal Talwar |
Constrained Non-monotone Submodular Maximization: Offline and Secretary Algorithms. |
WINE |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohit Singh, Kunal Talwar |
Improving Integrality Gaps via Chvátal-Gomory Rounding. |
APPROX-RANDOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Englert, Anupam Gupta, Robert Krauthgamer, Harald Räcke, Inbal Talgam-Cohen, Kunal Talwar |
Vertex Sparsifiers: New Results from Old Techniques. |
APPROX-RANDOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrej Bogdanov, Kunal Talwar, Andrew Wan |
Hard Instances for Satisfiability and Quasi-one-way Functions. |
ICS |
2010 |
DBLP BibTeX RDF |
|
| 1 | Rina Panigrahy, Kunal Talwar, Udi Wieder |
Lower Bounds on Near Neighbor Search via Metric Expansion. |
FOCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew McGregor, Ilya Mironov, Toniann Pitassi, Omer Reingold, Kunal Talwar, Salil P. Vadhan |
The Limits of Two-Party Differential Privacy. |
FOCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Moritz Hardt, Kunal Talwar |
On the geometry of differential privacy. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
privacy, complexity, histogram, geometry, differential privacy, statistical data analysis |
| 1 | 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. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Kamalika Chaudhuri, Satish Rao, Samantha Riesenfeld, Kunal Talwar |
What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs. |
Algorithmica |
2009 |
DBLP DOI BibTeX RDF |
Approximation algorithms, Combinatorial optimization, Matching, Minimum spanning trees |
| 1 | Uriel Feige, Kunal Talwar |
Approximating the Bandwidth of Caterpillars. |
Algorithmica |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Anupam Gupta, Katrina Ligett, Frank McSherry, Aaron Roth, Kunal Talwar |
Differentially Private Approximation Algorithms |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Moritz Hardt, Kunal Talwar |
On the Geometry of Differential Privacy |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Moshe Babaioff, Michael Dinitz, Anupam Gupta, Nicole Immorlica, Kunal Talwar |
Secretary problems: weights and discounts. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Isard, Vijayan Prabhakaran, Jon Currey, Udi Wieder, Kunal Talwar, Andrew Goldberg |
Quincy: fair scheduling for distributed computing clusters. |
SOSP |
2009 |
DBLP DOI BibTeX RDF |
cluster scheduling, dryad, network flow scheduling, mapreduce, fair scheduling |
| 1 | Dahlia Malkhi, Siddhartha Sen, Kunal Talwar, Renato Fonseca F. Werneck, Udi Wieder |
Virtual Ring Routing Trends. |
DISC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jittat Fakcharoenphol, Satish Rao, Kunal Talwar |
Approximating Metric Spaces by Tree Metrics. |
Encyclopedia of Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | T.-H. Hubert Chan, Anupam Gupta, Kunal Talwar |
Ultra-low-dimensional embeddings for doubling metrics. |
SODA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Anupam Gupta, Kunal Talwar |
How to Complete a Doubling Metric. |
LATIN |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | David B. Shmoys, Kunal Talwar |
A Constant Approximation Algorithm for the a prioriTraveling Salesman Problem. |
IPCO |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Maleq Khan, Fabian Kuhn, Dahlia Malkhi, Gopal Pandurangan, Kunal Talwar |
Efficient distributed approximation algorithms via probabilistic tree embeddings. |
PODC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Rina Panigrahy, Kunal Talwar, Udi Wieder |
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | 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) |
2007 |
DBLP BibTeX RDF |
|
| 1 | 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. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Anupam Gupta, Kunal Talwar |
How to Complete a Doubling Metric |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Ittai Abraham, Mahesh Balakrishnan, Fabian Kuhn, Dahlia Malkhi, Venugopalan Ramasubramanian, Kunal Talwar |
Reconstructing approximate tree metrics. |
PODC |
2007 |
DBLP DOI BibTeX RDF |
four-points condition, embeddings, metric spaces, tree metrics |
| 1 | Frank McSherry, Kunal Talwar |
Mechanism Design via Differential Privacy. |
FOCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicole Immorlica, Anna R. Karlin, Mohammad Mahdian, Kunal Talwar |
Balloon Popping With Applications to Ascending Auctions. |
FOCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
privacy, OLAP, contingency table |
| 1 | Kunal Talwar, Udi Wieder |
Balanced allocations: the weighted case. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
balls and bins, the multiple choice paradigm |
| 1 | Cynthia Dwork, Frank McSherry, Kunal Talwar |
The price of privacy and the limits of LP decoding. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
LP decoding, privacy, compressed sensing, basis pursuit |
| 1 | Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, Kunal Talwar |
Hardness of routing with congestion in directed graphs. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
all-or-nothing flow, hardness of approximation, multicommodity flow, edge-disjoint paths, integrality gap, congestion minimization |
| 1 | Venkatesan Guruswami, Kunal Talwar |
Hardness of Low Congestion Routing in Directed Graphs. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Anupam Gupta, Kunal Talwar |
Approximating unique games. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Kamalika Chaudhuri, Satish Rao, Samantha Riesenfeld, Kunal Talwar |
A Push-Relabel Algorithm for Approximating Degree Bounded MSTs. |
ICALP |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Kamal Jain, Aranyak Mehta, Kunal Talwar, Vijay V. Vazirani |
A Simple Characterization for Truth-Revealing Single-Item Auctions. |
WINE |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicole Immorlica, Kamal Jain, Mohammad Mahdian, Kunal Talwar |
Click Fraud Resistant Methods for Learning Click-Through Rates. |
WINE |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Kamal Jain, Mohammad Taghi Hajiaghayi, Kunal Talwar |
The Generalized Deadlock Resolution Problem. |
ICALP |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Shuchi Chawla, Cynthia Dwork, Frank McSherry, Kunal Talwar |
On Privacy-Preserving Histograms. |
UAI |
2005 |
DBLP BibTeX RDF |
|
| 1 | Kamalika Chaudhuri, Satish Rao, Samantha Riesenfeld, Kunal Talwar |
What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs. |
APPROX-RANDOM |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Uriel Feige, Kunal Talwar |
Approximating the Bandwidth of Caterpillars. |
APPROX-RANDOM |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Jittat Fakcharoenphol, Satish Rao, Kunal Talwar |
Approximating metrics by tree metrics. |
SIGACT News |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Jittat Fakcharoenphol, Satish Rao, Kunal Talwar |
A tight bound on approximating arbitrary metrics by tree metrics. |
J. Comput. Syst. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Aaron Archer, Jittat Fakcharoenphol, Chris Harrelson, Robert Krauthgamer, Kunal Talwar, Éva Tardos |
Approximate classification via earthmover metrics. |
SODA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Kunal Talwar |
Bypassing the embedding: algorithms for low dimensional metrics. |
STOC |
2004 |
DBLP DOI BibTeX RDF |
TSP, PTAS, routing schemes, doubling metrics, distance labels |
| 1 | Alex Fabrikant, Christos H. Papadimitriou, Kunal Talwar |
The complexity of pure Nash equilibria. |
STOC |
2004 |
DBLP DOI BibTeX RDF |
PLS-completeness, pure Nash equilibria, complexity, games, local search, congestion games, PLS |
| 1 | Aaron Archer, Christos H. Papadimitriou, Kunal Talwar, Éva Tardos |
An Approximate Truthful Mechanism for Combinatorial Auctions with Single Parameter Agents. |
Internet Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Aaron Archer, Christos H. Papadimitriou, Kunal Talwar, Éva Tardos |
An approximate truthful mechanism for combinatorial auctions with single parameter agents. |
SODA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Jittat Fakcharoenphol, Chris Harrelson, Satish Rao, Kunal Talwar |
An improved approximation algorithm for the 0-extension problem. |
SODA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Kunal Talwar |
The Price of Truth: Frugality in Truthful Mechanisms. |
STACS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Jittat Fakcharoenphol, Kunal Talwar |
An Improved Decomposition Theorem for Graphs Excluding a Fixed Minor. |
RANDOM-APPROX |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Kamalika Chaudhuri, Brighten Godfrey, Satish Rao, Kunal Talwar |
Paths, Trees, and Minimum Latency Tours. |
FOCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Jittat Fakcharoenphol, Satish Rao, Kunal Talwar |
A tight bound on approximating arbitrary metrics by tree metrics. |
STOC |
2003 |
DBLP DOI BibTeX RDF |
metrics, embeddings, tree metrics |
| 1 | Kunal Talwar |
The Single-Sink Buy-at-Bulk LP Has Constant Integrality Gap. |
IPCO |
2002 |
DBLP BibTeX RDF |
|
| 1 | Umesh Shankar, Kunal Talwar, Jeffrey S. Foster, David Wagner |
Detecting Format String Vulnerabilities with Type Qualifiers. |
USENIX Security Symposium |
2001 |
DBLP BibTeX RDF |
|
Displaying result #1 - #65 of 65 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")