The Structure of Metrizable Graphs.

Nathan Linial Nati Linial Hebrew University of Jerusalem, Israel Dijkstra Prize http://www.cs.huji.ac.il/~nati/ https://scholar.google.com/citations?user=wEBsSloAAAAJ https://zbmath.org/authors/?q=ai:linial.nathan https://mathscinet.ams.org/mathscinet/MRAuthorID/114440 https://mathgenealogy.org/id.php?id=63895 https://mathgenealogy.org/id.php?id=206046 https://en.wikipedia.org/wiki/Nati_Linial https://orcid.org/0000-0002-0918-3136 https://www.wikidata.org/entity/Q6969990 https://id.loc.gov/authorities/names/n91075450 https://d-nb.info/gnd/171385926

Maria Chudnovsky Daniel Cizma Nati Linial The Structure of Metrizable Graphs. 73-92 2026 January 75 Discret. Comput. Geom. 1 https://doi.org/10.1007/s00454-024-00685-3 db/journals/dcg/dcg75.html#ChudnovskyCL26 streams/journals/dcg

Aya Bernstine Nati Linial An Approach to the Girth Problem in Cubic Graphs. 2026 January 17-26 111 J. Graph Theory 1 https://doi.org/10.1002/jgt.23289 db/journals/jgt/jgt111.html#BernstineL26 streams/journals/jgt

Leonardo Nagami Coregliano Fernando Granha Jeronimo Chris Jones Nati Linial Elyassaf Loyfer Higher-Order Delsarte Dual LPs: Lifting, Constructions and Completeness. 44:1-44:22 2026 ITCS https://doi.org/10.4230/LIPIcs.ITCS.2026.44 conf/innovations/2026 db/conf/innovations/innovations2026.html#CoreglianoJJLL26

Gal Beniamini Nir Lavee Nati Linial How Balanced Can Permutations Be? 9 2025 February 45 Comb. 1 https://doi.org/10.1007/s00493-024-00127-x db/journals/combinatorica/combinatorica45.html#BeniaminiLL25 streams/journals/combinatorica

Nathan Linial Edan Orzech Bounds on unique-neighbor codes. 2025 5 Comb. Theory 3 https://doi.org/10.5070/c65365554 db/journals/combtheory/combtheory5.html#LinialO25 streams/journals/combtheory

Raziel Gartsman Nati Linial On the Löwner-John Ellipsoids of the Metric Polytope. 271-285 2025 September 74 Discret. Comput. Geom. 2 https://doi.org/10.1007/s00454-024-00703-4 db/journals/dcg/dcg74.html#GartsmanL25 streams/journals/dcg

Leonardo Nagami Coregliano Fernando Granha Jeronimo Chris Jones Nati Linial Elyassaf Loyfer Higher-order Delsarte Dual LPs: Lifting, Constructions and Completeness. 2025 January abs/2501.04854 CoRR https://doi.org/10.48550/arXiv.2501.04854 db/journals/corr/corr2501.html#abs-2501-04854 streams/journals/corr

Nati Linial Ori Shoshani Every Poset has a Large Cut. 2025 July abs/2507.12077 CoRR https://doi.org/10.48550/arXiv.2507.12077 db/journals/corr/corr2507.html#abs-2507-12077 streams/journals/corr

Asaf Etgar Nati Linial On the connectivity and diameter of geodetic graphs. 103886 2024 February 116 Eur. J. Comb. https://doi.org/10.1016/j.ejc.2023.103886 db/journals/ejc/ejc116.html#EtgarL24

Gal Beniamini Nati Linial Adi Shraibman The Rank-Ramsey Problem and the Log-Rank Conjecture. 2024 abs/2405.07337 CoRR https://doi.org/10.48550/arXiv.2405.07337 db/journals/corr/corr2405.html#abs-2405-07337

Amir Dahari Nathan Linial In Search of Hyperpaths. 399-421 2023 March 69 Discret. Comput. Geom. 2 https://doi.org/10.1007/s00454-021-00360-x db/journals/dcg/dcg69.html#DahariL23

Daniel Cizma Nati Linial Irreducible nonmetrizable path systems in graphs. 5-14 2023 102 J. Graph Theory 1 https://doi.org/10.1002/jgt.22854 db/journals/jgt/jgt102.html#CizmaL23

Elyassaf Loyfer Nati Linial New LP-Based Upper Bounds in the Rate-Vs.-Distance Problem for Binary Linear Codes. 2886-2899 2023 May 69 IEEE Trans. Inf. Theory 5 https://doi.org/10.1109/TIT.2023.3236660 db/journals/tit/tit69.html#LoyferL23

Nati Linial Elyassaf Loyfer An Elementary Proof of the First LP Bound on the Rate of Binary Codes. 2023 abs/2303.16619 CoRR https://doi.org/10.48550/arXiv.2303.16619 db/journals/corr/corr2303.html#abs-2303-16619

Shoni Gilboa Roman Glebov Dan Hefetz Nati Linial Avraham Morgenstern On the Local Structure of Oriented Graphs - a Case Study in Flag Algebras. 2022 29 Electron. J. Comb. 3 https://doi.org/10.37236/10694 db/journals/combinatorics/combinatorics29.html#GilboaGHLM22

Daniel Cizma Nati Linial Geodesic Geometry on Graphs. 298-347 2022 68 Discret. Comput. Geom. 1 https://doi.org/10.1007/s00454-021-00345-w db/journals/dcg/dcg68.html#CizmaL22

Nati Linial Idan Orzech Bounds on Unique-Neighbor Codes. 2022 abs/2203.10330 CoRR https://doi.org/10.48550/arXiv.2203.10330 db/journals/corr/corr2203.html#abs-2203-10330

Elyassaf Loyfer Nati Linial New LP-based Upper Bounds in the Rate-vs.-Distance Problem for Linear Codes. 2022 abs/2206.09211 CoRR https://doi.org/10.48550/arXiv.2206.09211 db/journals/corr/corr2206.html#abs-2206-09211

Elyassaf Loyfer Nati Linial Linear Programming Hierarchies in Coding Theory: Dual Solutions. 2022 abs/2211.12977 CoRR https://doi.org/10.48550/arXiv.2211.12977 db/journals/corr/corr2211.html#abs-2211-12977

Nati Linial Michael Simkin A randomized construction of high girth regular graphs. 345-369 2021 58 Random Struct. Algorithms 2 https://doi.org/10.1002/rsa.20976 db/journals/rsa/rsa58.html#LinialS21

Nati Linial Adi Shraibman An Improved Protocol for the Exactly-N Problem. 2:1-2:8 2021 CCC https://doi.org/10.4230/LIPIcs.CCC.2021.2 conf/coco/2021 db/conf/coco/coco2021.html#LinialS21

Michael Chapman Nati Linial Yuval Peled Expander Graphs - Both Local and Global. 473-509 2020 40 Comb. 4 https://doi.org/10.1007/s00493-019-4127-8 db/journals/combinatorica/combinatorica40.html#ChapmanLP20

Nathan Linial Sria Louis Asymptotically Almost Every 2r-Regular Graph Has an Internal Partition. 41-50 2020 36 Graphs Comb. 1 https://doi.org/10.1007/s00373-019-02116-0 https://www.wikidata.org/entity/Q126655126 db/journals/gc/gc36.html#LinialL20

Nati Linial Jonathan Mosheiff On the weight distribution of random binary linear codes. 5-36 2020 56 Random Struct. Algorithms 1 https://doi.org/10.1002/rsa.20879 https://www.wikidata.org/entity/Q127593503 db/journals/rsa/rsa56.html#LinialM20

Nadav Brandes Nathan Linial Michal Linial Functional Evolutionary Modeling Exposes Overlooked Protein-Coding Genes Involved in Cancer. 119-126 2020 ISBRA https://doi.org/10.1007/978-3-030-57821-3_11 conf/isbra/2020 db/conf/isbra/isbra2020.html#BrandesLL20 Nadav Brandes Nathan Linial Michal Linial PWAS: Proteome-Wide Association Study. 237-239 2020 RECOMB https://doi.org/10.1007/978-3-030-45257-5_20 conf/recomb/2020 db/conf/recomb/recomb2020.html#BrandesLL20

Amir Dahari Nati Linial Hyperpaths. 2020 abs/2011.09936 CoRR https://arxiv.org/abs/2011.09936 db/journals/corr/corr2011.html#abs-2011-09936

