Linial, Nati; Shraibman, Adi Larger corner-free sets from better NOF exactly-\(N\) protocols. (English) Zbl 07471817 Discrete Anal. 2021, Paper No. 19, 9 p. (2021). MSC: 68Q11 11B25 68R10 91A06 91A68 PDFBibTeX XMLCite \textit{N. Linial} and \textit{A. Shraibman}, Discrete Anal. 2021, Paper No. 19, 9 p. (2021; Zbl 07471817) Full Text: DOI arXiv
Linial, Nati; Pitassi, Toniann; Shraibman, Adi On the communication complexity of high-dimensional permutations. (English) Zbl 07559097 Blum, Avrim (ed.), 10th innovations in theoretical computer science conference, ITCS 2019, January 10–12, 2019, San Diego, CA, USA. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 124, Article 54, 20 p. (2019). MSC: 68Qxx PDFBibTeX XMLCite \textit{N. Linial} et al., LIPIcs -- Leibniz Int. Proc. Inform. 124, Article 54, 20 p. (2019; Zbl 07559097) Full Text: DOI arXiv
Linial, Nati; Shraibman, Adi Lower bounds in communication complexity based on factorization norms. (English) Zbl 1202.94012 Random Struct. Algorithms 34, No. 3, 368-394 (2009). MSC: 94A05 68Q17 81P68 68W20 81P45 PDFBibTeX XMLCite \textit{N. Linial} and \textit{A. Shraibman}, Random Struct. Algorithms 34, No. 3, 368--394 (2009; Zbl 1202.94012) Full Text: DOI
Linial, Nati; Mendelson, Shahar; Schechtman, Gideon; Shraibman, Adi Complexity measures of sign matrices. (English) Zbl 1164.68006 Combinatorica 27, No. 4, 439-463 (2007). MSC: 68Q15 46B07 68Q17 68Q32 PDFBibTeX XMLCite \textit{N. Linial} et al., Combinatorica 27, No. 4, 439--463 (2007; Zbl 1164.68006) Full Text: DOI
Hoory, Shlomo; Linial, Nathan; Wigderson, Avi Expander graphs and their applications. (English) Zbl 1147.68608 Bull. Am. Math. Soc., New Ser. 43, No. 4, 439-561 (2006). Reviewer: Olaf Ninnemann (Uffing am Staffelsee) MSC: 68R10 68-02 05-02 68Q15 68Q17 94B05 05C25 05C80 PDFBibTeX XMLCite \textit{S. Hoory} et al., Bull. Am. Math. Soc., New Ser. 43, No. 4, 439--561 (2006; Zbl 1147.68608) Full Text: DOI
Linial, N.; Luby, M.; Saks, M.; Zuckerman, D. Efficient construction of a small hitting set for combinatorial rectangles in high dimension. (English) Zbl 0886.68076 Combinatorica 17, No. 2, 215-234 (1997). Reviewer: András Recski (Budapest) MSC: 68Q25 05B40 68R05 PDFBibTeX XMLCite \textit{N. Linial} et al., Combinatorica 17, No. 2, 215--234 (1997; Zbl 0886.68076) Full Text: DOI
Kahn, J.; Linial, N.; Samorodnitsky, A. Inclusion-exclusion: exact and approximate. (English) Zbl 0881.68084 Combinatorica 16, No. 4, 465-477 (1996). Reviewer: Péter Komjáth (Budapest) MSC: 68R05 05A16 60C05 05A20 PDFBibTeX XMLCite \textit{J. Kahn} et al., Combinatorica 16, No. 4, 465--477 (1996; Zbl 0881.68084) Full Text: DOI
Gotsman, C.; Linial, N. The equivalence of two problems on the cube. (English) Zbl 0769.05050 J. Comb. Theory, Ser. A 61, No. 1, 142-146 (1992). Reviewer: Ma Zhongfan (Beijing) MSC: 05C35 06E30 PDFBibTeX XMLCite \textit{C. Gotsman} and \textit{N. Linial}, J. Comb. Theory, Ser. A 61, No. 1, 142--146 (1992; Zbl 0769.05050) Full Text: DOI