Amatya Sharma

Amatya Sharma is a PhD candidate in Computer Science and Engineering at the University of Michigan, Ann Arbor. His research focuses on approximation algorithms, streaming algorithms, and parameterized complexity, with an emphasis on constraint satisfaction and clustering problems. He studies how the structure of an optimization problem determines the computational resources needed to solve or approximate it. His work includes approximation algorithms for clustering and geometric packing, as well as characterizations of the memory required to solve constraint satisfaction problems in streaming models.