Nir Ailon

3.6k total citations
43 papers, 1.6k citations indexed

About

Nir Ailon is a scholar working on Artificial Intelligence, Computer Networks and Communications and Computational Theory and Mathematics. According to data from OpenAlex, Nir Ailon has authored 43 papers receiving a total of 1.6k indexed citations (citations by other indexed papers that have themselves been cited), including 26 papers in Artificial Intelligence, 13 papers in Computer Networks and Communications and 13 papers in Computational Theory and Mathematics. Recurrent topics in Nir Ailon's work include Machine Learning and Algorithms (16 papers), Optimization and Search Problems (12 papers) and Complexity and Algorithms in Graphs (12 papers). Nir Ailon is often cited by papers focused on Machine Learning and Algorithms (16 papers), Optimization and Search Problems (12 papers) and Complexity and Algorithms in Graphs (12 papers). Nir Ailon collaborates with scholars based in United States, Israel and Germany. Nir Ailon's co-authors include Bernard Chazelle, Moses Charikar, Alantha Newman, Edo Liberty, Ragesh Jaiswal, Claire Monteleoni, Mehryar Mohri, C. Seshadhri, Zohar Karnin and Ding Liu and has published in prestigious journals such as Communications of the ACM, Journal of the ACM and Machine Learning.

In The Last Decade

Nir Ailon

43 papers receiving 1.5k citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Nir Ailon United States 18 831 379 348 331 308 43 1.6k
Martin Anthony United Kingdom 18 1.6k 2.0× 359 0.9× 504 1.4× 166 0.5× 77 0.3× 76 2.2k
Satyen Kale United States 22 1.7k 2.0× 313 0.8× 226 0.6× 318 1.0× 127 0.4× 65 2.5k
Howard Karloff United States 29 957 1.2× 1.2k 3.1× 254 0.7× 215 0.6× 279 0.9× 91 2.9k
Samuel Burer United States 26 545 0.7× 1.2k 3.2× 248 0.7× 702 2.1× 99 0.3× 60 2.8k
Yuval Rabani Israel 30 827 1.0× 1.2k 3.1× 447 1.3× 109 0.3× 355 1.2× 94 2.9k
Tamir Tassa Israel 25 1.2k 1.4× 190 0.5× 346 1.0× 68 0.2× 146 0.5× 72 1.8k
David P. Woodruff United States 28 1.9k 2.2× 1.0k 2.7× 531 1.5× 1.0k 3.1× 433 1.4× 186 3.1k
George Labahn Canada 25 532 0.6× 1.0k 2.8× 183 0.5× 218 0.7× 79 0.3× 94 2.1k
Tamás Sarlós United States 17 883 1.1× 214 0.6× 426 1.2× 342 1.0× 195 0.6× 31 1.6k
Elias N. Houstis United States 23 401 0.5× 379 1.0× 152 0.4× 419 1.3× 59 0.2× 187 2.1k

Countries citing papers authored by Nir Ailon

Since Specialization
Citations

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

Fields of papers citing papers by Nir Ailon

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Nir Ailon

This figure shows the co-authorship network connecting the top 25 collaborators of Nir Ailon. A scholar is included among the top collaborators of Nir Ailon 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 Nir Ailon. Nir Ailon 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.
Ailon, Nir, et al.. (2018). A New and Flexible Approach to the Analysis of Paired Comparison Data. Journal of Machine Learning Research. 19(60). 1–29. 5 indexed citations
2.
Hoffer, Elad & Nir Ailon. (2017). Semi-supervised deep learning by metric embedding. arXiv (Cornell University). 3 indexed citations
3.
Jaiswal, Ragesh, et al.. (2016). Tight lower bound instances for k-means++ in two dimensions. Theoretical Computer Science. 634. 55–66. 5 indexed citations
4.
Ailon, Nir, Kohei Hatano, & Eiji Takimoto. (2016). Bandit online optimization over the permutahedron. Theoretical Computer Science. 650. 92–108. 1 indexed citations
6.
Ailon, Nir, Yudong Chen, & Huan Xu. (2015). Iterative and active graph clustering using trace norm minimization without cluster size constraints. Journal of Machine Learning Research. 16(1). 455–490. 4 indexed citations
7.
Ailon, Nir. (2014). Improved Bounds for Online Learning Over the Permutahedron and Other Ranking Polytopes. International Conference on Artificial Intelligence and Statistics. 29–37. 9 indexed citations
8.
Ailon, Nir, et al.. (2012). Improved Approximation Algorithms for Bipartite Correlation Clustering. SIAM Journal on Computing. 41(5). 1110–1121. 18 indexed citations
9.
Ailon, Nir, et al.. (2011). A New Active Learning Scheme with Applications to Learning to Rank from Pairwise Preferences. arXiv (Cornell University). 4 indexed citations
10.
Ailon, Nir. (2011). Active Learning Ranking from Pairwise Preferences with Almost Optimal Query Complexity. Neural Information Processing Systems. 24. 810–818. 27 indexed citations
11.
Radinsky, Kira & Nir Ailon. (2011). Ranking from pairs and triplets. 105–114. 19 indexed citations
12.
Ailon, Nir. (2010). An Active Learning Algorithm for Ranking from Pairwise Preferences with an Almost Optimal Query Complexity. Journal of Machine Learning Research. 13(1). 137–164. 42 indexed citations
13.
Ailon, Nir, Ragesh Jaiswal, & Claire Monteleoni. (2009). Streaming k-means approximation. Neural Information Processing Systems. 22. 10–18. 88 indexed citations
14.
Ailon, Nir. (2008). Reconciling Real Scores with Binary Comparisons: A New Logistic Based Model for Ranking. Neural Information Processing Systems. 21. 25–32. 2 indexed citations
15.
Ailon, Nir. (2008). Reconciling real scores with binary comparisons: a unified logistic model for ranking. Neural Information Processing Systems. 25–32. 2 indexed citations
16.
Ailon, Nir, Moses Charikar, & Alantha Newman. (2008). Aggregating inconsistent information. Journal of the ACM. 55(5). 1–27. 311 indexed citations
17.
Ailon, Nir. (2007). Aggregation of partial rankings, p-ratings and top-m lists. Symposium on Discrete Algorithms. 415–424. 12 indexed citations
18.
Ailon, Nir & Noga Alon. (2007). Hardness of fully dense problems. Information and Computation. 205(8). 1117–1129. 10 indexed citations
19.
Ailon, Nir, Bernard Chazelle, C. Seshadhri, & Ding Liu. (2006). Self-improving algorithms. Symposium on Discrete Algorithms. 261–270. 8 indexed citations
20.
Ailon, Nir & Moses Charikar. (2005). Fitting tree metrics: Hierarchical clustering and Phylogeny. 73–82. 24 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