Kunal Talwar, Ph.D. - Publications
Affiliations: | 2004 | University of California, Berkeley, Berkeley, CA, United States |
Area:
Biosystems & Computational Biology (BIO); Database Management Systems (DBMS); Theory (THY)Year | Citation | Score | |||
---|---|---|---|---|---|
2016 | Nikolov A, Talwar K, Zhang L. The geometry of differential privacy: The small database and approximate cases Siam Journal On Computing. 45: 575-616. DOI: 10.1137/130938943 | 0.343 | |||
2015 | Dwork C, Nikolov A, Talwar K. Efficient Algorithms for Privately Releasing Marginals via Convex Relaxations Discrete and Computational Geometry. 53: 650-673. DOI: 10.1007/S00454-015-9678-X | 0.321 | |||
2014 | Englert M, Gupta A, Krauthgamer R, R̈acke H, Talgam-Cohen I, Talwar K. Vertex sparsifiers: New results from old techniques Siam Journal On Computing. 43: 1239-1262. DOI: 10.1137/130908440 | 0.301 | |||
2012 | Khan M, Kuhn F, Malkhi D, Pandurangan G, Talwar K. Efficient distributed approximation algorithms via probabilistic tree embeddings Distributed Computing. 25: 189-205. DOI: 10.1007/S00446-012-0157-9 | 0.405 | |||
2011 | Gupta A, Talwar K. Making doubling metrics geodesic Algorithmica (New York). 59: 66-80. DOI: 10.1007/S00453-010-9397-X | 0.353 | |||
2010 | Andrews M, Chuzhoy J, Guruswami V, Khanna S, Talwar K, Zhang L. Inapproximability of Edge-Disjoint Paths and Low Congestion Routing on Undirected Graphs Combinatorica. 30: 485-520. DOI: 10.1007/S00493-010-2455-9 | 0.332 | |||
2004 | Archer A, Papadimitriou C, Talwar K, Tardos E. An approximate truthful mechanism for combinatorial auctions with single parameter agents Internet Mathematics. 1: 129-150. DOI: 10.1080/15427951.2004.10129086 | 0.47 | |||
2004 | Fakcharoenphol J, Rao S, Talwar K. A tight bound on approximating arbitrary metrics by tree metrics Journal of Computer and System Sciences. 69: 485-497. DOI: 10.1016/J.Jcss.2004.04.011 | 0.357 | |||
2004 | Fabrikant A, Papadimitriou C, Talwar K. The complexity of pure Nash equilibria Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 604-612. | 0.516 | |||
Show low-probability matches. |