Sanjeev Saluja

Publication Activity (10 Years)

Years Active: 1991-2003
Publications (10 Years): 0

Publications

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)
Dimitrios Gunopulos, Roni Khardon, Heikki Mannila, Sanjeev Saluja, Hannu Toivonen, Ram Sewak Sharm
Discovering all most specific sentences. ACM Trans. Database Syst. 28 (2) (2003)
Anmol Mathur, Sanjeev Saluja
Improved Merging of Datapath Operators using Information Content and Required Precision Analysis. DAC (2001)
Dimitrios Gunopulos, Heikki Mannila, Sanjeev Saluja
Discovering All Most Specific Sentences by Randomized Algorithms. ICDT (1997)
Subir Kumar Ghosh, Sanjeev Saluja
Optimal On-line Algorithms for Walking with Minimum Number of Turns in Unknown Streets. Comput. Geom. 8 (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) (1995)
Sanjeev Saluja, K. V. Subrahmanyam, Madhukar N. Thakur
Descriptive Complexity of #P Functions. J. Comput. Syst. Sci. 50 (3) (1995)
Subir Kumar Ghosh, Anil Maheshwari, Sudebkumar Prasant Pal, Sanjeev Saluja, C. E. Veni Madhavan
Characterizing and Recognizing Weak Visibility Polygons. Comput. Geom. 3 (1993)
Sanjeev Saluja
Relativized limitations of left set technique and closure classes of sparse sets (Extended Abstract). Computational Complexity Conference (1993)
Sanjeev Saluja
A Note on the Permanent Value Problem. Inf. Process. Lett. 43 (1) (1992)
Sanjeev Saluja, K. V. Subrahmanyam
On the Power of Enumerative Counting. Inf. Process. Lett. 43 (3) (1992)
Sanjeev Saluja, K. V. Subrahmanyam, Madhukar N. Thakur
Descriptive Complexity of #P Functions. Computational Complexity Conference (1992)
Subir Kumar Ghosh, Anil Maheshwari, Sudebkumar Prasant Pal, Sanjeev Saluja, C. E. Veni Madhavan
Computing the Shortest Path Tree in a Weak Visibility Polygon. FSTTCS (1991)