Shelly Mahlab-Aviv Nathan Linial Michal Linial A cell-based probabilistic approach unveils the concerted action of miRNAs. 2019 15 PLoS Comput. Biol. 12 https://doi.org/10.1371/journal.pcbi.1007204 https://www.wikidata.org/entity/Q91603745 db/journals/ploscb/ploscb15.html#Mahlab-AvivLL19

Nati Linial Yuval Peled Enumeration and randomized constructions of hypertrees. 677-695 2019 55 Random Struct. Algorithms 3 https://doi.org/10.1002/rsa.20841 https://www.wikidata.org/entity/Q128578653 db/journals/rsa/rsa55.html#LinialP19

Michael Chapman Nati Linial Yuval Peled Expander Graphs - Both Local and Global. 158-170 2019 FOCS https://doi.org/10.1109/FOCS.2019.00019 conf/focs/2019 db/conf/focs/focs2019.html#ChapmanLP19 Nati Linial Toniann Pitassi Adi Shraibman On the Communication Complexity of High-Dimensional Permutations. 54:1-54:20 2019 ITCS https://doi.org/10.4230/LIPIcs.ITCS.2019.54 conf/innovations/2019 db/conf/innovations/innovations2019.html#LinialPS19

Yehuda Afek Eli Gafni Nati Linial A King in every two consecutive tournaments. 2019 abs/1910.09684 CoRR http://arxiv.org/abs/1910.09684 db/journals/corr/corr1910.html#abs-1910-09684

Nathan Linial Michael Simkin Monotone Subsequences in High-Dimensional Permutations. 69-83 2018 27 Comb. Probab. Comput. 1 https://doi.org/10.1017/S0963548317000517 db/journals/cpc/cpc27.html#LinialS18

Nati Linial Jonathan Mosheiff On the weight distribution of random binary linear codes. 2018 abs/1806.08392 CoRR http://arxiv.org/abs/1806.08392 db/journals/corr/corr1806.html#abs-1806-08392

Nati Linial Jonathan Mosheiff On the Rigidity of Sparse Random Graphs. 466-480 2017 85 J. Graph Theory 2 https://doi.org/10.1002/jgt.22073 db/journals/jgt/jgt85.html#LinialM17

Nati Linial Adi Shraibman On The Communication Complexity of High-Dimensional Permutations. 2017 abs/1706.02207 CoRR http://arxiv.org/abs/1706.02207 db/journals/corr/corr1706.html#LinialS17

Hao Huang 0005 Nati Linial Humberto Naves Yuval Peled Benny Sudakov On the densities of cliques and independent sets in graphs. 493-512 2016 36 Comb. 5 https://doi.org/10.1007/s00493-015-3051-9 db/journals/combinatorica/combinatorica36.html#HuangLNPS16

Chaim Even-Zohar Joel Hass Nati Linial Tahl Nowik Invariants of Random Knots and Links. 274-314 2016 56 Discret. Comput. Geom. 2 https://doi.org/10.1007/s00454-016-9798-y db/journals/dcg/dcg56.html#Even-ZoharHLN16

Sébastien Bubeck Nati Linial On the Local Profiles of Trees. 109-119 2016 81 J. Graph Theory 2 https://doi.org/10.1002/jgt.21865 db/journals/jgt/jgt81.html#BubeckL16

Amir Ban Nati Linial Internal Partitions of Regular Graphs. 5-18 2016 83 J. Graph Theory 1 https://doi.org/10.1002/jgt.21909 db/journals/jgt/jgt83.html#BanL16

Nati Linial Avraham Morgenstern On the Number of 4-Cycles in a Tournament. 266-276 2016 83 J. Graph Theory 3 https://doi.org/10.1002/jgt.21996 db/journals/jgt/jgt83.html#LinialM16

Lior Aronshtam Nathan Linial The threshold for d-collapsibility in random complexes. 260-269 2016 48 Random Struct. Algorithms 2 https://doi.org/10.1002/rsa.20585 db/journals/rsa/rsa48.html#AronshtamL16

Chaim Even-Zohar Nati Linial A Note on the Inducibility of 4-Vertex Graphs. 1367-1380 2015 31 Graphs Comb. 5 https://doi.org/10.1007/s00373-014-1475-4 db/journals/gc/gc31.html#Even-ZoharL15

Nati Linial Avraham Morgenstern Graphs with Few 3-Cliques and 3-Anticliques are 3-Universal. 229-238 2015 78 J. Graph Theory 3 https://doi.org/10.1002/jgt.21801 db/journals/jgt/jgt78.html#LinialM15

Chaim Even-Zohar Nati Linial Triply Existentially Complete Triangle-Free Graphs. 305-317 2015 78 J. Graph Theory 4 https://doi.org/10.1002/jgt.21808 db/journals/jgt/jgt78.html#Even-ZoharL15

Lior Aronshtam Nathan Linial When does the top homology of a random simplicial complex vanish? 26-35 2015 46 Random Struct. Algorithms 1 https://doi.org/10.1002/rsa.20495 db/journals/rsa/rsa46.html#AronshtamL15

Nati Linial Jonathan Mosheiff On the Rigidity of Sparse Random Graphs. 2015 abs/1505.01189 CoRR http://arxiv.org/abs/1505.01189 db/journals/corr/corr1505.html#LinialM15

Nadav Rappoport Amos Stern Nathan Linial Michal Linial Entropy-driven partitioning of the hierarchical protein space. 624-630 2014 30 Bioinform. 17 https://doi.org/10.1093/bioinformatics/btu478 https://www.wikidata.org/entity/Q34103239 db/journals/bioinformatics/bioinformatics30.html#RappoportSLL14

Nathan Linial Zur Luria An upper bound on the number of high-dimensional permutations. 471-486 2014 34 Comb. 4 https://doi.org/10.1007/s00493-011-2842-8 db/journals/combinatorica/combinatorica34.html#LinialL14

David Ellis Nathan Linial On Regular Hypergraphs of High Girth. 1 2014 21 Electron. J. Comb. 1 https://doi.org/10.37236/3851 db/journals/combinatorics/combinatorics21.html#EllisL14

Nathan Linial Zur Luria On the Vertices of the d-Dimensional Birkhoff Polytope. 161-170 2014 51 Discret. Comput. Geom. 1 https://doi.org/10.1007/s00454-013-9554-5 db/journals/dcg/dcg51.html#LinialL14

Hao Huang 0005 Nati Linial Humberto Naves Yuval Peled Benny Sudakov On the 3-Local Profiles of Graphs. 236-248 2014 76 J. Graph Theory 3 https://doi.org/10.1002/jgt.21762 db/journals/jgt/jgt76.html#HuangLNPS14

Yehuda Afek Yakov Babichenko Uriel Feige Eli Gafni Nati Linial Benny Sudakov Musical Chairs. 1578-1600 2014 28 SIAM J. Discret. Math. 3 https://doi.org/10.1137/12088478X db/journals/siamdm/siamdm28.html#AfekBFGLS14

Amit Daniely Nati Linial Shai Shalev-Shwartz The Complexity of Learning Halfspaces using Generalized Linear Methods. 244-286 2014 COLT http://proceedings.mlr.press/v35/daniely14a.html conf/colt/2014 db/conf/colt/colt2014.html#DanielyLS14 Amit Daniely Nati Linial Shai Shalev-Shwartz From average case complexity to improper learning complexity. 441-448 2014 STOC https://doi.org/10.1145/2591796.2591820 conf/stoc/2014 db/conf/stoc/stoc2014.html#DanielyLS14

Amir Ban Nati Linial Market Share Indicates Quality. 2014 abs/1407.3641 CoRR http://arxiv.org/abs/1407.3641 db/journals/corr/corr1407.html#BanL14

Lior Aronshtam Nathan Linial Tomasz Luczak 0001 Roy Meshulam Collapsibility and Vanishing of Top Homology in Random Simplicial Complexes. 317-334 2013 49 Discret. Comput. Geom. 2 https://doi.org/10.1007/s00454-012-9483-8 db/journals/dcg/dcg49.html#AronshtamLLM13

Nati Linial Avraham Morgenstern On High-Dimensional Acyclic Tournaments. 1085-1100 2013 50 Discret. Comput. Geom. 4 https://doi.org/10.1007/s00454-013-9543-8 db/journals/dcg/dcg50.html#LinialM13

Nathan Linial Zur Luria An upper bound on the number of Steiner triple systems. 399-406 2013 43 Random Struct. Algorithms 4 https://doi.org/10.1002/rsa.20487 db/journals/rsa/rsa43.html#LinialL13

