Nati Linial
#36,602
Most Influential Person Now
Israeli mathematician
Nati Linial's AcademicInfluence.com Rankings
Nati Linialmathematics Degrees
Mathematics
#2777
World Rank
#4214
Historical Rank
Combinatorics
#92
World Rank
#100
Historical Rank
Measure Theory
#5793
World Rank
#6924
Historical Rank
Download Badge
Mathematics
Why Is Nati Linial Influential?
(Suggest an Edit or Addition)According to Wikipedia, Nathan Linial is an Israeli mathematician and computer scientist, a professor in the Rachel and Selim Benin School of Computer Science and Engineering at the Hebrew University of Jerusalem, and an ISI highly cited researcher.
Nati Linial's Published Works
Published Works
- Lifts, Discrepancy and Nearly Optimal Spectral Gaps (2003) (64)
- The distribution of knots in the Petaluma model (2017) (14)
- Extremal problems on shadows and hypercuts in simplicial complexes (2014) (10)
- Random Simplicial Complexes: Around the Phase Transition (2016) (10)
- Larger Corner-Free Sets from Better NOF Exactly-\(N\) Protocols (2021) (7)
- Universal knot diagrams (2018) (7)
- EXPANDERS, EIGENVALUES, AND ALL THAT (2004) (6)
- Extremal hypercuts and shadows of simplicial complexes (2014) (5)
- Efficient Generation of Random One-Factorizations for Complete Graphs (2017) (4)
- New LP-based Upper Bounds in the Rate-vs.-Distance Problem for Linear Codes (2022) (4)
- Geodesic Geometry on Graphs (2020) (3)
- On spectral properties of graphs , and their application to clustering (2004) (3)
- A New Derivation of the Counting Formula for Young Tableaux (1982) (2)
- Efficient Generation of One-Factorizations through Hill Climbing (2017) (2)
- On the Local Structure of Oriented Graphs - a Case Study in Flag Algebras (2019) (2)
- Linear Programming Hierarchies in Coding Theory: Dual Solutions (2022) (1)
- Session details: Session 2: 10:30--10:40 (2014) (0)
- Efficient, local and symmetric Markov chains that generate one-factorizations (2020) (0)
- On High-Dimensional Acyclic Tournaments (2013) (0)
- Hyperpaths (2020) (0)
- On the L\"owner-John Ellipsoids of the Metric Polytope (2023) (0)
- On the densities of cliques and independent sets in graphs (2015) (0)
- N ov 2 01 8 On The Communication Complexity of High-Dimensional Permutations Nati Linial (2018) (0)
- An Elementary Proof of the First LP Bound on the Rate of Binary Codes (2023) (0)
- On the Connectivity and Diameter of Geodetic Graphs (2022) (0)
- Extremal hypercuts and shadows of simplicial complexes (2019) (0)
- An approach to the girth problem in cubic graphs (2022) (0)
- Geodesic Geometry on Graphs (2022) (0)
- On the trace of incompatible vectors (2018) (0)
- New LP-Based Upper Bounds in the Rate-Vs.-Distance Problem for Binary Linear Codes (2023) (0)
- Expander Graphs — Both Local and Global (2020) (0)
- THE HEBREW UNIVERSITY OF JERUSALEM (2010) (0)
- Invariants of Random Knots and Links (2016) (0)
- Bounds on Unique-Neighbor Codes (2022) (0)
- Thanks to Referees (2011) (0)
- A note on Fermat's Last Theorem for $n=4$ (2023) (0)
- Leapfrog in Posets (2011) (0)
This paper list is powered by the following services:
Other Resources About Nati Linial
What Schools Are Affiliated With Nati Linial?
Nati Linial is affiliated with the following schools: