Nati Linial

858 total citations
35 papers, 353 citations indexed

About

Nati Linial is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Geometry and Topology. According to data from OpenAlex, Nati Linial has authored 35 papers receiving a total of 353 indexed citations (citations by other indexed papers that have themselves been cited), including 23 papers in Computational Theory and Mathematics, 17 papers in Discrete Mathematics and Combinatorics and 9 papers in Geometry and Topology. Recurrent topics in Nati Linial's work include Advanced Graph Theory Research (14 papers), Limits and Structures in Graph Theory (13 papers) and Complexity and Algorithms in Graphs (8 papers). Nati Linial is often cited by papers focused on Advanced Graph Theory Research (14 papers), Limits and Structures in Graph Theory (13 papers) and Complexity and Algorithms in Graphs (8 papers). Nati Linial collaborates with scholars based in Israel, United States and Switzerland. Nati Linial's co-authors include Adi Shraibman, Amit Daniely, Yonatan Bilu, Shai Shalev‐Shwartz, Shahar Mendelson, Gideon Schechtman, Michael Saks, Sébastien Bubeck, Joel Hass and Benny Sudakov and has published in prestigious journals such as IEEE Transactions on Information Theory, Journal of Combinatorial Theory Series B and Israel Journal of Mathematics.

In The Last Decade

Nati Linial

33 papers receiving 321 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Nati Linial Israel 11 216 169 92 62 52 35 353
Zeev Dvir United States 13 332 1.5× 346 2.0× 104 1.1× 44 0.7× 111 2.1× 53 562
Anup Rao United States 16 368 1.7× 340 2.0× 50 0.5× 28 0.5× 109 2.1× 40 527
Ronen Shaltiel Israel 15 532 2.5× 531 3.1× 58 0.6× 36 0.6× 81 1.6× 56 691
Joe Sawada Canada 14 376 1.7× 294 1.7× 170 1.8× 44 0.7× 43 0.8× 62 578
Caterina De Simone Italy 10 231 1.1× 57 0.3× 40 0.4× 29 0.5× 49 0.9× 26 390
Serge Dulucq France 13 95 0.4× 89 0.5× 158 1.7× 53 0.9× 15 0.3× 23 350
Nicolai Vorobjov United Kingdom 10 327 1.5× 90 0.5× 37 0.4× 118 1.9× 16 0.3× 27 434
Avner Magen Canada 12 220 1.0× 117 0.7× 24 0.3× 21 0.3× 70 1.3× 32 325
Marcos Kiwi Chile 9 155 0.7× 164 1.0× 38 0.4× 14 0.2× 40 0.8× 36 289
Vincent Vajnovszki France 8 181 0.8× 176 1.0× 67 0.7× 22 0.4× 81 1.6× 25 349

Countries citing papers authored by Nati Linial

Since Specialization
Citations

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

Fields of papers citing papers by Nati Linial

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Nati Linial

This figure shows the co-authorship network connecting the top 25 collaborators of Nati Linial. A scholar is included among the top collaborators of Nati Linial 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 Nati Linial. Nati Linial 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.
Linial, Nati, et al.. (2024). On the Löwner-John Ellipsoids of the Metric Polytope. Discrete & Computational Geometry. 74(2). 271–285.
2.
Linial, Nati, et al.. (2023). New LP-Based Upper Bounds in the Rate-Vs.-Distance Problem for Binary Linear Codes. IEEE Transactions on Information Theory. 69(5). 2886–2899. 2 indexed citations
3.
Linial, Nati, et al.. (2023). On the connectivity and diameter of geodetic graphs. European Journal of Combinatorics. 116. 103886–103886.
4.
Linial, Nati & Adi Shraibman. (2021). An Improved Protocol for the Exactly-N Problem. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations
5.
Hefetz, Dan, et al.. (2019). On the local structure of oriented graphs -- a case study in flag algebras. arXiv (Cornell University). 1 indexed citations
6.
Linial, Nati, et al.. (2019). On the weight distribution of random binary linear codes. Random Structures and Algorithms. 56(1). 5–36. 5 indexed citations
7.
Linial, Nati, Toniann Pitassi, & Adi Shraibman. (2018). On the Communication Complexity of High-Dimensional Permutations. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 20. 2 indexed citations
8.
Linial, Nati, et al.. (2016). On the Rigidity of Sparse Random Graphs. Journal of Graph Theory. 85(2). 466–480. 1 indexed citations
9.
Linial, Nati, et al.. (2015). Internal Partitions of Regular Graphs. Journal of Graph Theory. 83(1). 5–18. 17 indexed citations
10.
Bubeck, Sébastien & Nati Linial. (2015). On the Local Profiles of Trees. Journal of Graph Theory. 81(2). 109–119. 5 indexed citations
11.
Huang, Hao, et al.. (2015). On the densities of cliques and independent sets in graphs. COMBINATORICA. 36(5). 493–512. 4 indexed citations
12.
Linial, Nati, et al.. (2015). On the Number of 4-Cycles in a Tournament. Journal of Graph Theory. 83(3). 266–276. 4 indexed citations
13.
Linial, Nati, et al.. (2014). Graphs with Few 3‐Cliques and 3‐Anticliques are 3‐Universal. Journal of Graph Theory. 78(3). 229–238. 3 indexed citations
14.
Huang, Hao, et al.. (2013). On the 3‐Local Profiles of Graphs. Journal of Graph Theory. 76(3). 236–248. 8 indexed citations
15.
Linial, Nati, et al.. (2011). The dynamics of reputation systems. 91–100. 1 indexed citations
16.
Linial, Nati & Adi Shraibman. (2009). Learning Complexity vs Communication Complexity. Combinatorics Probability Computing. 18(1-2). 227–245. 24 indexed citations
17.
Linial, Nati & Adi Shraibman. (2008). Lower bounds in communication complexity based on factorization norms. Random Structures and Algorithms. 34(3). 368–394. 23 indexed citations
18.
Linial, Nati & Adi Shraibman. (2007). Lower bounds in communication complexity based on factorization norms. 699–708. 26 indexed citations
19.
Linial, Nati & Avi Wigderson. (2004). EXPANDERS, EIGENVALUES, AND ALL THAT. 1 indexed citations
20.
Bilu, Yonatan & Nati Linial. (2003). Lifts, Discrepancy and Nearly Optimal Spectral Gaps. arXiv (Cornell University). 25 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

Breakdown of academic impact, for papers by Zeev Dvir Breakdown of academic impact, for papers by Anup Rao Breakdown of academic impact, for papers by Ronen Shaltiel Breakdown of academic impact, for papers by Joe Sawada Breakdown of academic impact, for papers by Caterina De Simone Breakdown of academic impact, for papers by Serge Dulucq Breakdown of academic impact, for papers by Nicolai Vorobjov Breakdown of academic impact, for papers by Avner Magen Breakdown of academic impact, for papers by Marcos Kiwi Breakdown of academic impact, for papers by Vincent Vajnovszki
Rankless by CCL
2026