![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
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
- Srikanth Srinivasan 0001
Aarhus University, Denmark - Srikanth Srinivasan 0002
University of South Florida, Tampa, FL, USA - Srikanth Srinivasan 0003
Texas Instruments, Bangalore, India
Likely 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 202 matches
- 2024
- Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas:
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits. Commun. ACM 67(2): 101-108 (2024) - Raghuveer Peri, Sai Muralidhar Jayanthi, Srikanth Ronanki, Anshu Bhatia, Karel Mundnich, Saket Dingliwal, Nilaksh Das, Zejiang Hou, Goeric Huybrechts, Srikanth Vishnubhotla, Daniel Garcia-Romero, Sundararajan Srinivasan, Kyu J. Han, Katrin Kirchhoff:
SpeechGuard: Exploring the Adversarial Robustness of Multi-modal Large Language Models. ACL (Findings) 2024: 10018-10035 - Prashanth Amireddy
, Amik Raj Behera
, Manaswi Paraashar
, Srikanth Srinivasan
, Madhu Sudan
:
Local Correction of Linear Functions over the Boolean Cube. STOC 2024: 764-775 - Hervé Fournier, Nutan Limaye
, Srikanth Srinivasan
, Sébastien Tavenas
:
On the Power of Homogeneous Algebraic Formulas. STOC 2024: 141-151 - Prashanth Amireddy, Amik Raj Behera, Manaswi Paraashar, Srikanth Srinivasan, Madhu Sudan:
Local Correction of Linear Functions over the Boolean Cube. CoRR abs/2403.20305 (2024) - Nilaksh Das, Saket Dingliwal, Srikanth Ronanki, Rohit Paturi, Zhaocheng Huang, Prashant Mathur, Jie Yuan, Dhanush Bekal, Xing Niu, Sai Muralidhar Jayanthi, Xilai Li, Karel Mundnich, Monica Sunkara, Sundararajan Srinivasan, Kyu J. Han, Katrin Kirchhoff:
SpeechVerse: A Large-scale Generalizable Audio Language Model. CoRR abs/2405.08295 (2024) - Raghuveer Peri, Sai Muralidhar Jayanthi, Srikanth Ronanki, Anshu Bhatia, Karel Mundnich, Saket Dingliwal, Nilaksh Das, Zejiang Hou, Goeric Huybrechts, Srikanth Vishnubhotla, Daniel Garcia-Romero, Sundararajan Srinivasan, Kyu J. Han, Katrin Kirchhoff:
SpeechGuard: Exploring the Adversarial Robustness of Multimodal Large Language Models. CoRR abs/2405.08317 (2024) - Prashanth Amireddy, Amik Raj Behera, Manaswi Paraashar, Srikanth Srinivasan, Madhu Sudan:
Local Correction of Linear Functions over the Boolean Cube. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- Prasad Chaugule, Mrinal Kumar, Nutan Limaye, Chandra Kanta Mohapatra, Adrian She, Srikanth Srinivasan:
Schur Polynomials Do Not Have Small Formulas If the Determinant does not. Comput. Complex. 32(1): 3 (2023) - Srikanth Srinivasan:
A Robust Version of Hegedűs's Lemma, with Applications. TheoretiCS 2 (2023) - Prashanth Amireddy, Srikanth Srinivasan
, Madhu Sudan:
Low-Degree Testing over Grids. APPROX/RANDOM 2023: 41:1-41:22 - Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan
, Sébastien Tavenas:
Towards Optimal Depth-Reductions for Algebraic Formulas. CCC 2023: 28:1-28:19 - Fangkai Yang
, Jue Zhang
, Lu Wang
, Bo Qiao
, Di Weng
, Xiaoting Qin
, Gregory Weber
, Durgesh Nandini Das
, Srinivasan Rakhunathan
, Ranganathan Srikanth
, Qingwei Lin
, Dongmei Zhang
:
Contextual Self-attentive Temporal Point Process for Physical Decommissioning Prediction of Cloud Assets. KDD 2023: 5372-5381 - Srikanth Srinivasan
, Utkarsh Tripathi:
Optimal Explicit Small-Depth Formulas for the Coin Problem. STOC 2023: 881-894 - Patricia Bouyer
, Srikanth Srinivasan
:
43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, December 18-20, 2023, IIIT Hyderabad, Telangana, India. LIPIcs 284, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-304-1 [contents] - Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan, Sébastien Tavenas:
Towards Optimal Depth-Reductions for Algebraic Formulas. CoRR abs/2302.06984 (2023) - Prashanth Amireddy, Srikanth Srinivasan, Madhu Sudan:
Low-Degree Testing Over Grids. CoRR abs/2305.04983 (2023) - Srikanth Srinivasan, Amir Yehudayoff:
The discrepancy of greater-than. CoRR abs/2309.08703 (2023) - Hervé Fournier, Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas:
On the Power of Homogeneous Algebraic Formulas. Electron. Colloquium Comput. Complex. TR23 (2023) - Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan, Sébastien Tavenas:
Towards Optimal Depth-Reductions for Algebraic Formulas. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- Swapnam Bajpai, Vaibhav Krishan
, Deepanshu Kush, Nutan Limaye, Srikanth Srinivasan:
A #SAT Algorithm for Small Constant-Depth Circuits with PTF gates. Algorithmica 84(4): 1132-1162 (2022) - Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas:
Guest Column: Lower Bounds Against Constant-Depth Algebraic Circuits. SIGACT News 53(2): 40-62 (2022) - Siddharth Bhandari, Prahladh Harsha, Ramprasad Saptharishi, Srikanth Srinivasan
:
Vanishing Spaces of Random Sets and Applications to Reed-Muller Codes. CCC 2022: 31:1-31:14 - Nutan Limaye, Srikanth Srinivasan
, Sébastien Tavenas:
On the Partial Derivative Method Applied to Lopsided Set-Multilinear Polynomials. CCC 2022: 32:1-32:23 - Radu Curticapean, Nutan Limaye, Srikanth Srinivasan
:
On the VNP-Hardness of Some Monomial Symmetric Polynomials. FSTTCS 2022: 16:1-16:14 - Dhanush Bekal, Sundararajan Srinivasan, Srikanth Ronanki, Sravan Bodapati, Katrin Kirchhoff:
Contextual Acoustic Barge-In Classification for Spoken Dialog Systems. INTERSPEECH 2022: 1091-1095 - Sébastien Tavenas, Nutan Limaye, Srikanth Srinivasan
:
Set-multilinear and non-commutative formula lower bounds for iterated matrix multiplication. STOC 2022: 416-425 - Srikanth Srinivasan:
A Robust Version of Hegedűs's Lemma, with Applications. CoRR abs/2202.04982 (2022) - Siddharth Bhandari, Prahladh Harsha, Ramprasad Saptharishi, Srikanth Srinivasan:
Vanishing Spaces of Random Sets and Applications to Reed-Muller Codes. CoRR abs/2205.10749 (2022) - Dhanush Bekal, Sundararajan Srinivasan, Sravan Bodapati, Srikanth Ronanki, Katrin Kirchhoff:
Device Directedness with Contextual Cues for Spoken Dialog Systems. CoRR abs/2211.13280 (2022)
skipping 172 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-08-29 07:03 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