Varsha Dani

1.5k total citations
22 papers, 582 citations indexed

About

Varsha Dani is a scholar working on Artificial Intelligence, Computer Networks and Communications and Computational Theory and Mathematics. According to data from OpenAlex, Varsha Dani has authored 22 papers receiving a total of 582 indexed citations (citations by other indexed papers that have themselves been cited), including 13 papers in Artificial Intelligence, 12 papers in Computer Networks and Communications and 10 papers in Computational Theory and Mathematics. Recurrent topics in Varsha Dani's work include Complexity and Algorithms in Graphs (9 papers), Cryptography and Data Security (7 papers) and Optimization and Search Problems (7 papers). Varsha Dani is often cited by papers focused on Complexity and Algorithms in Graphs (9 papers), Cryptography and Data Security (7 papers) and Optimization and Search Problems (7 papers). Varsha Dani collaborates with scholars based in United States, Canada and Singapore. Varsha Dani's co-authors include Thomas P. Hayes, Sham M. Kakade, Ivona Bezáková, Jared Saia, Alina Beygelzimer, John Langford, T M Hayes, Bianca Zadrozny, Mahnush Movahedi and Ambuj Tewari and has published in prestigious journals such as Journal of Physics A Mathematical and Theoretical, Distributed Computing and arXiv (Cornell University).

In The Last Decade

Varsha Dani

22 papers receiving 550 citations

Peers

Varsha Dani

MSOR

AI

CNC

CTM

EE

Siddharth Barman United States

Ashwinkumar Badanidiyuru United States

Zeyuan Allen Zhu United States

Deeparnab Chakrabarty United States

Yasin Abbasi-Yadkori United States

Vladimir Gurvich United States

Simon Fischer Germany

Eugene Nudelman United States

Michele Flammini Italy

Yishay Mansour Israel

Siddharth Barman United States

Varsha Dani

221 ×0.5

MSOR

111 ×0.3

AI

179 ×0.7

CNC

69 ×0.8

CTM

174 ×2.5

EE

Citations per year, relative to Varsha Dani Varsha Dani (= 1×) peers Siddharth Barman

Countries citing papers authored by Varsha Dani

Since Specialization

Citations

This map shows the geographic impact of Varsha Dani'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 Varsha Dani with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Varsha Dani more than expected).

Fields of papers citing papers by Varsha Dani

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Varsha Dani. 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 Varsha Dani. The network helps show where Varsha Dani may publish in the future.

Co-authorship network of co-authors of Varsha Dani

This figure shows the co-authorship network connecting the top 25 collaborators of Varsha Dani. A scholar is included among the top collaborators of Varsha Dani 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 Varsha Dani. Varsha Dani is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Dani, Varsha, Aayush Gupta, Thomas P. Hayes, & Seth Pettie. (2022). Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks. Distributed Computing. 36(3). 373–384. 2 indexed citations

2.

Dani, Varsha, Aayush Gupta, Thomas P. Hayes, & Seth Pettie. (2021). Brief Announcement: Wake Up and Join Me! An Energy Efficient Algorithm for Maximal Matching in Radio Networks. 151–153. 1 indexed citations

3.

Dani, Varsha, et al.. (2020). A Scalable Algorithm for Multiparty Interactive Communication with Private Channels. 1–15. 2 indexed citations

4.

Dani, Varsha, et al.. (2019). Multiparty Interactive Communication with Private Channels. 147–149. 2 indexed citations

5.

Bhaskar, Umang, et al.. (2018). Truthful and Near-Optimal Mechanisms for Welfare Maximization in Multi-Winner Elections. Proceedings of the AAAI Conference on Artificial Intelligence. 32(1). 12 indexed citations

6.

Chang, Yi‐Jun, et al.. (2018). The Energy Complexity of Broadcast. 95–104. 14 indexed citations

7.

Dani, Varsha, et al.. (2017). Phase transitions in theq-coloring of random hypergraphs. Journal of Physics A Mathematical and Theoretical. 50(50). 505002–505002. 8 indexed citations

8.

Dani, Varsha, Valerie King, Mahnush Movahedi, Jared Saia, & Mahdi Zamani. (2016). Secure multi-party computation in large networks. Distributed Computing. 30(3). 193–229. 9 indexed citations

9.

Bender, Michael A., Jeremy T. Fineman, Mahnush Movahedi, et al.. (2015). Resource-Competitive Algorithms. ACM SIGACT News. 46(3). 57–71. 12 indexed citations

10.

Dani, Varsha, Mahnush Movahedi, & Jared Saia. (2014). Scalable mechanisms for rational secret sharing. Distributed Computing. 28(3). 171–187. 1 indexed citations

11.

Dani, Varsha, et al.. (2012). An Empirical Comparison of Algorithms for Aggregating Expert Predictions. arXiv (Cornell University). 106–113. 12 indexed citations

12.

Dani, Varsha, Valerie King, Mahnush Movahedi, & Jared Saia. (2012). Brief announcement. 227–228. 7 indexed citations

13.

Dani, Varsha, et al.. (2011). Scalable rational secret sharing. 7 indexed citations

14.

Bartlett, Peter L., Varsha Dani, Thomas P. Hayes, et al.. (2008). High-probability regret bounds for bandit online linear optimization. QUT ePrints (Queensland University of Technology). 335–342. 32 indexed citations

15.

Dani, Varsha, Thomas P. Hayes, & Sham M. Kakade. (2008). Stochastic Linear Optimization Under Bandit Feedback. ScholarlyCommons (University of Pennsylvania). 355–366. 207 indexed citations

16.

Dani, Varsha, Sham M. Kakade, & Thomas P. Hayes. (2007). The Price of Bandit Information for Online Optimization. ScholarlyCommons (University of Pennsylvania). 20. 345–352. 72 indexed citations

17.

Dani, Varsha & Thomas P. Hayes. (2006). Robbing the bandit: less regret in online geometric optimization against an adaptive adversary. Symposium on Discrete Algorithms. 937–943. 49 indexed citations

18.

Dani, Varsha & Thomas P. Hayes. (2006). Robbing the bandit. 937–943. 8 indexed citations

19.

Beygelzimer, Alina, Varsha Dani, T M Hayes, John Langford, & Bianca Zadrozny. (2005). Error limiting reductions between classification tasks. 49–56. 35 indexed citations

20.

Beygelzimer, Alina, Varsha Dani, Thomas P. Hayes, & John Langford. (2004). Reductions Between Classification Tasks. Electronic colloquium on computational complexity. 5 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.

Explore authors with similar magnitude of impact