Difference between revisions of "Amitava Bagchi"

From Chessprogramming wiki
Jump to: navigation, search
Line 44: Line 44:
 
'''[[People|Up one level]]'''
 
'''[[People|Up one level]]'''
 
[[Category:Mathematician|Bagchi]]
 
[[Category:Mathematician|Bagchi]]
 +
[[Category:Physicist|Bagchi]]
 
[[Category:Researcher|Bagchi]]
 
[[Category:Researcher|Bagchi]]

Revision as of 22:09, 3 November 2020

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*.

Selected Publications

[2] [3] [4]

1970 ...

1980 ...

1990 ...

2000 ...

2010 ...

External Links

References

Up one level