Amit Daniely Nati Linial Shai Shalev-Shwartz More data speeds up training time in learning halfspaces over sparse vectors. 145-153 2013 NIPS https://proceedings.neurips.cc/paper/2013/hash/903ce9225fca3e988c2af215d4e544d3-Abstract.html http://papers.nips.cc/paper/4905-more-data-speeds-up-training-time-in-learning-halfspaces-over-sparse-vectors conf/nips/2013 db/conf/nips/nips2013.html#DanielyLS13 Yonatan Bilu Amit Daniely Nati Linial Michael E. Saks On the practically interesting instances of MAXCUT. 526-537 2013 STACS https://doi.org/10.4230/LIPIcs.STACS.2013.526 conf/stacs/2013 db/conf/stacs/stacs2013.html#BiluDLS13

Amit Daniely Nati Linial Shai Shalev-Shwartz More data speeds up training time in learning halfspaces over sparse vectors. 2013 CoRR http://arxiv.org/abs/1311.2271 abs/1311.2271 db/journals/corr/corr1311.html#DanielyLS13

Amit Daniely Nati Linial Shai Shalev-Shwartz From average case complexity to improper learning complexity. 2013 CoRR http://arxiv.org/abs/1311.2272 abs/1311.2272 db/journals/corr/corr1311.html#DanielyLS13a

Yonatan Bilu Nathan Linial Are Stable Instances Easy? 643-660 2012 21 Comb. Probab. Comput. 5 https://doi.org/10.1017/S0963548312000193 db/journals/cpc/cpc21.html#BiluL12

Nayantara Bhatnagar Nathan Linial On the Lipschitz constant of the RSK correspondence. 63-82 2012 119 J. Comb. Theory A 1 https://doi.org/10.1016/j.jcta.2011.08.003 db/journals/jct/jcta119.html#BhatnagarL12

Amir Ban Nati Linial Strong convergence in posets. 1299-1301 2012 119 J. Comb. Theory A 6 https://doi.org/10.1016/j.jcta.2012.03.006 db/journals/jct/jcta119.html#BanL12

Amit Daniely Nathan Linial Tight products and graph expansion. 426-440 2012 69 J. Graph Theory 4 https://doi.org/10.1002/jgt.20593 db/journals/jgt/jgt69.html#DanielyL12

Nadav Rappoport Solange Karsenty Amos Stern Nathan Linial Michal Linial ProtoNet 6.0: organizing 10 million protein sequences in a compact hierarchical family tree. 313-320 2012 40 Nucleic Acids Res. Database-Issue https://doi.org/10.1093/nar/gkr1027 https://www.wikidata.org/entity/Q39974445 db/journals/nar/nar40.html#RappoportKSLL12

Danny Dolev Dror G. Feitelson Joseph Y. Halpern Raz Kupferman Nathan Linial No justified complaints: on fair sharing of multiple resources. 68-75 2012 ITCS https://doi.org/10.1145/2090236.2090243 conf/innovations/2012 db/conf/innovations/innovations2012.html#DolevFHKL12

Amit Daniely Nati Linial Michael E. Saks Clustering is difficult only when it does not matter http://arxiv.org/abs/1205.4891 2012 CoRR abs/1205.4891 db/journals/corr/corr1205.html#abs-1205-4891

Yonatan Bilu Amit Daniely Nati Linial Michael E. Saks On the practically interesting instances of MAXCUT http://arxiv.org/abs/1205.4893 2012 CoRR abs/1205.4893 db/journals/corr/corr1205.html#abs-1205-4893

Yehuda Afek Yakov Babichenko Uriel Feige Eli Gafni Nati Linial Benny Sudakov Musical chairs http://arxiv.org/abs/1208.0813 2012 CoRR abs/1208.0813 db/journals/corr/corr1208.html#abs-1208-0813

Amit Daniely Nati Linial Shai Shalev-Shwartz The error rate of learning halfspaces using Kernel-SVMs http://arxiv.org/abs/1211.0616 2012 CoRR abs/1211.0616 db/journals/corr/corr1211.html#abs-1211-0616

Yosef Prat Menachem Fromer Nathan Linial Michal Linial Recovering key biological constituents through sparse representation of gene expression. 655-661 2011 27 Bioinform. 5 https://doi.org/10.1093/bioinformatics/btr002 https://www.wikidata.org/entity/Q38503620 db/journals/bioinformatics/bioinformatics27.html#PratFLL11

Regev Schweiger Michal Linial Nathan Linial Generative probabilistic models for protein-protein interaction networks - the biclique perspective. 142-148 2011 27 Bioinform. 13 https://doi.org/10.1093/bioinformatics/btr201 https://www.wikidata.org/entity/Q42605574 db/journals/bioinformatics/bioinformatics27.html#SchweigerLL11

Nathan Linial Tahl Nowik The Expected Genus of a Random Chord Diagram. 161-180 2011 45 Discret. Comput. Geom. 1 https://doi.org/10.1007/s00454-010-9276-x db/journals/dcg/dcg45.html#LinialN11

Yael Dekel James R. Lee Nathan Linial Eigenvectors of random graphs: Nodal Domains. 39-58 2011 39 Random Struct. Algorithms 1 https://doi.org/10.1002/rsa.20330 db/journals/rsa/rsa39.html#DekelLL11

Yosef Prat Menachem Fromer Michal Linial Nathan Linial Geometric Interpretation of Gene Expression by Sparse Reconstruction of Transcript Profiles. 355-357 2011 RECOMB https://doi.org/10.1007/978-3-642-20036-6_33 conf/recomb/2011 db/conf/recomb/recomb2011.html#PratFLL11 Amir Ban Nati Linial The dynamics of reputation systems. 91-100 2011 TARK https://doi.org/10.1145/2000378.2000389 conf/tark/2011 db/conf/tark/tark2011.html#BanL11 Yehuda Afek Yakov Babichenko Uriel Feige Eli Gafni Nati Linial Benny Sudakov Oblivious Collaboration. 489-504 2011 DISC https://doi.org/10.1007/978-3-642-24100-0_45 conf/wdag/2011 db/conf/wdag/disc2011.html#AfekBFGLS11

Yehuda Afek Yakov Babichenko Uriel Feige Eli Gafni Nati Linial Benny Sudakov Oblivious Collaboration http://arxiv.org/abs/1106.2065 2011 CoRR abs/1106.2065 db/journals/corr/corr1106.html#abs-1106-2065

Danny Dolev Dror G. Feitelson Joseph Y. Halpern Raz Kupferman Nati Linial No justified complaints: On fair sharing of multiple resources http://arxiv.org/abs/1106.2673 2011 CoRR abs/1106.2673 db/journals/corr/corr1106.html#abs-1106-2673

Nathan Linial Roy Meshulam M. Rosenthal Sum Complexes - a New Family of Hypertrees. 622-636 2010 44 Discret. Comput. Geom. 3 https://doi.org/10.1007/s00454-010-9252-5 db/journals/dcg/dcg44.html#LinialMR10

Nati Linial Doron Puder Word maps and spectra of random graph lifts. 100-135 2010 37 Random Struct. Algorithms 1 https://doi.org/10.1002/rsa.20304 db/journals/rsa/rsa37.html#LinialP10

Yonatan Bilu Nathan Linial Are Stable Instances Easy? 332-341 2010 ICS http://conference.iiis.tsinghua.edu.cn/ICS2010/content/papers/26.html conf/innovations/2010 db/conf/innovations/innovations2010.html#BiluL10

Amit Daniely Nathan Linial Tight products and Expansion http://arxiv.org/abs/1001.3661 2010 CoRR abs/1001.3661 db/journals/corr/corr1001.html#abs-1001-3661

Nathan Linial Adi Shraibman Learning Complexity vs Communication Complexity. 227-245 2009 18 Comb. Probab. Comput. 1-2 https://doi.org/10.1017/S0963548308009656 db/journals/cpc/cpc18.html#LinialS09

Nati Linial Adi Shraibman Lower bounds in communication complexity based on factorization norms. 368-394 2009 34 Random Struct. Algorithms 3 https://doi.org/10.1002/rsa.20232 db/journals/rsa/rsa34.html#LinialS09

Yonatan Bilu Nathan Linial Are stable instances easy? http://arxiv.org/abs/0906.3162 2009 CoRR abs/0906.3162 db/journals/corr/corr0906.html#abs-0906-3162

Yonatan Bilu Nathan Linial Are stable instances easy? TR09-057 2009 TR09 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2009/057 db/journals/eccc/eccc16.html#BiluL09

