| |
 |      |
                                         |
Note: Links lead to the DBLP on the Web. Sanjeev Khanna 59 Sanjeev Khanna, Joseph Naor , Danny Raz : Control Message Aggregation in Group Communication Protocols. ICALP 2002 : 135-146 58 Peter Buneman , Sanjeev Khanna, Wang Chiew Tan : On Propagation of Deletions and Annotations Through Views. PODS 2002 : 150-158 57 Peter Buneman , Sanjeev Khanna, Keishi Tajima , Wang Chiew Tan : Archiving scientific data. SIGMOD Conference 2002 : 1-12 56 Chandra Chekuri , Sanjeev Khanna: Approximation schemes for preemptive weighted flow time. STOC 2002 : 297-305 55 Chandra Chekuri , Sanjeev Khanna: A PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines. ICALP 2001 : 848-861 54 Peter Buneman , Sanjeev Khanna, Wang Chiew Tan : Why and Where: A Characterization of Data Provenance. ICDT 2001 : 316-330 53 Sanjeev Khanna, Wang Chiew Tan : On Computing Functions with Uncertainty. PODS 2001 52 Michael Greenwald , Sanjeev Khanna: Space-Efficient Online Computation of Quantile Summaries. SIGMOD Conference 2001 51 Chandra Chekuri , Sanjeev Khanna, Joseph Naor , Leonid Zosin : Approximation algorithms for the metric labeling problem via a new linear programming formulation. SODA 2001 : 109-118 50 Chandra Chekuri , Sanjeev Khanna, Joseph Naor : A deterministic algorithm for the cost-distance problem. SODA 2001 : 232-233 49 Chandra Chekuri , Sanjeev Khanna, An Zhu : Algorithms for minimizing weighted flow time. STOC 2001 : 84-93 48 Chandra Chekuri , Sanjeev Khanna: Approximation Schemes for Preemptive Weighted Flow Time. Electronic Colloquium on Computational Complexity (ECCC) 8 (065): (2001) 47 Peter Buneman , Sanjeev Khanna, Wang Chiew Tan : Data Provenance: Some Basic Issues. FSTTCS 2000 : 87-93 46 Venkatesan Guruswami , Sanjeev Khanna: On the Hardness of 4-Coloring a 3-Colorable Graph. IEEE Conference on Computational Complexity 2000 : 188-197 45 Chandra Chekuri , Sanjeev Khanna: A PTAS for the multiple knapsack problem. SODA 2000 : 213-222 44 Leana Golubchik , Sanjeev Khanna, Samir Khuller , Ramakrishna Thurimella , An Zhu : Approximation algorithms for data placement on parallel disks. SODA 2000 : 223-232 43 Sanjeev Khanna, Francis Zane : Watermarking maps: hiding information in structured data. SODA 2000 : 596-605 42 Sanjeev Khanna, Joseph Naor , F. Bruce Shepherd : Directed network design with orientation constraints. SODA 2000 : 663-671 41 Sanjeev Khanna, Nathan Linial , Shmuel Safra : On the Hardness of Approximating the Chromatic Number. Combinatorica 20 (3): 393-415 (2000) 40 Venkatesan Guruswami , Sanjeev Khanna: On the Hardness of 4-coloring a 3-colorable Graph. Electronic Colloquium on Computational Complexity (ECCC) 7 (73): (2000) 39 Sanjeev Khanna, Shiyu Zhou : On Indexed Data Broadcast. JCSS 60 (3): 575-591 (2000) 38 Sanjeev Khanna, Vincenzo Liberatore : On Broadcast Disk Paging. SIAM J. Comput. 29 (5): 1683-1702 (2000) 37 Sanjeev Khanna, Madhu Sudan , Luca Trevisan , David P. Williamson : The Approximability of Constraint Satisfaction Problems. SIAM J. Comput. 30 (6): 1863-1920 (2000) 36 Foto N. Afrati , Evripidis Bampis , Chandra Chekuri , David R. Karger , Claire Kenyon , Sanjeev Khanna, Ioannis Milis , Maurice Queyranne , Martin Skutella , Clifford Stein , Maxim Sviridenko : Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates. FOCS 1999 : 32-44 35 Yevgeniy Dodis , Sanjeev Khanna: Space Time Tradeoffs for Graph Properties. ICALP 1999 : 291-300 34 Matthew Andrews , Sanjeev Khanna, Krishnan Kumaran : Integrated Scheduling of Unicast and Multicast Traffic in an Input-Queued Switch. INFOCOM 1999 : 1144-1151 33 Chandra Chekuri , Sanjeev Khanna: On Multi-Dimensional Packing Problems. SODA 1999 : 185-194 32 Susanne Albers , Sanjeev Arora , Sanjeev Khanna: Page Replacement for General Caching Problems. SODA 1999 : 31-40 31 Yevgeniy Dodis , Venkatesan Guruswami , Sanjeev Khanna: The 2-Catalog Segmentation Problem. SODA 1999 : 897-898 30 Micah Adler , Sanjeev Khanna, Rajmohan Rajaraman , Adi Rosén : Time-Constrained Scheduling of Weighted Packets on Trees and Meshes. SPAA 1999 : 1-12 29 Venkatesan Guruswami , Sanjeev Khanna, Rajmohan Rajaraman , F. Bruce Shepherd , Mihalis Yannakakis : Near-Optimal Hardness Results and Approximation Algorithms for Edge-Disjoint Paths and Related Problems. STOC 1999 : 19-28 28 Yevgeniy Dodis , Sanjeev Khanna: Design Networks with Bounded Pairwise Distance. STOC 1999 : 750-759 27 Alok Aggarwal , Don Coppersmith , Sanjeev Khanna, Rajeev Motwani , Baruch Schieber : The Angular-Metric Traveling Salesman Problem. SIAM J. Comput. 29 (3): 697-711 (1999) 26 Krishnan Kumaran , Sanjeev Khanna: On Wireless Spectrum Estimation and Generalized Graph Coloring. INFOCOM 1998 : 1273-1283 25 Sanjeev Khanna, S. Muthukrishnan , Mike Paterson : On Approximating Rectangle Tiling and Packing. SODA 1998 : 384-393 24 Sanjeev Khanna, Shiyu Zhou : On Indexed Data Broadcast. STOC 1998 : 463-472 23 Sanjeev Khanna, Vincenzo Liberatore : On Broadcast Disk Paging. STOC 1998 : 634-643 22 Sanjeev Khanna, Rajeev Motwani , Randall H. Wilson : On Certificates and Lookahead in Dynamic Graph Problems. Algorithmica 21 (4): 377-394 (1998) 21 Sanjeev Khanna, Rajeev Motwani , Madhu Sudan , Umesh V. Vazirani : On Syntactic versus Computational Views of Approximability. SIAM J. Comput. 28 (1): 164-191 (1998) 20 Sanjeev Khanna, S. Muthukrishnan , Steven Skiena : Efficient Array Partitioning. ICALP 1997 : 616-626 19 Sanjeev Khanna, Madhu Sudan , Luca Trevisan : Constraint Satisfaction: The Approximability of Minimization Problems. IEEE Conference on Computational Complexity 1997 : 282-296 18 Alok Aggarwal , Don Coppersmith , Sanjeev Khanna, Rajeev Motwani , Baruch Schieber : The Angular-Metric Traveling Salesman Problem. SODA 1997 : 221-229 17 Sanjeev Khanna, Madhu Sudan , David P. Williamson : A Complete Classification of the Approximability of Maximization Problems Derived from Boolean Constraint Satisfaction. STOC 1997 : 11-20 16 Sanjeev Khanna, W. Kent Fuchs : A Graph Partitioning Approach to Sequential Diagnosis. IEEE Transactions on Computers 46 (1): 39-47 (1997) 15 Viggo Kann , Sanjeev Khanna, Jens Lagergren , Alessandro Panconesi : On the Hardness of Approximating Max k-Cut and Its Dual. ISTCS 1996 : 61-67 14 Sanjeev Khanna, Rajeev Motwani , Randall H. Wilson : On Certificates and Lookahead in Dynamic Graph Problems. SODA 1996 : 222-231 13 Sanjeev Khanna, Rajeev Motwani : Towards a Syntactic Characterization of PTAS. STOC 1996 : 329-337 12 Sanjeev Khanna, Madhu Sudan : The Optimization Complexity of Constraint Satisfaction Problems. Electronic Colloquium on Computational Complexity (ECCC) 3 (28): (1996) 11 Sanjeev Khanna, Madhu Sudan , David P. Williamson : A Complete Characterization of the Approximability of Maximization Problems Derived from Boolean Constraint Satisfaction. Electronic Colloquium on Computational Complexity (ECCC) 3 (62): (1996) 10 Sanjeev Khanna, Madhu Sudan , Luca Trevisan : Constraint satisfaction: The approximability of minimization problems. Electronic Colloquium on Computational Complexity (ECCC) 3 (64): (1996) 9 Sanjeev Khanna, Rajeev Motwani , Madhu Sudan , Umesh V. Vazirani : On Syntactic versus Computational Views of Approximability. Electronic Colloquium on Computational Complexity (ECCC) 2 (23): (1995) 8 Sanjeev Khanna, W. Kent Fuchs : A Linear Time Algorithm for Sequential Diagnosis in Hypercubes. Journal of Parallel and Distributed Computing 26 (1): 48-53 (1995) 7 Sanjeev Khanna, Rajeev Motwani , Madhu Sudan , Umesh V. Vazirani : On Syntactic versus Computational Views of Approximability. FOCS 1994 : 819-830 6 Sanjeev Khanna, Nathan Linial , Shmuel Safra : On the Hardness of Approximating the Chromatic Number. ISTCS 1993 : 250-260 5 Kurt Maly , Sanjeev Khanna, Ravi Mukkamala , C. Michael Overstreet , Ramesh Yerraballi , Edwin C. Foudriat , B. Madan : Parallel TCP/IP for Multiprocessor Workstations. HPN 1992 : 103-118 4 Kurt Maly , F. Paterra , C. Michael Overstreet , Ravi Mukkamala , Sanjeev Khanna: Concurrent Use of Parallel Communication to Enable Remote Visualization. ICCI 1992 : 449-452 3 Kurt Maly , Sanjeev Khanna, C. Michael Overstreet , Ravi Mukkamala , Mohammad Zubair , Y. S. Sekhar : Multiprocessor Architectures for High Speed Networks: A Performance Study. IFIP Congress (1) 1992 : 645-651 2 Sanjeev Khanna: Logic Programming for Software Verification and Testing. The Computer Journal 34 (4): 350-357 (1991) 1 Sanjeev Khanna: Logic Programming for Software Testing. ICCI 1990 : 225-234  DiSC'03 © 2003 Association for Computing Machinery |
