Ankur Moitra
- Computational Mathematics top 1%
- Tensor decomposition and applications 7
- Signal Processing top 5%
- Blind Source Separation Techniques 6
- Artificial Intelligence top 2%
- Machine Learning and Algorithms 14
- Algorithms and Data Compression 8
-
- Complexity and Algorithms in Graphs 13
- Advanced Graph Theory Research 7
-
- Sparse and Compressive Sensing Techniques 9
-
- Optimization and Search Problems 6
Ankur Moitra
59 papers receiving 1.1k citations
Peers
Comparison fields: 5 of 110
- Computational Mathematics 96
- Signal Processing 185
- Artificial Intelligence 537
- Computational Theory and Mathematics 265
- Computer Graphics and Computer-Aided Design 54
Countries citing papers authored by Ankur Moitra
This map shows the geographic impact of Ankur Moitra'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 Ankur Moitra with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ankur Moitra more than expected).
Fields of papers citing papers by Ankur Moitra
This network shows the impact of papers produced by Ankur Moitra. 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 Ankur Moitra. The network helps show where Ankur Moitra may publish in the future.
Co-authorship network
The 25 scholars most cited alongside Ankur Moitra, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2024 | 4 | |
| 2 | 2024 | 5 | |
| 3 | 2024 | 0 | |
| 4 | Better Algorithms for Estimating Non-Parametric Models in Crowd-Sourcing and Rank Aggregation | 2020 | 2 |
| 5 | 2019 | 3 | |
| 6 | 2019 | 4 | |
| 7 | 2018 | 8 | |
| 8 | 2015 | 15 | |
| 9 | The Threshold for Super-resolution via Extremal Functions. | 2014 | 11 |
| 10 | Open Problem: Tensor Decompositions: Algorithms up to the Uniqueness Threshold? | 2014 | 1 |
| 11 | 2014 | 30 | |
| 12 | 2014 | 41 | |
| 13 | 2013 | 9 | |
| 14 | 2013 | 7 | |
| 15 | 2013 | 17 | |
| 16 | 2013 | 2 | |
| 17 | An Information Complexity Approach to Extended Formulations. | 2012 | 2 |
| 18 | Efficiently Coding for Interactive Communication. | 2011 | 6 |
| 19 | 2009 | 26 | |
| 20 | 2008 | 33 |
About Ankur Moitra
Ankur Moitra is a scholar working on Computational Mathematics, Computational Theory and Mathematics, Numerical Analysis, Artificial Intelligence and Statistics and Probability, having authored 63 papers that have together received 1.2k indexed citations. Recurring topics across this work include Machine Learning and Algorithms (14 papers), Complexity and Algorithms in Graphs (13 papers), Sparse and Compressive Sensing Techniques (9 papers), Algorithms and Data Compression (8 papers), Tensor decomposition and applications (7 papers), Advanced Graph Theory Research (7 papers), Blind Source Separation Techniques (6 papers) and Optimization and Search Problems (6 papers). The work is most often cited by research in Computational Mathematics (96 citations), Signal Processing (185 citations), Artificial Intelligence (537 citations), Computational Theory and Mathematics (265 citations) and Computer Graphics and Computer-Aided Design (54 citations). Ankur Moitra has collaborated with scholars based in United States, Canada and Israel. Frequent co-authors include Sanjeev Arora, Gregory Valiant, Rong Ge, Rong Ge, Adam Tauman Kalai, Tom Leighton, Ravindran Kannan, Amit Sahai, Ran Gelles and Mark Braverman. Their work appears in journals such as SIAM Journal on Computing, Communications of the ACM, Journal of the ACM, Algorithmica and Discrete & Computational Geometry.
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.