Nathan Linial Jirí Matousek 0001 Or Sheffet Gábor Tardos Graph Colouring with No Large Monochromatic Components. 577-589 2008 17 Comb. Probab. Comput. 4 https://doi.org/10.1017/S0963548308009140 db/journals/cpc/cpc17.html#LinialMST08

Nati Linial Adi Shraibman Learning Complexity vs. Communication Complexity. 53-63 2008 CCC https://doi.org/10.1109/CCC.2008.28 https://doi.ieeecomputersociety.org/10.1109/CCC.2008.28 conf/coco/2008 db/conf/coco/coco2008.html#LinialS08

Nati Linial Shahar Mendelson Gideon Schechtman Adi Shraibman Complexity measures of sign matrices. 439-463 2007 27 Comb. 4 https://doi.org/10.1007/s00493-007-2160-5 db/journals/combinatorica/combinatorica27.html#LinialMSS07

Nathan Linial Jirí Matousek 0001 Or Sheffet Gábor Tardos Graph coloring with no large monochromatic components. 115-122 2007 29 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2007.07.020 db/journals/endm/endm29.html#LinialMST07

Elon Portugaly Nathan Linial Michal Linial EVEREST: a collection of evolutionary conserved protein domains. 241-246 2007 35 Nucleic Acids Res. Database-Issue https://doi.org/10.1093/nar/gkl850 https://www.wikidata.org/entity/Q30827867 db/journals/nar/nar35.html#PortugalyLL07

Yael Dekel James R. Lee Nathan Linial Eigenvectors of Random Graphs: Nodal Domains. 436-448 2007 conf/approx/2007 APPROX-RANDOM https://doi.org/10.1007/978-3-540-74208-1_32 db/conf/approx/approx2007.html#DekelLL07 Nati Linial Adi Shraibman Lower bounds in communication complexity based on factorization norms. 699-708 2007 conf/stoc/2007 STOC https://doi.org/10.1145/1250790.1250892 db/conf/stoc/stoc2007.html#LinialS07

Elon Portugaly Amir Harel Nathan Linial Michal Linial EVEREST: automatic identification and classification of protein domains in all protein sequences. 277 2006 7 BMC Bioinform. https://doi.org/10.1186/1471-2105-7-277 https://www.wikidata.org/entity/Q30817064 db/journals/bmcbi/bmcbi7.html#PortugalyHLL06

Nathan Linial Roy Meshulam Homological Connectivity Of Random 2-Complexes. 475-487 2006 26 Comb. 4 https://doi.org/10.1007/s00493-006-0027-9 https://www.wikidata.org/entity/Q56221732 db/journals/combinatorica/combinatorica26.html#LinialM06

Yonatan Bilu Nathan Linial Lifts, Discrepancy and Nearly Optimal Spectral Gap*. 495-519 2006 26 Comb. 5 https://doi.org/10.1007/s00493-006-0029-7 https://www.wikidata.org/entity/Q105583356 db/journals/combinatorica/combinatorica26.html#BiluL06

Nathan Linial Michael E. Saks David Statter The Non-Crossing Graph. 2006 13 Electron. J. Comb. 1 https://doi.org/10.37236/1140 db/journals/combinatorics/combinatorics13.html#LinialSS06

Alon Amit Nathan Linial Random Lifts of Graphs: Edge Expansion. 317-332 2006 15 Comb. Probab. Comput. 3 https://doi.org/10.1017/S0963548305007273 db/journals/cpc/cpc15.html#AmitL06

Nathan Linial Isabella Novik How Neighborly Can a Centrally Symmetric Polytope Be? 273-281 2006 36 Discret. Comput. Geom. 2 https://doi.org/10.1007/s00454-006-1235-1 db/journals/dcg/dcg36.html#LinialN06

Doron Lipson Yonatan Aumann Amir Ben-Dor Nathan Linial Zohar Yakhini Efficient Calculation of Interval Scores for DNA Copy Number Data Analysis. 215-228 2006 13 J. Comput. Biol. 2 https://doi.org/10.1089/cmb.2006.13.215 https://www.wikidata.org/entity/Q31036186 db/journals/jcb/jcb13.html#LipsonABLY06

Nathan Linial Eran London On the expansion rate of Margulis expanders. 436-442 2006 96 J. Comb. Theory B 3 https://doi.org/10.1016/j.jctb.2005.09.001 db/journals/jct/jctb96.html#LinialL06

Yotam Drier Nathan Linial Minors in lifts of graphs. 208-225 2006 29 Random Struct. Algorithms 2 https://doi.org/10.1002/rsa.20100 https://www.wikidata.org/entity/Q58051345 db/journals/rsa/rsa29.html#DrierL06

Nathan Linial Eyal Rozenman Random Lifts Of Graphs: Perfekt Matchings. 407-424 2005 25 Comb. 4 https://doi.org/10.1007/s00493-005-0024-8 db/journals/combinatorica/combinatorica25.html#LinialR05

Yair Bartal Nathan Linial Manor Mendel Assaf Naor Some Low Distortion Metric Ramsey Problems. 27-41 2005 33 Discret. Comput. Geom. 1 https://doi.org/10.1007/s00454-004-1100-z db/journals/dcg/dcg33.html#BartalLMN05

Yonatan Bilu Nathan Linial Monotone maps, sphericity and bounded second eigenvalue. 283-299 2005 95 J. Comb. Theory B 2 https://doi.org/10.1016/j.jctb.2005.04.005 db/journals/jct/jctb95.html#BiluL05

Shlomo Hoory Nathan Linial A counterexample to a conjecture of Björner and Lovász on the <i>chi</i>-coloring complex. 346-349 2005 95 J. Comb. Theory B 2 https://doi.org/10.1016/j.jctb.2005.06.008 db/journals/jct/jctb95.html#HooryL05

Nathan Linial Jaikumar Radhakrishnan Essential covers of the cube by hyperplanes. 331-338 2005 109 J. Comb. Theory A 2 https://doi.org/10.1016/j.jcta.2004.07.012 db/journals/jct/jcta109.html#LinialR05

Noam Kaplan Ori Sasson Uri Inbar Moriah Friedlich Menachem Fromer Hillel Fleischer Elon Portugaly Nathan Linial Michal Linial ProtoNet 4.0: A hierarchical classification of one million protein sequences. 216-218 2005 33 Nucleic Acids Res. Database-Issue https://doi.org/10.1093/nar/gki007 https://www.wikidata.org/entity/Q24792932 db/journals/nar/nar33.html#KaplanSIFFFPLL05

Doron Lipson Yonatan Aumann Amir Ben-Dor Nathan Linial Zohar Yakhini Efficient Calculation of Interval Scores for DNA Copy Number Data Analysis. 83-100 2005 conf/recomb/2005 RECOMB https://doi.org/10.1007/11415770_6 db/conf/recomb/recomb2005.html#LipsonABLY05

Yonatan Bilu Nathan Linial Ramanujan Signing of Regular Graphs. 911-912 2004 13 Comb. Probab. Comput. 6 https://doi.org/10.1017/S0963548304006509 db/journals/cpc/cpc13.html#BiluL04

Otfried Cheong Sariel Har-Peled Nathan Linial Jirí Matousek 0001 The One-Round Voronoi Game. 125-138 2004 31 Discret. Comput. Geom. 1 https://doi.org/10.1007/s00454-003-2951-4 db/journals/dcg/dcg31.html#CheongHLM04

Robert Krauthgamer Nathan Linial Avner Magen Metric Embeddings--Beyond One-Dimensional Distortion. 339-356 2004 31 Discret. Comput. Geom. 3 https://doi.org/10.1007/s00454-003-2872-2 db/journals/dcg/dcg31.html#KrauthgamerLM04

Yair Bartal Nathan Linial Manor Mendel Assaf Naor Low dimensional embeddings of ultrametrics. 87-92 2004 25 Eur. J. Comb. 1 https://doi.org/10.1016/j.ejc.2003.08.003 db/journals/ejc/ejc25.html#BartalLMN04

Shlomo Hoory Nathan Linial Colorings of the d-regular infinite tree. 161-167 2004 91 J. Comb. Theory B 2 https://doi.org/10.1016/j.jctb.2003.11.004 db/journals/jct/jctb91.html#HooryL04

Yonatan Bilu Nathan Linial Constructing Expander Graphs by 2-Lifts and Discrepancy vs. Spectral Gap. 404-412 2004 conf/focs/2004 FOCS https://doi.org/10.1109/FOCS.2004.19 https://doi.ieeecomputersociety.org/10.1109/FOCS.2004.19 db/conf/focs/focs2004.html#BiluL04

