Sanjeev Saluja

According to our database1, Sanjeev Saluja authored at least 12 papers between 1991 and 2003.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2003
Discovering all most specific sentences.
ACM Trans. Database Syst., 2003

Graph Transformations for Improved Tree Height Reduction.
Proceedings of the 16th International Conference on VLSI Design (VLSI Design 2003), 2003

2001
Improved Merging of Datapath Operators using Information Content and Required Precision Analysis.
Proceedings of the 38th Design Automation Conference, 2001

1997
Optimal On-line Algorithms for Walking with Minimum Number of Turns in Unknown Streets.
Comput. Geom., 1997

Discovering All Most Specific Sentences by Randomized Algorithms.
Proceedings of the Database Theory, 1997

1995
Descriptive Complexity of #P Functions.
J. Comput. Syst. Sci., 1995

NC-Algorithms for Minimum Link Path and Related Problems.
J. Algorithms, 1995

1993
Characterizing and Recognizing Weak Visibility Polygons.
Comput. Geom., 1993

Relativized limitations of left set technique and closure classes of sparse sets (Extended Abstract).
Proceedings of the Eigth Annual Structure in Complexity Theory Conference, 1993

1992
On the Power of Enumerative Counting.
Inf. Process. Lett., 1992

A Note on the Permanent Value Problem.
Inf. Process. Lett., 1992

1991
Computing the Shortest Path Tree in a Weak Visibility Polygon.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1991


  Loading...