← back to search

Nathan Linial

Hebrew University of Jerusalem · IL
🔎 Find collaborators in Computational Theory and Mathematics · Discrete Mathematics and Combinatorics →
Search 5.9M scientists by topic, h-index, country & funding — free.
Area of research
Computational Theory and Mathematics · Discrete Mathematics and Combinatorics
Research interest
Research interests include Mathematics, Combinatorics, Upper and lower bounds, Computer science, Simplicial complex, and Conjecture.
h-index
citations
529
works
17
NIH funding
primary concept
email

Recent publications

Genetic association studies of alterations in protein function expose recessive effects on cancer predisposition
Scientific Reports 2021cited by 31position: middledoi
miRNA Combinatorics and its Role in Cell State Control—A Probabilistic Approach
Frontiers in Molecular Biosciences 2021cited by 12position: middledoi
Expanding cancer predisposition genes with ultra-rare cancer-exclusive human variations
Scientific Reports 2020cited by 15position: middledoi
PWAS: Proteome-Wide Association Study
Lecture notes in computer science 2020cited by 7position: middledoi
Quantifying gene selection in cancer through protein functional alteration bias
Nucleic Acids Research 2019cited by 32position: middledoi
The distribution of knots in the Petaluma model
Algebraic & Geometric Topology 2018cited by 15position: middledoi
Monotone Subsequences in High-Dimensional Permutations
Combinatorics Probability Computing 2017cited by 12position: firstdoi
Random Simplicial Complexes: Around the Phase Transition
2017cited by 10position: firstdoi
The threshold for d-collapsibility in random complexes*
Random Structures and Algorithms 2015cited by 22position: lastdoi
An upper bound on the number of high-dimensional permutations
COMBINATORICA 2014cited by 40position: firstdoi
An upper bound on the number of high-dimensional permutations
COMBINATORICA 2014cited by 5position: firstdoi
When does the top homology of a random simplicial complex vanish?
Random Structures and Algorithms 2013cited by 30position: lastdoi
An upper bound on the number of Steiner triple systems
Random Structures and Algorithms 2013cited by 26position: firstdoi
On the Vertices of the d-Dimensional Birkhoff Polytope
Discrete & Computational Geometry 2013cited by 23position: firstdoi
No justified complaints
2012cited by 118position: lastdoi
Collapsibility and Vanishing of Top Homology in Random Simplicial Complexes
Discrete & Computational Geometry 2012cited by 71position: middledoi
Are Stable Instances Easy?
Combinatorics Probability Computing 2012cited by 60position: lastdoi

Grants

No grants ingested yet.

Frequent collaborators

Michal Linial · Hebrew University of Jerusalem5 papers (2019–2021)Zur Luria · Hebrew University of Jerusalem4 papers (2013–2014)Nadav Brandes · University of California, San Francisco3 papers (2019–2021)Lior Aronshtam · Hebrew University of Jerusalem3 papers (2012–2015)Yuval Peled · Hebrew University of Jerusalem1 papers (2017–2017) · 1 papers (2012–2012)Shelly Mahlab-Aviv · Hebrew University of Jerusalem1 papers (2021–2021)Dror G. Feitelson · Hebrew University of Jerusalem1 papers (2012–2012)Joseph Y. Halpern · Cornell University1 papers (2012–2012)Tomasz Łuczak · Lund University1 papers (2012–2012)Danny Dolev · Hebrew University of Jerusalem1 papers (2012–2012)Chaim Even‐Zohar · Hebrew University of Jerusalem1 papers (2018–2018)Raz Kupferman · Hebrew University of Jerusalem1 papers (2012–2012) · 1 papers (2018–2018)Roni Rasnic · Hebrew University of Jerusalem1 papers (2020–2020)Joel Hass · University of California, Davis1 papers (2018–2018)Michael Simkin · Hebrew University of Jerusalem1 papers (2017–2017) · 1 papers (2012–2012)
Looking for a research collaborator?
Search millions of scientists by field, institution, impact, and funding status — see their work, find their email, and reach out directly.
Find collaborators in Computational Theory and Mathematics · Discrete Mathematics and Combinatorics →