I received my PhD in 2016 from the Tata Institute of Fundamental Research, Mumbai under the supervision of Prof. Jaikumar Radhakrishnan

My thesis titled 'The bit-probe complexity of set membership' is available here and the thesis synopsis is available here.

My master's thesis titled 'Random regular graphs: generation and cover time' is available here.

Publications:

(with Suneel Sarswat)

--AFT 2025 (to appear)


(with Miguel Bosch-Calvo, Fabrizio Grandoni, Felix Hommelsheim, Afrouz Jabal Ameli and Alexander Lindermayr)

--STOC 2025

(with N. Raja, Suneel Sarswat, and Abhishek Kr Singh)

--Journal of Automated Reasoning 2025

(with Debajyoti Kar and Arindam Khan)

--ESA 2024

  (with Suneel Sarswat)

--LPAR Complementary Volume 2024

  (with Felix Hommelsheim and Nicole Megow)

-- ICALP 2023

    (with Fabrizio Grandoni and Afrouz Jabal Ameli)

    --SODA 2023

     (with Suneel Sarswat)

    --FSTTCS 2022

(with Niv Buchbinder, Moran Feldman and Yuval Filmus)

--Mathematical Programming 2020 

(a preliminary version containing a weaker result appeared in IPCO)

(with Christian Engels, Kazihusa Makino and Anup Rao)

--SIAM Journal on Discrete Mathematics 2020

(with Niv Buchbinder and Moran Feldman)

--SODA 2019

(Full version: SIAM Journal on Computing 2023)

(with Jaikumar Radhakrishnan)

--STACS 2017

(with Jaikumar Radhakrishnan)

--SODA 2015

Preprints:

(with Aditya Subramanian)

--Submitted

(with Felix Hommelsheim and Alexander Lindermayr)

--STOC 2025 submisison; pre-merger manuscript