Title: Distribution Testing and Computation Complexity
Abstract: Given the ability to draw samples from an unknown distribution D, what properties can be inferred about D? How many samples are needed? Dr. Aduri will present Theoretical Computer Science approach to this problem and provide a computational complexity perspective. This talk is accessible to researchers not working in the area of Theoretical Computer Science.
Bio: Pavankumar (Pavan) Aduri is a Professor in the Department of Computer Science. Pavan's areas of expertise are Algorithms, Computational Theory and Complexity, and Big Data Analytics. Pavan has been with ISU for the last 17 years. Pavan received his PhD from the University of Buffalo.
After Dr. Aduri presents, there will be a short time for discussion and questions afterwards. Please feel free to bring your lunch!