Nathan Linial
Impact in
-
- Limits and Structures in Graph Theory
- Computational Theory and Mathematics top 0.05%
- Complexity and Algorithms in Graphs
- Advanced Graph Theory Research
Papers in
-
- Advanced Graph Theory Research 44
- Complexity and Algorithms in Graphs 31
-
- Limits and Structures in Graph Theory 39
- Co-authors
- Avi Wigderson (9 shared papers)Shlomo Hoory (6 shared papers)Yuri Rabinovich (4 shared papers)Noam Nisan (7 shared papers)Michael Saks (15 shared papers)Gil Kalai (4 shared papers)Yishay Mansour (5 shared papers)J. Kahn (1 shared paper)
- Journals
- COMBINATORICA (26 papers)Journal of Combinatorial Theory Series B (10 papers)Discrete & Computational Geometry (10 papers)Journal of Combinatorial Theory Series A (8 papers)Combinatorics Probability Computing (6 papers)
- Partner nations
- IsraelUnited StatesCanada
In The Last Decade
Nathan Linial
158 papers receiving 6.3k citations
Nathan Linial's Hit Papers
Peers
Comparison fields: 5 of 136
- Discrete Mathematics and Combinatorics 923
- Computational Theory and Mathematics 3.6k
- Computer Graphics and Computer-Aided Design 452
- Computer Networks and Communications 2.3k
- Geometry and Topology 817
Countries citing papers authored by Nathan Linial
This map shows the geographic impact of Nathan 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 Nathan Linial with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Nathan Linial more than expected).
Fields of papers citing papers by Nathan Linial
This network shows the impact of papers produced by Nathan 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 Nathan Linial. The network helps show where Nathan Linial may publish in the future.
Co-authors
The 25 scholars most cited alongside Nathan Linial, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 159 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | Expander graphs and their applications Hit paper breakdown → | 2006 | 796 |
| 2 | The geometry of graphs and some of its algorithmic applications Hit paper breakdown → | 1995 | 565 |
| 3 | 1992 | 373 | |
| 4 | 1988 | 349 | |
| 5 | 1993 | 325 | |
| 6 | 1991 | 201 | |
| 7 | 1992 | 182 | |
| 8 | Collective Coin Flipping. | 1989 | 128 |
| 9 | 2002 | 125 | |
| 10 | 2006 | 119 | |
| 11 | 2006 | 119 | |
| 12 | 1987 | 116 | |
| 13 | 1993 | 113 | |
| 14 | 1992 | 112 | |
| 15 | 2002 | 93 | |
| 16 | 2000 | 87 | |
| 17 | 1990 | 82 | |
| 18 | 2012 | 82 | |
| 19 | 2006 | 81 | |
| 20 | 2000 | 81 |
About Nathan Linial
Nathan Linial is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Artificial Intelligence, Computer Networks and Communications and Geometry and Topology, having authored 159 papers that have together received 6.9k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (44 papers), Limits and Structures in Graph Theory (39 papers), Complexity and Algorithms in Graphs (31 papers), graph theory and CDMA systems (21 papers), Graph theory and applications (17 papers), Computational Geometry and Mesh Generation (13 papers), Markov Chains and Monte Carlo Methods (12 papers) and Algorithms and Data Compression (12 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (923 citations), Computational Theory and Mathematics (3.6k citations), Computer Graphics and Computer-Aided Design (452 citations), Computer Networks and Communications (2.3k citations) and Geometry and Topology (817 citations). Nathan Linial has collaborated with scholars based in Israel, United States and Canada. Frequent co-authors include Avi Wigderson, Shlomo Hoory, Yuri Rabinovich, Noam Nisan, Michael Saks, Gil Kalai, Yishay Mansour, J. Kahn, David Peleg and Allan Borodin. Their work appears in journals such as COMBINATORICA, Journal of Combinatorial Theory Series B, Discrete & Computational Geometry, Journal of Combinatorial Theory Series A and Combinatorics Probability Computing.
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.