(in reverse chronological order).

papers in the area

- Isomorphism Testing of Read-once Functions and Polynomials [pdf]

(with Jayalal Sarma)

- Limitations of Sums of Bounded Read Formulas and ABPs [pdf]

(with Purnata Ghosal)

- Parameterised Counting in Logspace [pdf]

(with Anselm Haak, Arne Meier, Om Prakash)

- On Measures of Space Over Real and Complex numbers [pdf]

(with Om Prakash)

- Lower Bounds for Multilinear Order-restricted ABPs [pdf]

(with Ramya C.)

- On Proving Parameterized Size Lower Bounds for Multilinear Algebraic Models [pdf]

(with Purnata Ghosal)

- Linear projections of the Vandermonde polynomial [pdf]

(with Ramya C.)

- Lower bounds for Sum and Sum of Products of Read-once Formulas [pdf]

(with Ramya C.)

- Lower Bounds for Special Classes of Syntactic Multilinear ABPs [pdf]

(with Ramya C.)

- On Weak-Space Complexity over Complex Numbers [pdf]

(with Pushkar Joglekar, Siddhartha Sivakumar)

- On depth five Sum-Power-Sum-Power-Sum Circuits: The Role of Middle Σ Fan-in, Homogeneity and Bottom Degree [pdf]

(with Christian Engels, Karteek Sreenivasaiah)

- Testing Equivalence of Polynomials under Scaling [pdf]

(with Markus Blaser, Jayalal Sarma)

- On Constant Depth Circuits Parameterized by Degree: Identity Testing and Depth Reduction [pdf]

(with Purnata Ghosal, Om Prakash)

- On Hard Instances of Non-Commutative Permanent [pdf]

(with Christian Engels)

- Parameterized Analogues of Probabilistic Computation [pdf]

(with Ankit Chauhan)

- Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems [pdf]

(with Karl Bringmann, Christian Engels, Bodo Manthey)

- Building above read-once polynomials: identity testing and hardness of representation. [pdf]

(with Meena Mahajan, Karteek Sreenivasaiah)

- Complexity of Testing Reachability in Matroids [pdf]

(with Jayalal Sarma)

- Monomials, multilinearity and identity testing in simple read-restricted circuits [pdf]

(with Meena Mahajan, Karteek Sreenivasaiah)

- Small space analogues of Valiants classes [pdf]

(with Meena Mahajan)

- Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals [pdf]

(with Markus Blaeser, Bodo Manthey)

- Resource Trade-offs in Syntactically Multilinear Arithmetic Circuits [pdf]

(with Maurice Jansen, Meena Mahajan)

- Probabilistic Analysis of Christofides Algorithm. [pdf]

(with Markus Blaeser, Konstantinos Panagiotou)

- Faster Algorithms for Finding and Counting Subgraphs. [pdf]

(with Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh)

- Counting classes and the fine structure between NC^1 and L [pdf]

(with Samir Datta, Meena Mahajan, Michael Thomas, Heribert Vollmer)

- On the Complexity of Matroid Isomorphism Problem [pdf]

(with Jayalal Sarma)

- Arithmetizing Classes around NC1 and L [pdf]

(with Meena Mahajan, Nutan Limaye)

- Simulation of Arithmetical Circuits by Branching Programs Preserving Constant Width and Syntactic Multilinearity [pdf]

(with Maurice Jansen)

Last updated on Fri Jul 25 10:15:59 IST 2014