Srikanth Srinivasan

191 papers A* 19A 21B 5Journal 130Unranked 15

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Multilinear Algebraic Branching Programs and the Min-Partition Rank Method. Electron. Colloquium Comput. Complex. Théo Borém Fabris, Nutan Limaye, Srikanth Srinivasan, Amir Yehudayoff
2026	A	`conf`	On Closure Properties of Read-Once Oblivious Algebraic Branching Programs. ITCS Robert Andrews, Jules Armand, Prateek Dwivedi, Magnus Rahbek Dalgaard Hansen, Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas
2026	J	`jnl`	Separation Results for Constant-Depth and Multilinear Ideal Proof Systems. CoRR Amik Raj Behera, Magnus Rahbek Dalgaard Hansen, Nutan Limaye, Srikanth Srinivasan
2026	J	`jnl`	Separation Results for Constant-Depth and Multilinear Ideal Proof Systems. Electron. Colloquium Comput. Complex. Amik Raj Behera, Magnus Rahbek Dalgaard Hansen, Nutan Limaye, Srikanth Srinivasan
2026	J	`jnl`	Towards Optimal Depth-Reductions for Algebraic Formulas. Comput. Complex. Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan, Sébastien Tavenas
2025	B	`conf`	#SAT-Algorithms for Classes of Threshold Circuits Based on Probabilistic Rank. MFCS Nutan Limaye, Adarsh Srinivasan, Srikanth Srinivasan
2025	A	`ed.`	40th Computational Complexity Conference, CCC 2025, Toronto, Canada, August 5-8, 2025 CCC Srikanth Srinivasan
2025	J	`jnl`	A Near-Optimal Polynomial Distance Lemma Over Boolean Slices. CoRR Prashanth Amireddy, Amik Raj Behera, Srikanth Srinivasan, Madhu Sudan
2025	J	`jnl`	A Near-Optimal Polynomial Distance Lemma Over Boolean Slices. Electron. Colloquium Comput. Complex. Prashanth Amireddy, Amik Raj Behera, Srikanth Srinivasan, Madhu Sudan
2025	A*	`conf`	A Near-Optimal Polynomial Distance Lemma over Boolean Slices. ICALP Prashanth Amireddy, Amik Raj Behera, Srikanth Srinivasan, Madhu Sudan
2025	J	`jnl`	Eigenvalue Bounds for Symmetric Markov Chains on Multislices With Applications. CoRR Prashanth Amireddy, Amik Raj Behera, Srikanth Srinivasan, Madhu Sudan
2025	J	`jnl`	Eigenvalue Bounds for Symmetric Markov Chains on Multislices With Applications. Electron. Colloquium Comput. Complex. Prashanth Amireddy, Amik Raj Behera, Srikanth Srinivasan, Madhu Sudan
2025	A	`conf`	Eigenvalue Bounds for Symmetric Markov Chains on Multislices with Applications. APPROX/RANDOM Prashanth Amireddy, Amik Raj Behera, Srikanth Srinivasan, Madhu Sudan
2025	J	`jnl`	Ideals, Gröbner Bases, and PCPs. CoRR Prashanth Amireddy, Amik Raj Behera, Srikanth Srinivasan, Madhu Sudan, Sophus Valentin Willumsgaard
2025	J	`jnl`	Ideals, Gröbner Bases, and PCPs. Electron. Colloquium Comput. Complex. Prashanth Amireddy, Amik Raj Behera, Srikanth Srinivasan, Madhu Sudan, Sophus Valentin Willumsgaard
2025	A*	`conf`	Low Degree Local Correction Over the Boolean Cube. SODA Prashanth Amireddy, Amik Raj Behera, Manaswi Paraashar, Srikanth Srinivasan, Madhu Sudan
2025	J	`jnl`	Negations are powerful even in small depth. CoRR Bruno Cavalar, Théo Borém Fabris, Partha Mukhopadhyay, Srikanth Srinivasan, Amir Yehudayoff
2025	J	`jnl`	Negations are powerful even in small depth. Electron. Colloquium Comput. Complex. Bruno Pasqualotto Cavalar, Théo Borém Fabris, Partha Mukhopadhyay, Srikanth Srinivasan, Amir Yehudayoff
2025	A*	`conf`	New Bounds for the Ideal Proof System in Positive Characteristic. ICALP Amik Raj Behera, Nutan Limaye, Varun Ramanathan, Srikanth Srinivasan
2025	J	`jnl`	New Bounds for the Ideal Proof System in Positive Characteristic. CoRR Amik Raj Behera, Nutan Limaye, Varun Ramanathan, Srikanth Srinivasan
2025	J	`jnl`	New Bounds for the Ideal Proof System in Positive Characteristic. Electron. Colloquium Comput. Complex. Amik Raj Behera, Nutan Limaye, Varun Ramanathan, Srikanth Srinivasan
2025	J	`jnl`	On Closure Properties of Read-Once Oblivious Algebraic Branching Programs. CoRR Jules Armand, Prateek Dwivedi, Magnus Rahbek Dalgaard Hansen, Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas
2025	J	`jnl`	On Closure Properties of Read-Once Oblivious Algebraic Branching Programs. Electron. Colloquium Comput. Complex. Jules Armand, Prateek Dwivedi, Nutan Limaye, Magnus Rahbek Dalgaard Hansen, Srikanth Srinivasan, Sébastien Tavenas
2025	J	`jnl`	Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits. J. ACM Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas
2025	—	`conf`	The Algebraic Cost of a Boolean Sum. FSTTCS Ian Orzel, Srikanth Srinivasan, Sébastien Tavenas, Amir Yehudayoff
2025	J	`jnl`	The Algebraic Cost of a Boolean Sum. CoRR Ian Orzel, Srikanth Srinivasan, Sébastien Tavenas, Amir Yehudayoff
2025	J	`jnl`	The Algebraic Cost of a Boolean Sum. Electron. Colloquium Comput. Complex. Ian Orzel, Srikanth Srinivasan, Sébastien Tavenas, Amir Yehudayoff
2024	A*	`conf`	Local Correction of Linear Functions over the Boolean Cube. STOC Prashanth Amireddy, Amik Raj Behera, Manaswi Paraashar, Srikanth Srinivasan, Madhu Sudan
2024	J	`jnl`	Local Correction of Linear Functions over the Boolean Cube. CoRR Prashanth Amireddy, Amik Raj Behera, Manaswi Paraashar, Srikanth Srinivasan, Madhu Sudan
2024	J	`jnl`	Local Correction of Linear Functions over the Boolean Cube. Electron. Colloquium Comput. Complex. Prashanth Amireddy, Amik Raj Behera, Manaswi Paraashar, Srikanth Srinivasan, Madhu Sudan
2024	J	`jnl`	Low Degree Local Correction Over the Boolean Cube. CoRR Prashanth Amireddy, Amik Raj Behera, Manaswi Paraashar, Srikanth Srinivasan, Madhu Sudan
2024	J	`jnl`	Low Degree Local Correction Over the Boolean Cube. Electron. Colloquium Comput. Complex. Prashanth Amireddy, Amik Raj Behera, Manaswi Paraashar, Srikanth Srinivasan, Madhu Sudan
2024	A*	`conf`	On the Power of Homogeneous Algebraic Formulas. STOC Hervé Fournier, Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas
2024	J	`jnl`	Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits. Commun. ACM Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas
2023	—	`ed.`	43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, IIIT Hyderabad, Telangana, India, December 18-20, 2023 FSTTCS Patricia Bouyer, Srikanth Srinivasan
2023	J	`jnl`	A Robust Version of Hegedűs's Lemma, with Applications. TheoretiCS Srikanth Srinivasan
2023	J	`jnl`	Low-Degree Testing Over Grids. CoRR Prashanth Amireddy, Srikanth Srinivasan, Madhu Sudan
2023	A	`conf`	Low-Degree Testing over Grids. APPROX/RANDOM Prashanth Amireddy, Srikanth Srinivasan, Madhu Sudan
2023	J	`jnl`	On the Power of Homogeneous Algebraic Formulas. Electron. Colloquium Comput. Complex. Hervé Fournier, Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas
2023	A*	`conf`	Optimal Explicit Small-Depth Formulas for the Coin Problem. STOC Srikanth Srinivasan, Utkarsh Tripathi
2023	J	`jnl`	Schur Polynomials Do Not Have Small Formulas If the Determinant does not. Comput. Complex. Prasad Chaugule, Mrinal Kumar, Nutan Limaye, Chandra Kanta Mohapatra, Adrian She, Srikanth Srinivasan
2023	J	`jnl`	The discrepancy of greater-than. CoRR Srikanth Srinivasan, Amir Yehudayoff
2023	A	`conf`	Towards Optimal Depth-Reductions for Algebraic Formulas. CCC Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan, Sébastien Tavenas
2023	J	`jnl`	Towards Optimal Depth-Reductions for Algebraic Formulas. CoRR Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan, Sébastien Tavenas
2023	J	`jnl`	Towards Optimal Depth-Reductions for Algebraic Formulas. Electron. Colloquium Comput. Complex. Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan, Sébastien Tavenas
2022	J	`jnl`	A #SAT Algorithm for Small Constant-Depth Circuits with PTF gates. Algorithmica Swapnam Bajpai, Vaibhav Krishan, Deepanshu Kush, Nutan Limaye, Srikanth Srinivasan
2022	J	`jnl`	A Robust Version of Hegedűs's Lemma, with Applications. CoRR Srikanth Srinivasan
2022	J	`jnl`	Guest Column: Lower Bounds Against Constant-Depth Algebraic Circuits. SIGACT News Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas
2022	A	`conf`	On the Partial Derivative Method Applied to Lopsided Set-Multilinear Polynomials. CCC Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas
2022	J	`jnl`	On the Partial Derivative Method Applied to Lopsided Set-Multilinear Polynomials. Electron. Colloquium Comput. Complex. Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas
2022	—	`conf`	On the VNP-Hardness of Some Monomial Symmetric Polynomials. FSTTCS Radu Curticapean, Nutan Limaye, Srikanth Srinivasan
2022	J	`jnl`	On the VNP-hardness of Some Monomial Symmetric Polynomials. Electron. Colloquium Comput. Complex. Radu Curticapean, Nutan Limaye, Srikanth Srinivasan
2022	A*	`conf`	Set-multilinear and non-commutative formula lower bounds for iterated matrix multiplication. STOC Sébastien Tavenas, Nutan Limaye, Srikanth Srinivasan
2022	A	`conf`	Vanishing Spaces of Random Sets and Applications to Reed-Muller Codes. CCC Siddharth Bhandari, Prahladh Harsha, Ramprasad Saptharishi, Srikanth Srinivasan
2022	J	`jnl`	Vanishing Spaces of Random Sets and Applications to Reed-Muller Codes. CoRR Siddharth Bhandari, Prahladh Harsha, Ramprasad Saptharishi, Srikanth Srinivasan
2022	J	`jnl`	Vanishing Spaces of Random Sets and Applications to Reed-Muller Codes. Electron. Colloquium Comput. Complex. Siddharth Bhandari, Prahladh Harsha, Ramprasad Saptharishi, Srikanth Srinivasan
2021	J	`jnl`	A Fixed-Depth Size-Hierarchy Theorem for $\mathrm{AC}^0[\oplus]$ via the Coin Problem. SIAM J. Comput. Nutan Limaye, Karteek Sreenivasaiah, Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh
2021	J	`jnl`	New Non-FPT Lower Bounds for Some Arithmetic Formulas. Electron. Colloquium Comput. Complex. Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas
2021	J	`jnl`	On the Probabilistic Degree of an $n$-variate Boolean Function. Electron. Colloquium Comput. Complex. Srikanth Srinivasan, S. Venkitesh
2021	—	`conf`	On the Probabilistic Degree of an n-Variate Boolean Function. APPROX-RANDOM Srikanth Srinivasan, S. Venkitesh
2021	J	`jnl`	On the Probabilistic Degree of an n-variate Boolean Function. CoRR Srikanth Srinivasan, S. Venkitesh
2021	J	`jnl`	On the Probabilistic Degrees of Symmetric Boolean Functions. SIAM J. Discret. Math. Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh
2021	J	`jnl`	On the probabilistic degree of OR over the reals. Random Struct. Algorithms Siddharth Bhandari, Prahladh Harsha, Tulasimohan Molli, Srikanth Srinivasan
2021	A*	`conf`	Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits. FOCS Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas
2021	J	`jnl`	Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits. Electron. Colloquium Comput. Complex. Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas
2020	J	`jnl`	A Robust Version of Hegedűs's Lemma, with Applications. Electron. Colloquium Comput. Complex. Srikanth Srinivasan
2020	A*	`conf`	A robust version of Hegedus's lemma, with applications. STOC Srikanth Srinivasan
2020	J	`jnl`	Decoding Variants of Reed-Muller Codes over Finite Grids. ACM Trans. Comput. Theory Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh
2020	J	`jnl`	Local decoding and testing of polynomials over grids. Random Struct. Algorithms Mitali Bafna, Srikanth Srinivasan, Madhu Sudan
2020	A	`conf`	Schur Polynomials Do Not Have Small Formulas If the Determinant Doesn't. CCC Prasad Chaugule, Mrinal Kumar, Nutan Limaye, Chandra Kanta Mohapatra, Adrian She, Srikanth Srinivasan
2020	J	`jnl`	Strongly Exponential Separation between Monotone VP and Monotone VNP. ACM Trans. Comput. Theory Srikanth Srinivasan
2019	A	`conf`	A #SAT Algorithm for Small Constant-Depth Circuits with PTF Gates. ITCS Swapnam Bajpai, Vaibhav Krishan, Deepanshu Kush, Nutan Limaye, Srikanth Srinivasan
2019	A*	`conf`	A fixed-depth size-hierarchy theorem for AC STOC Nutan Limaye, Karteek Sreenivasaiah, Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh
2019	J	`jnl`	Decoding Downset codes over a finite grid. CoRR Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh
2019	J	`jnl`	Decoding Downset codes over a finite grid. Electron. Colloquium Comput. Complex. Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh
2019	J	`jnl`	Lower Bounds and PIT for Non-commutative Arithmetic Circuits with Restricted Parse Trees. Comput. Complex. Guillaume Lagarde, Nutan Limaye, Srikanth Srinivasan
2019	J	`jnl`	More on $AC^0[\oplus]$ and Variants of the Majority Function. Electron. Colloquium Comput. Complex. Nutan Limaye, Srikanth Srinivasan, Utkarsh Tripathi
2019	—	`conf`	More on AC^0[oplus] and Variants of the Majority Function. FSTTCS Nutan Limaye, Srikanth Srinivasan, Utkarsh Tripathi
2019	J	`jnl`	On polynomial approximations to AC. Random Struct. Algorithms Prahladh Harsha, Srikanth Srinivasan
2019	—	`conf`	On the Probabilistic Degrees of Symmetric Boolean Functions. FSTTCS Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh
2019	J	`jnl`	On the Probabilistic Degrees of Symmetric Boolean functions. CoRR Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh
2019	J	`jnl`	On the Probabilistic Degrees of Symmetric Boolean functions. Electron. Colloquium Comput. Complex. Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh
2019	A	`conf`	Parity Helps to Compute Majority. CCC Igor Carboni Oliveira, Rahul Santhanam, Srikanth Srinivasan
2019	J	`jnl`	Parity helps to compute Majority. Electron. Colloquium Comput. Complex. Igor Carboni Oliveira, Rahul Santhanam, Srikanth Srinivasan
2019	J	`jnl`	Robust Multiplication-Based Tests for Reed-Muller Codes. IEEE Trans. Inf. Theory Prahladh Harsha, Srikanth Srinivasan
2019	J	`jnl`	Schur Polynomials do not have small formulas if the Determinant doesn't! CoRR Prasad Chaugule, Mrinal Kumar, Nutan Limaye, Chandra Kanta Mohapatra, Adrian She, Srikanth Srinivasan
2019	J	`jnl`	Schur Polynomials do not have small formulas if the Determinant doesn't! Electron. Colloquium Comput. Complex. Prasad Chaugule, Mrinal Kumar, Nutan Limaye, Chandra Kanta Mohapatra, Adrian She, Srikanth Srinivasan
2019	J	`jnl`	Separation of AC Theory Comput. Benjamin Rossman, Srikanth Srinivasan
2019	J	`jnl`	Small-Depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication with Applications. SIAM J. Comput. Suryajith Chillara, Nutan Limaye, Srikanth Srinivasan
2019	J	`jnl`	Special Issue: CCC 2018: Guest Editor's Foreword. Theory Comput. Srikanth Srinivasan
2019	J	`jnl`	Strongly Exponential Separation Between Monotone VP and Monotone VNP. CoRR Srikanth Srinivasan
2019	J	`jnl`	Strongly Exponential Separation Between Monotone VP and Monotone VNP. Electron. Colloquium Comput. Complex. Srikanth Srinivasan
2018	J	`jnl`	A #SAT Algorithm for Small Constant-Depth Circuits with PTF gates. CoRR Swapnam Bajpai, Vaibhav Krishan, Deepanshu Kush, Nutan Limaye, Srikanth Srinivasan
2018	J	`jnl`	A #SAT Algorithm for Small Constant-Depth Circuits with PTF gates. Electron. Colloquium Comput. Complex. Swapnam Bajpai, Vaibhav Krishan, Deepanshu Kush, Nutan Limaye, Srikanth Srinivasan
2018	A*	`conf`	A Near-Optimal Depth-Hierarchy Theorem for Small-Depth Multilinear Circuits. FOCS Suryajith Chillara, Christian Engels, Nutan Limaye, Srikanth Srinivasan
2018	J	`jnl`	A Near-Optimal Depth-Hierarchy Theorem for Small-Depth Multilinear Circuits. CoRR Suryajith Chillara, Christian Engels, Nutan Limaye, Srikanth Srinivasan
2018	J	`jnl`	A Near-Optimal Depth-Hierarchy Theorem for Small-Depth Multilinear Circuits. Electron. Colloquium Comput. Complex. Suryajith Chillara, Christian Engels, Nutan Limaye, Srikanth Srinivasan
2018	A*	`conf`	A Quadratic Size-Hierarchy Theorem for Small-Depth Multilinear Formulas. ICALP Suryajith Chillara, Nutan Limaye, Srikanth Srinivasan
2018	J	`jnl`	Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits. CoRR Ruiwen Chen, Rahul Santhanam, Srikanth Srinivasan
2018	J	`jnl`	Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits. Theory Comput. Ruiwen Chen, Rahul Santhanam, Srikanth Srinivasan
2018	J	`jnl`	Certifying Polynomials for $\mathrm{AC}^0[\oplus]$ Circuits, with Applications to Lower Bounds and Circuit Compression. Theory Comput. Swastik Kopparty, Srikanth Srinivasan
2018	B	`conf`	Deterministically Counting Satisfying Assignments for Constant-Depth Circuits with Parity Gates, with Implications for Lower Bounds. MFCS Ninad Rajgopal, Rahul Santhanam, Srikanth Srinivasan
2018	A	`conf`	Local Decoding and Testing of Polynomials over Grids. ITCS Srikanth Srinivasan, Madhu Sudan
2018	—	`conf`	On the Probabilistic Degree of OR over the Reals. FSTTCS Siddharth Bhandari, Prahladh Harsha, Tulasimohan Molli, Srikanth Srinivasan
2018	J	`jnl`	On the Probabilistic Degree of OR over the Reals. CoRR Siddharth Bhandari, Prahladh Harsha, Tulasimohan Molli, Srikanth Srinivasan
2018	J	`jnl`	On the Probabilistic Degree of OR over the Reals. Electron. Colloquium Comput. Complex. Siddharth Bhandari, Prahladh Harsha, Tulasimohan Molli, Srikanth Srinivasan
2018	J	`jnl`	On the hardness of the noncommutative determinant. Comput. Complex. Vikraman Arvind, Srikanth Srinivasan
2018	A	`conf`	Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications. STACS Suryajith Chillara, Nutan Limaye, Srikanth Srinivasan
2018	J	`jnl`	The Coin Problem in Constant Depth: Sample Complexity and Parity Gates. CoRR Nutan Limaye, Karteek Sreenivasaiah, Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh
2018	J	`jnl`	The Coin Problem in Constant Depth: Sample Complexity and Parity gates. Electron. Colloquium Comput. Complex. Nutan Limaye, Karteek Sreenivasaiah, Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh
2017	J	`jnl`	An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas. SIAM J. Comput. Neeraj Kayal, Nutan Limaye, Chandan Saha, Srikanth Srinivasan
2017	J	`jnl`	Local decoding and testing of polynomials over grids. CoRR Srikanth Srinivasan, Madhu Sudan
2017	J	`jnl`	Local decoding and testing of polynomials over grids. Electron. Colloquium Comput. Complex. Srikanth Srinivasan, Madhu Sudan
2017	B	`conf`	Lower Bounds and PIT for Non-Commutative Arithmetic Circuits with Restricted Parse Trees. MFCS Guillaume Lagarde, Nutan Limaye, Srikanth Srinivasan
2017	J	`jnl`	Lower Bounds and PIT for Non-Commutative Arithmetic circuits with Restricted Parse Trees. Electron. Colloquium Comput. Complex. Guillaume Lagarde, Nutan Limaye, Srikanth Srinivasan
2017	A	`conf`	On Polynomial Approximations Over Z/2^kZ*. STACS Abhishek Bhrushundi, Prahladh Harsha, Srikanth Srinivasan
2017	J	`jnl`	On Some Recent Projection Switching Lemmas for Small Depth Circuits. Bull. EATCS Srikanth Srinivasan
2017	J	`jnl`	On polynomial approximations over Z/2 CoRR Abhishek Bhrushundi, Prahladh Harsha, Srikanth Srinivasan
2017	J	`jnl`	On polynomial approximations over ℤ/2 Electron. Colloquium Comput. Complex. Abhishek Bhrushundi, Prahladh Harsha, Srikanth Srinivasan
2017	J	`jnl`	Separation of AC Electron. Colloquium Comput. Complex. Benjamin Rossman, Srikanth Srinivasan
2017	J	`jnl`	Separation of AC$^0[\oplus]$ Formulas and Circuits. CoRR Benjamin Rossman, Srikanth Srinivasan
2017	A*	`conf`	Separation of AC^0[oplus] Formulas and Circuits. ICALP Benjamin Rossman, Srikanth Srinivasan
2017	J	`jnl`	Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications. CoRR Suryajith Chillara, Nutan Limaye, Srikanth Srinivasan
2017	J	`jnl`	Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications. Electron. Colloquium Comput. Complex. Suryajith Chillara, Nutan Limaye, Srikanth Srinivasan
2017	J	`jnl`	Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long Codes. SIAM J. Comput. Venkatesan Guruswami, Prahladh Harsha, Johan Håstad, Srikanth Srinivasan, Girish Varma
2017	J	`jnl`	The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials. Theory Comput. Hervé Fournier, Nutan Limaye, Meena Mahajan, Srikanth Srinivasan
2016	J	`jnl`	An Almost Cubic Lower Bound for ΣΠΣ Circuits Computing a Polynomial in VP. Electron. Colloquium Comput. Complex. Nikhil Balaji, Nutan Limaye, Srikanth Srinivasan
2016	A	`conf`	Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits. CCC Ruiwen Chen, Rahul Santhanam, Srikanth Srinivasan
2016	J	`jnl`	Composition limits and separating examples for some boolean function complexity measures. Comb. Justin Gilmer, Michael E. Saks, Srikanth Srinivasan
2016	J	`jnl`	Lower Bounds for Non-Commutative Skew Circuits. Theory Comput. Nutan Limaye, Guillaume Malod, Srikanth Srinivasan
2016	J	`jnl`	On Polynomial Approximations to ${AC}^0$. CoRR Prahladh Harsha, Srikanth Srinivasan
2016	J	`jnl`	On Polynomial Approximations to AC Electron. Colloquium Comput. Complex. Srikanth Srinivasan
2016	—	`conf`	On Polynomial Approximations to AC^0. APPROX-RANDOM Prahladh Harsha, Srikanth Srinivasan
2016	—	`conf`	Robust Multiplication-Based Tests for Reed-Muller Codes. FSTTCS Prahladh Harsha, Srikanth Srinivasan
2016	J	`jnl`	Robust Multiplication-based Tests for Reed-Muller Codes. CoRR Prahladh Harsha, Srikanth Srinivasan
2016	J	`jnl`	Robust Multiplication-based Tests for Reed-Muller Codes. Electron. Colloquium Comput. Complex. Prahladh Harsha, Srikanth Srinivasan
2015	J	`jnl`	A Compression Algorithm for AC Electron. Colloquium Comput. Complex. Srikanth Srinivasan
2015	J	`jnl`	A tail bound for read- Random Struct. Algorithms Dmitry Gavinsky, Shachar Lovett, Michael E. Saks, Srikanth Srinivasan
2015	J	`jnl`	Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits. Electron. Colloquium Comput. Complex. Ruiwen Chen, Rahul Santhanam, Srikanth Srinivasan
2015	A	`conf`	Derandomized Graph Product Results Using the Low Degree Long Code. STACS Irit Dinur, Prahladh Harsha, Srikanth Srinivasan, Girish Varma
2015	J	`jnl`	Lower Bounds for Depth-4 Formulas Computing Iterated Matrix Multiplication. SIAM J. Comput. Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan
2015	J	`jnl`	Lower bounds for non-commutative skew circuits. Electron. Colloquium Comput. Complex. Nutan Limaye, Guillaume Malod, Srikanth Srinivasan
2015	—	`conf`	The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials. MFCS (2) Hervé Fournier, Nutan Limaye, Meena Mahajan, Srikanth Srinivasan
2015	J	`jnl`	The shifted partial derivative complexity of Elementary Symmetric Polynomials. Electron. Colloquium Comput. Complex. Hervé Fournier, Nutan Limaye, Meena Mahajan, Srikanth Srinivasan
2014	A*	`conf`	An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas. FOCS Neeraj Kayal, Nutan Limaye, Chandan Saha, Srikanth Srinivasan
2014	J	`jnl`	An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas. Electron. Colloquium Comput. Complex. Neeraj Kayal, Nutan Limaye, Chandan Saha, Srikanth Srinivasan
2014	J	`jnl`	Derandomized Graph Product Results using the Low Degree Long Code. CoRR Irit Dinur, Prahladh Harsha, Srikanth Srinivasan, Girish Varma
2014	A*	`conf`	Lower bounds for depth 4 formulas computing iterated matrix multiplication. STOC Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan
2014	A*	`conf`	Super-polylogarithmic hypergraph coloring hardness via low-degree long codes. STOC Venkatesan Guruswami, Prahladh Harsha, Johan Håstad, Srikanth Srinivasan, Girish Varma
2014	A*	`conf`	Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas. STOC Neeraj Kayal, Nutan Limaye, Chandan Saha, Srikanth Srinivasan
2013	A	`conf`	Composition Limits and Separating Examples for Some Boolean Function Complexity Measures. CCC Justin Gilmer, Michael E. Saks, Srikanth Srinivasan
2013	J	`jnl`	Composition limits and separating examples for some Boolean function complexity measures. CoRR Justin Gilmer, Michael E. Saks, Srikanth Srinivasan
2013	J	`jnl`	Lower bounds for depth 4 formulas computing iterated matrix multiplication. Electron. Colloquium Comput. Complex. Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan
2013	—	`conf`	On Improved Degree Lower Bounds for Polynomial Approximation. FSTTCS Srikanth Srinivasan
2013	J	`jnl`	Optimal Hitting Sets for Combinatorial Shapes. Theory Comput. Aditya Bhaskara, Devendra Desai, Srikanth Srinivasan
2013	J	`jnl`	Super-polylogarithmic hypergraph coloring hardness via low-degree long codes. CoRR Venkatesan Guruswami, Johan Håstad, Prahladh Harsha, Srikanth Srinivasan, Girish Varma
2013	J	`jnl`	Super-polylogarithmic hypergraph coloring hardness via low-degree long codes. Electron. Colloquium Comput. Complex. Venkatesan Guruswami, Prahladh Harsha, Johan Håstad, Srikanth Srinivasan, Girish Varma
2012	J	`jnl`	A Tail Bound for Read-k Families of Functions CoRR Dmitry Gavinsky, Shachar Lovett, Michael E. Saks, Srikanth Srinivasan
2012	J	`jnl`	A Tail Bound for Read-k Families of Functions. Electron. Colloquium Comput. Complex. Dmitry Gavinsky, Shachar Lovett, Michael E. Saks, Srikanth Srinivasan
2012	A	`conf`	Approximating AC^0 by Small Height Decision Trees and a Deterministic Algorithm for #AC^0SAT. CCC Paul Beame, Russell Impagliazzo, Srikanth Srinivasan
2012	J	`jnl`	Certifying Polynomials for AC Electron. Colloquium Comput. Complex. Swastik Kopparty, Srikanth Srinivasan
2012	—	`conf`	Certifying polynomials for AC^0(parity) circuits, with applications. FSTTCS Swastik Kopparty, Srikanth Srinivasan
2012	—	`conf`	On the Limits of Sparsification. ICALP (1) Rahul Santhanam, Srikanth Srinivasan
2012	J	`jnl`	Optimal Hitting Sets for Combinatorial Shapes CoRR Aditya Bhaskara, Devendra Desai, Srikanth Srinivasan
2012	—	`conf`	Optimal Hitting Sets for Combinatorial Shapes. APPROX-RANDOM Aditya Bhaskara, Devendra Desai, Srikanth Srinivasan
2012	J	`jnl`	Optimal Hitting Sets for Combinatorial Shapes. Electron. Colloquium Comput. Complex. Aditya Bhaskara, Devendra Desai, Srikanth Srinivasan
2012	A	`conf`	Pseudorandom Generators for Read-Once ACC^0. CCC Dmitry Gavinsky, Shachar Lovett, Srikanth Srinivasan
2012	J	`jnl`	Streaming algorithms for recognizing nearly well-parenthesized expressions CoRR Andreas Krebs, Nutan Limaye, Srikanth Srinivasan
2011	J	`jnl`	Almost Settling the Hardness of Noncommutative Determinant CoRR Steve Chien, Prahladh Harsha, Alistair Sinclair, Srikanth Srinivasan
2011	A*	`conf`	Almost settling the hardness of noncommutative determinant. STOC Steve Chien, Prahladh Harsha, Alistair Sinclair, Srikanth Srinivasan
2011	—	`conf`	Correlation Bounds for Poly-size $\mbox{\rm AC}^0$ Circuits with n 1 - o(1) Symmetric Gates. APPROX-RANDOM Shachar Lovett, Srikanth Srinivasan
2011	J	`jnl`	On the Limits of Sparsification. Electron. Colloquium Comput. Complex. Rahul Santhanam, Srikanth Srinivasan
2011	B	`conf`	Streaming Algorithms for Recognizing Nearly Well-Parenthesized Expressions. MFCS Andreas Krebs, Nutan Limaye, Srikanth Srinivasan
2010	A	`conf`	Circuit Lower Bounds, Help Functions, and the Remote Point Problem. ICS Vikraman Arvind, Srikanth Srinivasan
2010	J	`jnl`	New Results on Noncommutative and Commutative Polynomial Identity Testing. Comput. Complex. Vikraman Arvind, Partha Mukhopadhyay, Srikanth Srinivasan
2010	A*	`conf`	On the hardness of the noncommutative determinant. STOC Vikraman Arvind, Srikanth Srinivasan
2010	A	`conf`	The Remote Point Problem, Small Bias Spaces, and Expanding Generator Sets. STACS Vikraman Arvind, Srikanth Srinivasan
2009	J	`jnl`	Arithmetic Circuits and the Hadamard Product of Polynomials CoRR Vikraman Arvind, Pushkar S. Joglekar, Srikanth Srinivasan
2009	—	`conf`	Arithmetic Circuits and the Hadamard Product of Polynomials. FSTTCS Vikraman Arvind, Pushkar S. Joglekar, Srikanth Srinivasan
2009	J	`jnl`	Circuit Lower Bounds, Help Functions, and the Remote Point Problem CoRR Vikraman Arvind, Srikanth Srinivasan
2009	J	`jnl`	Circuit Lower Bounds, Help Functions, and the Remote Point Problem. Electron. Colloquium Comput. Complex. Vikraman Arvind, Srikanth Srinivasan
2009	J	`jnl`	On Lower Bounds for Constant Width Arithmetic Circuits CoRR Vikraman Arvind, Pushkar S. Joglekar, Srikanth Srinivasan
2009	B	`conf`	On Lower Bounds for Constant Width Arithmetic Circuits. ISAAC Vikraman Arvind, Pushkar S. Joglekar, Srikanth Srinivasan
2009	J	`jnl`	On Lower Bounds for Constant Width Arithmetic Circuits. Electron. Colloquium Comput. Complex. Vikraman Arvind, Pushkar S. Joglekar, Srikanth Srinivasan
2009	J	`jnl`	On the Hardness of the Noncommutative Determinant. Electron. Colloquium Comput. Complex. Vikraman Arvind, Srikanth Srinivasan
2009	J	`jnl`	On the hardness of the noncommutative determinant CoRR Vikraman Arvind, Srikanth Srinivasan
2009	J	`jnl`	The Remote Point Problem, Small Bias Space, and Expanding Generator Sets CoRR Vikraman Arvind, Srikanth Srinivasan
2009	J	`jnl`	The Remote Point Problem, Small Bias Spaces, and Expanding Generator Sets. Electron. Colloquium Comput. Complex. Vikraman Arvind, Srikanth Srinivasan
2008	A	`conf`	New Results on Noncommutative and Commutative Polynomial Identity Testing. CCC Vikraman Arvind, Partha Mukhopadhyay, Srikanth Srinivasan
2008	J	`jnl`	New results on Noncommutative and Commutative Polynomial Identity Testing CoRR Vikraman Arvind, Partha Mukhopadhyay, Srikanth Srinivasan
2008	J	`jnl`	New results on Noncommutative and Commutative Polynomial Identity Testing. Electron. Colloquium Comput. Complex. Vikraman Arvind, Partha Mukhopadhyay, Srikanth Srinivasan