Anuj Tawari

Sums of Read-Once Formulas: How Many Summands Suffice?

Meena Mahajan, Anuj Tawari, 2016, CSR.

Computing the Maximum using (min, +) Formulas

Meena Mahajan, Prajakta Nimbhorkar, Anuj Tawari, 2017, MFCS.

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

Meena Mahajan, Prajakta Nimbhorkar, Anuj Tawari, 2018, Electron. Colloquium Comput. Complex..

Dynamic Complexity of Expansion pdf

Samir Datta, Yadu Vasudev, Anuj Tawari, 2020, CSR.

Sums of read-once formulas: How many summands are necessary?

Meena Mahajan, Anuj Tawari, 2018, Theor. Comput. Sci..

Dynamic complexity of Reachability: How many changes can we handle? pdf

Thomas Zeume, Pankaj Kumar, Samir Datta, 2020, ICALP.