Sanjeev Khanna
Sanjeev Khanna
Henry Salvatori Professor of Computer Science, University of Pennsylvania
Verified email at - Homepage
Cited by
Cited by
Why and where: A characterization of data provenance
P Buneman, S Khanna, T Wang-Chiew
International conference on database theory, 316-330, 2001
Handbook of scheduling: algorithms, models, and performance analysis
JYT Leung
CRC press, 2004
Space-efficient online computation of quantile summaries
M Greenwald, S Khanna
ACM SIGMOD Record 30 (2), 58-66, 2001
A polynomial time approximation scheme for the multiple knapsack problem
C Chekuri, S Khanna
SIAM Journal on Computing 35 (3), 713-728, 2005
Complexity classifications of Boolean constraint satisfaction problems
N Creignou, S Khanna, M Sudan
Society for Industrial and Applied Mathematics, 2001
Data provenance: Some basic issues
P Buneman, S Khanna, WC Tan
International Conference on Foundations of Software Technology and …, 2000
Archiving scientific data
P Buneman, S Khanna, K Tajima, WC Tan
ACM Transactions on Database Systems (TODS) 29 (1), 2-42, 2004
Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
V Guruswami, S Khanna, R Rajaraman, B Shepherd, M Yannakakis
Journal of Computer and System Sciences 67 (3), 473-496, 2003
On propagation of deletions and annotations through views
P Buneman, S Khanna, WC Tan
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on …, 2002
On the hardness of approximating the chromatic number
S Khanna, N Linial, S Safra
Combinatorica 20 (3), 393-415, 2000
Randomized pursuit-evasion in a polygonal environment
V Isler, S Kannan, S Khanna
IEEE Transactions on Robotics 21 (5), 875-884, 2005
Differential privacy: An economic method for choosing epsilon
J Hsu, M Gaboardi, A Haeberlen, S Khanna, A Narayan, BC Pierce, ...
2014 IEEE 27th Computer Security Foundations Symposium, 398-410, 2014
Approximation schemes for minimizing average weighted completion time with release dates
F Afrati, E Bampis, C Chekuri, D Karger, C Kenyon, S Khanna, I Milis, ...
40th Annual Symposium on Foundations of Computer Science (Cat. No. 99CB37039 …, 1999
On multi-dimensional packing problems
C Chekuri, S Khanna
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms …, 1999
On multidimensional packing problems
C Chekuri, S Khanna
SIAM journal on computing 33 (4), 837-851, 2004
Power-conserving computation of order-statistics over sensor networks
MB Greenwald, S Khanna
Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on …, 2004
The approximability of constraint satisfaction problems
S Khanna, M Sudan, L Trevisan, DP Williamson
SIAM Journal on Computing 30 (6), 1863-1920, 2001
On syntactic versus computational views of approximability
S Khanna, R Motwani, M Sudan, U Vazirani
SIAM Journal on Computing 28 (1), 164-191, 1998
On syntactic versus computational views of approximability
S Khanna, R Motwani, M Sudan, U Vazirani
Proceedings 35th annual symposium on foundations of computer science, 819-830, 1994
Approximation algorithms for the metric labeling problem via a new linear programming formulation
C Chekuri, S Khanna, J Naor, L Zosin
The system can't perform the operation now. Try again later.
Articles 1–20