Karteek Sreenivasaiah
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
11
Venues
6
Active years
2011–2025
Best venue rank
A*
Where they publish
Papers
11 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2025 | MFCS | Sensitivity and Query Complexity Under Uncertainty. | Deepu Benson, Balagopal Komarath, Nikhil S. Mande, Nalli Sai Soumya, Jayalal Sarma, Karteek Sreenivasaiah |
| 2024 | STACS | Depth-3 Circuit Lower Bounds for k-OV. | Tameem Choudhury, Karteek Sreenivasaiah |
| 2019 | STOC | A fixed-depth size-hierarchy theorem for AC | Nutan Limaye, Karteek Sreenivasaiah, Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh |
| 2018 | STOC | On the complexity of hazard-free circuits. | Christian Ikenmeyer, Balagopal Komarath, Christoph Lenzen, Vladimir Lysikov, Andrey Mokhov, Karteek Sreenivasaiah |
| 2017 | FCT | On \varSigma \wedge \varSigma \wedge \varSigma Circuits: The Role of Middle \varSigma Fan-In, Homogeneity and Bottom Degree. | Christian Engels, B. V. Raghavendra Rao, Karteek Sreenivasaiah |
| 2015 | LATA | A Game Characterisation of Tree-like Q-resolution Size. | Olaf Beyersdorff, Leroy Chew, Karteek Sreenivasaiah |
| 2014 | COCOON | Building above Read-once Polynomials: Identity Testing and Hardness of Representation. | Meena Mahajan, B. V. Raghavendra Rao, Karteek Sreenivasaiah |
| 2013 | MFCS | Small Depth Proof Systems. | Andreas Krebs, Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah |
| 2012 | COCOON | The Complexity of Unary Subset Sum. | Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah |
| 2012 | MFCS | Identity Testing, Multilinearity Testing, and Monomials in Read-Once/Twice Formulas and Branching Programs. | Meena Mahajan, B. V. Raghavendra Rao, Karteek Sreenivasaiah |
| 2011 | MFCS | Verifying Proofs in Constant Depth. | Olaf Beyersdorff, Samir Datta, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer |