Anuj Tawari

Anuj Tawari
PhD (Theoretical Computer Science), The Institute of Mathematical Sciences, Chennai
079-68261660 # 3104, FB-3, DA-IICT, Gandhinagar, Gujarat, India – 382007 anuj_tawari[at]daiict[dot]ac[dot]in https://sites.google.com/site/anujtawari/home

I obtained my Ph.D. in 2019 from The Institute of Mathematical Sciences (HBNI), Chennai Under the supervision of Prof. Meena Mahajan. My Ph.D. thesis dealt with some lower bound questions in Algebraic Complexity. Prior to joining DA-IICT, I was a post-doctoral fellow at Chennai Mathematical Institute. My research interests are in the broad area of Algorithms and Complexity Theory. I joined DA-IICT in March 2021.

Algorithms and Complexity Theory

  • Dynamic Complexity of Expansion With Samir Datta and YaduVasudev. To appear in CSR 2021
  • Dynamic Complexity of Reachability: How many changes can we handle? With Samir Datta, Pankaj Kumar, Anish Mukherjee,  Nils Vortmeier and Thomas Zeume. ICALP 2020 (Track B)
  • Shortest path length with bounded alternation (min, +) formulas With Meena Mahajan and Prajakta Nimbhorkar. International Journal of Advances in Engineering Sciences and Applied Mathematics, 11(1): pp 68-74, 2019
  • Computing the maximum using (min, +) formulas With Meena Mahajan and Prajakta Nimbhorkar MFCS 2017
  • Sums of read-once formulas: How many summands are necessary? With Meena Mahajan In Theoretical Computer Science, Vol. 708, Pg. 34-45, 2018 Preliminary version in CSR 2016.
Back to Top