Sanjeev Saluja

2003
13	EE	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
12	EE	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)
2001
11	EE	Anmol Mathur, Sanjeev Saluja: Improved Merging of Datapath Operators using Information Content and Required Precision Analysis. DAC 2001: 462-467
1997
10	EE	Dimitrios Gunopulos, Heikki Mannila, Sanjeev Saluja: Discovering All Most Specific Sentences by Randomized Algorithms. ICDT 1997: 215-229
9		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)
1995
8		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)
7		Sanjeev Saluja, K. V. Subrahmanyam, Madhukar N. Thakur: Descriptive Complexity of #P Functions. J. Comput. Syst. Sci. 50(3): 493-505 (1995)
1993
6		Sanjeev Saluja: Relativized limitations of left set technique and closure classes of sparse sets (Extended Abstract). Structure in Complexity Theory Conference 1993: 215-222
5		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)
1992
4		Sanjeev Saluja, K. V. Subrahmanyam, Madhukar N. Thakur: Descriptive Complexity of #P Functions. Structure in Complexity Theory Conference 1992: 169-184
3		Sanjeev Saluja: A Note on the Permanent Value Problem. Inf. Process. Lett. 43(1): 1-5 (1992)
2		Sanjeev Saluja, K. V. Subrahmanyam: On the Power of Enumerative Counting. Inf. Process. Lett. 43(3): 119-125 (1992)
1991
1		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: 369-389

Coauthor Index

1	LaNae J. Avra	[13]
2	Paul van Besouw	[13]
3	Vijay Chandru (Vijaya Chandru)	[8]
4	Subir Kumar Ghosh	[1] [5] [8] [9]
5	Dimitrios Gunopulos	[10] [12]
6	Roni Khardon	[12]
7	C. E. Veni Madhavan	[1] [5]
8	Anil Maheshwari	[1] [5] [8]
9	G. N. Mangalam	[13]
10	Heikki Mannila	[10] [12]
11	Anmol Mathur	[11] [13]
12	Sanjiv Narayan	[13]
13	Sudebkumar Prasant Pal	[1] [5]
14	V. T. Rajan	[8]
15	Ram Sewak Sharm	[12]
16	K. V. Subrahmanyam	[2] [4] [7]
17	Madhukar N. Thakur	[4] [7]
18	Hannu Toivonen	[12]

Colors in the list of coauthors