Sanjeev Saluja

13 papers A* 1A 1Misc 1Journal 7Unranked 3
YearRankTypeTitle / Venue / Authors
2003 J jnl
Discovering all most specific sentences.
ACM Trans. Database Syst.
Dimitrios Gunopulos, Roni Khardon, Heikki Mannila, Sanjeev Saluja, Hannu Toivonen, Ram Sewak Sharm
2003 Misc conf
Graph Transformations for Improved Tree Height Reduction.
VLSI Design
G. N. Mangalam, Sanjiv Narayan, Paul van Besouw, LaNae J. Avra, Anmol Mathur, Sanjeev Saluja
2001 A* conf
Improved Merging of Datapath Operators using Information Content and Required Precision Analysis.
DAC
Anmol Mathur, Sanjeev Saluja
1997 A conf
Discovering All Most Specific Sentences by Randomized Algorithms.
ICDT
Dimitrios Gunopulos, Heikki Mannila, Sanjeev Saluja
1997 J jnl
Optimal On-line Algorithms for Walking with Minimum Number of Turns in Unknown Streets.
Comput. Geom.
Subir Kumar Ghosh, Sanjeev Saluja
1995 J jnl
Descriptive Complexity of #P Functions.
J. Comput. Syst. Sci.
Sanjeev Saluja, K. V. Subrahmanyam, Madhukar N. Thakur
1995 J jnl
NC-Algorithms for Minimum Link Path and Related Problems.
J. Algorithms
Vijay Chandru, Subir Kumar Ghosh, Anil Maheshwari, V. T. Rajan, Sanjeev Saluja
1993 J jnl
Characterizing and Recognizing Weak Visibility Polygons.
Comput. Geom.
Subir Kumar Ghosh, Anil Maheshwari, Sudebkumar Prasant Pal, Sanjeev Saluja, C. E. Veni Madhavan
1993 — conf
Relativized limitations of left set technique and closure classes of sparse sets (Extended Abstract).
SCT
Sanjeev Saluja
1992 J jnl
A Note on the Permanent Value Problem.
Inf. Process. Lett.
Sanjeev Saluja
1992 — conf
Descriptive Complexity of #P Functions.
SCT
Sanjeev Saluja, K. V. Subrahmanyam, Madhukar N. Thakur
1992 J jnl
On the Power of Enumerative Counting.
Inf. Process. Lett.
Sanjeev Saluja, K. V. Subrahmanyam
1991 — conf
Computing the Shortest Path Tree in a Weak Visibility Polygon.
FSTTCS
Subir Kumar Ghosh, Anil Maheshwari, Sudebkumar Prasant Pal, Sanjeev Saluja, C. E. Veni Madhavan