Anindya De

952 total citations
34 papers, 252 citations indexed

About

Anindya De is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Anindya De has authored 34 papers receiving a total of 252 indexed citations (citations by other indexed papers that have themselves been cited), including 22 papers in Artificial Intelligence, 16 papers in Computational Theory and Mathematics and 7 papers in Computer Networks and Communications. Recurrent topics in Anindya De's work include Machine Learning and Algorithms (13 papers), Complexity and Algorithms in Graphs (12 papers) and Markov Chains and Monte Carlo Methods (6 papers). Anindya De is often cited by papers focused on Machine Learning and Algorithms (13 papers), Complexity and Algorithms in Graphs (12 papers) and Markov Chains and Monte Carlo Methods (6 papers). Anindya De collaborates with scholars based in United States, United Kingdom and Switzerland. Anindya De's co-authors include Rocco A. Servedio, Thomas Vidick, Renato Renner, Christopher Portmann, Ilias Diakonikolas, Ryan O’Donnell, Rajeev Gajbhiye, Thomas Watson, S. A. Soman and Xi Chen and has published in prestigious journals such as IEEE Transactions on Power Delivery, SIAM Journal on Computing and Games and Economic Behavior.

In The Last Decade

Anindya De

32 papers receiving 222 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Anindya De United States	9	177	95	58	32	26	34	252
Jop Briët Netherlands	8	151 0.9×	77 0.8×	73 1.3×	7 0.2×	12 0.5×	28	248
Karol Pąk Poland	8	198 1.1×	159 1.7×	29 0.5×	15 0.5×	11 0.4×	62	312
Serge Fehr Netherlands	9	329 1.9×	48 0.5×	179 3.1×	43 1.3×	13 0.5×	27	390
Adam Naumowicz Poland	7	253 1.4×	177 1.9×	35 0.6×	9 0.3×	9 0.3×	27	341
João Inácio da Silva Filho Brazil	12	172 1.0×	120 1.3×	59 1.0×	34 1.1×	11 0.4×	65	341
Nati Linial Israel	11	169 1.0×	216 2.3×	13 0.2×	48 1.5×	7 0.3×	35	353
Zhimin He China	9	225 1.3×	40 0.4×	64 1.1×	23 0.7×	10 0.4×	37	294
Andrei Romashchenko Russia	7	99 0.6×	175 1.8×	12 0.2×	100 3.1×	32 1.2×	25	293
Anupam Prakash Singapore	9	463 2.6×	181 1.9×	112 1.9×	38 1.2×	5 0.2×	12	505
Adi Shraibman Israel	11	215 1.2×	240 2.5×	17 0.3×	44 1.4×	9 0.3×	19	335

Countries citing papers authored by Anindya De

Since Specialization

Citations

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

Fields of papers citing papers by Anindya De

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Anindya De

This figure shows the co-authorship network connecting the top 25 collaborators of Anindya De. A scholar is included among the top collaborators of Anindya De 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 Anindya De. Anindya De 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.

De, Anindya, et al.. (2024). Detecting Low-Degree Truncation. 1027–1038. 2 indexed citations

2.

Chen, Xi, et al.. (2022). Polynomial-time Trace Reconstruction in the Smoothed Complexity Model. ACM Transactions on Algorithms. 21(3). 1–28.

3.

Chen, Xi, et al.. (2021). Polynomial-Time Trace Reconstruction in the Low Deletion Rate Regime. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations

4.

Servedio, Rocco A., Anindya De, & Ryan O’Donnell. (2021). Learning sparse mixtures of permutations from noisy information. Conference on Learning Theory. 1429–1466.

5.

De, Anindya, Elchanan Mossel, & Joe Neeman. (2021). Robust testing of low dimensional functions. 584–597. 2 indexed citations

6.

De, Anindya, Ryan O’Donnell, & Rocco A. Servedio. (2020). . Theory of Computing. 16(1). 1–20. 1 indexed citations

7.

De, Anindya, Elchanan Mossel, & Joe Neeman. (2019). Is your function low dimensional. Conference on Learning Theory. 979–993. 1 indexed citations

8.

De, Anindya, Ryan O’Donnell, & Rocco A. Servedio. (2019). Optimal mean-based algorithms for trace reconstruction. The Annals of Applied Probability. 29(2). 7 indexed citations

9.

De, Anindya, et al.. (2018). Simple and efficient pseudorandom generators from Gaussian processes.. 25. 100. 1 indexed citations

10.

De, Anindya, Ryan O’Donnell, & Rocco A. Servedio. (2017). Optimal mean-based algorithms for trace reconstruction. 1047–1056. 19 indexed citations

11.

De, Anindya, Elchanan Mossel, & Joe Neeman. (2016). . Theory of Computing. 12(1). 1–50. 1 indexed citations

12.

De, Anindya & Rocco A. Servedio. (2014). Efficient deterministic approximate counting for low-degree polynomial threshold functions. 832–841. 5 indexed citations

13.

De, Anindya, Ilias Diakonikolas, & Rocco A. Servedio. (2014). Learning from satisfying assignments. Edinburgh Research Explorer (University of Edinburgh). 478–497. 2 indexed citations

14.

De, Anindya & Rocco A. Servedio. (2013). Efficient deterministic approximate counting for low-degree polynomial threshold functions. arXiv (Cornell University). 20. 173. 1 indexed citations

15.

De, Anindya. (2011). Pseudorandomness for Permutation and Regular Branching Programs. 221–231. 19 indexed citations

16.

De, Anindya & Thomas Vidick. (2010). Near-optimal extractors against quantum storage. 161–170. 15 indexed citations

17.

De, Anindya, Omid Etesami, Luca Trevisan, & Madhur Tulsiani. (2009). Improved Pseudorandom Generators for Depth 2 Circuits.. Electronic colloquium on computational complexity. 16. 141. 2 indexed citations

18.

De, Anindya, Luca Trevisan, & Madhur Tulsiani. (2009). Non-uniform attacks against one-way functions and PRGs.. Electronic colloquium on computational complexity. 16. 113. 2 indexed citations

19.

De, Anindya, et al.. (2008). Fast Integer Multiplication Using Modular Arithmetic. SIAM Journal on Computing. 42(2). 499–506. 6 indexed citations

20.

Gajbhiye, Rajeev, Anindya De, & S. A. Soman. (2007). Computation of Optimal Break Point Set of Relays—An Integer Linear Programming Approach. IEEE Transactions on Power Delivery. 22(4). 2087–2098. 17 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