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 × Czech Republic
1 × Finland
1 × France
1 × Iceland
1 × Italy
1 × United Kingdom
13 × USA
2 × Canada
2 × Spain
3 × Greece
Collaborated with:
C.Chekuri J.Chuzhoy F.B.Shepherd W.C.Tan Y.Dodis S.Roy A.Goel P.Buneman M.Greenwald J.Naor V.Liberatore S.Zhou R.Motwani S.B.Davidson V.Guruswami J.Hsu A.Roth V.Tannen M.Kapralov T.Chakraborty A.Björklund T.Husfeldt D.Raz A.Zhu S.Muthukrishnan S.Skiena M.Sudan D.P.Williamson Z.Bao K.Talwar A.Kumar K.Tajima T.Milo D.Panigrahi R.Rajaraman M.Yannakakis K.Mamouras M.Raghothaman R.Alur Z.G.Ives S.Guha E.Halperin G.Kortsarz
Talks about:
problem (7) time (6) flow (6) approxim (5) graph (5) hard (5) direct (4) cut (4) algorithm (3) network (3)

Person: Sanjeev Khanna

DBLP DBLP: Khanna:Sanjeev

Contributed to:

LATA 20142014
ICALP (1) 20122012
PODS 20112011
VLDB 20112011
SIGMOD 20102010
STOC 20102010
ICALP (1) 20082008
STOC 20082008
STOC 20072007
STOC 20062006
STOC 20052005
ICALP 20042004
PODS 20042004
STOC 20042004
ICALP 20022002
PODS 20022002
SIGMOD 20022002
STOC 20022002
ICALP 20012001
PODS 20012001
STOC 20012001
ICALP 19991999
STOC 19991999
STOC 19981998
ICALP 19971997
STOC 19971997
STOC 19961996
PLDI 20172017

Wrote 34 papers:

LATA-2014-Khanna #random
Matchings, Random Walks, and Sampling (SK), pp. 32–33.
ICALP-v1-2012-HsuKR #distributed
Distributed Private Heavy Hitters (JH, SK, AR), pp. 461–472.
PODS-2011-DavidsonKMPR #privacy
Provenance views for module privacy (SBD, SK, TM, DP, SR), pp. 175–186.
VLDB-2011-KhannaRT #database #difference #probability #query
Queries with Difference on Probabilistic Databases (SK, SR, VT), pp. 1051–1062.
SIGMOD-2010-BaoDKR #using #workflow
An optimal labeling scheme for workflow provenance using skeleton labels (ZB, SBD, SK, SR), pp. 711–722.
STOC-2010-GoelKK #graph
Perfect matchings in o(n log n) time in regular bipartite graphs (AG, MK, SK), pp. 39–46.
ICALP-A-2008-ChekuriK #algorithm #problem
Algorithms for 2-Route Cut Problems (CC, SK), pp. 472–484.
STOC-2008-ChakrabortyCK #design #network
Network design for vertex connectivity (TC, JC, SK), pp. 167–176.
STOC-2007-ChuzhoyGKT #graph
Hardness of routing with congestion in directed graphs (JC, VG, SK, KT), pp. 165–178.
STOC-2007-ChuzhoyK #polynomial #problem
Polynomial flow-cut gaps and hardness of directed cut problems (JC, SK), pp. 179–188.
STOC-2006-ChekuriKS #constant #graph
Edge-disjoint paths in Planar graphs with constant congestion (CC, SK, FBS), pp. 757–766.
STOC-2006-ChuzhoyK #graph #problem
Hardness of cut problems in directed graphs (JC, SK), pp. 527–536.
STOC-2005-ChekuriKS #multi #problem
Multicommodity flow, well-linked terminals, and routing problems (CC, SK, FBS), pp. 183–192.
ICALP-2004-BjorklundHK #approximate
Approximating Longest Directed Paths and Cycles (AB, TH, SK), pp. 222–233.
PODS-2004-GreenwaldK #network #statistics
Power-Conserving Computation of Order-Statistics over Sensor Networks (MG, SK), pp. 275–285.
STOC-2004-ChekuriGKK #multi #scheduling
Multi-processor scheduling to minimize flow time with epsilon resource augmentation (CC, AG, SK, AK), pp. 363–372.
STOC-2004-ChekuriKS #multi #problem
The all-or-nothing multicommodity flow problem (CC, SK, FBS), pp. 156–165.
STOC-2004-ChuzhoyGHKKN #approximate #symmetry
Asymmetric k-center is log* n-hard to approximate (JC, SG, EH, SK, GK, JN), pp. 21–27.
ICALP-2002-KhannaNR #communication #protocol
Control Message Aggregation in Group Communication Protocols (SK, JN, DR), pp. 135–146.
PODS-2002-BunemanKT #on the
On Propagation of Deletions and Annotations Through Views (PB, SK, WCT), pp. 150–158.
Archiving scientific data (PB, SK, KT, WCT), pp. 1–12.
STOC-2002-ChekuriK #approximate
Approximation schemes for preemptive weighted flow time (CC, SK), pp. 297–305.
A PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines (CC, SK), pp. 848–861.
PODS-2001-KhannaT #nondeterminism #on the
On Computing Functions with Uncertainty (SK, WCT).
STOC-2001-ChekuriKZ #algorithm
Algorithms for minimizing weighted flow time (CC, SK, AZ), pp. 84–93.
ICALP-1999-DodisK #graph #trade-off
Space Time Tradeoffs for Graph Properties (YD, SK), pp. 291–300.
STOC-1999-DodisK #bound #design #distance #network
Design Networks with Bounded Pairwise Distance (YD, SK), pp. 750–759.
STOC-1999-GuruswamiKRSY #algorithm #approximate #problem
Near-Optimal Hardness Results and Approximation Algorithms for Edge-Disjoint Paths and Related Problems (VG, SK, RR, FBS, MY), pp. 19–28.
STOC-1998-KhannaL #on the
On Broadcast Disk Paging (SK, VL), pp. 634–643.
STOC-1998-KhannaZ #on the
On Indexed Data Broadcast (SK, SZ), pp. 463–472.
ICALP-1997-KhannaMS #array #clustering #performance
Efficient Array Partitioning (SK, SM, SS), pp. 616–626.
STOC-1997-KhannaSW #classification #constraints #problem
A Complete Classification of the Approximability of Maximization Problems Derived from Boolean Constraint Satisfaction (SK, MS, DPW), pp. 11–20.
STOC-1996-KhannaM #towards
Towards a Syntactic Characterization of PTAS (SK, RM), pp. 329–337.
PLDI-2017-MamourasRAIK #composition #evaluation #named #performance #query #specification #streaming
StreamQRE: modular specification and efficient evaluation of quantitative queries over streaming data (KM, MR, RA, ZGI, SK), pp. 693–708.

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.