| Why and where: A characterization of data provenance P Buneman, S Khanna, T Wang-Chiew International conference on database theory, 316-330, 2001 | 1961 | 2001 |
| Space-efficient online computation of quantile summaries M Greenwald, S Khanna ACM SIGMOD Record 30 (2), 58-66, 2001 | 825 | 2001 |
| A polynomial time approximation scheme for the multiple knapsack problem C Chekuri, S Khanna SIAM Journal on Computing 35 (3), 713-728, 2005 | 798 | 2005 |
| Complexity classifications of Boolean constraint satisfaction problems N Creignou, S Khanna, M Sudan Society for Industrial and Applied Mathematics, 2001 | 584 | 2001 |
| On multidimensional packing problems C Chekuri, S Khanna SIAM journal on computing 33 (4), 837-851, 2004 | 516 | 2004 |
| 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 | 455 | 2014 |
| Data provenance: Some basic issues P Buneman, S Khanna, WC Tan International Conference on Foundations of Software Technology and …, 2000 | 412 | 2000 |
| Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems V Guruswami, S Khanna, R Rajaraman, B Shepherd, M Yannakakis Proceedings of the thirty-first Annual ACM Symposium on Theory of Computing …, 1999 | 347 | 1999 |
| Archiving scientific data P Buneman, S Khanna, K Tajima, WC Tan ACM Transactions on Database Systems (TODS) 29 (1), 2-42, 2004 | 342 | 2004 |
| 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 | 303 | 2002 |
| Randomized pursuit-evasion in a polygonal environment V Isler, S Kannan, S Khanna IEEE Transactions on Robotics 21 (5), 875-884, 2005 | 272 | 2005 |
| 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 | 269 | 1999 |
| The approximability of constraint satisfaction problems S Khanna, M Sudan, L Trevisan, DP Williamson SIAM Journal on Computing 30 (6), 1863-1920, 2001 | 252 | 2001 |
| 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 | 236 | 2004 |
| On syntactic versus computational views of approximability S Khanna, R Motwani, M Sudan, U Vazirani SIAM Journal on Computing 28 (1), 164-191, 1998 | 229 | 1998 |
| Reconstructing strings from random traces T Batu, S Kannan, S Khanna, A McGregor SODA 4, 910-918, 2004 | 200 | 2004 |
| 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 | 199 | 1994 |
| On the communication and streaming complexity of maximum bipartite matching A Goel, M Kapralov, S Khanna Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012 | 198 | 2012 |
| On the hardness of approximating the chromatic number S Khanna, N Linial, S Safra Combinatorica 20 (3), 393-415, 2000 | 186 | 2000 |
| Design networks with bounded pairwise distance Y Dodis, S Khanna Proceedings of the thirty-first annual ACM symposium on Theory of computing …, 1999 | 168 | 1999 |
Chandra ChekuriProfessor of Computer Science, University of Illinois, Urbana-ChampaignVerified email at illinois.edu
