25,161
edits
Changes
Created page with "'''Home * People * Amitava Bagchi''' '''Amitava Bagchi''',<br/> an Indian physicist, computer scientist and professor emeritus at Management Information Sys..."
'''[[Main Page|Home]] * [[People]] * Amitava Bagchi'''
'''Amitava Bagchi''',<br/>
an Indian physicist, computer scientist and professor emeritus at Management Information Systems at the [https://en.wikipedia.org/wiki/Indian_Institute_of_Management_Calcutta Indian Institute of Management, Calcutta], and [https://en.wikipedia.org/wiki/Maulana_Abul_Kalam_Azad_University_of_Technology West Bengal University of Technology] <ref>[https://biography.omicsonline.org/india/west-bengal-university-of-technology/dr-amitava-bagchi-370072 Dr. Amitava Bagchi | West Bengal University of Technology | India]</ref>.
He defended his Ph.D. thesis under [[Mathematician#ARMeyer|Ronald da Silva Meyer]] at [[Massachusetts Institute of Technology]] in 1972 on ''Topics in Complexity Theory and Recursion Theory''.
Along with his Ph.D. student [[Subir Bhattacharya]], he researched on [[Search|search algorithms]]. They investigated [[George Stockman|Stockman's]] [[SSS* and Dual*|SSS* algorithm]],
and proposed a [[Recursion|recursive]] implementation, called [[SSS* and Dual*#RecSSS|RecSSS*]].
=Selected Publications=
<ref>[https://dblp.uni-trier.de/pers/hd/b/Bagchi:Amitava dblp: Amitava Bagchi]</ref> <ref>[http://ilk.uvt.nl/icga/journal/docs/References.pdf ICGA Reference Database] (pdf)</ref> <ref>[https://scholar.google.co.in/citations?user=Ju_cP1kAAAAJ&hl=en amitava bagchi - Google Scholar Citations]</ref>
==1970 ...==
* [[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 ...==
* [[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
* [[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]] ('''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]
==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]] ('''1992'''). ''[https://dlp5.acm.org/citation.cfm?id=664175 QuickGame: A Compromise Between Pure Depth-first and Pure Best-first Game Tree Search Strategies]''. [https://dblp.uni-trier.de/db/conf/iwar/iwar1992.html IWAR 1992]
* [[Subir Bhattacharya]], [[Amitava Bagchi]] ('''1993'''). ''[https://dl.acm.org/citation.cfm?id=173194&preflayout=flat A Faster Alternative to SSS* with Extension to Variable Memory]''. [https://en.wikipedia.org/wiki/Information_Processing_Letters Information Processing Letters], Vol. 47, No. 4
* [https://dblp.uni-trier.de/pers/hd/v/Viswanathan:K=_V= K. V. Viswanathan], [[Amitava Bagchi]] ('''1993'''). ''[https://www.jstor.org/stable/171971?seq=1#page_scan_tab_contents Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems]''. [https://en.wikipedia.org/wiki/Operations_Research_(journal) Operations Research], Vol. 41, No. 4
* [[Subir Bhattacharya]], [[Amitava Bagchi]] ('''1996'''). ''[https://www.aaai.org/Library/AAAI/1996/aaai96-033.php Searching Game Trees Under Memory Constraints]''. [[Conferences#AAAI-96|AAAI-96]]
=External Links=
* [https://genealogy.math.ndsu.nodak.edu/id.php?id=81222 The Mathematics Genealogy Project - Amitava Bagchi]
* [https://biography.omicsonline.org/india/west-bengal-university-of-technology/dr-amitava-bagchi-370072 Dr. Amitava Bagchi | West Bengal University of Technology | India]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Mathematician|Bagchi]]
[[Category:Researcher|Bagchi]]
'''Amitava Bagchi''',<br/>
an Indian physicist, computer scientist and professor emeritus at Management Information Systems at the [https://en.wikipedia.org/wiki/Indian_Institute_of_Management_Calcutta Indian Institute of Management, Calcutta], and [https://en.wikipedia.org/wiki/Maulana_Abul_Kalam_Azad_University_of_Technology West Bengal University of Technology] <ref>[https://biography.omicsonline.org/india/west-bengal-university-of-technology/dr-amitava-bagchi-370072 Dr. Amitava Bagchi | West Bengal University of Technology | India]</ref>.
He defended his Ph.D. thesis under [[Mathematician#ARMeyer|Ronald da Silva Meyer]] at [[Massachusetts Institute of Technology]] in 1972 on ''Topics in Complexity Theory and Recursion Theory''.
Along with his Ph.D. student [[Subir Bhattacharya]], he researched on [[Search|search algorithms]]. They investigated [[George Stockman|Stockman's]] [[SSS* and Dual*|SSS* algorithm]],
and proposed a [[Recursion|recursive]] implementation, called [[SSS* and Dual*#RecSSS|RecSSS*]].
=Selected Publications=
<ref>[https://dblp.uni-trier.de/pers/hd/b/Bagchi:Amitava dblp: Amitava Bagchi]</ref> <ref>[http://ilk.uvt.nl/icga/journal/docs/References.pdf ICGA Reference Database] (pdf)</ref> <ref>[https://scholar.google.co.in/citations?user=Ju_cP1kAAAAJ&hl=en amitava bagchi - Google Scholar Citations]</ref>
==1970 ...==
* [[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 ...==
* [[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
* [[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]] ('''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]
==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]] ('''1992'''). ''[https://dlp5.acm.org/citation.cfm?id=664175 QuickGame: A Compromise Between Pure Depth-first and Pure Best-first Game Tree Search Strategies]''. [https://dblp.uni-trier.de/db/conf/iwar/iwar1992.html IWAR 1992]
* [[Subir Bhattacharya]], [[Amitava Bagchi]] ('''1993'''). ''[https://dl.acm.org/citation.cfm?id=173194&preflayout=flat A Faster Alternative to SSS* with Extension to Variable Memory]''. [https://en.wikipedia.org/wiki/Information_Processing_Letters Information Processing Letters], Vol. 47, No. 4
* [https://dblp.uni-trier.de/pers/hd/v/Viswanathan:K=_V= K. V. Viswanathan], [[Amitava Bagchi]] ('''1993'''). ''[https://www.jstor.org/stable/171971?seq=1#page_scan_tab_contents Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems]''. [https://en.wikipedia.org/wiki/Operations_Research_(journal) Operations Research], Vol. 41, No. 4
* [[Subir Bhattacharya]], [[Amitava Bagchi]] ('''1996'''). ''[https://www.aaai.org/Library/AAAI/1996/aaai96-033.php Searching Game Trees Under Memory Constraints]''. [[Conferences#AAAI-96|AAAI-96]]
=External Links=
* [https://genealogy.math.ndsu.nodak.edu/id.php?id=81222 The Mathematics Genealogy Project - Amitava Bagchi]
* [https://biography.omicsonline.org/india/west-bengal-university-of-technology/dr-amitava-bagchi-370072 Dr. Amitava Bagchi | West Bengal University of Technology | India]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Mathematician|Bagchi]]
[[Category:Researcher|Bagchi]]
