Prasad Tetali
About
In The Last Decade
Prasad Tetali
102 papers receiving 2.1k citations
Peers
Comparison fields: 5 of 94
- Computational Theory and Mathematics 733
- Statistics and Probability 678
- Mathematical Physics 556
- Computer Networks and Communications 466
- Geometry and Topology 408
Countries citing papers authored by Prasad Tetali
This map shows the geographic impact of Prasad Tetali'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 Prasad Tetali with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Prasad Tetali more than expected).
Fields of papers citing papers by Prasad Tetali
This network shows the impact of papers produced by Prasad Tetali. 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 Prasad Tetali. The network helps show where Prasad Tetali may publish in the future.
Co-authorship network of co-authors of Prasad Tetali
This figure shows the co-authorship network connecting the top 25 collaborators of Prasad Tetali. A scholar is included among the top collaborators of Prasad Tetali 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 Prasad Tetali. Prasad Tetali is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 2 | |
| 2 | 57 | |
| 3 | 5 | |
| 4 | 17 | |
| 5 | Near-Optimal Sublinear Time Bounds for Distributed Random Walks | 1 |
| 6 | 13 | |
| 7 | 9 | |
| 8 | Parking Functions and Acyclic Orientations of Graphs | 1 |
| 9 | A Near Optimal Bound for Pollard's Rho to Solve Discrete Log | 1 |
| 10 | Mathematical Aspects of Mixing Times in Markov Chains (Foundations and Trends(R) in Theoretical Computer Science) | 24 |
| 11 | 1 | |
| 12 | 0 | |
| 13 | 18 | |
| 14 | 5 | |
| 15 | 11 | |
| 16 | 1 | |
| 17 | Simple Markov-chain algorithms for generating bipartite graphs and tournaments (Extended Abstract) | 3 |
| 18 | 15 | |
| 19 | 3 | |
| 20 | 3 |
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.