Home * People * Amitava Bagchi

Amitava Bagchi,
an Indian physicist, computer scientist and until 2007 professor for Management Information Systems at the Indian Institute of Management, Calcutta. With his colleague Subir Bhattacharya, he researched on various search topics and investigated Stockman's SSS* algorithm. With some improvements they tried a recursive depth-first implementation, called RecSSS*.

Selected Publications

^{[1] [2] [3]}

• Amitava Bagchi, Ambuj Mahanti (1983). Search Algorithms Under Different Kinds of Heuristics - A Comparative Study. Journal of the ACM, Vol. 30, No. 1
• Subir Bhattacharya, Amitava Bagchi (1986). Making Best Use of Available Memory when Searching Game Trees. AAAI 1986
• Anup K. Sen, Amitava Bagchi (1989). Fast Recursive Formulations for Best-First Search that allow Controlled use of Memory. IJCAI 1989, pdf
• Subir Bhattacharya, Amitava Bagchi (1990). Unified Recursive Schemes for Search in Game Trees. Technical Report WPS-144, Indian Institute of Management, Calcutta
• Subir Bhattacharya, Amitava Bagchi (1993). A Faster Alternative to SSS* with Extension to Variable Memory. Information Processing Letters, Vol. 47

External Links

• The Mathematics Genealogy Project - Amitava Bagchi

References

1. ^ dblp: Amitava Bagchi
2. ^ Amitava Bagchi - LIST OF PUBLICATIONS
3. ^ ICGA Reference Database (pdf)

What links here?

Up one level