default search action
Karteek Sreenivasaiah
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j9]Yogesh Dahiya
, K. Vignesh, Meena Mahajan, Karteek Sreenivasaiah
Linear threshold functions in decision lists, decision trees, and depth-2 circuits. Inf. Process. Lett. 183: 106418 (2024) - [c12]Tameem Choudhury, Karteek Sreenivasaiah
Depth-3 Circuit Lower Bounds for k-OV. STACS 2024: 25:1-25:17 - 2023
- [i13]Tameem Choudhury, Karteek Sreenivasaiah:
Depth-3 Circuit Lower Bounds for k-OV. Electron. Colloquium Comput. Complex. TR23 (2023) - [i12]Yogesh Dahiya, K. Vignesh, Meena Mahajan, Karteek Sreenivasaiah:
Linear threshold functions in decision lists, decision trees, and depth-2 circuits. Electron. Colloquium Comput. Complex. TR23 (2023) - 2021
- [j8]Nutan Limaye, Karteek Sreenivasaiah
A Fixed-Depth Size-Hierarchy Theorem for $\mathrm{AC}^0[\oplus]$ via the Coin Problem. SIAM J. Comput. 50(4): 1461-1499 (2021)
2010 – 2019
- 2019
- [j7]Christian Ikenmeyer, Balagopal Komarath, Christoph Lenzen, Vladimir Lysikov
On the Complexity of Hazard-free Circuits. J. ACM 66(4): 25:1-25:20 (2019) - [j6]Olaf Beyersdorff
A game characterisation of tree-like Q-Resolution size. J. Comput. Syst. Sci. 104: 82-101 (2019) - [c11]Nutan Limaye, Karteek Sreenivasaiah
A fixed-depth size-hierarchy theorem for AC0[⊕] via the coin problem. STOC 2019: 442-453 - 2018
- [c10]Markus Bläser, Balagopal Komarath, Karteek Sreenivasaiah
Graph Pattern Polynomials. FSTTCS 2018: 18:1-18:13 - [c9]Christian Ikenmeyer, Balagopal Komarath, Christoph Lenzen, Vladimir Lysikov
On the complexity of hazard-free circuits. STOC 2018: 878-889 - [i11]Nutan Limaye, Karteek Sreenivasaiah, Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh:
The Coin Problem in Constant Depth: Sample Complexity and Parity Gates. CoRR abs/1809.04092 (2018) - [i10]Markus Bläser, Balagopal Komarath, Karteek Sreenivasaiah:
Graph Pattern Polynomials. CoRR abs/1809.08858 (2018) - [i9]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. TR18 (2018) - 2017
- [c8]Christian Engels
On \varSigma \wedge \varSigma \wedge \varSigma Circuits: The Role of Middle \varSigma Fan-In, Homogeneity and Bottom Degree. FCT 2017: 230-242 - [i8]Christian Ikenmeyer, Balagopal Komarath, Christoph Lenzen, Vladimir Lysikov
On the complexity of hazard-free circuits. CoRR abs/1711.01904 (2017) - 2016
- [j5]Meena Mahajan
Building Above Read-Once Polynomials: Identity Testing and Hardness of Representation. Algorithmica 76(4): 890-909 (2016) - [j4]Anna Gál, Jing-Tang Jang, Nutan Limaye, Meena Mahajan
Space-Efficient Approximations for Subset Sum. ACM Trans. Comput. Theory 8(4): 16:1-16:28 (2016) - [j3]Andreas Krebs, Nutan Limaye, Meena Mahajan
Small Depth Proof Systems. ACM Trans. Comput. Theory 9(1): 2:1-2:26 (2016) - [i7]Christian Engels
Lower Bounds and Identity Testing for Projections of Power Symmetric Polynomials. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [c7]Olaf Beyersdorff
A Game Characterisation of Tree-like Q-resolution Size. LATA 2015: 486-498 - [i6]Meena Mahajan, B. V. Raghavendra Rao, Karteek Sreenivasaiah:
Building above read-once polynomials: identity testing and hardness of representation. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j2]Meena Mahajan
Monomials, multilinearity and identity testing in simple read-restricted circuits. Theor. Comput. Sci. 524: 90-102 (2014) - [c6]Meena Mahajan
Building above Read-once Polynomials: Identity Testing and Hardness of Representation. COCOON 2014: 1-12 - [i5]Olaf Beyersdorff, Leroy Chew, Karteek Sreenivasaiah:
A game characterisation of tree-like Q-Resolution size. Electron. Colloquium Comput. Complex. TR14 (2014) - [i4]Anna Gál, Jing-Tang Jang, Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah:
Space-Efficient Approximations for Subset Sum. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [j1]Olaf Beyersdorff
Verifying proofs in constant depth. ACM Trans. Comput. Theory 5(1): 2:1-2:23 (2013) - [c5]Andreas Krebs, Nutan Limaye, Meena Mahajan
Small Depth Proof Systems. MFCS 2013: 583-594 - [i3]Andreas Krebs, Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah:
Small Depth Proof Systems. CoRR abs/1307.4897 (2013) - [i2]Andreas Krebs, Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah:
Small Depth Proof Systems. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [c4]Meena Mahajan, Nitin Saurabh, Karteek Sreenivasaiah:
Counting paths in planar width 2 branching programs. CATS 2012: 59-68 - [c3]Nutan Limaye, Meena Mahajan
The Complexity of Unary Subset Sum. COCOON 2012: 458-469 - [c2]Meena Mahajan
Identity Testing, Multilinearity Testing, and Monomials in Read-Once/Twice Formulas and Branching Programs. MFCS 2012: 655-667 - [i1]Olaf Beyersdorff, Samir Datta, Andreas Krebs, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer:
Verifying Proofs in Constant Depth. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [c1]Olaf Beyersdorff
Verifying Proofs in Constant Depth. MFCS 2011: 84-95
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: