Nathan Linial
Nathan Linial publishes mostly in Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Artificial Intelligence, on topics such as Advanced Graph Theory Research, Limits and Structures in Graph Theory and Complexity and Algorithms in Graphs.
- World rank
- #102,412 of 7,710,434 ranked researchers
- Rank in Israel
- #858 of 38,292
- Works
- 216
- Citations
- 13k
- Citations per work
- 62.5
What does Nathan Linial research?
Nathan Linial's work is mostly in Computer Science (40%), Mathematics (20%), Biochemistry, Genetics and Molecular Biology (7%).
Their six largest subfields, inside their fields and domains; the grey slice is everything else they publish. The interactive view splits every one of their works down to single topics.
The fields and subfields, with their numbers
- Physical Sciences12959.5%
- Computer Science8640.0%
- Mathematics4219.5%
- Everything else7333.7%
- Life Sciences156.8%
- 1Computational Theory and Mathematics24% of their works
- 2Discrete Mathematics and Combinatorics12% of their works
- 3Artificial Intelligence9% of their works
- 4Computer Networks and Communications7% of their works
- 5Geometry and Topology7% of their works
- 6Molecular Biology7% of their works
Research topics
Which keywords describe Nathan Linial's research?
The keywords of their largest research topics: Approximation Algorithms, Algorithmic Applications, Graph Theory, Parameterized Complexity, Graph Limits, Szemerédi's Theorem, Combinatorial Optimization and Complexity Theory.
- Permutations
- Mesh Generation
- Topological Methods
- Topological Indices
- Spectral Amplitude Coding
- Complexity Theory
- Szemerédi's Theorem
- Parameterized Complexity
- Algorithmic Applications
- Approximation Algorithms
- Graph Theory
- Graph Limits
- Combinatorial Optimization
- Fiber Bragg Grating
- Graph Spectra
- Persistent Homology
- Delaunay Triangulations
- Combinatorics
Size is their works in the topics tagged with each word, from their 8 largest topics. Each links to the topic it comes from most. The words come from the keyword list OpenAlex gives each topic, not from the text of the papers, so a word can appear that none of the papers uses.
All 18 words, with their numbers
- Approximation Algorithms1023 topics
- Algorithmic Applications862 topics
- Graph Theory521 topic
- Parameterized Complexity521 topic
- Graph Limits501 topic
- Szemerédi's Theorem501 topic
- Combinatorial Optimization341 topic
- Complexity Theory341 topic
- Fiber Bragg Grating281 topic
- Spectral Amplitude Coding281 topic
- Graph Spectra221 topic
- Topological Indices221 topic
- Persistent Homology201 topic
- Topological Methods201 topic
- Delaunay Triangulations161 topic
- Mesh Generation161 topic
- Combinatorics151 topic
- Permutations151 topic
Where does Nathan Linial work?
Nathan Linial's main affiliation in the publication record is Hebrew University of Jerusalem, Israel.
How many publications and citations does Nathan Linial have?
OpenAlex counts 216 works and 13,498 citations for Nathan Linial, an h-index of 53, ranking #102,412 of 7,710,434 researchers worldwide on the quality score.
Ranked on field-normalised citation excellence (50%), output (30%) and citations (20%). Counts come from OpenAlex author records, which occasionally merge different people who share a name or split one person into several.
Other researchers named Nathan Linial
Papers, co-authors, who cited this work and researchers on the nearest topics have tabs of their own, above. Is this your page? Claim it with your ORCID iD, or request a correction or removal.
Discussion
Ask a question or share a note about Nathan Linial. Keep it to the research: no personal attacks, advertising or links. Any reader can report a post, which collapses it for everyone until it is opened.