Amitabh Chaudhary joined the University of Chicago, leaving the University of Notre Dame as an Assistant Professor in the Department of Computer Science and Engineering, in 2005. Before this he was an Associate Specialist in the Donald Bren School of Information and Computer Sciences at University of California, Irvine.
Dr. Chaudhary’s research is directed at the design, analysis, and application of algorithms, primarily online algorithms—algorithms that compute under incomplete information. His algorithms have addressed fundamental problems in resource allocation, distributed databases, scientific computing, network routing, fault-tolerance, spatial data management, inventory control, and graph theory. His recent work is in designing algorithms for the notorious newsvendor problem in supply chain management, and in developing efficient caching solutions for dynamic data in scientific databases.
He has over 35 publications in high-impact journals and conferences. He has reviewed for several journals and served on the program committees of a number of conferences. He is a member of the ACM and IEEE. He has received research grants from the NSF and a National Scholarship from NCERT, India. Recently he received the Outstanding Teacher Award from his department at the University of Notre Dame.
ACTIVITIES / INTERESTS
- Online algorithms
- Spatial data structures
- Graph theory
- Ph.D., Computer Science, Johns Hopkins University, 2002.