The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Sanjeev Saluja: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Dimitrios Gunopulos, Heikki Mannila, Sanjeev Saluja
    Discovering All Most Specific Sentences by Randomized Algorithms. [Citation Graph (4, 16)][DBLP]
    ICDT, 1997, pp:215-229 [Conf]
  2. Sanjeev Saluja
    Relativized limitations of left set technique and closure classes of sparse sets (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:215-222 [Conf]
  3. Sanjeev Saluja, K. V. Subrahmanyam, Madhukar N. Thakur
    Descriptive Complexity of #P Functions. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1992, pp:169-184 [Conf]
  4. Anmol Mathur, Sanjeev Saluja
    Improved Merging of Datapath Operators using Information Content and Required Precision Analysis. [Citation Graph (0, 0)][DBLP]
    DAC, 2001, pp:462-467 [Conf]
  5. Subir Kumar Gosh, Anil Maheshwari, Sudebkumar Prasant Pal, Sanjeev Saluja, C. E. Veni Madhavan
    Computing the Shortest Path Tree in a Weak Visibility Polygon. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1991, pp:369-389 [Conf]
  6. G. N. Mangalam, Sanjiv Narayan, Paul van Besouw, LaNae J. Avra, Anmol Mathur, Sanjeev Saluja
    Graph Transformations for Improved Tree Height Reduction. [Citation Graph (0, 0)][DBLP]
    VLSI Design, 2003, pp:474-479 [Conf]
  7. Subir Kumar Ghosh, Anil Maheshwari, Sudebkumar Prasant Pal, Sanjeev Saluja, C. E. Veni Madhavan
    Characterizing and Recognizing Weak Visibility Polygons. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1993, v:3, n:, pp:213-233 [Journal]
  8. Subir Kumar Ghosh, Sanjeev Saluja
    Optimal On-line Algorithms for Walking with Minimum Number of Turns in Unknown Streets. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:8, n:, pp:241-266 [Journal]
  9. Sanjeev Saluja
    A Note on the Permanent Value Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:43, n:1, pp:1-5 [Journal]
  10. Sanjeev Saluja, K. V. Subrahmanyam
    On the Power of Enumerative Counting. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:43, n:3, pp:119-125 [Journal]
  11. Vijay Chandru, Subir Kumar Ghosh, Anil Maheshwari, V. T. Rajan, Sanjeev Saluja
    NC-Algorithms for Minimum Link Path and Related Problems. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1995, v:19, n:2, pp:173-203 [Journal]
  12. Sanjeev Saluja, K. V. Subrahmanyam, Madhukar N. Thakur
    Descriptive Complexity of #P Functions. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:50, n:3, pp:493-505 [Journal]
  13. Dimitrios Gunopulos, Roni Khardon, Heikki Mannila, Sanjeev Saluja, Hannu Toivonen, Ram Sewak Sharm
    Discovering all most specific sentences. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Database Syst., 2003, v:28, n:2, pp:140-174 [Journal]

Search in 0.075secs, Finished in 0.076secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002