| |
 |      |
                                              |
Note: Links lead to the DBLP on the Web. Sanjeev Saluja G. N. Mangalam , Sanjiv Narayan , Paul van Besouw , LaNae J. Avra , Anmol Mathur , Sanjeev Saluja: Graph Transformations for Improved Tree Height Reduction. VLSI Design 2003 : 474-479 Dimitrios Gunopulos , Roni Khardon , Heikki Mannila , Sanjeev Saluja, Hannu Toivonen , Ram Sewak Sharm : Discovering all most specific sentences. ACM Trans. Database Syst. 28 (2): 140-174 (2003) Anmol Mathur , Sanjeev Saluja: Improved Merging of Datapath Operators using Information Content and Required Precision Analysis. DAC 2001 : 462-467 Dimitrios Gunopulos , Heikki Mannila , Sanjeev Saluja: Discovering All Most Specific Sentences by Randomized Algorithms. ICDT 1997 : 215-229 Subir Kumar Ghosh , Sanjeev Saluja: Optimal On-line Algorithms for Walking with Minimum Number of Turns in Unknown Streets. Comput. Geom. 8 : 241-266 (1997) Vijay Chandru , Subir Kumar Ghosh , Anil Maheshwari , V. T. Rajan , Sanjeev Saluja: NC-Algorithms for Minimum Link Path and Related Problems. J. Algorithms 19 (2): 173-203 (1995) Sanjeev Saluja, K. V. Subrahmanyam , Madhukar N. Thakur : Descriptive Complexity of #P Functions. J. Comput. Syst. Sci. 50 (3): 493-505 (1995) Sanjeev Saluja: Relativized limitations of left set technique and closure classes of sparse sets (Extended Abstract). Structure in Complexity Theory Conference 1993 : 215-222 Subir Kumar Ghosh , Anil Maheshwari , Sudebkumar Prasant Pal , Sanjeev Saluja, C. E. Veni Madhavan : Characterizing and Recognizing Weak Visibility Polygons. Comput. Geom. 3 : 213-233 (1993) Sanjeev Saluja, K. V. Subrahmanyam , Madhukar N. Thakur : Descriptive Complexity of #P Functions. Structure in Complexity Theory Conference 1992 : 169-184 Sanjeev Saluja: A Note on the Permanent Value Problem. Inf. Process. Lett. 43 (1): 1-5 (1992) Sanjeev Saluja, K. V. Subrahmanyam : On the Power of Enumerative Counting. Inf. Process. Lett. 43 (3): 119-125 (1992) Subir Kumar Gosh , Anil Maheshwari , Sudebkumar Prasant Pal , Sanjeev Saluja, C. E. Veni Madhavan : Computing the Shortest Path Tree in a Weak Visibility Polygon. FSTTCS 1991 : 369-389 1 [ 13 ] 2 [ 13 ] 3 [ 8 ] 4 [ 5 ] [ 8 ] [ 9 ] 5 [ 1 ] 6 [ 10 ] [ 12 ] 7 [ 12 ] 8 [ 1 ] [ 5 ] 9 [ 1 ] [ 5 ] [ 8 ] 10 [ 13 ] 11 [ 10 ] [ 12 ] 12 [ 11 ] [ 13 ] 13 [ 13 ] 14 [ 1 ] [ 5 ] 15 [ 8 ] 16 [ 12 ] 17 [ 2 ] [ 4 ] [ 7 ] 18 [ 4 ] [ 7 ] 19 [ 12 ]  ©2004 Association for Computing Machinery |
