25,161
edits
Changes
no edit summary
'''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 received 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''.His research interests include [https://en.wikipedia.org/wiki/Software_engineering software engineering], [https://en.wikipedia.org/wiki/Software_quality software reliability], [https://en.wikipedia.org/wiki/Software_verification_and_validation software verification and validation], analysis of [[Algorithms|algorithms]], and [https://en.wikipedia.org/wiki/Combinatorial_auction combinatorial auctions].Along with his Ph.D. student [[Subir Bhattacharya]]students, he researched worked and published on [[Search|search algorithms]]. They Amitava Bagchi and [[Subir Bhattacharya]] 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 Journal#RefDB|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]]
* [[Mathematician#ARMeyer|Ronald da Silva Meyer]], [[Amitava Bagchi]] ('''1972'''). ''[https://dl.acm.org/citation.cfm?id=804912 Program size and economy of descriptions: Preliminary Report]''. [https://dblp.org/db/conf/stoc/stoc72 STOC 1972]
==1980 ...==
* [[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* [[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]] ('''1989'''). ''Searching Game Trees in Parallel Using SSS''. [[Conferences#IJCAI1989|IJCAI 1989]], [https://www.ijcai.org/Proceedings/89-1/Papers/007.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 ...==
* [[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]
* [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]]
* [https://dblp.uni-trier.de/pers/hd/n/Nazareth:Terence Terence Nazareth], [[Mathematician#SVerma|Sanjay Verma]], [[Subir Bhattacharya]], [[Amitava Bagchi]] ('''1999'''). ''[https://www.semanticscholar.org/paper/The-multiple-resource-constrained-project-problem%3A-Nazareth-Verma/4de0a88cac15288e8086ee708360f2e3dbd519eb The multiple resource-constrained project scheduling problem: A breadth-first approach]''. [https://en.wikipedia.org/wiki/European_Journal_of_Operational_Research European Journal of Operational Research], Vol. 112, No. 1
==2000 ...==
* [[Mathematician#AKSen|Anup K. Sen]], [[Amitava Bagchi]], [[Mathematician#WZhang|Weixiong Zhang]] ('''2002'''). ''An Average-case Analysis of Graph Search''. [[Conferences#AAAI-2002|AAAI-2002]], [https://www.aaai.org/Papers/AAAI/2002/AAAI02-114.pdf pdf]
* [[Mathematician#AKSen|Anup K. Sen]], [[Amitava Bagchi]], [[Mathematician#WZhang|Weixiong Zhang]] ('''2004'''). ''[https://www.sciencedirect.com/science/article/pii/S000437020400013X Average-case analysis of best-first search in two representative directed acyclic graphs]''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_(journal) Artificial Intelligence], Vol. 155, Nos. 1-2
* [[Mathematician#RahulRoy|Rahul Roy]], [[Amitava Bagchi]] ('''2007'''). ''[https://www.sciencedirect.com/science/article/pii/S0020019007001603 On estimating the time taken to rectify faults in a software package during the system testing phase]''. [https://en.wikipedia.org/wiki/Information_Processing_Letters Information Processing Letters], Vol. 104, No. 5
* [https://dblp.uni-trier.de/pers/hd/c/Chakraborty:Soumyakanti Soumyakanti Chakraborty], [[Amitava Bagchi]], [[Mathematician#AKSen|Anup K. Sen]] ('''2009'''). ''[https://ieeexplore.ieee.org/document/4755388 Revaluation of Bundles by Bidders in Combinatorial Auctions]''. [https://dblp.uni-trier.de/db/conf/hicss/hicss2009.html HICSS 2009]
* [https://dblp.uni-trier.de/pers/hd/c/Chakraborty:Soumyakanti Soumyakanti Chakraborty], [[Amitava Bagchi]], [[Mathematician#AKSen|Anup K. Sen]] ('''2009'''). ''[https://ieeexplore.ieee.org/document/4755389 Designing Proxy Bidders for Online Combinatorial Auctions]''. [https://dblp.uni-trier.de/db/conf/hicss/hicss2009.html HICSS 2009]
==2010 ...==
* [https://dblp.org/pers/hd/m/Meda:Hema_S= Hema S. Meda], [[Mathematician#AKSen|Anup K. Sen]], [[Amitava Bagchi]] ('''2010'''). ''[https://dl.acm.org/citation.cfm?id=1805290 On Detecting Data Flow Errors in Workflows]''. [https://jdiq.acm.org/ Journal of Data and Information Quality], Vol. 2, No. 2
* [https://dblp.uni-trier.de/pers/hd/c/Chakraborty:Soumyakanti Soumyakanti Chakraborty], [[Mathematician#AKSen|Anup K. Sen]], [[Amitava Bagchi]] ('''2014'''). ''[https://www.igi-global.com/article/experimenting-with-proxy-agents-in-online-combinatorial-auctions/114959 Experimenting with Proxy Agents in Online Combinatorial Auctions]''. [https://en.wikipedia.org/wiki/International_Journal_of_Intelligent_Information_Technologies IJIIT], Vol. 10, No. 2
* [https://dblp.uni-trier.de/pers/hd/c/Chakraborty:Soumyakanti Soumyakanti Chakraborty], [[Mathematician#AKSen|Anup K. Sen]], [[Amitava Bagchi]] ('''2015'''). ''[https://econpapers.repec.org/article/saejospec/v_3a16_3ay_3a2015_3ai_3a1_3ap_3a86-107.htm Combinatorial Auctions for Player Selection in the Indian Premier League (IPL)]''. [https://en.wikipedia.org/wiki/Journal_of_Sports_Economics Journal of Sports Economics], Vol. 16, No. 1
=External Links=
'''[[People|Up one level]]'''
[[Category:Mathematician|Bagchi]]
[[Category:Physicist|Bagchi]]
[[Category:Researcher|Bagchi]]
