Difference between revisions of "Amitava Bagchi"
GerdIsenberg (talk | contribs) |
GerdIsenberg (talk | contribs) |
||
| Line 11: | Line 11: | ||
* [[Amitava Bagchi]] ('''1972'''). ''Topics in Complexity Theory and Recursion Theory''. Ph.D. thesis, [[Massachusetts Institute of Technology]], advisor [[Mathematician#ARMeyer|Ronald da Silva Meyer]] | * [[Amitava Bagchi]] ('''1972'''). ''Topics in Complexity Theory and Recursion Theory''. Ph.D. thesis, [[Massachusetts Institute of Technology]], advisor [[Mathematician#ARMeyer|Ronald da Silva Meyer]] | ||
==1980 ...== | ==1980 ...== | ||
| − | * [[Amitava Bagchi]], [[Ambuj Mahanti]] ('''1983'''). ''[https://dl.acm.org/citation.cfm?id=322359 Search Algorithms Under Different Kinds of Heuristics - A Comparative Study]''. [[ACM#Journal|Journal of the ACM]], Vol. 30, No. 1 | + | * [[Amitava Bagchi]], [[Mathematician#AMahanti|Ambuj Mahanti]] ('''1983'''). ''[https://dl.acm.org/citation.cfm?id=322359 Search Algorithms Under Different Kinds of Heuristics - A Comparative Study]''. [[ACM#Journal|Journal of the ACM]], Vol. 30, No. 1 |
| − | * [[Ambuj Mahanti]], [[Amitava Bagchi]] ('''1985'''). ''[https://dl.acm.org/citation.cfm?id=2459 AND/OR graph heuristic search methods]''. [[ACM#Journal|Journal of the ACM]], Vol. 32, No. 1 | + | * [[Mathematician#AMahanti|Ambuj Mahanti]] , [[Amitava Bagchi]] ('''1985'''). ''[https://dl.acm.org/citation.cfm?id=2459 AND/OR graph heuristic search methods]''. [[ACM#Journal|Journal of the ACM]], Vol. 32, No. 1 |
* [[Subir Bhattacharya]], [[Amitava Bagchi]] ('''1986'''). ''[https://www.semanticscholar.org/paper/Making-Best-Use-of-Available-Memory-When-Searching-Bhattacharya-Bagchi/382a9878c5bcb72d760a48a3507e24eb64094853 Making Best Use of Available Memory when Searching Game Trees]''. [[Conferences#AAAI-86|AAAI-86]] | * [[Subir Bhattacharya]], [[Amitava Bagchi]] ('''1986'''). ''[https://www.semanticscholar.org/paper/Making-Best-Use-of-Available-Memory-When-Searching-Bhattacharya-Bagchi/382a9878c5bcb72d760a48a3507e24eb64094853 Making Best Use of Available Memory when Searching Game Trees]''. [[Conferences#AAAI-86|AAAI-86]] | ||
* [[Subir Bhattacharya]], [[Amitava Bagchi]] ('''1989'''). ''Searching Game Trees in Parallel Using SSS''. [[Conferences#IJCAI1989|IJCAI 1989]], [https://www.ijcai.org/Proceedings/89-1/Papers/007.pdf pdf] | * [[Subir Bhattacharya]], [[Amitava Bagchi]] ('''1989'''). ''Searching Game Trees in Parallel Using SSS''. [[Conferences#IJCAI1989|IJCAI 1989]], [https://www.ijcai.org/Proceedings/89-1/Papers/007.pdf pdf] | ||
| − | * [[Anup K. Sen]], [[Amitava Bagchi]] ('''1989'''). ''Fast Recursive Formulations for Best-First Search that allow Controlled use of Memory''. [[Conferences#IJCAI|IJCAI 1989]], [https://www.ijcai.org/Proceedings/89-1/Papers/047.pdf pdf] | + | * [[Mathematician#AKSen|Anup K. Sen]], [[Amitava Bagchi]] ('''1989'''). ''Fast Recursive Formulations for Best-First Search that allow Controlled use of Memory''. [[Conferences#IJCAI|IJCAI 1989]], [https://www.ijcai.org/Proceedings/89-1/Papers/047.pdf pdf] |
==1990 ...== | ==1990 ...== | ||
* [[Subir Bhattacharya]], [[Amitava Bagchi]] ('''1990'''). ''Unified Recursive Schemes for Search in Game Trees''. Technical Report WPS-144, [https://en.wikipedia.org/wiki/Indian_Institute_of_Management_Calcutta Indian Institute of Management, Calcutta] | * [[Subir Bhattacharya]], [[Amitava Bagchi]] ('''1990'''). ''Unified Recursive Schemes for Search in Game Trees''. Technical Report WPS-144, [https://en.wikipedia.org/wiki/Indian_Institute_of_Management_Calcutta Indian Institute of Management, Calcutta] | ||
Revision as of 20:26, 22 July 2019
Home * People * Amitava Bagchi
Amitava Bagchi,
an Indian physicist, computer scientist and professor emeritus at Management Information Systems at the Indian Institute of Management, Calcutta, and West Bengal University of Technology [1].
He defended his Ph.D. thesis under Ronald da Silva Meyer at Massachusetts Institute of Technology in 1972 on Topics in Complexity Theory and Recursion Theory.
Along with his Ph.D. students, he researched on search algorithms. Amitava Bagchi and Subir Bhattacharya investigated Stockman's SSS* algorithm, and proposed a recursive implementation, called RecSSS*.
Contents
Selected Publications
1970 ...
- Amitava Bagchi (1972). Topics in Complexity Theory and Recursion Theory. Ph.D. thesis, Massachusetts Institute of Technology, advisor Ronald da Silva Meyer
1980 ...
- Amitava Bagchi, Ambuj Mahanti (1983). Search Algorithms Under Different Kinds of Heuristics - A Comparative Study. Journal of the ACM, Vol. 30, No. 1
- Ambuj Mahanti , Amitava Bagchi (1985). AND/OR graph heuristic search methods. Journal of the ACM, Vol. 32, No. 1
- Subir Bhattacharya, Amitava Bagchi (1986). Making Best Use of Available Memory when Searching Game Trees. AAAI-86
- Subir Bhattacharya, Amitava Bagchi (1989). Searching Game Trees in Parallel Using SSS. IJCAI 1989, pdf
- Anup K. Sen, Amitava Bagchi (1989). Fast Recursive Formulations for Best-First Search that allow Controlled use of Memory. IJCAI 1989, pdf
1990 ...
- 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 (1992). QuickGame: A Compromise Between Pure Depth-first and Pure Best-first Game Tree Search Strategies. IWAR 1992
- Subir Bhattacharya, Amitava Bagchi (1993). A Faster Alternative to SSS* with Extension to Variable Memory. Information Processing Letters, Vol. 47, No. 4
- K. V. Viswanathan, Amitava Bagchi (1993). Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems. Operations Research, Vol. 41, No. 4
- Subir Bhattacharya, Amitava Bagchi (1996). Searching Game Trees Under Memory Constraints. AAAI-96
External Links
- The Mathematics Genealogy Project - Amitava Bagchi
- Dr. Amitava Bagchi | West Bengal University of Technology | India
