E-LIB Suche - Ergebnisse für: Tawari, Anuj

1

Exactly k MSTs: How Many Vertices Suffice?:

, In: Combinatorial Optimization and Applications; Lecture Notes in Computer Science,

Dutta, Apratim ; Muthu, Rahul ; Tawari, Anuj. - p. 94-106 , 2023

Link: https://doi.org/10.1007/..

2

Dynamic Complexity of Expansion:

, In: Computer Science – Theory and Applications; Lecture Notes in Computer Science,

Datta, Samir ; Tawari, Anuj ; Vasudev, Yadu - p. 56-77 , 2021

Link: https://doi.org/10.1007/..

3

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

Mahajan, Meena ; Tawari, Anuj
Theoretical Computer Science. 708 (2018) - p. 34-45 , 2018

Link: https://doi.org/10.1016/..

4

Shortest path length with bounded-alternation $$(\min ,+)$$..:

Mahajan, Meena ; Nimbhorkar, Prajakta ; Tawari, Anuj
International Journal of Advances in Engineering Sciences and Applied Mathematics. 11 (2018) 1 - p. 68-74 , 2018

Link: https://doi.org/10.1007/..

5

Dynamic complexity of Reachability: How many changes can we..:

Datta, Samir ; Kumar, Pankaj ; Mukherjee, Anish...
http://arxiv.org/abs/2004.12739. , 2020

Link: http://arxiv.org/abs/200..

6

Dynamic Complexity of Reachability: How Many Changes Can We..:

Datta, Samir ; Kumar, Pankaj ; Mukherjee, Anish...
doi:10.4230/LIPIcs.ICALP.2020.122. , 2020

Link: https://doi.org/10.4230/..

7

Dynamic Complexity of Expansion:

Datta, Samir ; Tawari, Anuj ; Vasudev, Yadu
http://arxiv.org/abs/2008.05728. , 2020

Link: http://arxiv.org/abs/200..

8

Computing the Maximum using (min, +) Formulas:

Mahajan, Meena ; Nimbhorkar, Prajakta ; Tawari, Anuj
doi:10.4230/LIPIcs.MFCS.2017.74. , 2017

Link: https://doi.org/10.4230/..

9

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

Mahajan, Meena ; Tawari, Anuj
http://arxiv.org/abs/1603.02605. , 2016

Link: http://arxiv.org/abs/160..

10

Read-once polynomials: How many summands suffice?:

Mahajan, Meena ; Tawari, Anuj
http://arxiv.org/abs/1512.04386. , 2015

Link: http://arxiv.org/abs/151..