P.P. Chakrabarti

Bibliography

Chakrabarti, P. P. 1994. “Algorithms for Searching Explicit AND/OR Graphs and Their Applications to Problem Reduction Search.” Artificial Intelligence 65(2): 329–345.
Chakrabarti, P. P., Ghose, S., Acharya, A. and De Sarkar, S. C. 1989. “Heuristic Search in Restricted Memory.” Artificial Intelligence 41(2): 197–221.
Chakrabarti, P. P., Ghose, S. and De Sarkar, S. C. 1986. “Heuristic Search through Islands.” Artificial Intelligence 29(3): 339–347.
Chakrabarti, P. P., Ghose, S. and De Sarkar, S. C. 1987. “Admissibility of AO* when Heuristics Overestimate.” Artificial Intelligence 34(1): 97–113.
Dasgupta, Pallab, Chakrabarti, P. P. and De Sarkar, S. C. 1994. “Agent Searching in a Tree and the Optimality of Iterative Deepening.” Artificial Intelligence 71(1): 195–208.
Dasgupta, Pallab, Chakrabarti, P. P. and De Sarkar, S. C. 1996. “Searching Game Trees under a Partial Order.” Artificial Intelligence 82(1–2): 237–257.
Dasgupta, Pallab, Chakrabarti, P. P., Kumar Deka, Jatindra and Sankaranarayanan, Sriram. 2001. “Min-Max Computation Tree Logic.” Artificial Intelligence 127(1): 137–162.
Sarkar, U. K., Chakrabarti, P. P., Ghose, S. and De Sarkar, S. C. 1991. “Reducing Reexpansions in Iterative-Deepening Search by Controlling Cutoff Bounds.” Artificial Intelligence 50(2): 207–221.