Sanjeev Saluja

Tata Institute of Fundamental Research — India

Computer Science · Physical Sciences

9h-index404citations16works0.02yr avg
OpenAlex↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Complexity and Algorithms in Graphs(5), Advanced Graph Theory Research(4), Robotic Path Planning Algorithms(4), Computational Geometry and Mesh Generation(4), Natural Language Processing Techniques(2)

Publications16 total

Graph transformations for improved tree height reduction
2003· 3 cited
Discovering all most specific sentences
ACM Transactions on Database Systems·2003· 215 cited
Descriptive complexity of Hash P functions
2003· 5 cited
Relativized limitations of left set technique and closure classes of sparse sets
2002· 14 cited
Improved merging of datapath operators using information content and required precision analysis
2001· 13 cited
Optimal on-line algorithms for walking with minimum number of turns in unknown streets
Computational Geometry·1997· 20 cited
Discovering all most specific sentences by randomized algorithms extended abstract
Lecture notes in computer science·1997· 30 cited
Discovering all most specific sentences by randomized algorithms
Max Planck Digital Library·1997· 10 citedOpen Access
Optimal algorithms for some proximity problems on the Gaussian sphere with applications
MPG.PuRe (Max Planck Society)·1996Open Access
-Algorithms for Minimum Link Path and Related Problems
Journal of Algorithms·1995· 12 cited
Descriptive Complexity of #P Functions
Journal of Computer and System Sciences·1995· 50 cited
Characterizing and recognizing weak visibility polygons
Computational Geometry·1993· 23 citedOpen Access
Relativized limitations of left set technique and closure classes of sparse sets (Extended Abstract).
Structure in Complexity Theory Annual Conference·1993
On the power of enumerative counting
Information Processing Letters·1992
A note on the permanent value problem
Information Processing Letters·1992· 5 cited
Computing the shortest path tree in a weak visibility polygon
Lecture notes in computer science·1991· 4 cited

Frequent Co-authors

Dimitrios Gunopulos(3), Heikki Mannila(3), K. V. Subrahmanyam(3), Anil Maheshwari(3), M.N. Thakur(2), Subir Kumar Ghosh(2), Sudebkumar Prasant Pal(2), C. E. Veni Madhavan(2), Roni Khardon(1), Hannu Toivonen(1), Ram Sewak Sharma(1), Anmol Mathur(1), V. Chandru(1), S. K. Ghosh(1), V. T. Rajan(1), Subir Kumar Ghosh(1), G.N. Mangalam(1), Sanjiv M. Narayan(1), P. van Besouw(1), L.N. Avra(1)