Author:
Haviv Ishay,Parnas Michal
Funder
Israel Science Foundation
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science,General Computer Science
Reference31 articles.
1. Some improved bounds on communication complexity via new decomposition of cliques;Amano;Discrete Appl. Math.,2014
2. Unambiguous DNFs and Alon-Saks-Seymour;Balodis,2021
3. Low-sensitivity functions from unambiguous certificates;Ben-David,2017
4. Improving the Hadamard extractor;Bouda;Theor. Comput. Sci.,2012
5. Decomposition techniques applied to the clique-stable set separation problem;Bousquet;Discrete Math.,2018