| |
      |
                                          |
Note: Links lead to the DBLP on the Web. Sanjeev Khanna Klaus Jansen , Sanjeev Khanna, José D. P. Rolim , Dana Ron : Approximation, Randomization, and Combinatorial Optimization, Algorithms and Techniques, 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004, and 8th International Workshop on Randomization and Computation, RANDOM 2004, Cambridge, MA, USA, August 22-24, 2004, Proceedings Springer 2004 Chandra Chekuri , Sanjeev Khanna, F. Bruce Shepherd : Edge-Disjoint Paths in Planar Graphs. FOCS 2004 : 71-80 Julia Chuzhoy , Sudipto Guha , Sanjeev Khanna, Joseph Naor : Machine Minimization for Scheduling Jobs with Interval Constraints. FOCS 2004 : 81-90 Andreas Björklund , Thore Husfeldt , Sanjeev Khanna: Approximating Longest Directed Paths and Cycles. ICALP 2004 : 222-233 Carl A. Gunter , Sanjeev Khanna, Kaijun Tan , Santosh S. Venkatesh : DoS Protection for Reliably Authenticated Broadcast. NDSS 2004 Michael Greenwald , Sanjeev Khanna: Power-Conserving Computation of Order-Statistics over Sensor Networks. PODS 2004 : 275-285 Volkan Isler , Sampath Kannan , Sanjeev Khanna: Randomized pursuit-evasion with limited visibility. SODA 2004 : 1060-1069 Tugkan Batu , Sampath Kannan , Sanjeev Khanna, Andrew McGregor : Reconstructing strings from random traces. SODA 2004 : 910-918 Chandra Chekuri , Sanjeev Khanna, F. Bruce Shepherd : The all-or-nothing multicommodity flow problem. STOC 2004 : 156-165 Julia Chuzhoy , Sudipto Guha , Eran Halperin , Sanjeev Khanna, Guy Kortsarz , Joseph Naor : Asymmetric k-center is log * n -hard to approximate. STOC 2004 : 21-27 Chandra Chekuri , Ashish Goel , Sanjeev Khanna, Amit Kumar : Multi-processor scheduling to minimize flow time with epsilon resource augmentation. STOC 2004 : 363-372 Stanislav Angelov , Sanjeev Khanna, Li Li , Fernando Pereira : ATDD: An Algorithmic Tool for Domain Discovery in Protein Sequences. WABI 2004 : 206-217 Stanislav Angelov , Boulos Harb , Sampath Kannan , Sanjeev Khanna, Junhyong Kim , Li-San Wang : Genome Identification and Classification by Short Oligo Arrays. WABI 2004 : 400-411 Peter Buneman , Sanjeev Khanna, Keishi Tajima , Wang Chiew Tan : Archiving scientific data. ACM Trans. Database Syst. 29 : 2-42 (2004) Chandra Chekuri , Sanjeev Khanna: On Multidimensional Packing Problems. SIAM J. Comput. 33 (4): 837-851 (2004) Sampath Kannan , Sanjeev Khanna: Selection with monotone comparison cost. SODA 2003 : 10-17 Chandra Chekuri , Sanjeev Khanna: Edge disjoint paths revisited. SODA 2003 : 628-637 Micah Adler , Sanjeev Khanna, Rajmohan Rajaraman , Adi Rosén : Time-Constrained Scheduling of Weighted Packets on Trees and Meshes. Algorithmica 36 (2): 123-152 (2003) Andreas Björklund , Thore Husfeldt , Sanjeev Khanna: Approximating Longest Directed Path Electronic Colloquium on Computational Complexity (ECCC) 10 (032): (2003) Julia Chuzhoy , Sudipto Guha , Sanjeev Khanna, Joseph Naor : Asymmetric k-center is log * n-hard to Approximate Electronic Colloquium on Computational Complexity (ECCC) (038): (2003) 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. J. Comput. Syst. Sci. 67 (3): 473-496 (2003) Sanjeev Khanna, Joseph Naor , Danny Raz : Control Message Aggregation in Group Communication Protocols. ICALP 2002 : 135-146 Peter Buneman , Sanjeev Khanna, Wang Chiew Tan : On Propagation of Deletions and Annotations Through Views. PODS 2002 : 150-158 Peter Buneman , Sanjeev Khanna, Keishi Tajima , Wang Chiew Tan : Archiving scientific data. SIGMOD Conference 2002 : 1-12 Chandra Chekuri , Sanjeev Khanna: Approximation schemes for preemptive weighted flow time. STOC 2002 : 297-305 Sanjeev Khanna: Guest Editor's Foreword. J. Comput. Syst. Sci. 64 (4): 749 (2002) Chandra Chekuri , Sanjeev Khanna: A PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines. ICALP 2001 : 848-861 Peter Buneman , Sanjeev Khanna, Wang Chiew Tan : Why and Where: A Characterization of Data Provenance. ICDT 2001 : 316-330 Maria Adamou , Sanjeev Khanna, Insup Lee , Insik Shin , Shiyu Zhou : Fair Real-Time Traffic Scheduling over a Wireless LA. IEEE Real-Time Systems Symposium 2001 : 279-288 Sanjeev Khanna, Wang Chiew Tan : On Computing Functions with Uncertainty. PODS 2001 Michael Greenwald , Sanjeev Khanna: Space-Efficient Online Computation of Quantile Summaries. SIGMOD Conference 2001 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 Chandra Chekuri , Sanjeev Khanna, Joseph Naor : A deterministic algorithm for the cost-distance problem. SODA 2001 : 232-233 Chandra Chekuri , Sanjeev Khanna, An Zhu : Algorithms for minimizing weighted flow time. STOC 2001 : 84-93 Chandra Chekuri , Sanjeev Khanna: Approximation Schemes for Preemptive Weighted Flow Time Electronic Colloquium on Computational Complexity (ECCC) 8 (065): (2001) Peter Buneman , Sanjeev Khanna, Wang Chiew Tan : Data Provenance: Some Basic Issues. FSTTCS 2000 : 87-93 Venkatesan Guruswami , Sanjeev Khanna: On the Hardness of 4-Coloring a 3-Colorable Graph. IEEE Conference on Computational Complexity 2000 : 188-197 Chandra Chekuri , Sanjeev Khanna: A PTAS for the multiple knapsack problem. SODA 2000 : 213-222 Leana Golubchik , Sanjeev Khanna, Samir Khuller , Ramakrishna Thurimella , An Zhu : Approximation algorithms for data placement on parallel disks. SODA 2000 : 223-232 Sanjeev Khanna, Francis Zane : Watermarking maps: hiding information in structured data. SODA 2000 : 596-605 Sanjeev Khanna, Joseph Naor , F. Bruce Shepherd : Directed network design with orientation constraints. SODA 2000 : 663-671 Sanjeev Khanna, Nathan Linial , Shmuel Safra : On the Hardness of Approximating the Chromatic Number. Combinatorica 20 (3): 393-415 (2000) Venkatesan Guruswami , Sanjeev Khanna: On the Hardness of 4-coloring a 3-colorable Graph Electronic Colloquium on Computational Complexity (ECCC) 7 (73): (2000) Sanjeev Khanna, Shiyu Zhou : On Indexed Data Broadcast J. Comput. Syst. Sci. 60 (3): 575-591 (2000) Sanjeev Khanna, Vincenzo Liberatore : On Broadcast Disk Paging. SIAM J. Comput. 29 (5): 1683-1702 (2000) Sanjeev Khanna, Madhu Sudan , Luca Trevisan , David P. Williamson : The Approximability of Constraint Satisfaction Problems. SIAM J. Comput. 30 (6): 1863-1920 (2000) 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 Yevgeniy Dodis , Sanjeev Khanna: Space Time Tradeoffs for Graph Properties. ICALP 1999 : 291-300 Matthew Andrews , Sanjeev Khanna, Krishnan Kumaran : Integrated Scheduling of Unicast and Multicast Traffic in an Input-Queued Switch. INFOCOM 1999 : 1144-1151 Chandra Chekuri , Sanjeev Khanna: On Multi-Dimensional Packing Problems. SODA 1999 : 185-194 Susanne Albers , Sanjeev Arora , Sanjeev Khanna: Page Replacement for General Caching Problems. SODA 1999 : 31-40 Yevgeniy Dodis , Venkatesan Guruswami , Sanjeev Khanna: The 2-Catalog Segmentation Problem. SODA 1999 : 897-898 Micah Adler , Sanjeev Khanna, Rajmohan Rajaraman , Adi Rosén : Time-Constrained Scheduling of Weighted Packets on Trees and Meshes. SPAA 1999 : 1-12 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 Yevgeniy Dodis , Sanjeev Khanna: Design Networks with Bounded Pairwise Distance. STOC 1999 : 750-759 Alok Aggarwal , Don Coppersmith , Sanjeev Khanna, Rajeev Motwani , Baruch Schieber : The Angular-Metric Traveling Salesman Problem. SIAM J. Comput. 29 (3): 697-711 (1999) Krishnan Kumaran , Sanjeev Khanna: On Wireless Spectrum Estimation and Generalized Graph Coloring. INFOCOM 1998 : 1273-1283 Sanjeev Khanna, S. Muthukrishnan , Mike Paterson : On Approximating Rectangle Tiling and Packing. SODA 1998 : 384-393 Sanjeev Khanna, Shiyu Zhou : On Indexed Data Broadcast. STOC 1998 : 463-472 Sanjeev Khanna, Vincenzo Liberatore : On Broadcast Disk Paging. STOC 1998 : 634-643 Sanjeev Khanna, Rajeev Motwani , Randall H. Wilson : On Certificates and Lookahead in Dynamic Graph Problems. Algorithmica 21 (4): 377-394 (1998) Sanjeev Khanna, Rajeev Motwani , Madhu Sudan , Umesh V. Vazirani : On Syntactic versus Computational Views of Approximability. SIAM J. Comput. 28 (1): 164-191 (1998) Sanjeev Khanna, S. Muthukrishnan , Steven Skiena : Efficient Array Partitioning. ICALP 1997 : 616-626 Sanjeev Khanna, Madhu Sudan , Luca Trevisan : Constraint Satisfaction: The Approximability of Minimization Problems. IEEE Conference on Computational Complexity 1997 : 282-296 Alok Aggarwal , Don Coppersmith , Sanjeev Khanna, Rajeev Motwani , Baruch Schieber : The Angular-Metric Traveling Salesman Problem. SODA 1997 : 221-229 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 Viggo Kann , Sanjeev Khanna, Jens Lagergren , Alessandro Panconesi : On the Hardness of Approximating Max k-Cut and its Dual. Chicago J. Theor. Comput. Sci. 1997 : (1997) Sanjeev Khanna, W. Kent Fuchs : A Graph Partitioning Approach to Sequential Diagnosis. IEEE Trans. Computers 46 (1): 39-47 (1997) Viggo Kann , Sanjeev Khanna, Jens Lagergren , Alessandro Panconesi : On the Hardness of Approximating Max k-Cut and Its Dual. ISTCS 1996 : 61-67 Sanjeev Khanna, Rajeev Motwani , Randall H. Wilson : On Certificates and Lookahead in Dynamic Graph Problems. SODA 1996 : 222-231 Sanjeev Khanna, Rajeev Motwani : Towards a Syntactic Characterization of PTAS. STOC 1996 : 329-337 Sanjeev Khanna, Madhu Sudan : The Optimization Complexity of Constraint Satisfaction Problems Electronic Colloquium on Computational Complexity (ECCC) 3 (28): (1996) 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) Sanjeev Khanna, Madhu Sudan , Luca Trevisan : Constraint satisfaction: The approximability of minimization problems. Electronic Colloquium on Computational Complexity (ECCC) 3 (64): (1996) 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) Sanjeev Khanna, W. Kent Fuchs : A Linear Time Algorithm for Sequential Diagnosis in Hypercubes. J. Parallel Distrib. Comput. 26 (1): 48-53 (1995) Sanjeev Khanna, Rajeev Motwani , Madhu Sudan , Umesh V. Vazirani : On Syntactic versus Computational Views of Approximability FOCS 1994 : 819-830 Sanjeev Khanna, Nathan Linial , Shmuel Safra : On the Hardness of Approximating the Chromatic Number. ISTCS 1993 : 250-260 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 Kurt Maly , F. Paterra , C. Michael Overstreet , Ravi Mukkamala , Sanjeev Khanna: Concurrent Use of Parallel Communication to Enable Remote Visualization. ICCI 1992 : 449-452 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 Sanjeev Khanna: Logic Programming for Software Verification and Testing. Comput. J. 34 (4): 350-357 (1991) Sanjeev Khanna: Logic Programming for Software Testing. ICCI 1990 : 225-234 1 [ 55 ] 2 [ 31 ] [ 66 ] 3 [ 37 ] 4 [ 19 ] [ 28 ] 5 [ 33 ] 6 [ 35 ] 7 [ 71 ] [ 72 ] 8 [ 33 ] 9 [ 37 ] 10 [ 76 ] 11 [ 65 ] [ 80 ] 12 [ 48 ] [ 56 ] [ 60 ] [ 61 ] [ 70 ] 13 [ 34 ] [ 37 ] [ 46 ] [ 49 ] [ 50 ] [ 51 ] [ 52 ] [ 57 ] [ 59 ] [ 67 ] [ 69 ] [ 73 ] [ 75 ] [ 82 ] 14 [ 64 ] [ 74 ] [ 81 ] 15 [ 19 ] [ 28 ] 16 [ 29 ] [ 32 ] [ 36 ] 17 [ 5 ] 18 [ 8 ] [ 16 ] 19 [ 73 ] 20 [ 45 ] 21 [ 53 ] [ 78 ] 22 [ 64 ] [ 74 ] [ 81 ] 23 [ 79 ] 24 [ 30 ] [ 32 ] [ 41 ] [ 47 ] [ 63 ] 25 [ 74 ] 26 [ 71 ] 27 [ 65 ] [ 80 ] 28 [ 77 ] 29 [ 83 ] 30 [ 15 ] [ 17 ] 31 [ 68 ] [ 71 ] [ 76 ] [ 77 ] 32 [ 37 ] 33 [ 37 ] 34 [ 45 ] 35 [ 71 ] 36 [ 74 ] 37 [ 73 ] 38 [ 27 ] [ 35 ] 39 [ 15 ] [ 17 ] 40 [ 55 ] 41 [ 72 ] 42 [ 24 ] [ 39 ] 43 [ 6 ] [ 42 ] 44 [ 5 ] 45 [ 3 ] [ 4 ] [ 5 ] 46 [ 76 ] 47 [ 37 ] 48 [ 7 ] [ 9 ] [ 13 ] [ 14 ] [ 19 ] [ 22 ] [ 23 ] [ 28 ] 49 [ 3 ] [ 4 ] [ 5 ] 50 [ 21 ] [ 26 ] 51 [ 43 ] [ 51 ] [ 52 ] [ 62 ] [ 64 ] [ 74 ] [ 81 ] 52 [ 3 ] [ 4 ] [ 5 ] 53 [ 15 ] [ 17 ] 54 [ 4 ] 55 [ 26 ] 56 [ 72 ] 57 [ 37 ] 58 [ 30 ] [ 31 ] [ 63 ] [ 66 ] 59 [ 62 ] 60 [ 83 ] 61 [ 83 ] 62 [ 31 ] [ 66 ] 63 [ 6 ] [ 42 ] 64 [ 19 ] [ 28 ] 65 [ 3 ] 66 [ 30 ] [ 43 ] [ 63 ] [ 75 ] [ 82 ] 67 [ 55 ] 68 [ 21 ] 69 [ 37 ] 70 [ 37 ] 71 [ 7 ] [ 9 ] [ 10 ] [ 11 ] [ 12 ] [ 18 ] [ 20 ] [ 22 ] [ 38 ] 72 [ 37 ] 73 [ 60 ] [ 70 ] 74 [ 79 ] 75 [ 48 ] [ 54 ] [ 56 ] [ 60 ] [ 61 ] [ 70 ] 76 [ 45 ] 77 [ 10 ] [ 20 ] [ 38 ] 78 [ 7 ] [ 9 ] [ 22 ] 79 [ 79 ] 80 [ 71 ] 81 [ 11 ] [ 18 ] [ 38 ] 82 [ 14 ] [ 23 ] 83 [ 30 ] [ 63 ] 84 [ 5 ] 85 [ 44 ] 86 [ 25 ] [ 40 ] [ 55 ] 87 [ 45 ] [ 50 ] 88 [ 52 ] 89 [ 3 ]  ©2005 Association for Computing Machinery |
