Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAditya Krishnan 0001
Person information
- affiliation: Pinecone, New York, NY, USA
- affiliation (former): Johns Hopkins University, Baltimore, MD, USA
Other persons with the same name
- Aditya Krishnan 0002 — WARF-Chennai, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i9]Sebastian Bruch, Aditya Krishnan, Franco Maria Nardini:
Optimistic Query Routing in Clustering-based Approximate Maximum Inner Product Search. CoRR abs/2405.12207 (2024)- 2023
- [c7]Vladimir Braverman, Robert Krauthgamer, Aditya Krishnan, Shay Sapir:
Lower Bounds for Pseudo-Deterministic Counting in a Stream. ICALP 2023: 30:1-30:14 - [i8]Vladimir Braverman, Robert Krauthgamer, Aditya Krishnan, Shay Sapir:
Lower Bounds for Pseudo-Deterministic Counting in a Stream. CoRR abs/2303.16287 (2023) - 2022
- [c6]Vladimir Braverman, Aditya Krishnan, Christopher Musco:
Sublinear time spectral density estimation. STOC 2022: 1144-1157 - 2021
- [c5]Haoran Li, Aditya Krishnan, Jingfeng Wu, Soheil Kolouri, Praveen K. Pilly, Vladimir Braverman:
Lifelong Learning with Sketched Structural Regularization. ACML 2021: 985-1000 - [c4]Vladimir Braverman, Robert Krauthgamer, Aditya Krishnan, Shay Sapir:
Near-Optimal Entrywise Sampling of Numerically Sparse Matrices. COLT 2021: 759-773 - [i7]Vladimir Braverman, Aditya Krishnan, Christopher Musco:
Linear and Sublinear Time Spectral Density Estimation. CoRR abs/2104.03461 (2021) - [i6]Haoran Li, Aditya Krishnan, Jingfeng Wu, Soheil Kolouri, Praveen K. Pilly, Vladimir Braverman:
Lifelong Learning with Sketched Structural Regularization. CoRR abs/2104.08604 (2021) - [i5]Aditya Krishnan, Edo Liberty:
Projective Clustering Product Quantization. CoRR abs/2112.02179 (2021) - 2020
- [c3]Vladimir Braverman, Robert Krauthgamer, Aditya Krishnan, Roi Sinoff:
Schatten Norms in Matrix Streams: Hello Sparsity, Goodbye Dimension. ICML 2020: 1100-1110 - [c2]Max Bender, Jacob Gilbert, Aditya Krishnan, Kirk Pruhs:
Competitively Pricing Parking in a Tree. WINE 2020: 220-233 - [i4]Max Bender, Jacob Gilbert, Aditya Krishnan, Kirk Pruhs:
Competitively Pricing Parking in a Tree. CoRR abs/2007.07294 (2020) - [i3]Vladimir Braverman, Robert Krauthgamer, Aditya Krishnan, Shay Sapir:
Near-Optimal Entrywise Sampling of Numerically Sparse Matrices. CoRR abs/2011.01777 (2020)
2010 – 2019
- 2019
- [i2]Vladimir Braverman, Robert Krauthgamer, Aditya Krishnan, Roi Sinoff:
Schatten Norms in Matrix Streams: Hello Sparsity, Goodbye Dimension. CoRR abs/1907.05457 (2019) - 2018
- [c1]Aditya Krishnan, Sidhanth Mohanty, David P. Woodruff:
On Sketching the q to p Norms. APPROX-RANDOM 2018: 15:1-15:20 - [i1]Aditya Krishnan, Sidhanth Mohanty, David P. Woodruff:
On Sketching the q to p norms. CoRR abs/1806.06429 (2018)
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-07-09 05:26 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:
