Greedy Strikes Again: A Deterministic PTAS for Commutative Rank of Matrix Spaces. - Markus Bläser; Gorav Jindal; Anurag Pandey 001 (Electron. Colloquium Comput. Complex., 2016)

Algebraic independence over positive characteristic: New criterion and applications to locally low-algebraic-rank circuits. - Anurag Pandey 001; Nitin Saxena 001; Amit Sinhababu (Comput. Complex., 2018)

A Deterministic PTAS for the Commutative Rank of Matrix Spaces. - Markus Bläser; Gorav Jindal; Anurag Pandey 001 (Theory Comput., 2018)

A Deterministic PTAS for the Algebraic Rank of Bounded Degree Polynomials. - Vishwas Bhargava; Markus Bläser; Gorav Jindal; Anurag Pandey 001 (SODA, 2019)

Variety Membership Testing, Algebraic Natural Proofs, and Geometric Complexity Theory. - Markus Bläser; Christian Ikenmeyer; Vladimir Lysikov; Anurag Pandey 001; Frank-Olaf Schreyer (CoRR, 2019)

Polynomial Identity Testing for Low Degree Polynomials with Optimal Randomness. - Markus Bläser; Anurag Pandey 001 (APPROX-RANDOM, 2020)

How many zeros of a random sparse polynomial are real? - Gorav Jindal; Anurag Pandey 001; Himanshu Shukla; Charilaos Zisopoulos (ISSAC, 2020)

Graph Homomorphism Polynomials: Algorithms and Complexity. - Balagopal Komarath; Anurag Pandey 001; Chengot Sankaramenon Rahul (CoRR, 2020)

Algebraic Branching Programs, Border Complexity, and Tangent Spaces. - Markus Bläser; Christian Ikenmeyer; Meena Mahajan; Anurag Pandey 001; Nitin Saurabh (Electron. Colloquium Comput. Complex., 2020)

On the Orbit Closure Containment Problem and Slice Rank of Tensors. - Markus Bläser; Christian Ikenmeyer; Vladimir Lysikov; Anurag Pandey 001; Frank-Olaf Schreyer (SODA, 2021)

Arithmetic Circuit Complexity of Division and Truncation. - Pranjal Dutta; Gorav Jindal; Anurag Pandey 001; Amit Sinhababu (Electron. Colloquium Comput. Complex., 2021)

Variety membership testing in algebraic complexity theory. - Anurag Pandey 001 (2021)

Rabbits Approximate, Cows Compute Exactly! - Balagopal Komarath; Anurag Pandey 001; Nitin Saurabh (MFCS, 2022)

Monotone Arithmetic Complexity of Graph Homomorphism Polynomials. - Balagopal Komarath; Anurag Pandey 001; Chengot Sankaramenon Rahul (Algorithmica, 2023)