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
-
- Limits and Structures in Graph Theory 39
-
- Advanced Graph Theory Research 44
- Complexity and Algorithms in Graphs 31
- Co-authors
- Avi WigdersonShlomo HooryYuri RabinovichNoam NisanMichael SaksGil KalaiYishay MansourJ. Kahn
- Journals
- COMBINATORICA (26 papers)Discrete & Computational Geometry (10 papers)Journal of Combinatorial Theory Series B (10 papers)Journal of Combinatorial Theory Series A (8 papers)Random Structures and Algorithms (6 papers)
- Partner nations
- IsraelUnited StatesCanada
In The Last Decade
Nathan Linial
158 papers receiving 6.2k citations
Hit Papers
Peers
Comparison fields: 5 of 136
- Discrete Mathematics and Combinatorics 913
- Computational Theory and Mathematics 3.5k
- Computer Graphics and Computer-Aided Design 447
- Computer Networks and Communications 2.3k
- Geometry and Topology 802
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-authorship network
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
| # | Work | ||
|---|---|---|---|
| 1 | 2013 | 9 | |
| 2 | 2011 | 2 | |
| 3 | On the Complexity of Radio Communication (Extended Abstract) | 2008 | 4 |
| 4 | 2006 | 13 | |
| 5 | 2005 | 2 | |
| 6 | 2005 | 3 | |
| 7 | 2004 | 73 | |
| 8 | 2004 | 6 | |
| 9 | 1994 | 12 | |
| 10 | 1993 | 30 | |
| 11 | 1992 | 11 | |
| 12 | 1991 | 45 | |
| 13 | 1991 | 28 | |
| 14 | 1991 | 21 | |
| 15 | Compact distributed data structures for adaptive routing | 1989 | 47 |
| 16 | 1989 | 23 | |
| 17 | 1988 | 1 | |
| 18 | 1981 | 0 | |
| 19 | 1978 | 12 | |
| 20 | 1976 | 23 |
About Nathan Linial
Nathan Linial is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design, Geometry and Topology and Computational Mathematics, having authored 159 papers that have together received 6.8k 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), Algorithms and Data Compression (12 papers) and Markov Chains and Monte Carlo Methods (12 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (913 citations), Computational Theory and Mathematics (3.5k citations), Computer Graphics and Computer-Aided Design (447 citations), Computer Networks and Communications (2.3k citations) and Geometry and Topology (802 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, Discrete & Computational Geometry, Journal of Combinatorial Theory Series B, Journal of Combinatorial Theory Series A and Random Structures and Algorithms.
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.