2023 - Research.com Mathematics in Israel Leader Award
2022 - Research.com Mathematics in Israel Leader Award
2013 - Fellow of the American Mathematical Society
Combinatorics, Discrete mathematics, Upper and lower bounds, Function and Pathwidth are his primary areas of study. The various areas that Nathan Linial examines in his Combinatorics study include Geometry, Omega and Constant. His research in Omega tackles topics such as Computational problem which are related to areas like Distributed algorithm.
His Competitive analysis study in the realm of Upper and lower bounds interacts with subjects such as Schedule. His Function research includes themes of Harmonic analysis, Fourier transform, Boolean function and Polynomial. His Pathwidth research incorporates themes from Indifference graph and Chordal graph.
Nathan Linial spends much of his time researching Combinatorics, Discrete mathematics, Upper and lower bounds, Graph and Computational biology. His study looks at the intersection of Combinatorics and topics like Omega with Bounded function. His Discrete mathematics study focuses mostly on Indifference graph, Graph power, Random regular graph, Vertex and Boolean function.
Nathan Linial interconnects Pathwidth and Chordal graph in the investigation of issues within Indifference graph. His work deals with themes such as Graph theory and Permutation, which intersect with Upper and lower bounds. His Computational biology study combines topics in areas such as microRNA, Gene and Bioinformatics.
His scientific interests lie mostly in Combinatorics, Computational biology, Discrete mathematics, Gene and Almost surely. His study on Combinatorics is mostly dedicated to connecting different topics, such as Upper and lower bounds. The concepts of his Computational biology study are interwoven with issues in Phenotype, Proteome, microRNA and Heritability.
Nathan Linial has included themes like Calculus, Simple, Chernoff bound and Inequality in his Discrete mathematics study. In general Gene study, his work on Human genome and Genome often relates to the realm of Open peer review, thereby connecting several areas of interest. He interconnects High dimensional, Random graph, Omega and Homology in the investigation of issues within Almost surely.
His primary areas of investigation include Combinatorics, Discrete mathematics, Almost surely, Upper and lower bounds and Homology. His work on Time complexity as part of general Combinatorics research is often related to Stable roommates problem, thus linking different fields of science. His biological study spans a wide range of topics, including NODAL and Eigenvalues and eigenvectors.
His Almost surely study combines topics in areas such as Random regular graph, Simplicial complex, Eigenfunction, Adjacency matrix and Random graph. The Upper and lower bounds study combines topics in areas such as Hypergraph, Entropy, Complete graph and Omega. His research on Homology also deals with topics like
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Expander graphs and their applications
S Hoory;N Linial.
Bulletin of the American Mathematical Society (2006)
Expander graphs and their applications
S Hoory;N Linial.
Bulletin of the American Mathematical Society (2006)
The geometry of graphs and some of its algorithmic applications
Nathan Linial;Eran London;Yuri Rabinovich.
Combinatorica (1995)
The geometry of graphs and some of its algorithmic applications
Nathan Linial;Eran London;Yuri Rabinovich.
Combinatorica (1995)
Constant depth circuits, Fourier transform, and learnability
Nathan Linial;Yishay Mansour;Noam Nisan.
Journal of the ACM (1993)
Constant depth circuits, Fourier transform, and learnability
Nathan Linial;Yishay Mansour;Noam Nisan.
Journal of the ACM (1993)
Locality in distributed graph algorithms
Nathan Linial.
SIAM Journal on Computing (1992)
Locality in distributed graph algorithms
Nathan Linial.
SIAM Journal on Computing (1992)
The influence of variables on Boolean functions
J. Kahn;G. Kalai;N. Linial.
foundations of computer science (1988)
The influence of variables on Boolean functions
J. Kahn;G. Kalai;N. Linial.
foundations of computer science (1988)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
Hebrew University of Jerusalem
Rutgers, The State University of New Jersey
Weizmann Institute of Science
Princeton University
Institute for Advanced Study
Hebrew University of Jerusalem
City University of New York
University of Washington
Tel Aviv University
Tel Aviv University
University of Maryland, College Park
Paul Scherrer Institute
Inserm : Institut national de la santé et de la recherche médicale
University College London
Kansas State University
Jilin University
Chinese Academy of Sciences
Tohoku University
University of Copenhagen
MRC Laboratory of Molecular Biology
North Carolina State University
Rutgers, The State University of New Jersey
University of Milan
University of London
University of Oxford
Auckland University of Technology