Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Countries citing papers authored by Amir Globerson
Since
Specialization
Citations
This map shows the geographic impact of Amir Globerson'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 Amir Globerson with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Amir Globerson more than expected).
This network shows the impact of papers produced by Amir Globerson. 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 Amir Globerson. The network helps show where Amir Globerson may publish in the future.
Co-authorship network of co-authors of Amir Globerson
This figure shows the co-authorship network connecting the top 25 collaborators of Amir Globerson.
A scholar is included among the top collaborators of Amir Globerson 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 Amir Globerson. Amir Globerson is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Globerson, Amir, et al.. (2020). Regularizing Towards Permutation Invariance In Recurrent Models. Neural Information Processing Systems. 33. 18364–18374.1 indexed citations
Globerson, Amir, et al.. (2018). Uncertainty in Artificial Intelligence: Proceedings of the Thirty-Fourth Conference.5 indexed citations
7.
Globerson, Amir, et al.. (2018). Predict and Constrain: Modeling Cardinality in Deep Structured Prediction. International Conference on Machine Learning. 659–667.3 indexed citations
8.
Livni, Roi, et al.. (2016). Improper Deep Kernels. International Conference on Artificial Intelligence and Statistics. 1159–1167.
9.
Quattoni, Ariadna, Borja Balle, Xavier Carreras, & Amir Globerson. (2014). Spectral Regularization for Max-Margin Sequence Tagging. QRU Quaderns de Recerca en Urbanisme. 1710–1718.7 indexed citations
10.
Eban, Elad, et al.. (2014). Discrete Chebyshev Classifiers. International Conference on Machine Learning. 1233–1241.5 indexed citations
11.
Meshi, Ofer, Amir Globerson, & Tommi Jaakkola. (2012). Convergence Rate Analysis of MAP Coordinate Minimization Algorithms. DSpace@MIT (Massachusetts Institute of Technology). 25. 3014–3022.13 indexed citations
12.
Jaakkola, Tommi, David Sontag, Amir Globerson, & Marina Meilă. (2010). Learning Bayesian Network Structure using LP Relaxations. DSpace@MIT (Massachusetts Institute of Technology). 9. 358–365.100 indexed citations
13.
Sontag, David, Ofer Meshi, Amir Globerson, & Tommi Jaakkola. (2010). More data means less inference: A pseudo-max approach to structured learning. DSpace@MIT (Massachusetts Institute of Technology). 23. 2181–2189.10 indexed citations
Globerson, Amir & Tommi Jaakkola. (2007). Approximate inference using conditional entropy decompositions. International Conference on Artificial Intelligence and Statistics. 130–138.18 indexed citations
17.
Koo, Terry, Amir Globerson, Xavier Carreras, & Michael Collins. (2007). Structured Prediction Models via the Matrix-Tree Theorem. RECERCAT (Consorci de Serveis Universitaris de Catalunya). 141–150.65 indexed citations
18.
Globerson, Amir & Tommi Jaakkola. (2007). Fixing Max-Product: Convergent Message Passing Algorithms for MAP LP-Relaxations. Neural Information Processing Systems. 20. 553–560.162 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.