Neeraj Kayal - RankMe

84 papers A* 17A 13Journal 52Unranked 2

Year	Rank	Type	Title / Venue / Authors
2026	A*	`conf`	Incorporating Token Importance in Multi-Vector Retrieval. AAAI Archish S, Ankit Garg, Kirankumar Shiragur, Neeraj Kayal
2026	J	`jnl`	On Strengths and Limitations of Single-Vector Embeddings. CoRR Archish S, Mihir Agarwal, Ankit Garg, Neeraj Kayal, Kirankumar Shiragur
2025	J	`jnl`	Equivalence Checking of ML GPU Kernels. CoRR Kshitij Dubey, Benjamin Driscoll, Anjiang Wei, Neeraj Kayal, Rahul Sharma, Alex Aiken
2025	J	`jnl`	Incorporating Token Importance in Multi-Vector Retrieval. CoRR Archish S, Ankit Garg, Kirankumar Shiragur, Neeraj Kayal
2024	A	`conf`	Learning Arithmetic Formulas in the Presence of Noise: A General Framework and Applications to Unsupervised Learning. ITCS Pritam Chandra, Ankit Garg, Neeraj Kayal, Kunal Mittal, Tanmay Sinha
2023	J	`jnl`	Learning Arithmetic Formulas in the Presence of Noise: A General Framework and Applications to Unsupervised Learning. CoRR Pritam Chandra, Ankit Garg, Neeraj Kayal, Kunal Mittal, Tanmay Sinha
2023	J	`jnl`	Learning Arithmetic Formulas in the Presence of Noise: A General Framework and Applications to Unsupervised Learning. Electron. Colloquium Comput. Complex. Pritam Chandra, Ankit Garg, Neeraj Kayal, Kunal Mittal, Tanmay Sinha
2023	A*	`conf`	Low-Depth Arithmetic Circuit Lower Bounds: Bypassing Set-Multilinearization. ICALP Prashanth Amireddy, Ankit Garg, Neeraj Kayal, Chandan Saha, Bhargav Thankey
2022	A	`conf`	Learning Generalized Depth Three Arithmetic Circuits in the Non-Degenerate Case. APPROX/RANDOM Vishwas Bhargava, Ankit Garg, Neeraj Kayal, Chandan Saha
2022	J	`jnl`	Low-depth arithmetic circuit lower bounds via shifted partials. CoRR Prashanth Amireddy, Ankit Garg, Neeraj Kayal, Chandan Saha, Bhargav Thankey
2022	J	`jnl`	Low-depth arithmetic circuit lower bounds via shifted partials. Electron. Colloquium Comput. Complex. Prashanth Amireddy, Ankit Garg, Neeraj Kayal, Chandan Saha, Bhargav Thankey
2021	J	`jnl`	Learning generalized depth-three arithmetic circuits in the non-degenerate case. Electron. Colloquium Comput. Complex. Vishwas Bhargava, Ankit Garg, Neeraj Kayal, Chandan Saha
2020	A*	`conf`	Learning sums of powers of low-degree polynomials in the non-degenerate case. FOCS Ankit Garg, Neeraj Kayal, Chandan Saha
2020	J	`jnl`	Learning sums of powers of low-degree polynomials in the non-degenerate case. CoRR Ankit Garg, Neeraj Kayal, Chandan Saha
2020	J	`jnl`	Learning sums of powers of low-degree polynomials in the non-degenerate case. Electron. Colloquium Comput. Complex. Ankit Garg, Neeraj Kayal, Chandan Saha
2020	J	`jnl`	Separation Between Read-once Oblivious Algebraic Branching Programs (ROABPs) and Multilinear Depth-three Circuits. ACM Trans. Comput. Theory Neeraj Kayal, Vineet Nair, Chandan Saha
2019	J	`jnl`	Average-case linear matrix factorization and reconstruction of low width algebraic branching programs. Comput. Complex. Neeraj Kayal, Vineet Nair, Chandan Saha
2019	A*	`conf`	Determinant Equivalence Test over Finite Fields and over Q. ICALP Ankit Garg, Nikhil Gupta, Neeraj Kayal, Chandan Saha
2019	J	`jnl`	Determinant equivalence test over finite fields and over ℚ. Electron. Colloquium Comput. Complex. Ankit Garg, Nikhil Gupta, Neeraj Kayal, Chandan Saha
2019	J	`jnl`	Reconstruction of Full Rank Algebraic Branching Programs. ACM Trans. Comput. Theory Neeraj Kayal, Vineet Nair, Chandan Saha, Sébastien Tavenas
2019	A*	`conf`	Reconstruction of non-degenerate homogeneous depth three circuits. STOC Neeraj Kayal, Chandan Saha
2018	J	`jnl`	Average-case linear matrix factorization and reconstruction of low width Algebraic Branching Programs. Electron. Colloquium Comput. Complex. Neeraj Kayal, Vineet Nair, Chandan Saha
2018	J	`jnl`	Guest Column: A Paradigm for Arithmetic Circuit Lower Bounds. SIGACT News Neeraj Kayal, Chandan Saha
2018	J	`jnl`	On the Size of Homogeneous and of Depth-Four Formulas with Low Individual Degree. Theory Comput. Neeraj Kayal, Chandan Saha, Sébastien Tavenas
2018	J	`jnl`	Reconstruction of non-degenerate homogeneous depth three circuits. Electron. Colloquium Comput. Complex. Neeraj Kayal, Chandan Saha
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`	Multi-k-ic Depth Three Circuit Lower Bound. Theory Comput. Syst. Neeraj Kayal, Chandan Saha
2017	A	`conf`	Reconstruction of Full Rank Algebraic Branching Programs. CCC Neeraj Kayal, Vineet Nair, Chandan Saha, Sébastien Tavenas
2017	J	`jnl`	Reconstruction of full rank Algebraic Branching Programs. Electron. Colloquium Comput. Complex. Neeraj Kayal, Vineet Nair, Chandan Saha, Sébastien Tavenas
2017	J	`jnl`	Unexpected power of low-depth arithmetic circuits. Commun. ACM Ankit Gupta, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi
2016	A*	`conf`	An Almost Cubic Lower Bound for Depth Three Arithmetic Circuits. ICALP Neeraj Kayal, Chandan Saha, Sébastien Tavenas
2016	J	`jnl`	An almost Cubic Lower Bound for Depth Three Arithmetic Circuits. Electron. Colloquium Comput. Complex. Neeraj Kayal, Chandan Saha, Sébastien Tavenas
2016	J	`jnl`	Arithmetic Circuits: A Chasm at Depth 3. SIAM J. Comput. Ankit Gupta, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi
2016	J	`jnl`	Lower Bounds for Depth-Three Arithmetic Circuits with small bottom fanin. Comput. Complex. Neeraj Kayal, Chandan Saha
2016	A*	`conf`	On the size of homogeneous and of depth four formulas with low individual degree. STOC Neeraj Kayal, Chandan Saha, Sébastien Tavenas
2016	A	`conf`	Separation Between Read-once Oblivious Algebraic Branching Programs (ROABPs) and Multilinear Depth Three Circuits. STACS Neeraj Kayal, Vineet Nair, Chandan Saha
2015	A	`conf`	Lower Bounds for Depth Three Arithmetic Circuits with Small Bottom Fanin. CCC Neeraj Kayal, Chandan Saha
2015	—	`conf`	Lower Bounds for Sums of Powers of Low Degree Univariates. ICALP (1) Neeraj Kayal, Pascal Koiran, Timothée Pecatte, Chandan Saha
2015	J	`jnl`	Lower Bounds for Sums of Products of Low arity Polynomials. Electron. Colloquium Comput. Complex. Neeraj Kayal, Chandan Saha
2015	J	`jnl`	Multi- Electron. Colloquium Comput. Complex. Neeraj Kayal, Chandan Saha
2015	A	`conf`	Multi-k-ic Depth Three Circuit Lower Bound. STACS Neeraj Kayal, Chandan Saha
2015	J	`jnl`	On the size of homogeneous and of depth four formulas with low individual degree. Electron. Colloquium Comput. Complex. Neeraj Kayal, Chandan Saha, Sébastien Tavenas
2015	J	`jnl`	Separation between Read-once Oblivious Algebraic Branching Programs (ROABPs) and Multilinear Depth Three Circuits. Electron. Colloquium Comput. Complex. Neeraj Kayal, Vineet Nair, Chandan Saha
2014	A*	`conf`	A super-polynomial lower bound for regular arithmetic formulas. STOC Neeraj Kayal, Chandan Saha, Ramprasad Saptharishi
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`	Approaching the Chasm at Depth Four. J. ACM Ankit Gupta, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi
2014	A	`conf`	Arithmetic Circuit Complexity (Tutorial). STACS Neeraj Kayal
2014	J	`jnl`	Lower Bounds for Depth Three Arithmetic Circuits with small bottom fanin. Electron. Colloquium Comput. Complex. Neeraj Kayal, Chandan Saha
2014	J	`jnl`	Random arithmetic formulas can be reconstructed efficiently. Comput. Complex. Ankit Gupta, Neeraj Kayal, Youming Qiao
2014	A*	`conf`	Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas. STOC Neeraj Kayal, Nutan Limaye, Chandan Saha, Srikanth Srinivasan
2013	J	`jnl`	A super-polynomial lower bound for regular arithmetic formulas. Electron. Colloquium Comput. Complex. Neeraj Kayal, Chandan Saha, Ramprasad Saptharishi
2013	A	`conf`	Approaching the Chasm at Depth Four. CCC Ankit Gupta, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi
2013	A*	`conf`	Arithmetic Circuits: A Chasm at Depth Three. FOCS Ankit Gupta, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi
2013	J	`jnl`	Arithmetic circuits: A chasm at depth three. Electron. Colloquium Comput. Complex. Ankit Gupta, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi
2013	A	`conf`	Random Arithmetic Formulas Can Be Reconstructed Efficiently. CCC Ankit Gupta, Neeraj Kayal, Youming Qiao
2012	A*	`conf`	Affine projections of polynomials: extended abstract. STOC Neeraj Kayal
2012	J	`jnl`	An exponential lower bound for homogeneous depth four arithmetic circuits with bounded bottom fanin. Electron. Colloquium Comput. Complex. Ankit Gupta, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi
2012	J	`jnl`	An exponential lower bound for the sum of powers of bounded degree polynomials. Electron. Colloquium Comput. Complex. Neeraj Kayal
2012	J	`jnl`	On the Sum of Square Roots of Polynomials and Related Problems. ACM Trans. Comput. Theory Neeraj Kayal, Chandan Saha
2012	J	`jnl`	Random Arithmetic Formulas can be Reconstructed Efficiently. Electron. Colloquium Comput. Complex. Ankit Gupta, Neeraj Kayal, Youming Qiao
2012	A*	`conf`	Reconstruction of depth-4 multilinear circuits with top fan-in 2. STOC Ankit Gupta, Neeraj Kayal, Satyanarayana V. Lokam
2011	J	`jnl`	Affine projections of polynomials. Electron. Colloquium Comput. Complex. Neeraj Kayal
2011	A*	`conf`	Efficient Reconstruction of Random Multilinear Formulas. FOCS Ankit Gupta, Neeraj Kayal, Satyanarayana V. Lokam
2011	A*	`conf`	Efficient algorithms for some special cases of the polynomial equivalence problem. SODA Neeraj Kayal
2011	A	`conf`	On the Sum of Square Roots of Polynomials and Related Problems. CCC Neeraj Kayal, Chandan Saha
2011	J	`jnl`	Partial Derivatives in Arithmetic Complexity and Beyond. Found. Trends Theor. Comput. Sci. Xi Chen, Neeraj Kayal, Avi Wigderson
2011	J	`jnl`	Reconstruction of Depth-4 Multilinear Circuits with Top fanin 2. Electron. Colloquium Comput. Complex. Ankit Gupta, Neeraj Kayal, Satyanarayana V. Lokam
2011	J	`jnl`	Square root Bound on the Least Power Non-residue using a Sylvester-Vandermonde Determinant CoRR Michael Forbes, Neeraj Kayal, Rajat Mittal, Chandan Saha
2010	J	`jnl`	Algorithms for Arithmetic Circuits. Electron. Colloquium Comput. Complex. Neeraj Kayal
2010	J	`jnl`	On the Sum of Square Roots of Polynomials and related problems. Electron. Colloquium Comput. Complex. Neeraj Kayal, Chandan Saha
2009	A*	`conf`	Blackbox Polynomial Identity Testing for Depth 3 Circuits. FOCS Neeraj Kayal, Shubhangi Saraf
2009	J	`jnl`	Blackbox Polynomial Identity Testing for Depth 3 Circuits. Electron. Colloquium Comput. Complex. Neeraj Kayal, Shubhangi Saraf
2009	—	`conf`	Factoring Groups Efficiently. ICALP (1) Neeraj Kayal, Timur Nezhmetdinov
2009	A	`conf`	The Complexity of the Annihilating Polynomial. CCC Neeraj Kayal
2008	J	`jnl`	Factoring groups efficiently. Electron. Colloquium Comput. Complex. Neeraj Kayal, Timur Nezhmetdinov
2007	J	`jnl`	Polynomial Identity Testing for Depth 3 Circuits. Comput. Complex. Neeraj Kayal, Nitin Saxena
2006	J	`jnl`	Complexity of Ring Morphism Problems. Comput. Complex. Neeraj Kayal, Nitin Saxena
2006	A	`conf`	Polynomial Identity Testing for Depth 3 Circuits. CCC Neeraj Kayal, Nitin Saxena
2005	A	`conf`	On the Ring Isomorphism and Automorphism Problems. CCC Neeraj Kayal, Nitin Saxena
2005	J	`jnl`	Polynomial Identity Testing for Depth 3 Circuits Electron. Colloquium Comput. Complex. Neeraj Kayal, Nitin Saxena
2005	J	`jnl`	Recognizing permutation functions in polynomial time. Electron. Colloquium Comput. Complex. Neeraj Kayal
2005	A*	`conf`	Solvability of a System of Bivariate Polynomial Equations over a Finite Field. ICALP Neeraj Kayal
2004	J	`jnl`	On the Ring Isomorphism & Automorphism Problems Electron. Colloquium Comput. Complex. Neeraj Kayal, Nitin Saxena