Nati Linial - RankMe

62 papers A* 4A 6B 1Journal 50Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	An Approach to the Girth Problem in Cubic Graphs. J. Graph Theory Aya Bernstine, Nati Linial
2026	A	`conf`	Higher-Order Delsarte Dual LPs: Lifting, Constructions and Completeness. ITCS Leonardo Nagami Coregliano, Fernando Granha Jeronimo, Chris Jones, Nati Linial, Elyassaf Loyfer
2026	J	`jnl`	The Structure of Metrizable Graphs. Discret. Comput. Geom. Maria Chudnovsky, Daniel Cizma, Nati Linial
2025	J	`jnl`	Every Poset has a Large Cut. CoRR Nati Linial, Ori Shoshani
2025	J	`jnl`	Higher-order Delsarte Dual LPs: Lifting, Constructions and Completeness. CoRR Leonardo Nagami Coregliano, Fernando Granha Jeronimo, Chris Jones, Nati Linial, Elyassaf Loyfer
2025	J	`jnl`	How Balanced Can Permutations Be? Comb. Gal Beniamini, Nir Lavee, Nati Linial
2025	J	`jnl`	On the Löwner-John Ellipsoids of the Metric Polytope. Discret. Comput. Geom. Raziel Gartsman, Nati Linial
2024	J	`jnl`	On the connectivity and diameter of geodetic graphs. Eur. J. Comb. Asaf Etgar, Nati Linial
2024	J	`jnl`	The Rank-Ramsey Problem and the Log-Rank Conjecture. CoRR Gal Beniamini, Nati Linial, Adi Shraibman
2023	J	`jnl`	An Elementary Proof of the First LP Bound on the Rate of Binary Codes. CoRR Nati Linial, Elyassaf Loyfer
2023	J	`jnl`	Irreducible nonmetrizable path systems in graphs. J. Graph Theory Daniel Cizma, Nati Linial
2023	J	`jnl`	New LP-Based Upper Bounds in the Rate-Vs.-Distance Problem for Binary Linear Codes. IEEE Trans. Inf. Theory Elyassaf Loyfer, Nati Linial
2022	J	`jnl`	Bounds on Unique-Neighbor Codes. CoRR Nati Linial, Idan Orzech
2022	J	`jnl`	Geodesic Geometry on Graphs. Discret. Comput. Geom. Daniel Cizma, Nati Linial
2022	J	`jnl`	Linear Programming Hierarchies in Coding Theory: Dual Solutions. CoRR Elyassaf Loyfer, Nati Linial
2022	J	`jnl`	New LP-based Upper Bounds in the Rate-vs.-Distance Problem for Linear Codes. CoRR Elyassaf Loyfer, Nati Linial
2022	J	`jnl`	On the Local Structure of Oriented Graphs - a Case Study in Flag Algebras. Electron. J. Comb. Shoni Gilboa, Roman Glebov, Dan Hefetz, Nati Linial, Avraham Morgenstern
2021	J	`jnl`	A randomized construction of high girth regular graphs. Random Struct. Algorithms Nati Linial, Michael Simkin
2021	A	`conf`	An Improved Protocol for the Exactly-N Problem. CCC Nati Linial, Adi Shraibman
2020	J	`jnl`	Expander Graphs - Both Local and Global. Comb. Michael Chapman, Nati Linial, Yuval Peled
2020	J	`jnl`	Hyperpaths. CoRR Amir Dahari, Nati Linial
2020	J	`jnl`	On the weight distribution of random binary linear codes. Random Struct. Algorithms Nati Linial, Jonathan Mosheiff
2019	J	`jnl`	A King in every two consecutive tournaments. CoRR Yehuda Afek, Eli Gafni, Nati Linial
2019	J	`jnl`	Enumeration and randomized constructions of hypertrees. Random Struct. Algorithms Nati Linial, Yuval Peled
2019	A*	`conf`	Expander Graphs - Both Local and Global. FOCS Michael Chapman, Nati Linial, Yuval Peled
2019	A	`conf`	On the Communication Complexity of High-Dimensional Permutations. ITCS Nati Linial, Toniann Pitassi, Adi Shraibman
2018	J	`jnl`	On the weight distribution of random binary linear codes. CoRR Nati Linial, Jonathan Mosheiff
2017	J	`jnl`	On The Communication Complexity of High-Dimensional Permutations. CoRR Nati Linial, Adi Shraibman
2017	J	`jnl`	On the Rigidity of Sparse Random Graphs. J. Graph Theory Nati Linial, Jonathan Mosheiff
2016	J	`jnl`	Internal Partitions of Regular Graphs. J. Graph Theory Amir Ban, Nati Linial
2016	J	`jnl`	Invariants of Random Knots and Links. Discret. Comput. Geom. Chaim Even-Zohar, Joel Hass, Nati Linial, Tahl Nowik
2016	J	`jnl`	On the Local Profiles of Trees. J. Graph Theory Sébastien Bubeck, Nati Linial
2016	J	`jnl`	On the Number of 4-Cycles in a Tournament. J. Graph Theory Nati Linial, Avraham Morgenstern
2016	J	`jnl`	On the densities of cliques and independent sets in graphs. Comb. Hao Huang, Nati Linial, Humberto Naves, Yuval Peled, Benny Sudakov
2015	J	`jnl`	A Note on the Inducibility of 4-Vertex Graphs. Graphs Comb. Chaim Even-Zohar, Nati Linial
2015	J	`jnl`	Graphs with Few 3-Cliques and 3-Anticliques are 3-Universal. J. Graph Theory Nati Linial, Avraham Morgenstern
2015	J	`jnl`	On the Rigidity of Sparse Random Graphs. CoRR Nati Linial, Jonathan Mosheiff
2015	J	`jnl`	Triply Existentially Complete Triangle-Free Graphs. J. Graph Theory Chaim Even-Zohar, Nati Linial
2014	A*	`conf`	From average case complexity to improper learning complexity. STOC Amit Daniely, Nati Linial, Shai Shalev-Shwartz
2014	J	`jnl`	Market Share Indicates Quality. CoRR Amir Ban, Nati Linial
2014	J	`jnl`	Musical Chairs. SIAM J. Discret. Math. Yehuda Afek, Yakov Babichenko, Uriel Feige, Eli Gafni, Nati Linial, Benny Sudakov
2014	J	`jnl`	On the 3-Local Profiles of Graphs. J. Graph Theory Hao Huang, Nati Linial, Humberto Naves, Yuval Peled, Benny Sudakov
2014	A*	`conf`	The Complexity of Learning Halfspaces using Generalized Linear Methods. COLT Amit Daniely, Nati Linial, Shai Shalev-Shwartz
2013	J	`jnl`	From average case complexity to improper learning complexity. CoRR Amit Daniely, Nati Linial, Shai Shalev-Shwartz
2013	—	`conf`	More data speeds up training time in learning halfspaces over sparse vectors. NIPS Amit Daniely, Nati Linial, Shai Shalev-Shwartz
2013	J	`jnl`	More data speeds up training time in learning halfspaces over sparse vectors. CoRR Amit Daniely, Nati Linial, Shai Shalev-Shwartz
2013	J	`jnl`	On High-Dimensional Acyclic Tournaments. Discret. Comput. Geom. Nati Linial, Avraham Morgenstern
2013	A	`conf`	On the practically interesting instances of MAXCUT. STACS Yonatan Bilu, Amit Daniely, Nati Linial, Michael E. Saks
2012	J	`jnl`	Clustering is difficult only when it does not matter CoRR Amit Daniely, Nati Linial, Michael E. Saks
2012	J	`jnl`	Musical chairs CoRR Yehuda Afek, Yakov Babichenko, Uriel Feige, Eli Gafni, Nati Linial, Benny Sudakov
2012	J	`jnl`	On the practically interesting instances of MAXCUT CoRR Yonatan Bilu, Amit Daniely, Nati Linial, Michael E. Saks
2012	J	`jnl`	Strong convergence in posets. J. Comb. Theory A Amir Ban, Nati Linial
2012	J	`jnl`	The error rate of learning halfspaces using Kernel-SVMs CoRR Amit Daniely, Nati Linial, Shai Shalev-Shwartz
2011	J	`jnl`	No justified complaints: On fair sharing of multiple resources CoRR Danny Dolev, Dror G. Feitelson, Joseph Y. Halpern, Raz Kupferman, Nati Linial
2011	J	`jnl`	Oblivious Collaboration CoRR Yehuda Afek, Yakov Babichenko, Uriel Feige, Eli Gafni, Nati Linial, Benny Sudakov
2011	A	`conf`	Oblivious Collaboration. DISC Yehuda Afek, Yakov Babichenko, Uriel Feige, Eli Gafni, Nati Linial, Benny Sudakov
2011	B	`conf`	The dynamics of reputation systems. TARK Amir Ban, Nati Linial
2010	J	`jnl`	Word maps and spectra of random graph lifts. Random Struct. Algorithms Nati Linial, Doron Puder
2009	J	`jnl`	Lower bounds in communication complexity based on factorization norms. Random Struct. Algorithms Nati Linial, Adi Shraibman
2008	A	`conf`	Learning Complexity vs. Communication Complexity. CCC Nati Linial, Adi Shraibman
2007	J	`jnl`	Complexity measures of sign matrices. Comb. Nati Linial, Shahar Mendelson, Gideon Schechtman, Adi Shraibman
2007	A*	`conf`	Lower bounds in communication complexity based on factorization norms. STOC Nati Linial, Adi Shraibman