default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 34 matches
- 2024
- 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) - Tameem Choudhury, Karteek Sreenivasaiah:
Depth-3 Circuit Lower Bounds for k-OV. STACS 2024: 25:1-25:17 - 2023
- Tameem Choudhury, Karteek Sreenivasaiah:
Depth-3 Circuit Lower Bounds for k-OV. Electron. Colloquium Comput. Complex. TR23 (2023) - 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
- 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): 1461-1499 (2021) - 2019
- Christian Ikenmeyer, Balagopal Komarath, Christoph Lenzen, Vladimir Lysikov, Andrey Mokhov, Karteek Sreenivasaiah:
On the Complexity of Hazard-free Circuits. J. ACM 66(4): 25:1-25:20 (2019) - Olaf Beyersdorff, Leroy Chew, Karteek Sreenivasaiah:
A game characterisation of tree-like Q-Resolution size. J. Comput. Syst. Sci. 104: 82-101 (2019) - Nutan Limaye, Karteek Sreenivasaiah, Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh:
A fixed-depth size-hierarchy theorem for AC0[⊕] via the coin problem. STOC 2019: 442-453 - 2018
- Markus Bläser, Balagopal Komarath, Karteek Sreenivasaiah:
Graph Pattern Polynomials. FSTTCS 2018: 18:1-18:13 - Christian Ikenmeyer, Balagopal Komarath, Christoph Lenzen, Vladimir Lysikov, Andrey Mokhov, Karteek Sreenivasaiah:
On the complexity of hazard-free circuits. STOC 2018: 878-889 - 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) - Markus Bläser, Balagopal Komarath, Karteek Sreenivasaiah:
Graph Pattern Polynomials. CoRR abs/1809.08858 (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. TR18 (2018) - 2017
- Christian Engels, B. V. Raghavendra Rao, Karteek Sreenivasaiah:
On \varSigma \wedge \varSigma \wedge \varSigma Circuits: The Role of Middle \varSigma Fan-In, Homogeneity and Bottom Degree. FCT 2017: 230-242 - Christian Ikenmeyer, Balagopal Komarath, Christoph Lenzen, Vladimir Lysikov, Andrey Mokhov, Karteek Sreenivasaiah:
On the complexity of hazard-free circuits. CoRR abs/1711.01904 (2017) - 2016
- Meena Mahajan, B. V. Raghavendra Rao, Karteek Sreenivasaiah:
Building Above Read-Once Polynomials: Identity Testing and Hardness of Representation. Algorithmica 76(4): 890-909 (2016) - Anna Gál, Jing-Tang Jang, Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah:
Space-Efficient Approximations for Subset Sum. ACM Trans. Comput. Theory 8(4): 16:1-16:28 (2016) - Andreas Krebs, Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah:
Small Depth Proof Systems. ACM Trans. Comput. Theory 9(1): 2:1-2:26 (2016) - Christian Engels, B. V. Raghavendra Rao, Karteek Sreenivasaiah:
Lower Bounds and Identity Testing for Projections of Power Symmetric Polynomials. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- Olaf Beyersdorff, Leroy Chew, Karteek Sreenivasaiah:
A Game Characterisation of Tree-like Q-resolution Size. LATA 2015: 486-498 - 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
- Meena Mahajan, B. V. Raghavendra Rao, Karteek Sreenivasaiah:
Monomials, multilinearity and identity testing in simple read-restricted circuits. Theor. Comput. Sci. 524: 90-102 (2014) - Meena Mahajan, B. V. Raghavendra Rao, Karteek Sreenivasaiah:
Building above Read-once Polynomials: Identity Testing and Hardness of Representation. COCOON 2014: 1-12 - Olaf Beyersdorff, Leroy Chew, Karteek Sreenivasaiah:
A game characterisation of tree-like Q-Resolution size. Electron. Colloquium Comput. Complex. TR14 (2014) - 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
- Olaf Beyersdorff, Samir Datta, Andreas Krebs, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer:
Verifying proofs in constant depth. ACM Trans. Comput. Theory 5(1): 2:1-2:23 (2013) - Andreas Krebs, Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah:
Small Depth Proof Systems. MFCS 2013: 583-594 - Andreas Krebs, Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah:
Small Depth Proof Systems. CoRR abs/1307.4897 (2013) - Andreas Krebs, Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah:
Small Depth Proof Systems. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- Meena Mahajan, Nitin Saurabh, Karteek Sreenivasaiah:
Counting paths in planar width 2 branching programs. CATS 2012: 59-68
skipping 4 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-09-27 21:18 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint