default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSanjeev Saluja
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2003
[j7]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)- [c6]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 - 2001
- [c5]Anmol Mathur, Sanjeev Saluja:
Improved Merging of Datapath Operators using Information Content and Required Precision Analysis. DAC 2001: 462-467
1990 – 1999
- 1997
- [j6]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) - [c4]Dimitrios Gunopulos, Heikki Mannila, Sanjeev Saluja:
Discovering All Most Specific Sentences by Randomized Algorithms. ICDT 1997: 215-229 - 1995
- [j5]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) - [j4]Sanjeev Saluja, K. V. Subrahmanyam, Madhukar N. Thakur:
Descriptive Complexity of #P Functions. J. Comput. Syst. Sci. 50(3): 493-505 (1995) - 1993
- [j3]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) - [c3]Sanjeev Saluja:
Relativized limitations of left set technique and closure classes of sparse sets (Extended Abstract). SCT 1993: 215-222 - 1992
- [j2]Sanjeev Saluja:
A Note on the Permanent Value Problem. Inf. Process. Lett. 43(1): 1-5 (1992) - [j1]Sanjeev Saluja, K. V. Subrahmanyam:
On the Power of Enumerative Counting. Inf. Process. Lett. 43(3): 119-125 (1992) - [c2]Sanjeev Saluja, K. V. Subrahmanyam, Madhukar N. Thakur:
Descriptive Complexity of #P Functions. SCT 1992: 169-184 - 1991
- [c1]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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:14 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
