default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAditya Vikram Singh 0001
Person information
- affiliation: Indian Institute of Science, Department of Electrical Communication Engineering, Bengaluru, India
Other persons with the same name
- Aditya Vikram Singh — disambiguation page
- Aditya Vikram Singh 0002
![[0009-0009-8365-0503]](/https://anthro-https-dblp.uni-trier.de/img/orcid-mark.12x12.png "0009-0009-8365-0503")
— Northeastern University, College of Computer Science, Boston, MA, USA - Aditya Vikram Singh 0003 — University of Massachusetts Amherst, College of Information & Computer Sciences, Amherst, MA, USA
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2025
[i4]Clément Canonne, Sam Polgar, Aditya Vikram Singh, Aravind Thyagarajan, Joy Qiping Yang:
Verification of Statistical Properties: Redefining the Possible. Electron. Colloquium Comput. Complex. TR25: Article TR25-199 (2025)- 2024
- [j3]Anand Jerry George, Lekshmi Ramesh, Aditya Vikram Singh, Himanshu Tyagi:
Continual Mean Estimation Under User-Level Privacy. IEEE J. Sel. Areas Inf. Theory 5: 28-43 (2024) - [j2]Jayadev Acharya, Clément L. Canonne, Aditya Vikram Singh, Himanshu Tyagi:
Optimal Rates for Nonparametric Density Estimation Under Communication Constraints. IEEE Trans. Inf. Theory 70(3): 1939-1961 (2024) - 2022
- [i3]Anand Jerry George, Lekshmi Ramesh, Aditya Vikram Singh, Himanshu Tyagi:
Continual Mean Estimation Under User-Level Privacy. CoRR abs/2212.09980 (2022) - 2021
- [c3]Jayadev Acharya, Clément L. Canonne, Aditya Vikram Singh, Himanshu Tyagi:
Optimal Rates for Nonparametric Density Estimation under Communication Constraints. NeurIPS 2021: 26754-26766 - [i2]Jayadev Acharya, Clément L. Canonne, Aditya Vikram Singh, Himanshu Tyagi:
Optimal Rates for Nonparametric Density Estimation under Communication Constraints. CoRR abs/2107.10078 (2021) - 2020
- [j1]Aditya Vikram Singh, Kunal N. Chaudhury:
On Uniquely Registrable Networks. IEEE Trans. Netw. Sci. Eng. 7(3): 1327-1336 (2020)
2010 – 2019
- 2019
- [c2]Aditya Vikram Singh, Kunal N. Chaudhury:
When Can a System of Subnetworks Be Registered Uniquely? ICASSP 2019: 4564-4568 - [c1]Rajat Sanyal, Aditya Vikram Singh, Kunal Narayan Chaudhury:
An Iterative Eigensolver for Rank-Constrained Semidefinite Programming. NCC 2019: 1-6 - [i1]Aditya Vikram Singh, Kunal N. Chaudhury:
On Uniquely Registrable Networks. CoRR abs/1906.09714 (2019)
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 2026-06-27 04:09 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