Nathan Linial Michael E. Saks The Euclidean Distortion of Complete Binary Trees. 19-21 2003 29 Discret. Comput. Geom. 1 https://doi.org/10.1007/s00454-002-2827-z db/journals/dcg/dcg29.html#LinialS03

Ori Sasson Avishay Vaaknin Hillel Fleischer Elon Portugaly Yonatan Bilu Nathan Linial Michal Linial ProtoNet: hierarchical classification of the protein space. 348-352 2003 31 Nucleic Acids Res. 1 db/journals/nar/nar31.html#SassonVFPBLL03 https://doi.org/10.1093/nar/gkg096 https://www.wikidata.org/entity/Q39790583

Yair Bartal Nathan Linial Manor Mendel Assaf Naor On metric ramsey-type phenomena. 463-472 2003 conf/stoc/2003 STOC https://doi.org/10.1145/780542.780610 db/conf/stoc/stoc2003.html#BartalLMN03

Alon Amit Nathan Linial Random Graph Coverings I: General Theory and Graph Connectivity. 1-18 2002 22 Comb. 1 https://doi.org/10.1007/s004930200000 db/journals/combinatorica/combinatorica22.html#AmitL02

Nathan Linial Alex Samorodnitsky Linear Codes and Character Sums. 497-522 2002 22 Comb. 4 https://doi.org/10.1007/s00493-002-0003-y db/journals/combinatorica/combinatorica22.html#LinialS02

Noga Alon Shlomo Hoory Nathan Linial The Moore Bound for Irregular Graphs. 53-57 2002 18 Graphs Comb. 1 https://doi.org/10.1007/s003730200002 db/journals/gc/gc18.html#AlonHL02

Nathan Linial Eyal Rozenman An Extremal Problem on Degree Sequences of Graphs. 573-582 2002 18 Graphs Comb. 3 https://doi.org/10.1007/s003730200041 db/journals/gc/gc18.html#LinialR02

Alon Amit Shlomo Hoory Nathan Linial A Continuous Analogue of the Girth Problem. 340-363 2002 84 J. Comb. Theory B 2 https://doi.org/10.1006/jctb.2001.2088 db/journals/jct/jctb84.html#AmitHL02

Alon Amit Nathan Linial Jirí Matousek 0001 Random lifts of graphs: Independence and chromatic number. 1-22 2002 20 Random Struct. Algorithms 1 db/journals/rsa/rsa20.html#AmitLM02 https://doi.org/10.1002/rsa.10003

Nathan Linial Finite metric spaces: combinatorics, geometry and algorithms. 63 2002 conf/compgeom/2002 SCG https://doi.org/10.1145/513400.513441 db/conf/compgeom/compgeom2002.html#Linial02 Otfried Cheong Sariel Har-Peled Nathan Linial Jirí Matousek 0001 The one-round Voronoi game. 97-101 2002 conf/compgeom/2002 SCG https://doi.org/10.1145/513400.513413 db/conf/compgeom/compgeom2002.html#CheongHLM02 Ori Sasson Nathan Linial Michal Linial The metric space of proteins-comparative study of clustering algorithms. 14-21 2002 conf/ismb/2002 ISMB db/conf/ismb/ismb2002.html#SassonLL02 https://doi.org/10.1093/bioinformatics/18.suppl_1.s14 Nathan Linial Avner Magen Assaf Naor Girth and euclidean distortion. 705-711 2002 conf/stoc/2002 STOC https://doi.org/10.1145/509907.510009 db/conf/stoc/stoc2002.html#LinialMN02

Danny Dolev Yuval Harari Nathan Linial Noam Nisan Michal Parnas Neighborhood Preserving Hashing and Approximate Queries. 73-85 2001 15 SIAM J. Discret. Math. 1 https://doi.org/10.1137/S089548019731809X db/journals/siamdm/siamdm15.html#DolevHLNP01

Alon Amit Nathan Linial Jirí Matousek 0001 Eyal Rozenman Random lifts of graphs. 883-894 2001 conf/soda/2001 SODA http://dl.acm.org/citation.cfm?id=365411.365801 db/conf/soda/soda2001.html#AmitLMR01

Sanjeev Khanna Nathan Linial Shmuel Safra On the Hardness of Approximating the Chromatic Number. 393-415 2000 20 Comb. 3 https://doi.org/10.1007/s004930070013 db/journals/combinatorica/combinatorica20.html#KhannaLS00

Nathan Linial Alex Samorodnitsky Avi Wigderson A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents. 545-568 2000 20 Comb. 4 https://doi.org/10.1007/s004930070007 db/journals/combinatorica/combinatorica20.html#LinialSW00

Nathan Linial Avner Magen Least-Distortion Euclidean Embeddings of Graphs: Products of Cycles and Expanders. 157-171 2000 79 J. Comb. Theory B 2 https://doi.org/10.1006/jctb.2000.1953 db/journals/jct/jctb79.html#LinialM00

Golan Yona Nathan Linial Michal Linial ProtoMap: automatic classification of protein sequences and hierarchy of protein families. 49-55 2000 28 Nucleic Acids Res. 1 db/journals/nar/nar28.html#YonaLL00 https://doi.org/10.1093/nar/28.1.49 https://www.wikidata.org/entity/Q39541528

Ran El-Yaniv Ron Kaniel Nathan Linial Competitive Optimal On-Line Leasing. 116-140 1999 25 Algorithmica 1 https://doi.org/10.1007/PL00009279 db/journals/algorithmica/algorithmica25.html#El-YanivKL99

Eyal Kushilevitz Nathan Linial Rafail Ostrovsky The Linear-Array Conjecture in Communication Complexity Is False. 241-254 1999 19 Comb. 2 https://doi.org/10.1007/s004930050054 https://www.wikidata.org/entity/Q122887971 db/journals/combinatorica/combinatorica19.html#KushilevitzL99

Amir Ben-Dor Anna R. Karlin Nathan Linial Yuri Rabinovich A Note on the Influence of an epsilon-Biased Random Source. 174-176 1999 58 J. Comput. Syst. Sci. 1 db/journals/jcss/jcss58.html#Ben-DorKLR99 https://doi.org/10.1006/jcss.1997.1551

Nathan Linial Ori Sasson Non-Expansive Hashing. 121-132 1998 18 Comb. 1 https://doi.org/10.1007/PL00009805 db/journals/combinatorica/combinatorica18.html#LinialS98

Oded Goldreich 0001 Shafi Goldwasser Nathan Linial Fault-Tolerant Computation in the Full Information Model. 506-544 1998 27 SIAM J. Comput. 2 db/journals/siamcomp/siamcomp27.html#GoldreichGL98 https://doi.org/10.1137/S0097539793246689

Golan Yona Nathan Linial Naftali Tishby Michal Linial A Map of the Protein Space: An Automatic Hierarchical Classification of all Protein Sequences. 212-221 1998 conf/ismb/1998 ISMB db/conf/ismb/ismb1998.html#YonaLTL98 http://www.aaai.org/Library/ISMB/1998/ismb98-025.php Nathan Linial Avner Magen Michael E. Saks Trees and Euclidean Metrics. 169-175 1998 conf/stoc/1998 STOC https://doi.org/10.1145/276698.276726 db/conf/stoc/stoc1998.html#LinialMS98 Nathan Linial Alex Samorodnitsky Avi Wigderson A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents. 644-652 1998 conf/stoc/1998 STOC https://doi.org/10.1145/276698.276880 db/conf/stoc/stoc1998.html#LinialSW98

Nathan Linial Michael Luby Michael E. Saks David Zuckerman Efficient Construction of a Small Hitting Set for Combinatorial Rectangles in High Dimension. 215-234 1997 17 Comb. 2 db/journals/combinatorica/combinatorica17.html#LinialLSZ97 https://doi.org/10.1007/BF01200907

Yossi Azar Andrei Z. Broder Anna R. Karlin Nathan Linial Steven J. Phillips Biased Random Walks. 1-18 1996 16 Comb. 1 db/journals/combinatorica/combinatorica16.html#AzarBKLP96 https://doi.org/10.1007/BF01300124

Jeff Kahn 0001 Nathan Linial Alex Samorodnitsky Inclusion-Exclusion: Exact and Approximate. 465-477 1996 16 Comb. 4 db/journals/combinatorica/combinatorica16.html#KahnLS96 https://doi.org/10.1007/BF01271266

