Namrata
Namrata
Embedded Files
I am a research fellow in the Theory of Computation group at the University of Birmingham, UK. I am funded by Rajesh Chitnis' grant, New Frontiers in Fine-Grained Approximation Algorithms.
Previously, I was a postdoc in the Algorithms, Complexity Theory and Optimization group at the University of Liverpool hosted by Sebastian Wild.
I did my PhD in the Division of Theory and Foundations (FoCS) and the Centre for Discrete Mathematics and its Applications (DIMAP) at the University of Warwick. I was advised by Torsten Mütze and my research was supported by the Chancellor's International Scholarship.
Before joining Warwick, I graduated with an MSc degree in Theoretical Computer Science from Chennai Mathematical Institute, India, where I was advised by Partha Mukhopadhyay. During my master's, I was also a research intern at Sorbonne University, Paris, where I was hosted by Vincent Cohen-Addad.
Before delving into academia, I worked as a software developer for five years at Oracle Corporation.
Research Interests
Research Interests
I am interested in algorithmic design and, broadly speaking, in discrete mathematics. My PhD was in enumerative combinatorics, where the goal is to exhaustively generate various combinatorial objects. I aim to generate such objects efficiently using Gray codes. The research during my PhD revolved around objects defined by intersecting set systems. I also studied combinatorial properties of classical objects characterized by pattern avoidance.
Currently, I am learning about ETH-based lower bounds in parameterized complexity in problems originating from geometry and machine learning. I am also interested in designing lower bounds for Quantum algorithms.
Page updated
Google Sites
Report abuse