Somewhere, something incredible is waiting to be known.
I am broadly interested in Theoretical Computer Science. While I am still exploring areas, I enjoy Algorithms which use insights from probability, combinatorics or graph theory. I also enjoy Complexity Theory and am enthusiastic about recent developments in Communication Complexity and Fine-Grained Complexity.
I am studying Streaming/Sketching algorithms from various sources and presenting to Prof Rajiv and some of my peers. I am also compiling notes on what I present.
In May 2018 I started working on Guillotine Cuts for Axis Parallel Rectangles. The general problem dates back to the paper Cutting Glass [Pach, Tardos] but the specific problem we’re working on is presented directly in On Guillotine Cutting Sequences [Abed, Chalermsook et al]. In particular, we want to know if one can always save Omega(n) rectangles and exactly what fraction is feasible. Such a lower bound would imply a polytime constant approximation for MISR (Maximum Independent Set on Rectangles), as explained in second linked paper. We found and explored an interesting link with Pattern Matching in permutations.
If you optimize everything, you will always be unhappy.
Accepted to the 4th CSE Winter School.
Visited Shanghai in the summer, hosted by Prof Bundit.
Selected for scholarship to attend the summer school.
Selected to study various topics in Combinatorics and Graph Theory during the summer term.
I was a scholar selected to study state of the art material from renowned professors. The school had the objective of motivating research and promoting collaboration.
IIIT-Delhi Grading Scheme
|Letter Grade||Grade Point||Comment|