Shlomo Hoory Nathan Linial Central Points for Sets in Rn (or: the Chocolate Ice-Cream Problem). 467-479 1996 15 Discret. Comput. Geom. 4 https://doi.org/10.1007/BF02711520 db/journals/dcg/dcg15.html#HooryL96

Eyal Kushilevitz Nathan Linial Yuri Rabinovich Michael E. Saks Witness Sets for Families of Binary Vectors. 376-380 1996 73 J. Comb. Theory A 2 https://doi.org/10.1006/jcta.1996.0031 db/journals/jct/jcta73.html#KushilevitzLRS96

Eyal Kushilevitz Nathan Linial Rafail Ostrovsky The Linear-Array Conjecture in Communication Complexity is False. 1-10 1996 conf/stoc/1996 STOC https://doi.org/10.1145/237814.237817 db/conf/stoc/stoc1996.html#KushilevitzLO96 Nathan Linial Ori Sasson Non-Expansive Hashing. 509-518 1996 conf/stoc/1996 STOC https://doi.org/10.1145/237814.237999 db/conf/stoc/stoc1996.html#LinialS96

Nathan Linial Eran London Yuri Rabinovich The Geometry of Graphs and Some of its Algorithmic Applications. 215-245 1995 15 Comb. 2 db/journals/combinatorica/combinatorica15.html#LinialLR95 https://doi.org/10.1007/BF01200757 https://www.wikidata.org/entity/Q105824835

Jason Cooper Nathan Linial Fast Perfect-Information Leader-Election Protocols with Linear Immunity. 319-332 1995 15 Comb. 3 db/journals/combinatorica/combinatorica15.html#CooperL95 https://doi.org/10.1007/BF01299739

Gil Kalai Nathan Linial On the distance distribution of codes. 1467-1472 1995 41 IEEE Trans. Inf. Theory 5 db/journals/tit/tit41.html#KalaiL95 https://doi.org/10.1109/18.412711

Craig Gotsman Nathan Linial Spectral Properties of Threshold Functions. 35-50 1994 14 Comb. 1 db/journals/combinatorica/combinatorica14.html#GotsmanL94 https://doi.org/10.1007/BF01305949

Nathan Linial Yuri Rabinovich Local and Global Clique Numbers. 5-15 1994 61 J. Comb. Theory B 1 https://doi.org/10.1006/jctb.1994.1026 db/journals/jct/jctb61.html#LinialR94

The geometry of graphs and some of its algorithmic applications Nathan Linial Eran London Yuri Rabinovich 577-591 conf/focs/FOCS35 1994 FOCS db/conf/focs/focs94.html#LinialLR94 https://doi.org/10.1109/SFCS.1994.365733 https://doi.ieeecomputersociety.org/10.1109/SFCS.1994.365733 Danny Dolev Yuval Harari Nathan Linial Noam Nisan Michal Parnas Neighborhood Preserving Hashing and Approximate Queries. 251-259 1994 conf/soda/1994 SODA db/conf/soda/soda94.html#DolevHLNP94 http://dl.acm.org/citation.cfm?id=314464.314501

Miklós Ajtai Nathan Linial The influence of large coalitions. 129-145 1993 13 Comb. 2 db/journals/combinatorica/combinatorica13.html#AjtaiL93 https://doi.org/10.1007/BF01303199

Nathan Linial Michael E. Saks Low diameter graph decompositions. 441-454 1993 13 Comb. 4 db/journals/combinatorica/combinatorica13.html#LinialS93 https://doi.org/10.1007/BF01303516

Nathan Linial Local-Global Phenomena in Graphs. 491-503 1993 2 Comb. Probab. Comput. db/journals/cpc/cpc2.html#Linial93 https://doi.org/10.1017/S0963548300000857

Joel Friedman Nathan Linial On Convex Body Chasing. 293-321 1993 9 Discret. Comput. Geom. db/journals/dcg/dcg9.html#FriedmanL93 https://doi.org/10.1007/BF02189324

Mauricio Karchmer Nathan Linial Ilan Newman Michael E. Saks Avi Wigderson Combinatorial characterization of read-once formulae. 275-282 1993 114 Discret. Math. 1-3 https://doi.org/10.1016/0012-365X(93)90372-Z https://www.wikidata.org/entity/Q127725709 db/journals/dm/dm114.html#KarchmerLNSW93

Nathan Linial Yishay Mansour Noam Nisan Constant Depth Circuits, Fourier Transform, and Learnability. 607-620 1993 40 J. ACM 3 db/journals/jacm/jacm40.html#LinialMN93 https://doi.org/10.1145/174130.174138 https://www.wikidata.org/entity/Q105824818

Yitzhak Birk Nathan Linial Roy Meshulam On the uniform-traffic capacity of single-hop interconnections employing shared directional multichannels. 186-191 1993 39 IEEE Trans. Inf. Theory 1 db/journals/tit/tit39.html#BirkLM93 https://doi.org/10.1109/18.179355

Nathan Linial David Peleg Yuri Rabinovich Michael E. Saks Sphere Packing and Local Majorities in Graphs. 141-149 1993 conf/istcs/1993 ISTCS db/conf/istcs/istcs1993.html#LinialPRS93 https://doi.org/10.1109/ISTCS.1993.253475 https://doi.ieeecomputersociety.org/10.1109/ISTCS.1993.253475 Sanjeev Khanna Nathan Linial Shmuel Safra On the Hardness of Approximating the Chromatic Number. 250-260 1993 conf/istcs/1993 ISTCS db/conf/istcs/istcs1993.html#KhannaLS93 https://doi.org/10.1109/ISTCS.1993.253464 https://doi.ieeecomputersociety.org/10.1109/ISTCS.1993.253464 Nathan Linial Michael Luby Michael E. Saks David Zuckerman Efficient construction of a small hitting set for combinatorial rectangles in high dimension. 258-267 1993 conf/stoc/STOC25 STOC https://doi.org/10.1145/167088.167166 db/conf/stoc/stoc1993.html#LinialLSZ93 Jason Cooper Nathan Linial Fast perfection-information leader-election protocol with linear immunity. 662-671 1993 conf/stoc/STOC25 STOC https://doi.org/10.1145/167088.167258 db/conf/stoc/stoc1993.html#CooperL93

Allan Borodin Nathan Linial Michael E. Saks An Optimal On-Line Algorithm for Metrical Task System. 745-763 1992 39 J. ACM 4 db/journals/jacm/jacm39.html#BorodinLS92 https://doi.org/10.1145/146585.146588 https://www.wikidata.org/entity/Q29543421

Noga Alon Amotz Bar-Noy Nathan Linial David Peleg Single Round Simulation on Radio Networks. 188-210 1992 13 J. Algorithms 2 db/journals/jal/jal13.html#AlonBLP92 https://doi.org/10.1016/0196-6774(92)90015-5 https://www.wikidata.org/entity/Q132858658

François Jaeger Nathan Linial Charles Payan Michael Tarsi Group connectivity of graphs - A nonhomogeneous analogue of nowhere-zero flow properties. 165-182 1992 56 J. Comb. Theory B 2 https://doi.org/10.1016/0095-8956(92)90016-Q db/journals/jct/jctb56.html#JaegerLPT92

Craig Gotsman Nathan Linial The Equivalence of Two Problems on the Cube. 142-146 1992 61 J. Comb. Theory A 1 db/journals/jct/jcta61.html#GotsmanL92

Nathan Linial Locality in Distributed Graph Algorithms. 193-201 1992 21 SIAM J. Comput. 1 db/journals/siamcomp/siamcomp21.html#Linial92 https://doi.org/10.1137/0221015 https://www.wikidata.org/entity/Q55896380

Biased Random Walks Yossi Azar Andrei Z. Broder Anna R. Karlin Nathan Linial Steven J. Phillips 1-9 conf/stoc/STOC24 1992 STOC db/conf/stoc/stoc92.html#AzarBKLP92 https://doi.org/10.1145/129712.129713

Alok Aggarwal Maria M. Klawe David Lichtenstein Nathan Linial Avi Wigderson A Lower Bound on the Area of Permutation Layouts. 241-255 1991 6 Algorithmica 2 db/journals/algorithmica/algorithmica6.html#AggarwalKLLW91 https://doi.org/10.1007/BF01759044

Jeff Kahn 0001 Nathan Linial Balancing extensions via Brunn-Minkowski. 363-368 1991 11 Comb. 4 db/journals/combinatorica/combinatorica11.html#KahnL91 https://doi.org/10.1007/BF01275670

