BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × China
1 × Denmark
1 × Italy
1 × Portugal
8 × USA
Collaborated with:
U.Wieder A.Gupta C.Dwork L.Zhang S.Rao M.Hardt F.McSherry K.Chaudhuri D.Witmer A.Nikolov K.Jain M.T.Hajiaghayi A.Fabrikant C.H.Papadimitriou J.Fakcharoenphol A.Thakurta A.Bhaskara D.Dadush R.Krishnaswamy J.Chuzhoy V.Guruswami S.Khanna S.Riesenfeld I.Abraham C.Gavoille O.Neiman M.Isard V.Prabhakaran J.Currey A.Goldberg B.Barak S.Kale
Talks about:
privaci (5) bound (4) differenti (3) algorithm (3) approxim (3) metric (3) graph (3) case (3) geometri (2) balanc (2)

Person: Kunal Talwar

DBLP DBLP: Talwar:Kunal

Contributed to:

ICALP (1) 20142014
STOC 20142014
STOC 20132013
STOC 20122012
STOC 20102010
SOSP 20092009
PODS 20072007
STOC 20072007
ICALP (1) 20062006
ICALP 20052005
STOC 20042004
STOC 20032003

Wrote 18 papers:

ICALP-v1-2014-GuptaTW #multi #optimisation
Changing Bases: Multistage Optimization for Matroids and Matchings (AG, KT, UW), pp. 563–575.
ICALP-v1-2014-TalwarW #proving
Balanced Allocations: A Simple Proof for the Heavily Loaded Case (KT, UW), pp. 979–990.
STOC-2014-AbrahamGGNT #composition #graph
Cops, robbers, and threatening skeletons: padded decomposition for minor-free graphs (IA, CG, AG, ON, KT), pp. 79–88.
STOC-2014-DworkTT0 #analysis #bound #component #privacy
Analyze gauss: optimal bounds for privacy-preserving principal component analysis (CD, KT, AT, LZ), pp. 11–20.
STOC-2013-GuptaTW #algorithm #bound #graph
Sparsest cut on bounded treewidth graphs: algorithms and hardness results (AG, KT, DW), pp. 281–290.
STOC-2013-NikolovTZ #approximate #difference #geometry #privacy
The geometry of differential privacy: the sparse and approximate cases (AN, KT, LZ), pp. 351–360.
STOC-2012-BhaskaraDKT #linear #query
Unconditional differentially private mechanisms for linear queries (AB, DD, RK, KT), pp. 1269–1284.
STOC-2010-HardtT #difference #geometry #on the #privacy
On the geometry of differential privacy (MH, KT), pp. 705–714.
SOSP-2009-IsardPCWTG #clustering #distributed #named #scheduling
Quincy: fair scheduling for distributed computing clusters (MI, VP, JC, UW, KT, AG), pp. 261–276.
PODS-2007-BarakCDKMT #consistency #privacy
Privacy, accuracy, and consistency too: a holistic solution to contingency table release (BB, KC, CD, SK, FM, KT), pp. 273–282.
STOC-2007-ChuzhoyGKT #graph
Hardness of routing with congestion in directed graphs (JC, VG, SK, KT), pp. 165–178.
STOC-2007-DworkMT #privacy
The price of privacy and the limits of LP decoding (CD, FM, KT), pp. 85–94.
Balanced allocations: the weighted case (KT, UW), pp. 256–265.
ICALP-v1-2006-ChaudhuriRRT #algorithm #approximate #bound
A Push-Relabel Algorithm for Approximating Degree Bounded MSTs (KC, SR, SR, KT), pp. 191–201.
ICALP-2005-JainHT #concurrent #problem
The Generalized Deadlock Resolution Problem (KJ, MTH, KT), pp. 853–865.
STOC-2004-FabrikantPT #complexity #nash
The complexity of pure Nash equilibria (AF, CHP, KT), pp. 604–612.
STOC-2004-Talwar #algorithm #metric
Bypassing the embedding: algorithms for low dimensional metrics (KT), pp. 281–290.
STOC-2003-FakcharoenpholRT #approximate #bound #metric
A tight bound on approximating arbitrary metrics by tree metrics (JF, SR, KT), pp. 448–455.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.