default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAdrian She
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j5]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)- [c4]Nicola Galesi, Joshua A. Grochow, Toniann Pitassi, Adrian She:
On the Algebraic Proof Complexity of Tensor Isomorphism. CCC 2023: 4:1-4:40 - [c3]Adrian She, Henry Yuen:
Unitary Property Testing Lower Bounds by Polynomials. ITCS 2023: 96:1-96:17 - [i6]Nicola Galesi, Joshua A. Grochow, Toniann Pitassi, Adrian She:
On the algebraic proof complexity of Tensor Isomorphism. CoRR abs/2305.19320 (2023) - 2022
- [j4]Prerona Chatterjee
, Mrinal Kumar, Adrian She, Ben Lee Volk:
Quadratic Lower Bounds for Algebraic Branching Programs and Formulas. Comput. Complex. 31(2): 8 (2022) - [i5]Adrian She, Henry Yuen:
Unitary property testing lower bounds by polynomials. CoRR abs/2210.05885 (2022) - 2021
- [j3]Samantha Dahlberg, Adrian She, Stephanie van Willigenburg:
Chromatic posets. J. Comb. Theory A 184: 105496 (2021) - 2020
- [j2]Samantha Dahlberg, Adrian She, Stephanie van Willigenburg:
Schur and e-Positivity of Trees and Cut Vertices. Electron. J. Comb. 27(1): 1 (2020) - [c2]Prerona Chatterjee, Mrinal Kumar, Adrian She, Ben Lee Volk:
A Quadratic Lower Bound for Algebraic Branching Programs. CCC 2020: 2:1-2:21 - [c1]Prasad Chaugule, Mrinal Kumar, Nutan Limaye, Chandra Kanta Mohapatra, Adrian She, Srikanth Srinivasan:
Schur Polynomials Do Not Have Small Formulas If the Determinant Doesn't. CCC 2020: 14:1-14:27
2010 – 2019
- 2019
- [i4]Prerona Chatterjee, Mrinal Kumar, Adrian She, Ben Lee Volk:
A Quadratic Lower Bound for Algebraic Branching Programs. CoRR abs/1911.11793 (2019) - [i3]Prasad Chaugule, Mrinal Kumar, Nutan Limaye, Chandra Kanta Mohapatra, Adrian She, Srikanth Srinivasan:
Schur Polynomials do not have small formulas if the Determinant doesn't! CoRR abs/1911.12520 (2019) - [i2]Prerona Chatterjee, Mrinal Kumar, Adrian She, Ben Lee Volk:
A Quadratic Lower Bound for Algebraic Branching Programs. Electron. Colloquium Comput. Complex. TR19 (2019) - [i1]Prasad Chaugule, Mrinal Kumar, Nutan Limaye, Chandra Kanta Mohapatra, Adrian She, Srikanth Srinivasan:
Schur Polynomials do not have small formulas if the Determinant doesn't! Electron. Colloquium Comput. Complex. TR19 (2019) - 2016
- [j1]Petr Smirnov, Zhaleh Safikhani, Nehme Hachem, Dong Wang, Adrian She, Catharina Olsen, Mark Freeman, Heather Marie Selby, Deena M. A. Gendoo, Patrick Grossmann, Andrew H. Beck, Hugo J. W. L. Aerts, Mathieu Lupien, Anna Goldenberg, Benjamin Haibe-Kains:
PharmacoGx: an R package for analysis of large pharmacogenomic datasets. Bioinform. 32(8): 1244-1246 (2016)
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-06-10 21:23 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:
