Aditya Bhaskara
About
In The Last Decade
Aditya Bhaskara
32 papers receiving 372 citations
Peers
Comparison fields: 5 of 56
- Computational Theory and Mathematics 175
- Artificial Intelligence 156
- Computer Networks and Communications 107
- Computer Vision and Pattern Recognition 51
- Computational Mechanics 39
Countries citing papers authored by Aditya Bhaskara
This map shows the geographic impact of Aditya Bhaskara's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Aditya Bhaskara with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Aditya Bhaskara more than expected).
Fields of papers citing papers by Aditya Bhaskara
This network shows the impact of papers produced by Aditya Bhaskara. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Aditya Bhaskara. The network helps show where Aditya Bhaskara may publish in the future.
Co-authorship network of co-authors of Aditya Bhaskara
This figure shows the co-authorship network connecting the top 25 collaborators of Aditya Bhaskara. A scholar is included among the top collaborators of Aditya Bhaskara based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Aditya Bhaskara. Aditya Bhaskara is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | 0 | |
| 3 | 1 | |
| 4 | 2 | |
| 5 | 2 | |
| 6 | Online MAP Inference of Determinantal Point Processes | 0 |
| 7 | Robust Algorithms for Online k-means Clustering. | 2 |
| 8 | Adaptive Probing Policies for Shortest Path Routing | 2 |
| 9 | 3 | |
| 10 | 3 | |
| 11 | Greedy Sampling for Approximate Clustering in the Presence of Outliers | 5 |
| 12 | On Distributed Averaging for Stochastic k-PCA | 0 |
| 13 | Distributed Clustering via LSH Based Data Partitioning | 5 |
| 14 | 2 | |
| 15 | Linear Relaxations for Finding Diverse Elements in Metric Spaces | 8 |
| 16 | Distributed Balanced Clustering via Mapping Coresets | 22 |
| 17 | Open Problem: Tensor Decompositions: Algorithms up to the Uniqueness Threshold? | 1 |
| 18 | 34 | |
| 19 | 12 | |
| 20 | Computing the Matrix p-norm | 1 |
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.