Остановите войну!
for scientists:
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
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 79 matches
- 2024
- Srinivasan Arunachalam, Arkopal Dutt, Francisco Escudero Gutiérrez, Carlos Palazuelos:
Learning Low-Degree Quantum Objects. ICALP 2024: 13:1-13:19 - Srinivasan Arunachalam, Arkopal Dutt, Francisco Escudero Gutiérrez, Carlos Palazuelos:
Learning low-degree quantum objects. CoRR abs/2405.10933 (2024) - 2023
- Vinayakumar Ravi, Mamoun Alazab, Sriram Srinivasan, Ajay Arunachalam, K. P. Soman:
Adversarial Defense: DGA-Based Botnets and DNS Homographs Detection Through Integrated Deep Learning. IEEE Trans. Engineering Management 70(1): 249-266 (2023) - Srinivasan Arunachalam, Uma Girish:
Trade-Offs Between Entanglement and Communication. CCC 2023: 25:1-25:23 - Srinivasan Arunachalam, Vojtech Havlícek, Louis Schatzki:
On the Role of Entanglement and Statistics in Learning. NeurIPS 2023 - Srinivasan Arunachalam, Sergey Bravyi, Arkopal Dutt, Theodore J. Yoder:
Optimal Algorithms for Learning Quantum Phase States. TQC 2023: 3:1-3:24 - Srinivasan Arunachalam, João F. Doriguello, Rahul Jain:
A note on the partition bound for one-way classical communication complexity. CoRR abs/2302.10431 (2023) - Thays Guerra Araujo Duarte, Srinivasan Arunachalam, Arthriya Subgranon, Seymour M. J. Spence:
Uncertainty Quantification of a Wind Tunnel-Informed Stochastic Wind Load Model for Wind Engineering Applications. CoRR abs/2305.06253 (2023) - Srinivasan Arunachalam, Seymour M. J. Spence:
Generalized Stratified Sampling for Efficient Reliability Assessment of Structures Against Natural Hazards. CoRR abs/2305.06338 (2023) - Anurag Anshu, Srinivasan Arunachalam:
A survey on the complexity of learning quantum states. CoRR abs/2305.20069 (2023) - Srinivasan Arunachalam, Uma Girish:
Trade-offs between Entanglement and Communication. CoRR abs/2306.01233 (2023) - Srinivasan Arunachalam, Vojtech Havlícek, Louis Schatzki:
On the Role of Entanglement and Statistics in Learning. CoRR abs/2306.03161 (2023) - Srinivasan Arunachalam, Uma Girish, Noam Lifshitz:
One Clean Qubit Suffices for Quantum Communication Advantage. CoRR abs/2310.02406 (2023) - Srinivasan Arunachalam, Uma Girish, Noam Lifshitz:
One Clean Qubit Suffices for Quantum Communication Advantage. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- Srinivasan Arunachalam, Vojtech Havlícek, Giacomo Nannicini, Kristan Temme, Pawel Wocjan:
Simpler (classical) and faster (quantum) algorithms for Gibbs partition functions. Quantum 6: 789 (2022) - Srinivasan Arunachalam, Penghui Yao:
Positive spectrahedra: invariance principles and pseudorandom generators. STOC 2022: 208-221 - Srinivasan Arunachalam, Sergey Bravyi, Chinmay Nirkhe, Bryan O'Gorman:
The Parametrized Complexity of Quantum Verification. TQC 2022: 3:1-3:18 - Srinivasan Arunachalam, Sergey Bravyi, Chinmay Nirkhe, Bryan O'Gorman:
The Parameterized Complexity of Quantum Verification. CoRR abs/2202.08119 (2022) - Srinivasan Arunachalam, Seymour M. J. Spence:
Reliability-Based Collapse Assessment of Wind-Excited Steel Structures within Performance-Based Wind Engineering. CoRR abs/2207.14156 (2022) - Srinivasan Arunachalam, Sergey Bravyi, Arkopal Dutt, Theodore J. Yoder:
Optimal algorithms for learning quantum phase states. CoRR abs/2208.07851 (2022) - 2021
- Sivaraman Eswaran, Aruna Srinivasan, Prasad B. Honnavalli:
A threshold-based, real-time analysis in early detection of endpoint anomalies using SIEM expertise. Netw. Secur. 2021(4): 7-16 (2021) - Srinivasan Arunachalam, Sourav Chakraborty, Troy Lee, Manaswi Paraashar, Ronald de Wolf:
Two new results about quantum exact learning. Quantum 5: 587 (2021) - Srinivasan Arunachalam, Alex Bredariol Grilo, Aarthi Sundaram:
Quantum Hardness of Learning Shallow Classical Circuits. SIAM J. Comput. 50(3): 972-1013 (2021) - Srinivasan Arunachalam, Sourav Chakraborty, Michal Koucký, Nitin Saurabh, Ronald de Wolf:
Improved Bounds on Fourier Entropy and Min-entropy. ACM Trans. Comput. Theory 13(4): 22:1-22:40 (2021) - Srinivasan Arunachalam, Alex B. Grilo, Tom Gur, Igor C. Oliveira, Aarthi Sundaram:
Quantum learning algorithms imply circuit lower bounds. FOCS 2021: 562-573 - Srinivasan Arunachalam, Supartha Podder:
Communication Memento: Memoryless Communication Complexity. ITCS 2021: 61:1-61:20 - Yihui Quek, Srinivasan Arunachalam, John A. Smolin:
Private learning implies quantum stability. NeurIPS 2021: 20503-20515 - Srinivasan Arunachalam, Vojtech Havlícek, Giacomo Nannicini, Kristan Temme, Pawel Wocjan:
Simpler (Classical) and Faster (Quantum) Algorithms for Gibbs Partition Functions. QCE 2021: 112-122 - Srinivasan Arunachalam, Penghui Yao:
Positive spectrahedrons: Geometric properties, Invariance principles and Pseudorandom generators. CoRR abs/2101.08141 (2021) - Srinivasan Arunachalam, Yihui Quek, John A. Smolin:
Private learning implies quantum stability. CoRR abs/2102.07171 (2021)
skipping 49 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-09 13:20 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