Ravi Kumar
About
In The Last Decade
Ravi Kumar
137 papers receiving 6.2k citations
Hit Papers
Peers
Comparison fields: 5 of 149
- Artificial Intelligence 3.5k
- Information Systems 1.6k
- Computer Networks and Communications 1.5k
- Statistical and Nonlinear Physics 1.3k
- Signal Processing 1.2k
Countries citing papers authored by Ravi Kumar
This map shows the geographic impact of Ravi Kumar'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 Ravi Kumar with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ravi Kumar more than expected).
Fields of papers citing papers by Ravi Kumar
This network shows the impact of papers produced by Ravi Kumar. 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 Ravi Kumar. The network helps show where Ravi Kumar may publish in the future.
Co-authorship network of co-authors of Ravi Kumar
This figure shows the co-authorship network connecting the top 25 collaborators of Ravi Kumar. A scholar is included among the top collaborators of Ravi Kumar 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 Ravi Kumar. Ravi Kumar 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 | 1 | |
| 3 | 1 | |
| 4 | 1 | |
| 5 | User-Level Differentially Private Learning via Correlated Sampling | 3 |
| 6 | Online Knapsack with Frequency Predictions | 5 |
| 7 | 1 | |
| 8 | Differentially Private Clustering: Tight Approximation Ratios | 2 |
| 9 | Faster Algorithms for Binary Matrix Factorization | 5 |
| 10 | On Mixtures of Markov Chains | 6 |
| 11 | Sketching, Embedding and Dimensionality Reduction in Information Theoretic Spaces | 6 |
| 12 | Great Question! Question Quality in Community Q&A | 32 |
| 13 | Summarization Through Submodularity and Dispersion | 24 |
| 14 | Near-Optimal Bounds for Cross-Validation via Loss Stability | 4 |
| 15 | Selecting Diverse Features via Spectral Regularization | 20 |
| 16 | Efficient implementation of large-scale multi-structural databases | 11 |
| 17 | 1 | |
| 18 | Comparing top k lists breakdown → | 487 |
| 19 | 192 | |
| 20 | 10 |
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.