Countries citing papers authored by L. A. Prashanth
Since
Specialization
Citations
This map shows the geographic impact of L. A. Prashanth'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 L. A. Prashanth with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites L. A. Prashanth more than expected).
This network shows the impact of papers produced by L. A. Prashanth. 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 L. A. Prashanth. The network helps show where L. A. Prashanth may publish in the future.
Co-authorship network of co-authors of L. A. Prashanth
This figure shows the co-authorship network connecting the top 25 collaborators of L. A. Prashanth.
A scholar is included among the top collaborators of L. A. Prashanth 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 L. A. Prashanth. L. A. Prashanth is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Prashanth, L. A., et al.. (2020). Concentration bounds for CVaR estimation: The cases of light-tailed and heavy-tailed distributions. International Conference on Machine Learning. 1. 5577–5586.11 indexed citations
6.
Bhat, Sanjay P. & L. A. Prashanth. (2019). Improved Concentration Bounds for Conditional Value-at-Risk and Cumulative Prospect Theory using Wasserstein distance.. arXiv (Cornell University).1 indexed citations
7.
Bhat, Sanjay P. & L. A. Prashanth. (2019). Concentration of risk measures: A Wasserstein distance approach. Neural Information Processing Systems. 32. 11762–11771.12 indexed citations
8.
Prashanth, L. A., et al.. (2019). Risk-aware Multi-armed Bandits Using Conditional Value-at-Risk..
Prashanth, L. A., et al.. (2015). Cumulative Prospect Theory Meets Reinforcement Learning: Prediction and Control. arXiv (Cornell University). 1406–1415.25 indexed citations
Korda, Nathaniel & L. A. Prashanth. (2015). On TD(0) with function approximation: Concentration bounds and a centered variant with exponential convergence. International Conference on Machine Learning. 626–634.9 indexed citations
14.
Prashanth, L. A., et al.. (2014). Algorithms for Nash Equilibria in General-Sum Stochastic Games.. arXiv (Cornell University).2 indexed citations
15.
Prashanth, L. A. & Mohammad Ghavamzadeh. (2014). Actor-Critic Algorithms for Risk-Sensitive Reinforcement Learning.. arXiv (Cornell University).1 indexed citations
16.
Korda, Nathaniel, L. A. Prashanth, & Rémi Munos. (2013). Online gradient descent for least squares regression: Non-asymptotic bounds and application to bandits.. arXiv (Cornell University).1 indexed citations
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.