default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Nathan Linial
aka: Nati Linial
Hebrew University of Jerusalem, Israel
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 221 matches
- 2024
- Asaf Etgar, Nati Linial:
On the connectivity and diameter of geodetic graphs. Eur. J. Comb. 116: 103886 (2024) - Gal Beniamini, Nati Linial, Adi Shraibman:
The Rank-Ramsey Problem and the Log-Rank Conjecture. CoRR abs/2405.07337 (2024) - 2023
- Amir Dahari, Nathan Linial:
In Search of Hyperpaths. Discret. Comput. Geom. 69(2): 399-421 (2023) - Daniel Cizma, Nati Linial:
Irreducible nonmetrizable path systems in graphs. J. Graph Theory 102(1): 5-14 (2023) - Elyassaf Loyfer, Nati Linial:
New LP-Based Upper Bounds in the Rate-Vs.-Distance Problem for Binary Linear Codes. IEEE Trans. Inf. Theory 69(5): 2886-2899 (2023) - Nati Linial, Elyassaf Loyfer:
An Elementary Proof of the First LP Bound on the Rate of Binary Codes. CoRR abs/2303.16619 (2023) - 2022
- Shoni Gilboa, Roman Glebov, Dan Hefetz, Nati Linial, Avraham Morgenstern:
On the Local Structure of Oriented Graphs - a Case Study in Flag Algebras. Electron. J. Comb. 29(3) (2022) - Daniel Cizma, Nati Linial:
Geodesic Geometry on Graphs. Discret. Comput. Geom. 68(1): 298-347 (2022) - Nati Linial, Idan Orzech:
Bounds on Unique-Neighbor Codes. CoRR abs/2203.10330 (2022) - Elyassaf Loyfer, Nati Linial:
New LP-based Upper Bounds in the Rate-vs.-Distance Problem for Linear Codes. CoRR abs/2206.09211 (2022) - Elyassaf Loyfer, Nati Linial:
Linear Programming Hierarchies in Coding Theory: Dual Solutions. CoRR abs/2211.12977 (2022) - 2021
- Nati Linial, Michael Simkin:
A randomized construction of high girth regular graphs. Random Struct. Algorithms 58(2): 345-369 (2021) - Nati Linial, Adi Shraibman:
An Improved Protocol for the Exactly-N Problem. CCC 2021: 2:1-2:8 - 2020
- Michael Chapman, Nati Linial, Yuval Peled:
Expander Graphs - Both Local and Global. Comb. 40(4): 473-509 (2020) - Nathan Linial, Sria Louis:
Asymptotically Almost Every 2r-Regular Graph Has an Internal Partition. Graphs Comb. 36(1): 41-50 (2020) - Nati Linial, Jonathan Mosheiff:
On the weight distribution of random binary linear codes. Random Struct. Algorithms 56(1): 5-36 (2020) - Nadav Brandes, Nathan Linial, Michal Linial:
Functional Evolutionary Modeling Exposes Overlooked Protein-Coding Genes Involved in Cancer. ISBRA 2020: 119-126 - Nadav Brandes, Nathan Linial, Michal Linial:
PWAS: Proteome-Wide Association Study. RECOMB 2020: 237-239 - Amir Dahari, Nati Linial:
Hyperpaths. CoRR abs/2011.09936 (2020) - 2019
- Shelly Mahlab-Aviv, Nathan Linial, Michal Linial:
A cell-based probabilistic approach unveils the concerted action of miRNAs. PLoS Comput. Biol. 15(12) (2019) - Nati Linial, Yuval Peled:
Enumeration and randomized constructions of hypertrees. Random Struct. Algorithms 55(3): 677-695 (2019) - Michael Chapman, Nati Linial, Yuval Peled:
Expander Graphs - Both Local and Global. FOCS 2019: 158-170 - Nati Linial, Toniann Pitassi, Adi Shraibman:
On the Communication Complexity of High-Dimensional Permutations. ITCS 2019: 54:1-54:20 - Yehuda Afek, Eli Gafni, Nati Linial:
A King in every two consecutive tournaments. CoRR abs/1910.09684 (2019) - 2018
- Nathan Linial, Michael Simkin:
Monotone Subsequences in High-Dimensional Permutations. Comb. Probab. Comput. 27(1): 69-83 (2018) - Nati Linial, Jonathan Mosheiff:
On the weight distribution of random binary linear codes. CoRR abs/1806.08392 (2018) - 2017
- Nati Linial, Jonathan Mosheiff:
On the Rigidity of Sparse Random Graphs. J. Graph Theory 85(2): 466-480 (2017) - Nati Linial, Adi Shraibman:
On The Communication Complexity of High-Dimensional Permutations. CoRR abs/1706.02207 (2017) - 2016
- Hao Huang, Nati Linial, Humberto Naves, Yuval Peled, Benny Sudakov:
On the densities of cliques and independent sets in graphs. Comb. 36(5): 493-512 (2016) - Chaim Even-Zohar, Joel Hass, Nati Linial, Tahl Nowik:
Invariants of Random Knots and Links. Discret. Comput. Geom. 56(2): 274-314 (2016)
skipping 191 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-10-06 03:19 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint