Simplification of Incompletely Specified Flow Tables with the Help of Prime Closed Sets. - S. C. De Sarkar; A. K. Basu; Arun Kumar Choudhury (IEEE Trans. Computers, 1969)

Authors' Reply. - Arun Kumar Choudhury; A. K. Basu; S. C. De Sarkar (IEEE Trans. Computers, 1970)

On the Determination of Irredundant Prime Closed Sets. - S. C. De Sarkar; A. K. Basu; Arun K. Choudhury (IEEE Trans. Computers, 1971)

Unate Cascade Realization of Synchronous Sequential Machines. - S. C. De Sarkar; Subir Bandyopadhyay; Arun K. Choudhury (IEEE Trans. Computers, 1974)

Heuristic Search Through Islands. - P. P. Chakrabarti 001; Sujoy Ghose; S. C. De Sarkar (Artif. Intell., 1986)

Admissibility of A0* when Heuristics Overestimate. - P. P. Chakrabarti 001; Sujoy Ghose; S. C. De Sarkar (Artif. Intell., 1987)

Best first search in and/or graphs. - P. P. Chakrabarti 001; Sujoy Ghose; S. C. De Sarkar (ACM Conference on Computer Science, 1988)

Pruning by Upperbounds in Heuristic Search: Use of Approximate Algorithms. - U. K. Sarkar; P. P. Chakrabarti 001; Sujoy Ghose; S. C. De Sarkar (KBCS, 1989)

Heuristic Search in Restricted Memory. - P. P. Chakrabarti 001; Sujoy Ghose; Arup Acharya; S. C. De Sarkar (Artif. Intell., 1989)

Increasing Search Efficiency Using Multiple Heuristics. - P. P. Chakrabarti 001; Sujoy Ghose; A. Pandey; S. C. De Sarkar (Inf. Process. Lett., 1989)

Some Inference Rules for Integer Arithmetic for Verification of Flowchart Programs on Integers. - Dipankar Sarkar 001; S. C. De Sarkar (IEEE Trans. Software Eng., 1989)

A Set of Inference Rules for Quantified Formula Handling and Array Handling in Verification of Programs Over Integers. - Dipankar Sarkar 001; S. C. De Sarkar (IEEE Trans. Software Eng., 1989)

A Theorem Prover for Verifying Iterative Programs Over Integers. - Dipankar Sarkar 001; S. C. De Sarkar (IEEE Trans. Software Eng., 1989)

Reducing Reexpansions in Iterative-Deepening Search by Controlling Cutoff Bounds. - U. K. Sarkar; P. P. Chakrabarti 001; Sujoy Ghose; S. C. De Sarkar (Artif. Intell., 1991)

Multiple Stack Branch and Bound. - U. K. Sarkar; P. P. Chakrabarti 001; Sujoy Ghose; S. C. De Sarkar (Inf. Process. Lett., 1991)

Effective Use of Memory in Iterative Deepening Search. - U. K. Sarkar; P. P. Chakrabarti 001; Sujoy Ghose; S. C. De Sarkar (Inf. Process. Lett., 1992)

A Simple 0.5-Bounded Greedy Algorithm for the 0/1 Knapsack Problem. - U. K. Sarkar; P. P. Chakrabarti 001; Sujoy Ghose; S. C. De Sarkar (Inf. Process. Lett., 1992)

Generalized best first search using single and multiple heuristics. - P. P. Chakrabarti 001; Sujoy Ghose; S. C. De Sarkar (Inf. Sci., 1992)

Multiobjective Search in VLSI Design. - Pallab Dasgupta; Prasenjit Mitra; P. P. Chakrabarti 001; S. C. De Sarkar (VLSI Design, 1994)

Agent Searching in a Tree and the Optimality of Iterative Deepening. - Pallab Dasgupta; P. P. Chakrabarti 001; S. C. De Sarkar (Artif. Intell., 1994)

Improving Greedy Algorithms by Lookahead-Search. - U. K. Sarkar; P. P. Chakrabarti 001; Sujoy Ghose; S. C. De Sarkar (J. Algorithms, 1994)

A Near Optimal Algorithm for the Extended Cow-Path Problem in the Presence of Relative Errors. - Pallab Dasgupta; P. P. Chakrabarti 001; S. C. De Sarkar (FSTTCS, 1995)

A Correction to "Agent Searching in a Tree and the Optimality of Iterative Deepening". - Pallab Dasgupta; P. P. Chakrabarti 001; S. C. De Sarkar (Artif. Intell., 1995)

Utility of Pathmax in Partial Order Heuristic Search. - Pallab Dasgupta; P. P. Chakrabarti 001; S. C. De Sarkar (Inf. Process. Lett., 1995)

A New Competitive Algorithm for Agent Searching in Unknown Streets. - Pallab Dasgupta; P. P. Chakrabarti 001; S. C. De Sarkar (FSTTCS, 1996)

Searching Game Trees under a Partial Order. - Pallab Dasgupta; P. P. Chakrabarti 001; S. C. De Sarkar (Artif. Intell., 1996)

Agent Search in Uniform b-Ary Trees: Multiple Goals and Unequal Costs. - Pallab Dasgupta; P. P. Chakrabarti 001; S. C. De Sarkar (Inf. Process. Lett., 1996)

Multiobjektive Heuristic Search in AND/OR Graphs. - Pallab Dasgupta; P. P. Chakrabarti 001; S. C. De Sarkar (J. Algorithms, 1996)

Multiobjective heuristic search - an introduction to intelligent search methods for multicriteria optimization. - Pallab Dasgupta; P. P. Chakrabarti 001; S. C. De Sarkar (Vieweg, 1999)

Natural resources data management system (NRDMS): a suite of web-accessible geo-spatial data processing tools for e-Governance in India. - P. S. Acharya; Soumya K. Ghosh 001; S. C. De Sarkar (COM.Geo, 2011)