Srikanth Srinivasan

ORCID

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 107

Top Venues

Electron. Colloquium Comput. Complex.

CoRR

STOC

Theory Comput.

Publications

Prashanth Amireddy, Amik Raj Behera, Manaswi Paraashar, Srikanth Srinivasan, Madhu Sudan
Local Correction of Linear Functions over the Boolean Cube. CoRR (2024)
Hervé Fournier, Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas
On the Power of Homogeneous Algebraic Formulas. STOC (2024)
Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits. Commun. ACM 67 (2) (2024)
Prashanth Amireddy, Amik Raj Behera, Manaswi Paraashar, Srikanth Srinivasan, Madhu Sudan
Local Correction of Linear Functions over the Boolean Cube. Electron. Colloquium Comput. Complex. (2024)
Prashanth Amireddy, Amik Raj Behera, Manaswi Paraashar, Srikanth Srinivasan, Madhu Sudan
Local Correction of Linear Functions over the Boolean Cube. STOC (2024)
Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan, Sébastien Tavenas
Towards Optimal Depth-Reductions for Algebraic Formulas. CoRR (2023)
Srikanth Srinivasan
A Robust Version of Hegedűs's Lemma, with Applications. TheoretiCS 2 (2023)
Prasad Chaugule, Mrinal Kumar, Nutan Limaye, Chandra Kanta Mohapatra, Adrian She, Srikanth Srinivasan
Schur Polynomials Do Not Have Small Formulas If the Determinant does not. Comput. Complex. 32 (1) (2023)
Hervé Fournier, Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas
On the Power of Homogeneous Algebraic Formulas. Electron. Colloquium Comput. Complex. (2023)
Srikanth Srinivasan, Utkarsh Tripathi
Optimal Explicit Small-Depth Formulas for the Coin Problem. STOC (2023)
Srikanth Srinivasan, Amir Yehudayoff
The discrepancy of greater-than. CoRR (2023)
Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan, Sébastien Tavenas
Towards Optimal Depth-Reductions for Algebraic Formulas. Electron. Colloquium Comput. Complex. (2023)
Prashanth Amireddy, Srikanth Srinivasan, Madhu Sudan
Low-Degree Testing Over Grids. CoRR (2023)
Prashanth Amireddy, Srikanth Srinivasan, Madhu Sudan
Low-Degree Testing over Grids. APPROX/RANDOM (2023)
Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan, Sébastien Tavenas
Towards Optimal Depth-Reductions for Algebraic Formulas. CCC (2023)
Srikanth Srinivasan
A Robust Version of Hegedűs's Lemma, with Applications. CoRR (2022)
Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas
On the Partial Derivative Method Applied to Lopsided Set-Multilinear Polynomials. Electron. Colloquium Comput. Complex. (2022)
Siddharth Bhandari, Prahladh Harsha, Ramprasad Saptharishi, Srikanth Srinivasan
Vanishing Spaces of Random Sets and Applications to Reed-Muller Codes. Electron. Colloquium Comput. Complex. (2022)
Radu Curticapean, Nutan Limaye, Srikanth Srinivasan
On the VNP-hardness of Some Monomial Symmetric Polynomials. Electron. Colloquium Comput. Complex. (2022)
Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits. FOCS (2022)
Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas
Guest Column: Lower Bounds Against Constant-Depth Algebraic Circuits. SIGACT News 53 (2) (2022)
Swapnam Bajpai, Vaibhav Krishan, Deepanshu Kush, Nutan Limaye, Srikanth Srinivasan
A #SAT Algorithm for Small Constant-Depth Circuits with PTF gates. Algorithmica 84 (4) (2022)
Siddharth Bhandari, Prahladh Harsha, Ramprasad Saptharishi, Srikanth Srinivasan
Vanishing Spaces of Random Sets and Applications to Reed-Muller Codes. CoRR (2022)
Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas
On the Partial Derivative Method Applied to Lopsided Set-Multilinear Polynomials. CCC (2022)
Siddharth Bhandari, Prahladh Harsha, Ramprasad Saptharishi, Srikanth Srinivasan
Vanishing Spaces of Random Sets and Applications to Reed-Muller Codes. CCC (2022)
Radu Curticapean, Nutan Limaye, Srikanth Srinivasan
On the VNP-Hardness of Some Monomial Symmetric Polynomials. FSTTCS (2022)
Sébastien Tavenas, Nutan Limaye, Srikanth Srinivasan
Set-multilinear and non-commutative formula lower bounds for iterated matrix multiplication. STOC (2022)
Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh
On the Probabilistic Degrees of Symmetric Boolean Functions. SIAM J. Discret. Math. 35 (3) (2021)
Siddharth Bhandari, Prahladh Harsha, Tulasimohan Molli, Srikanth Srinivasan
On the probabilistic degree of OR over the reals. Random Struct. Algorithms 59 (1) (2021)
Srikanth Srinivasan, S. Venkitesh
On the Probabilistic Degree of an n-Variate Boolean Function. APPROX-RANDOM (2021)
Srikanth Srinivasan, S. Venkitesh
On the Probabilistic Degree of an $n$-variate Boolean Function. Electron. Colloquium Comput. Complex. 28 (2021)
Srikanth Srinivasan, S. Venkitesh
On the Probabilistic Degree of an n-variate Boolean Function. CoRR (2021)
Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas
New Non-FPT Lower Bounds for Some Arithmetic Formulas. Electron. Colloquium Comput. Complex. 28 (2021)
Nutan Limaye, Karteek Sreenivasaiah, Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh
A Fixed-Depth Size-Hierarchy Theorem for $\mathrm{AC}^0[\oplus]$ via the Coin Problem. SIAM J. Comput. 50 (4) (2021)
Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits. Electron. Colloquium Comput. Complex. 28 (2021)
Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits. FOCS (2021)
Srikanth Srinivasan
Strongly Exponential Separation between Monotone VP and Monotone VNP. ACM Trans. Comput. Theory 12 (4) (2020)
Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh
Decoding Variants of Reed-Muller Codes over Finite Grids. ACM Trans. Comput. Theory 12 (4) (2020)
Prasad Chaugule, Mrinal Kumar, Nutan Limaye, Chandra Kanta Mohapatra, Adrian She, Srikanth Srinivasan
Schur Polynomials Do Not Have Small Formulas If the Determinant Doesn't. Computational Complexity Conference (2020)
Srikanth Srinivasan
A robust version of Hegedus's lemma, with applications. STOC (2020)
Srikanth Srinivasan
A Robust Version of Hegedűs's Lemma, with Applications. Electron. Colloquium Comput. Complex. 27 (2020)
Mitali Bafna, Srikanth Srinivasan, Madhu Sudan
Local decoding and testing of polynomials over grids. Random Struct. Algorithms 57 (3) (2020)
Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh
On the Probabilistic Degrees of Symmetric Boolean Functions. FSTTCS (2019)
Benjamin Rossman, Srikanth Srinivasan
[⊕] Formulas and Circuits. Theory Comput. 15 (2019)
Nutan Limaye, Srikanth Srinivasan, Utkarsh Tripathi
More on AC^0[oplus] and Variants of the Majority Function. FSTTCS (2019)
Guillaume Lagarde, Nutan Limaye, Srikanth Srinivasan
Lower Bounds and PIT for Non-commutative Arithmetic Circuits with Restricted Parse Trees. Comput. Complex. 28 (3) (2019)
Prahladh Harsha, Srikanth Srinivasan
Robust Multiplication-Based Tests for Reed-Muller Codes. IEEE Trans. Inf. Theory 65 (1) (2019)
Srikanth Srinivasan
Strongly Exponential Separation Between Monotone VP and Monotone VNP. CoRR (2019)
Nutan Limaye, Karteek Sreenivasaiah, Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh
[⊕] via the coin problem. STOC (2019)
Swapnam Bajpai, Vaibhav Krishan, Deepanshu Kush, Nutan Limaye, Srikanth Srinivasan
A #SAT Algorithm for Small Constant-Depth Circuits with PTF Gates. ITCS (2019)
Prasad Chaugule, Mrinal Kumar, Nutan Limaye, Chandra Kanta Mohapatra, Adrian She, Srikanth Srinivasan
Schur Polynomials do not have small formulas if the Determinant doesn't! Electron. Colloquium Comput. Complex. 26 (2019)
Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh
On the Probabilistic Degrees of Symmetric Boolean functions. Electron. Colloquium Comput. Complex. 26 (2019)
Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh
Decoding Downset codes over a finite grid. Electron. Colloquium Comput. Complex. 26 (2019)
Prahladh Harsha, Srikanth Srinivasan
On polynomial approximations to AC. Random Struct. Algorithms 54 (2) (2019)
Igor Carboni Oliveira, Rahul Santhanam, Srikanth Srinivasan
Parity Helps to Compute Majority. Computational Complexity Conference (2019)
Srikanth Srinivasan
Strongly Exponential Separation Between Monotone VP and Monotone VNP. Electron. Colloquium Comput. Complex. 26 (2019)
Prasad Chaugule, Mrinal Kumar, Nutan Limaye, Chandra Kanta Mohapatra, Adrian She, Srikanth Srinivasan
Schur Polynomials do not have small formulas if the Determinant doesn't! CoRR (2019)
Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh
On the Probabilistic Degrees of Symmetric Boolean functions. CoRR (2019)
Suryajith Chillara, Nutan Limaye, Srikanth Srinivasan
Small-Depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication with Applications. SIAM J. Comput. 48 (1) (2019)
Srikanth Srinivasan
Special Issue: CCC 2018: Guest Editor's Foreword. Theory Comput. 15 (2019)
Igor Carboni Oliveira, Rahul Santhanam, Srikanth Srinivasan
Parity helps to compute Majority. Electron. Colloquium Comput. Complex. 26 (2019)
Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh
Decoding Downset codes over a finite grid. CoRR (2019)
Nutan Limaye, Srikanth Srinivasan, Utkarsh Tripathi
More on $AC^0[\oplus]$ and Variants of the Majority Function. Electron. Colloquium Comput. Complex. 26 (2019)
Suryajith Chillara, Christian Engels, Nutan Limaye, Srikanth Srinivasan
A Near-Optimal Depth-Hierarchy Theorem for Small-Depth Multilinear Circuits. CoRR (2018)
Siddharth Bhandari, Prahladh Harsha, Tulasimohan Molli, Srikanth Srinivasan
On the Probabilistic Degree of OR over the Reals. CoRR (2018)
Suryajith Chillara, Nutan Limaye, Srikanth Srinivasan
A Quadratic Size-Hierarchy Theorem for Small-Depth Multilinear Formulas. ICALP (2018)
Siddharth Bhandari, Prahladh Harsha, Tulasimohan Molli, Srikanth Srinivasan
On the Probabilistic Degree of OR over the Reals. Electron. Colloquium Comput. Complex. 25 (2018)
Swapnam Bajpai, Vaibhav Krishan, Deepanshu Kush, Nutan Limaye, Srikanth Srinivasan
A #SAT Algorithm for Small Constant-Depth Circuits with PTF gates. CoRR (2018)
Swastik Kopparty, Srikanth Srinivasan
Certifying Polynomials for $\mathrm{AC}^0[\oplus]$ Circuits, with Applications to Lower Bounds and Circuit Compression. Theory Comput. 14 (1) (2018)
Nutan Limaye, Karteek Sreenivasaiah, Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh
The Coin Problem in Constant Depth: Sample Complexity and Parity Gates. CoRR (2018)
Swapnam Bajpai, Vaibhav Krishan, Deepanshu Kush, Nutan Limaye, Srikanth Srinivasan
A #SAT Algorithm for Small Constant-Depth Circuits with PTF gates. Electron. Colloquium Comput. Complex. 25 (2018)
Nutan Limaye, Karteek Sreenivasaiah, Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh
The Coin Problem in Constant Depth: Sample Complexity and Parity gates. Electron. Colloquium Comput. Complex. 25 (2018)
Suryajith Chillara, Nutan Limaye, Srikanth Srinivasan
Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications. STACS (2018)
Srikanth Srinivasan, Madhu Sudan
Local Decoding and Testing of Polynomials over Grids. ITCS (2018)
Ruiwen Chen, Rahul Santhanam, Srikanth Srinivasan
Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits. CoRR (2018)
Ninad Rajgopal, Rahul Santhanam, Srikanth Srinivasan
Deterministically Counting Satisfying Assignments for Constant-Depth Circuits with Parity Gates, with Implications for Lower Bounds. MFCS (2018)
Suryajith Chillara, Christian Engels, Nutan Limaye, Srikanth Srinivasan
A Near-Optimal Depth-Hierarchy Theorem for Small-Depth Multilinear Circuits. FOCS (2018)
Ruiwen Chen, Rahul Santhanam, Srikanth Srinivasan
Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits. Theory Comput. 14 (1) (2018)
Siddharth Bhandari, Prahladh Harsha, Tulasimohan Molli, Srikanth Srinivasan
On the Probabilistic Degree of OR over the Reals. FSTTCS (2018)
Suryajith Chillara, Christian Engels, Nutan Limaye, Srikanth Srinivasan
A Near-Optimal Depth-Hierarchy Theorem for Small-Depth Multilinear Circuits. Electron. Colloquium Comput. Complex. 25 (2018)
Vikraman Arvind, Srikanth Srinivasan
On the hardness of the noncommutative determinant. Comput. Complex. 27 (1) (2018)
Suryajith Chillara, Nutan Limaye, Srikanth Srinivasan
Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications. CoRR (2017)
Venkatesan Guruswami, Prahladh Harsha, Johan Håstad, Srikanth Srinivasan, Girish Varma
Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long Codes. SIAM J. Comput. 46 (1) (2017)
Benjamin Rossman, Srikanth Srinivasan
Separation of AC$^0[\oplus]$ Formulas and Circuits. CoRR (2017)
Abhishek Bhrushundi, Prahladh Harsha, Srikanth Srinivasan
Z. CoRR (2017)
Srikanth Srinivasan
On Some Recent Projection Switching Lemmas for Small Depth Circuits. Bull. EATCS 122 (2017)
Abhishek Bhrushundi, Prahladh Harsha, Srikanth Srinivasan
ℤ. Electron. Colloquium Comput. Complex. 24 (2017)
Benjamin Rossman, Srikanth Srinivasan
Separation of AC^0[oplus] Formulas and Circuits. ICALP (2017)
Srikanth Srinivasan, Madhu Sudan
Local decoding and testing of polynomials over grids. CoRR (2017)
Suryajith Chillara, Nutan Limaye, Srikanth Srinivasan
Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications. Electron. Colloquium Comput. Complex. 24 (2017)
Abhishek Bhrushundi, Prahladh Harsha, Srikanth Srinivasan
On Polynomial Approximations Over Z/2^kZ*. STACS (2017)
Srikanth Srinivasan, Madhu Sudan
Local decoding and testing of polynomials over grids. Electron. Colloquium Comput. Complex. 24 (2017)
Neeraj Kayal, Nutan Limaye, Chandan Saha, Srikanth Srinivasan
An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas. SIAM J. Comput. 46 (1) (2017)
Hervé Fournier, Nutan Limaye, Meena Mahajan, Srikanth Srinivasan
The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials. Theory Comput. 13 (1) (2017)
Guillaume Lagarde, Nutan Limaye, Srikanth Srinivasan
Lower Bounds and PIT for Non-Commutative Arithmetic Circuits with Restricted Parse Trees. MFCS (2017)
Guillaume Lagarde, Nutan Limaye, Srikanth Srinivasan
Lower Bounds and PIT for Non-Commutative Arithmetic circuits with Restricted Parse Trees. Electron. Colloquium Comput. Complex. 24 (2017)
Benjamin Rossman, Srikanth Srinivasan
[⊕] Formulas and Circuits. Electron. Colloquium Comput. Complex. 24 (2017)
Prahladh Harsha, Srikanth Srinivasan
On Polynomial Approximations to ${AC}^0$. CoRR (2016)
Prahladh Harsha, Srikanth Srinivasan
Robust Multiplication-Based Tests for Reed-Muller Codes. FSTTCS (2016)
Nikhil Balaji, Nutan Limaye, Srikanth Srinivasan
An Almost Cubic Lower Bound for ΣΠΣ Circuits Computing a Polynomial in VP. Electron. Colloquium Comput. Complex. 23 (2016)

Srikanth Srinivasan.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Srikanth Srinivasan