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
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.
Servedio, Rocco A., Anindya De, & Ryan O’Donnell. (2021). Learning sparse mixtures of permutations from noisy information. Conference on Learning Theory. 1429–1466.
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
Servedio, Rocco A., et al.. (2013). Consistency versus Realizable H-Consistency for Multiclass Classification. International Conference on Machine Learning. 801–809.3 indexed citations
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.