Difference between revisions of "Amitava Bagchi"
GerdIsenberg (talk | contribs) |
GerdIsenberg (talk | contribs) |
||
| Line 11: | Line 11: | ||
==1970 ...== | ==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]] | * [[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 ...== | ==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 | * [[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 | ||
Revision as of 22:27, 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 received his Ph.D. under Ronald da Silva Meyer at Massachusetts Institute of Technology in 1972 on Topics in Complexity Theory and Recursion Theory.
His research interests include software engineering, software reliability, software verification and validation, analysis of algorithms, and combinatorial auctions.
Along with his Ph.D. students, he worked and published 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
- Ronald da Silva Meyer, Amitava Bagchi (1972). Program size and economy of descriptions: Preliminary Report. STOC 1972
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
- Terence Nazareth, Sanjay Verma, Subir Bhattacharya, Amitava Bagchi (1999). The multiple resource-constrained project scheduling problem: A breadth-first approach. European Journal of Operational Research, Vol. 112, No. 1
2000 ...
- Anup K. Sen, Amitava Bagchi, Weixiong Zhang (2002). An Average-case Analysis of Graph Search. AAAI-2002, pdf
- Anup K. Sen, Amitava Bagchi, Weixiong Zhang (2004). Average-case analysis of best-first search in two representative directed acyclic graphs. Artificial Intelligence, Vol. 155, Nos. 1-2
- Rahul Roy, Amitava Bagchi (2007). On estimating the time taken to rectify faults in a software package during the system testing phase. Information Processing Letters, Vol. 104, No. 5
- Soumyakanti Chakraborty, Amitava Bagchi, Anup K. Sen (2009). Revaluation of Bundles by Bidders in Combinatorial Auctions. HICSS 2009
- Soumyakanti Chakraborty, Amitava Bagchi, Anup K. Sen (2009). Designing Proxy Bidders for Online Combinatorial Auctions. HICSS 2009
2010 ...
- Hema S. Meda, Anup K. Sen, Amitava Bagchi (2010). On Detecting Data Flow Errors in Workflows. Journal of Data and Information Quality, Vol. 2, No. 2
- Soumyakanti Chakraborty, Anup K. Sen, Amitava Bagchi (2014). Experimenting with Proxy Agents in Online Combinatorial Auctions. IJIIT, Vol. 10, No. 2
- Soumyakanti Chakraborty, Anup K. Sen, Amitava Bagchi (2015). Combinatorial Auctions for Player Selection in the Indian Premier League (IPL). Journal of Sports Economics, Vol. 16, No. 1
External Links
- The Mathematics Genealogy Project - Amitava Bagchi
- Dr. Amitava Bagchi | West Bengal University of Technology | India