Results on Learnability and the Vapnik-Chervonenkis Dimension Nathan Linial Yishay Mansour Ronald L. Rivest 33-49 Inf. Comput. January 1991 90 1 db/journals/iandc/iandc90.html#LinialMR91 https://doi.org/10.1016/0890-5401(91)90058-A

Noga Alon Amotz Bar-Noy Nathan Linial David Peleg A Lower Bound for Radio Broadcast. 290-298 1991 43 J. Comput. Syst. Sci. 2 db/journals/jcss/jcss43.html#AlonBLP91 https://doi.org/10.1016/0022-0000(91)90015-W

Noga Alon Nathan Linial Roy Meshulam Additive bases of vector spaces over prime fields. 203-210 1991 57 J. Comb. Theory A 2 https://doi.org/10.1016/0097-3165(91)90045-I db/journals/jct/jcta57.html#AlonLM91

Fault-tolerant Computation in the Full Information Model (Extended Abstract) Oded Goldreich 0001 Shafi Goldwasser Nathan Linial 447-457 conf/focs/FOCS32 1991 FOCS db/conf/focs/focs91.html#GoldreichGL91 https://doi.org/10.1109/SFCS.1991.185405 https://doi.ieeecomputersociety.org/10.1109/SFCS.1991.185405 Nathan Linial Michael E. Saks Decomposing Graphs into Regions of Small Diameter. 320-330 1991 conf/soda/1991 SODA db/conf/soda/soda91.html#LinialS91 http://dl.acm.org/citation.cfm?id=127787.127848

Nathan Linial Noam Nisan Approximate inclusion-exclusion. 349-365 1990 10 Comb. 4 db/journals/combinatorica/combinatorica10.html#LinialN90 https://doi.org/10.1007/BF02128670

Baruch Awerbuch Amotz Bar-Noy Nathan Linial David Peleg Improved Routing Strategies with Succinct Tables. 307-341 1990 11 J. Algorithms 3 db/journals/jal/jal11.html#AwerbuchBLP90 https://doi.org/10.1016/0196-6774(90)90017-9

Approximate Inclusion-Exclusion Nathan Linial Noam Nisan 260-270 conf/stoc/STOC22 1990 STOC db/conf/stoc/stoc90.html#LinialN90 https://doi.org/10.1145/100216.100250

Michael Ben-Or Nathan Linial Collective Coin Flipping. 91-115 1989 5 Adv. Comput. Res. db/journals/acr/acr5.html#Ben-OrL89

David Lichtenstein Nathan Linial Michael E. Saks Some extremal problems arising form discrete control processes. 269-287 1989 9 Comb. 3 db/journals/combinatorica/combinatorica9.html#LichtensteinLS89 https://doi.org/10.1007/BF02125896

Nathan Linial Michael Tarsi Interpolation Between Bases and the Shuffle Exchange Network. 29-39 1989 10 Eur. J. Comb. 1 https://doi.org/10.1016/S0195-6698(89)80030-7 db/journals/ejc/ejc10.html#LinialT89

Noga Alon Nathan Linial Cycles of length 0 modulo <i>k</i> in directed graphs. 114-119 1989 47 J. Comb. Theory B 1 https://doi.org/10.1016/0095-8956(89)90071-3 db/journals/jct/jctb47.html#AlonL89

Amotz Bar-Noy Allan Borodin Mauricio Karchmer Nathan Linial Michael Werman Bounds on Universal Sequences. 268-277 1989 18 SIAM J. Comput. 2 db/journals/siamcomp/siamcomp18.html#Bar-NoyBKLW89 https://doi.org/10.1137/0218018

Graph Products and Chromatic Numbers Nathan Linial Umesh V. Vazirani 124-128 conf/focs/FOCS30 1989 FOCS db/conf/focs/focs89.html#LinialV89 https://doi.org/10.1109/SFCS.1989.63466 https://doi.ieeecomputersociety.org/10.1109/SFCS.1989.63466 Constant Depth Circuits, Fourier Transform, and Learnability Nathan Linial Yishay Mansour Noam Nisan 574-579 conf/focs/FOCS30 1989 FOCS db/conf/focs/focs89.html#LinialMN89 https://doi.org/10.1109/SFCS.1989.63537 https://doi.ieeecomputersociety.org/10.1109/SFCS.1989.63537 On the Complexity of Radio Communication (Extended Abstract) Noga Alon Amotz Bar-Noy Nathan Linial David Peleg 274-285 conf/stoc/STOC21 1989 STOC db/conf/stoc/stoc89.html#AlonBLP89 https://doi.org/10.1145/73007.73033 Compact Distributed Data Structures for Adaptive Routing (Extended Abstract) Baruch Awerbuch Amotz Bar-Noy Nathan Linial David Peleg 479-489 conf/stoc/STOC21 1989 STOC db/conf/stoc/stoc89.html#AwerbuchBLP89 https://doi.org/10.1145/73007.73053

Ron Aharoni Paul Erdös Nathan Linial Optima of dual integer linear programs. 13-20 1988 8 Comb. 1 db/journals/combinatorica/combinatorica8.html#AharoniEL88 https://doi.org/10.1007/BF02122549 https://www.wikidata.org/entity/Q105659276

Nathan Linial László Lovász 0001 Avi Wigderson Rubber bands, convex embeddings and graph connectivity. 91-102 1988 8 Comb. 1 db/journals/combinatorica/combinatorica8.html#LinialLW88 https://doi.org/10.1007/BF02122557 https://www.wikidata.org/entity/Q56555114

Nathan Linial Roy Meshulam Michael Tarsi Matroidal bijections between graphs. 31-44 1988 45 J. Comb. Theory B 1 https://doi.org/10.1016/0095-8956(88)90053-6 db/journals/jct/jctb45.html#LinialMT88

Ron Holzman Ehud Lehrer Nathan Linial Some Bounds for the Banzhaf Index and Other Semivalues. 358-363 1988 13 Math. Oper. Res. 2 https://doi.org/10.1287/moor.13.2.358 db/journals/mor/mor13.html#HolzmanLL88

Nathan Linial Yishay Mansour Ronald L. Rivest Results on Learnability and the Vapnick-Chervonenkis Dimension. 56-68 1988 conf/colt/1988 COLT http://dl.acm.org/citation.cfm?id=93043 db/conf/colt/colt1988.html#LinialMR88 The Influence of Variables on Boolean Functions (Extended Abstract) Jeff Kahn 0001 Gil Kalai Nathan Linial 68-80 conf/focs/FOCS29 1988 FOCS db/conf/focs/focs88.html#KahnKL88 https://doi.org/10.1109/SFCS.1988.21923 https://doi.ieeecomputersociety.org/10.1109/SFCS.1988.21923 Results on learnability and the Vapnik-Chervonenkis dimension (Extended Abstract) Nathan Linial Yishay Mansour Ronald L. Rivest 120-129 conf/focs/FOCS29 1988 FOCS db/conf/focs/focs88.html#LinialMR88 https://doi.org/10.1109/SFCS.1988.21930 https://doi.ieeecomputersociety.org/10.1109/SFCS.1988.21930

Paul Erdös Nathan Linial Shlomo Moran Extremal problems on permutations under cyclic equivalence. 1-11 1987 64 Discret. Math. 1 https://doi.org/10.1016/0012-365X(87)90235-4 https://www.wikidata.org/entity/Q105686168 db/journals/dm/dm64.html#ErdosLM87

Distributive Graph Algorithms-Global Solutions from Local Data Nathan Linial 331-335 conf/focs/FOCS28 1987 FOCS db/conf/focs/focs87.html#Linial87 https://doi.org/10.1109/SFCS.1987.20 https://doi.ieeecomputersociety.org/10.1109/SFCS.1987.20 Imperfect Random Sources and Discrete Controlled Processes David Lichtenstein Nathan Linial Michael E. Saks 169-177 conf/stoc/STOC19 1987 STOC db/conf/stoc/stoc87.html#LichtensteinLS87 https://doi.org/10.1145/28395.28414 An Optimal Online Algorithm for Metrical Task Systems Allan Borodin Nathan Linial Michael E. Saks 373-382 conf/stoc/STOC19 1987 STOC db/conf/stoc/stoc87.html#BorodinLS87 https://doi.org/10.1145/28395.28435

Nathan Linial Legal coloring of graphs. 49-54 1986 6 Comb. 1 db/journals/combinatorica/combinatorica6.html#Linial86 https://doi.org/10.1007/BF02579408

Nathan Linial Graph coloring and monotone functions on posets. 97-98 1986 58 Discret. Math. 1 https://doi.org/10.1016/0012-365X(86)90191-3 db/journals/dm/dm58.html#Linial86

