Rocco A. Servedio

5.6k total citations
145 papers, 2.1k citations indexed

About

Rocco A. Servedio is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Rocco A. Servedio has authored 145 papers receiving a total of 2.1k indexed citations (citations by other indexed papers that have themselves been cited), including 118 papers in Artificial Intelligence, 86 papers in Computational Theory and Mathematics and 18 papers in Computer Networks and Communications. Recurrent topics in Rocco A. Servedio's work include Machine Learning and Algorithms (109 papers), Complexity and Algorithms in Graphs (67 papers) and Algorithms and Data Compression (44 papers). Rocco A. Servedio is often cited by papers focused on Machine Learning and Algorithms (109 papers), Complexity and Algorithms in Graphs (67 papers) and Algorithms and Data Compression (44 papers). Rocco A. Servedio collaborates with scholars based in United States, Israel and United Kingdom. Rocco A. Servedio's co-authors include Ryan O’Donnell, Adam R. Klivans, Philip M. Long, Ilias Diakonikolas, Jon Feldman, Adam Tauman Kalai, Tal Malkin, Steven J. Gortler, Yishay Mansour and Li-Yang Tan and has published in prestigious journals such as IEEE Transactions on Information Theory, The Journal of Urology and Journal of the ACM.

In The Last Decade

Rocco A. Servedio

137 papers receiving 1.9k citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Rocco A. Servedio United States 26 1.5k 962 402 274 124 145 2.1k
Luca Trevisan United States 28 1.3k 0.9× 1.8k 1.9× 677 1.7× 206 0.8× 130 1.0× 117 2.5k
Robert Krauthgamer Israel 26 602 0.4× 1.2k 1.2× 697 1.7× 187 0.7× 253 2.0× 110 2.0k
Marek Karpiński Germany 26 1.2k 0.8× 1.6k 1.7× 917 2.3× 349 1.3× 174 1.4× 190 2.8k
Subhash Khot United States 26 924 0.6× 2.3k 2.4× 897 2.2× 126 0.5× 97 0.8× 116 2.9k
Leonid A. Levin United States 14 2.0k 1.3× 1.7k 1.7× 346 0.9× 234 0.9× 355 2.9× 33 2.7k
Ronitt Rubinfeld United States 30 2.2k 1.5× 2.0k 2.1× 987 2.5× 132 0.5× 203 1.6× 111 3.3k
Michael Ben-Or Israel 27 3.3k 2.2× 1.8k 1.9× 1.3k 3.2× 306 1.1× 272 2.2× 52 4.5k
Ilan Newman Israel 23 687 0.5× 1.1k 1.1× 429 1.1× 113 0.4× 56 0.5× 86 1.4k
Paul C. Shields United States 20 869 0.6× 504 0.5× 256 0.6× 266 1.0× 211 1.7× 70 1.9k
Tomás Feder United States 23 846 0.6× 1.5k 1.6× 850 2.1× 267 1.0× 209 1.7× 87 2.8k

Countries citing papers authored by Rocco A. Servedio

Since Specialization
Citations

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

Fields of papers citing papers by Rocco A. Servedio

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Rocco A. Servedio

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

All Works

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.
O’Donnell, Ryan, Rocco A. Servedio, & Li-Yang Tan. (2020). Fooling Gaussian PTFs via local hyperconcentration. 1170–1183. 1 indexed citations
6.
De, Anindya, Ryan O’Donnell, & Rocco A. Servedio. (2020). . Theory of Computing. 16(1). 1–20. 1 indexed citations
7.
Chen, Xi, et al.. (2019). Efficient average-case population recovery in the presence of insertions and deletions. arXiv (Cornell University). 2 indexed citations
8.
De, Anindya, et al.. (2018). Simple and efficient pseudorandom generators from Gaussian processes.. 25. 100. 1 indexed citations
9.
Ron, Dana & Rocco A. Servedio. (2015). Testing probability distributions using conditional samples. 19 indexed citations
10.
Ron, Dana & Rocco A. Servedio. (2013). Exponentially improved algorithms and lower bounds for testing signed majorities. Symposium on Discrete Algorithms. 1319–1336. 2 indexed citations
11.
Servedio, Rocco A., et al.. (2013). Consistency versus Realizable H-Consistency for Multiclass Classification. International Conference on Machine Learning. 801–809. 3 indexed citations
12.
Hardt, Moritz, Guy N. Rothblum, & Rocco A. Servedio. (2012). Private data release via learning thresholds. Symposium on Discrete Algorithms. 168–187. 15 indexed citations
13.
Servedio, Rocco A. & Emanuele Viola. (2012). On a special case of rigidity.. Electronic colloquium on computational complexity. 19. 144. 6 indexed citations
14.
Long, Philip M. & Rocco A. Servedio. (2011). Algorithms and hardness results for parallel large margin learning. Journal of Machine Learning Research. 14(1). 1314–1322. 2 indexed citations
15.
Servedio, Rocco A., et al.. (2011). Learning large-margin halfspaces with more malicious noise. Neural Information Processing Systems. 24. 91–99. 8 indexed citations
16.
Long, Philip M. & Rocco A. Servedio. (2010). Restricted Boltzmann Machines are Hard to Approximately Evaluate or Simulate. International Conference on Machine Learning. 703–710. 24 indexed citations
17.
Dachman-Soled, Dana, Homin K. Lee, Tal Malkin, et al.. (2009). . Theory of Computing. 5(1). 257–282. 4 indexed citations
18.
Servedio, Rocco A., et al.. (2009). . Theory of Computing. 5(1). 191–216. 14 indexed citations
19.
Servedio, Rocco A., et al.. (2007). Boosting the Area under the ROC Curve. Neural Information Processing Systems. 20. 945–952. 22 indexed citations
20.
Diakonikolas, Ilias, et al.. (2007). Testing for Concise Representations. 549–558. 31 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

Rankless by CCL
2026