default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDS. C. De Sarkar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[c6]P. S. Acharya, Soumya K. Ghosh, S. C. De Sarkar:
Natural resources data management system (NRDMS): a suite of web-accessible geo-spatial data processing tools for e-Governance in India. COM.Geo 2011: 59:1
1990 – 1999
- 1999
- [b1]Pallab Dasgupta, P. P. Chakrabarti, S. C. De Sarkar:
Multiobjective heuristic search - an introduction to intelligent search methods for multicriteria optimization. Computational intelligence, Vieweg 1999, ISBN 978-3-528-05708-4, pp. 1-134 - 1996
- [j26]Pallab Dasgupta, P. P. Chakrabarti, S. C. De Sarkar:
Searching Game Trees under a Partial Order. Artif. Intell. 82(1-2): 237-257 (1996) - [j25]Pallab Dasgupta, P. P. Chakrabarti, S. C. De Sarkar:
Searching Game Trees under a Partial Order. J. Int. Comput. Games Assoc. 19(2): 101 (1996) - [j24]Pallab Dasgupta, P. P. Chakrabarti, S. C. De Sarkar:
Agent Search in Uniform b-Ary Trees: Multiple Goals and Unequal Costs. Inf. Process. Lett. 58(6): 311-318 (1996) - [j23]Pallab Dasgupta, P. P. Chakrabarti, S. C. De Sarkar:
Multiobjektive Heuristic Search in AND/OR Graphs. J. Algorithms 20(2): 282-311 (1996) - [c5]Pallab Dasgupta, P. P. Chakrabarti, S. C. De Sarkar:
A New Competitive Algorithm for Agent Searching in Unknown Streets. FSTTCS 1996: 147-155 - 1995
- [j22]Pallab Dasgupta, P. P. Chakrabarti, S. C. De Sarkar:
A Correction to "Agent Searching in a Tree and the Optimality of Iterative Deepening". Artif. Intell. 77(1): 173-176 (1995) - [j21]Pallab Dasgupta, P. P. Chakrabarti, S. C. De Sarkar:
Utility of Pathmax in Partial Order Heuristic Search. Inf. Process. Lett. 55(6): 317-322 (1995) - [c4]Pallab Dasgupta, P. P. Chakrabarti, S. C. De Sarkar:
A Near Optimal Algorithm for the Extended Cow-Path Problem in the Presence of Relative Errors. FSTTCS 1995: 22-36 - 1994
- [j20]Pallab Dasgupta, P. P. Chakrabarti, S. C. De Sarkar:
Agent Searching in a Tree and the Optimality of Iterative Deepening. Artif. Intell. 71(1): 195-208 (1994) - [j19]Pallab Dasgupta, P. P. Chakrabarti, S. C. De Sarkar:
Agent Searching in a Tree and the Optimality of Iterative Deepening. J. Int. Comput. Games Assoc. 17(4): 222 (1994) - [j18]U. K. Sarkar, P. P. Chakrabarti, Sujoy Ghose, S. C. De Sarkar:
Improving Greedy Algorithms by Lookahead-Search. J. Algorithms 16(1): 1-23 (1994) - [c3]Pallab Dasgupta, Prasenjit Mitra, P. P. Chakrabarti, S. C. De Sarkar:
Multiobjective Search in VLSI Design. VLSI Design 1994: 395-400 - 1992
- [j17]U. K. Sarkar, P. P. Chakrabarti, Sujoy Ghose, S. C. De Sarkar:
Effective Use of Memory in Iterative Deepening Search. Inf. Process. Lett. 42(1): 47-52 (1992) - [j16]U. K. Sarkar, P. P. Chakrabarti, Sujoy Ghose, S. C. De Sarkar:
A Simple 0.5-Bounded Greedy Algorithm for the 0/1 Knapsack Problem. Inf. Process. Lett. 42(3): 173-177 (1992) - [j15]P. P. Chakrabarti, Sujoy Ghose, S. C. De Sarkar:
Generalized best first search using single and multiple heuristics. Inf. Sci. 60(1-2): 145-175 (1992) - 1991
- [j14]U. K. Sarkar, P. P. Chakrabarti, Sujoy Ghose, S. C. De Sarkar:
Reducing Reexpansions in Iterative-Deepening Search by Controlling Cutoff Bounds. Artif. Intell. 50(2): 207-221 (1991) - [j13]U. K. Sarkar, P. P. Chakrabarti, Sujoy Ghose, S. C. De Sarkar:
Multiple Stack Branch and Bound. Inf. Process. Lett. 37(1): 43-48 (1991)
1980 – 1989
- 1989
- [j12]P. P. Chakrabarti, Sujoy Ghose, Arup Acharya, S. C. De Sarkar:
Heuristic Search in Restricted Memory. Artif. Intell. 41(2): 197-221 (1989) - [j11]P. P. Chakrabarti, Sujoy Ghose, A. Pandey, S. C. De Sarkar:
Increasing Search Efficiency Using Multiple Heuristics. Inf. Process. Lett. 30(1): 33-36 (1989) - [j10]P. P. Chakrabarti, Sujoy Ghose, A. Pandey, S. C. De Sarkar:
Increasing Search Efficiency Using Multiple Heuristics. Inf. Process. Lett. 32(5): 275 (1989) - [j9]Dipankar Sarkar, S. C. De Sarkar:
Some Inference Rules for Integer Arithmetic for Verification of Flowchart Programs on Integers. IEEE Trans. Software Eng. 15(1): 1-9 (1989) - [j8]Dipankar Sarkar, S. C. De Sarkar:
A Set of Inference Rules for Quantified Formula Handling and Array Handling in Verification of Programs Over Integers. IEEE Trans. Software Eng. 15(11): 1368-1381 (1989) - [j7]Dipankar Sarkar, S. C. De Sarkar:
A Theorem Prover for Verifying Iterative Programs Over Integers. IEEE Trans. Software Eng. 15(12): 1550-1566 (1989) - [c2]U. K. Sarkar, P. P. Chakrabarti, Sujoy Ghose, S. C. De Sarkar:
Pruning by Upperbounds in Heuristic Search: Use of Approximate Algorithms. KBCS 1989: 451-461 - 1988
- [c1]P. P. Chakrabarti, Sujoy Ghose, S. C. De Sarkar:
Best first search in and/or graphs. ACM Conference on Computer Science 1988: 256-261 - 1987
- [j6]P. P. Chakrabarti, Sujoy Ghose, S. C. De Sarkar:
Admissibility of A0* when Heuristics Overestimate. Artif. Intell. 34(1): 97-113 (1987) - 1986
- [j5]P. P. Chakrabarti, Sujoy Ghose, S. C. De Sarkar:
Heuristic Search Through Islands. Artif. Intell. 29(3): 339-347 (1986)
1970 – 1979
- 1974
- [j4]S. C. De Sarkar, Subir Bandyopadhyay, Arun K. Choudhury:
Unate Cascade Realization of Synchronous Sequential Machines. IEEE Trans. Computers 23(10): 1008-1019 (1974) - 1971
- [j3]S. C. De Sarkar, A. K. Basu, Arun K. Choudhury:
On the Determination of Irredundant Prime Closed Sets. IEEE Trans. Computers 20(8): 933-938 (1971) - 1970
- [j2]Arun Kumar Choudhury, A. K. Basu, S. C. De Sarkar:
Authors' Reply. IEEE Trans. Computers 19(5): 459 (1970)
1960 – 1969
- 1969
- [j1]S. C. De Sarkar, A. K. Basu, Arun Kumar Choudhury:
Simplification of Incompletely Specified Flow Tables with the Help of Prime Closed Sets. IEEE Trans. Computers 18(10): 953-956 (1969)
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 2024-04-24 22:53 CEST 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:
