Anuj Tawari

Publication Activity (10 Years)

Years Active: 2015-2023
Publications (10 Years): 13

Top Topics

Dynamically Updated

Tree Decompositions

Probabilistic Databases

Read Once Formulas

Top Venues

Electron. Colloquium Comput. Complex.

Publications

Apratim Dutta, Rahul Muthu, Anuj Tawari, V. Sunitha
Exactly k MSTs: How Many Vertices Suffice? COCOA (1) (2023)
Samir Datta, Anuj Tawari, Yadu Vasudev
Dynamic Complexity of Expansion. CSR (2021)
Samir Datta, Pankaj Kumar, Anish Mukherjee, Anuj Tawari, Nils Vortmeier, Thomas Zeume
Dynamic complexity of Reachability: How many changes can we handle? CoRR (2020)
Samir Datta, Pankaj Kumar, Anish Mukherjee, Anuj Tawari, Nils Vortmeier, Thomas Zeume
Dynamic Complexity of Reachability: How Many Changes Can We Handle? ICALP (2020)
Samir Datta, Anuj Tawari, Yadu Vasudev
Dynamic Complexity of Expansion. CoRR (2020)
Meena Mahajan, Prajakta Nimbhorkar, Anuj Tawari
Computing the maximum using (min, +) formulas. Electron. Colloquium Comput. Complex. 25 (2018)
Meena Mahajan, Prajakta Nimbhorkar, Anuj Tawari
Shortest path length with bounded-alternation (min, +) formulas. Electron. Colloquium Comput. Complex. 25 (2018)
Meena Mahajan, Anuj Tawari
Sums of read-once formulas: How many summands are necessary? Theor. Comput. Sci. 708 (2018)
Meena Mahajan, Prajakta Nimbhorkar, Anuj Tawari
Computing the Maximum using (min, +) Formulas. MFCS (2017)
Meena Mahajan, Anuj Tawari
Sums of Read-Once Formulas: How Many Summands Suffice? CSR (2016)
Meena Mahajan, Anuj Tawari
Sums of read-once formulas: How many summands suffice? CoRR (2016)
Meena Mahajan, Anuj Tawari
Sums of read-once formulas: How many summands suffice? Electron. Colloquium Comput. Complex. 22 (2015)
Meena Mahajan, Anuj Tawari
Read-once polynomials: How many summands suffice? CoRR (2015)