Anuj Tawari

Assistant Professor ,

Sardar Patel Institute of Technology,

Mumbai

Email :  anuj.tawari@spit.ac.in

I am an Assistant Professor at Sardar Patel Institute of Technology, Mumbai. Previously, I was an Assistant Professor at DA-IICT . Prior to joining DA-IICT , I was a postdoctoral fellow at Chennai Mathematical Institute.



Research Interests

Dynamic Algorithms, Complexity Theory and Program Verification


Teaching

August-December 2021   Design and Analysis of Algorithms (2nd year B.Tech (ICT)) (with Supantha Pandit)

August-December 2021  Advanced Algorithms (1st year M.Tech)

January-May            2022   Parallel and Distributed Algorithms  (2nd year B.Tech (MnC)  (with Rahul Muthu)

August-December 2022   Design and Analysis of Algorithms (2nd year B.Tech (MnC)) 

August-December 2022  Advanced Algorithms (1st year M.Tech)

January-May 2023   Parallel and Distributed Algorithms  (2nd year B.Tech (MnC)

August-December 2023  Advanced Algorithms (1st year M.Tech)  

August-December 2023   Design and analysis of algorithms (2nd year B.Tech(MnC))

January-May 2024        Design and analysis of Algorithms(2nd year B.Tech(AIML))

January-May 2024        Operating Systems (2nd year B.Tech(Data Science))

January-May 2024        High Performance Computing Lab (1st year M.Tech)


Research Publications


Exactly k MSTs :  How many vertices suffice?

Joint work with Apratim Dutta, Rahul Muthu and V.Sunitha

In Proceedings of 16th Annual International Conference on Combinatorial Optimization

and Applications (COCOA), 2023


Dynamic Complexity of Expansion

Joint work with Samir Datta and Yadu Vasudev. 

 In Proceedings of 16th Computer Science Symposium in Russia (CSR), 2021. 



Dynamic Complexity of Reachability: How many changes can we handle? 

Joint work with Samir Datta, Pankaj Kumar, Anish Mukherjee, Nils Vortmeier

and Thomas Zeume. 

In Proceedings of 47th International Colloqium on Automata, Languages and Programming (ICALP), 2020.



Shortest path lengths with bounded-alternation (min, +) formulas

Joint work with Meena Mahajan and Prajakta Nimbhorkar.

In International Journal of Advances in Engineering Sciences and

Applied Mathematics, 11(1): pp 68-74, 2019



 

Computing the maximum using (min, +) formulas

Joint work with Meena Mahajan and Prajakta Nimbhorkar

In Proceedings of 42nd International Symposium on Mathematical Foundations Of Computer Science (MFCS), 2017.



Sums of read-once formulas: How many summands suffice?

Joint work with Meena Mahajan.

In Theoretical Computer Science, Vol. 708, pp 34-45, 2018 

Preliminary version in Proceedings of 11th Computer Science Symposium in Russia (CSR), 2016.




Education


               Thesis title: Lower bounds for read-once and tropical formulas

             Advisor:  Prof. Meena Mahajan