Ron Aharoni Nathan Linial Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas. 196-204 1986 43 J. Comb. Theory A 2 https://doi.org/10.1016/0097-3165(86)90060-9 db/journals/jct/jcta43.html#AharoniL86

A Physical Interpretation of Graph Connectivity, and Its Algorithmic Applications Nathan Linial László Lovász 0001 Avi Wigderson 39-48 conf/focs/FOCS27 1986 FOCS db/conf/focs/focs86.html#LinialLW86 https://doi.org/10.1109/SFCS.1986.3

Nathan Linial Michael E. Saks Searching Ordered Structures. 86-103 1985 6 J. Algorithms 1 db/journals/jal/jal6.html#LinialS85 https://doi.org/10.1016/0196-6774(85)90020-3

Nathan Linial Michael E. Saks Every Poset Has a Central Element. 195-210 1985 40 J. Comb. Theory A 2 db/journals/jct/jcta40.html#Linial85 https://doi.org/10.1016/0097-3165(85)90087-1

Nathan Linial Michael Tarsi Deciding Hypergraph 2-Colourability by H-Resolution. 343-347 1985 38 Theor. Comput. Sci. db/journals/tcs/tcs38.html#LinialT85 https://doi.org/10.1016/0304-3975(85)90227-0

Multi-Layer Grid Embeddings Alok Aggarwal Maria M. Klawe David Lichtenstein Nathan Linial Avi Wigderson 186-196 conf/focs/FOCS26 1985 FOCS db/conf/focs/focs85.html#AggarwalKLLW85 https://doi.org/10.1109/SFCS.1985.37 https://doi.ieeecomputersociety.org/10.1109/SFCS.1985.37 Collective Coin Flipping, Robust Voting Schemes and Minima of Banzhaf Values Michael Ben-Or Nathan Linial 408-416 conf/focs/FOCS26 1985 FOCS db/conf/focs/focs85.html#Ben-OrL85 https://doi.org/10.1109/SFCS.1985.15 https://doi.ieeecomputersociety.org/10.1109/SFCS.1985.15 https://www.wikidata.org/entity/Q62111465 Dual Integer Linear Programs and the Relationship between their Optima Ron Aharoni Paul Erdös Nathan Linial 476-483 conf/stoc/STOC17 1985 STOC db/conf/stoc/stoc85.html#AharoniEL85 https://doi.org/10.1145/22145.22198

Nathan Linial Graph decompositions without isolates. 16-25 1984 36 J. Comb. Theory B 1 https://doi.org/10.1016/0095-8956(84)90010-8 db/journals/jct/jctb36.html#Linial84

Nathan Linial The Information-Theoretic Bound is Good for Merging. 795-801 1984 13 SIAM J. Comput. 4 db/journals/siamcomp/siamcomp13.html#Linial84 https://doi.org/10.1137/0213049

Nathan Linial Michael E. Saks Vera T. Sós Largest digraphs contained in all n-tournaments. 101-104 1983 3 Comb. 1 db/journals/combinatorica/combinatorica3.html#LinialSS83 https://doi.org/10.1007/BF02579345

Legal Coloring of Graphs Nathan Linial 470-472 conf/focs/FOCS24 1983 FOCS db/conf/focs/focs83.html#Linial83 https://doi.org/10.1109/SFCS.1983.28 https://doi.ieeecomputersociety.org/10.1109/SFCS.1983.28 Information Bounds Are Good for Search Problems on Ordered Data Structures Nathan Linial Michael E. Saks 473-475 conf/focs/FOCS24 1983 FOCS db/conf/focs/focs83.html#LinialS83 https://doi.org/10.1109/SFCS.1983.27 https://doi.ieeecomputersociety.org/10.1109/SFCS.1983.27

Nathan Linial A New Derivation of the Counting Formula for Young Tableaux. 340-342 1982 33 J. Comb. Theory A 3 db/journals/jct/jcta33.html#Linial82 https://doi.org/10.1016/0097-3165(82)90044-9

Nathan Linial Michael Tarsi The Counterfeit Coin Problem Revisited. 409-415 1982 11 SIAM J. Comput. 3 db/journals/siamcomp/siamcomp11.html#LinialT82 https://doi.org/10.1137/0211032

Nathan Linial On Petersen's graph theorem. 53-56 1981 33 Discret. Math. 1 https://doi.org/10.1016/0012-365X(81)90257-0 db/journals/dm/dm33.html#Linial81

Nathan Linial Extending the Greene-Kleitman Theorem to Directed Graphs. 331-334 1981 30 J. Comb. Theory A 3 db/journals/jct/jcta30.html#Linial81 https://doi.org/10.1016/0097-3165(81)90029-7

Nathan Linial בעיות פירוק וכיסוי בתורת הגרפים (Decomposition and covering problems in graph theory.). Hebrew University of Jerusalem, Israel 1978 https://huji-primo.hosted.exlibrisgroup.com/permalink/f/13ns5ae/972HUJI_ALMA21159208420003701

Nathan Linial Covering digraphs by paths. 257-272 1978 23 Discret. Math. 3 https://doi.org/10.1016/0012-365X(78)90007-9 db/journals/dm/dm23.html#Linial78

Nathan Linial A lower bound for the circumference of a graph. 297-300 1976 15 Discret. Math. 3 https://doi.org/10.1016/0012-365X(76)90031-5 db/journals/dm/dm15.html#Linial76

Yehuda Afek Alok Aggarwal Ron Aharoni Miklós Ajtai Noga Alon Alon Amit Lior Aronshtam Yonatan Aumann Baruch Awerbuch Yossi Azar Yakov Babichenko Amir Ban Amotz Bar-Noy Yair Bartal Amir Ben-Dor Michael Ben-Or Gal Beniamini Aya Bernstine Nayantara Bhatnagar Yonatan Bilu Yitzhak Birk Allan Borodin Nadav Brandes Andrei Z. Broder Sébastien Bubeck Michael Chapman Otfried Cheong Maria Chudnovsky Daniel Cizma Jason Cooper Leonardo Nagami Coregliano Amir Dahari Amit Daniely Yael Dekel Danny Dolev Yotam Drier Ran El-Yaniv David Ellis Paul Erdös Asaf Etgar Chaim Even-Zohar Uriel Feige Dror G. Feitelson Hillel Fleischer Moriah Friedlich Joel Friedman Menachem Fromer Eli Gafni Raziel Gartsman Shoni Gilboa Roman Glebov Oded Goldreich 0001 Shafi Goldwasser Craig Gotsman Joseph Y. Halpern Sariel Har-Peled Yuval Harari Amir Harel Joel Hass Dan Hefetz Ron Holzman Shlomo Hoory Hao Huang 0005 Uri Inbar François Jaeger Fernando Granha Jeronimo Chris Jones Jeff Kahn 0001 Gil Kalai Ron Kaniel Noam Kaplan Mauricio Karchmer Anna R. Karlin Solange Karsenty Sanjeev Khanna Maria M. Klawe Robert Krauthgamer Raz Kupferman Eyal Kushilevitz Nir Lavee James R. Lee Ehud Lehrer David Lichtenstein Michal Linial Doron Lipson Eran London Sria Louis László Lovász 0001 Elyassaf Loyfer Michael Luby Tomasz Luczak 0001 Zur Luria Avner Magen Shelly Mahlab-Aviv Yishay Mansour Jirí Matousek 0001 Manor Mendel Shahar Mendelson Roy Meshulam Shlomo Moran Avraham Morgenstern Jonathan Mosheiff Assaf Naor Humberto Naves Ilan Newman Noam Nisan Isabella Novik Tahl Nowik Idan OrzechEdan Orzech Rafail Ostrovsky Michal Parnas Charles Payan Yuval Peled David Peleg Steven J. Phillips Toniann Pitassi Elon Portugaly Yosef Prat Doron Puder Yuri Rabinovich Jaikumar Radhakrishnan Nadav Rappoport Ronald L. Rivest M. Rosenthal Eyal Rozenman Shmuel Safra Michael E. Saks Alex Samorodnitsky Ori Sasson Gideon Schechtman Regev Schweiger Shai Shalev-Shwartz Or Sheffet Ori Shoshani Adi Shraibman Michael Simkin Vera T. Sós David Statter Amos Stern Benny Sudakov Gábor Tardos Michael Tarsi Naftali Tishby Avishay Vaaknin Umesh V. Vazirani Michael Werman Avi Wigderson Zohar Yakhini Golan Yona David Zuckerman