Somewhere, something incredible is waiting to be known.
Carl Sagan
Research Interests
I am broadly interested in Theoretical Computer Science. While I am still exploring areas, some fields I want to work in:
- Approximation Algorithms
- Fine Grained Complexity
Projects
Algorithms for Big Data
Prof Rajiv Raman | Independent Study
I am studying the topic from various sources and presenting to Prof Rajiv and some of my peers. I will also be compiling notes on what I present.
Online Matching
Prof Syamantak Das | Independent Project
Argh!
Algorithms Reading Group Hour
Guillotine Cuts & Pattern Avoidance in Permutations
Prof Rajiv Raman & Prof Samrith Ram | Bachelor’s Thesis
From May 2018 to May 2019 I was 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.
Project Resources
If you optimize everything, you will always be unhappy.
Donald Knuth
Experience
2019
Research Intern
Prof Bundit Laekhanukit | ITCS@SUFE
Visited Shanghai in the summer, hosted by Prof Bundit.
Mathematics for Data Science
IFCAM Summer School | IISc Bangalore
Selected for scholarship to attend the summer school.
2018
External reviewer for Journal of Computer and System Sciences (JCSS)
Prof Debajyoti Bera | IIIT Delhi
Teaching Assistant | Discrete Structures
Prof Rajiv Raman | IIIT Delhi
The course website can be found here. For students of IIITD, the Backpack course is here.
Combinatorics & Graph Theory
Prof Samrith Ram | IIIT Delhi Internship
Selected to study various topics in Combinatorics and Graph Theory during the summer term.
2017
Graph Theory & Algorithms
ACM Summer School | IIT Gandhinagar
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.
Notable Courses
- Randomised Algorithms (A-)
- Complexity Theory (A) (Website)
- Modern Algorithm Design (A) (Website)
- Theory of Computation (A) (Website)
- Discrete Structures (A)
- Combinatorics (A)
- Linear Optimisation (A)
- Number Theory (A+)
- Abstract Algebra I (A)
- Abstract Algebra II (A-)
- Intro to Dynamical Systems (A)
- Competitive Programming 1 (A)
- Linear Algebra (A-)
IIIT-Delhi Grading Scheme
| Letter Grade | Grade Point | Comment |
|---|---|---|
| A+ | 10 | Outstanding |
| A | 10 | |
| A- | 9 |