Michal Parnas

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	Testing Intersectingness of Uniform Families	2024	Ishay Haviv Michal Parnas
+ PDF Chat	On the binary and Boolean rank of regular matrices	2023	Ishay Haviv Michal Parnas
+ PDF Chat	The binary rank of circulant block matrices	2022	Ishay Haviv Michal Parnas
+ PDF Chat	Upper bounds on the Boolean rank of Kronecker products	2022	Ishay Haviv Michal Parnas
+	On the Binary and Boolean Rank of Regular Matrices	2022	Ishay Haviv Michal Parnas
+	The Binary Rank of Circulant Block Matrices	2022	Ishay Haviv Michal Parnas
+ PDF Chat	Circulant almost cross intersecting families	2021	Michal Parnas
+ PDF Chat	Property Testing of the Boolean and Binary Rank	2021	Michal Parnas Dana Ron Adi Shraibman
+	Upper Bounds on the Boolean Rank of Kronecker Products	2021	Ishay Haviv Michal Parnas
+	Upper Bounds on the Boolean Rank of Kronecker Products	2021	Ishay Haviv Michal Parnas
+	Circulant almost cross intersecting families	2020	Michal Parnas
+	Circulant almost cross intersecting families	2020	Michal Parnas
+	Property testing of the Boolean and binary rank	2019	Michal Parnas Dana Ron Adi Shraibman
+	The Boolean rank of the uniform intersection matrix and a family of its submatrices	2019	Michal Parnas Dana Ron Adi Shraibman
+	On maximal isolation sets in the uniform intersection matrix	2019	Michal Parnas Adi Shraibman
+	On maximal isolation sets in the uniform intersection matrix.	2019	Michal Parnas Adi Shraibman
+	Property testing of the Boolean and binary rank	2019	Michal Parnas Dana Ron Adi Shraibman
+	The augmentation property of binary matrices for the binary and Boolean rank	2018	Michal Parnas Adi Shraibman
+	The Augmentation Property of Binary Matrices for the Binary and Boolean Rank	2017	Michal Parnas Adi Shraibman
+	The Augmentation Property of Binary Matrices for the Binary and Boolean Rank	2017	Michal Parnas Adi Shraibman
+	Testing the diameter of graphs	2002	Michal Parnas Dana Ron
+	On Testing Convexity and Submodularity	2002	Michal Parnas Dana Ron Ronitt Rubinfeld

Common Coauthors

Coauthor	Papers Together
Adi Shraibman	9
Ishay Haviv	6
Dana Ron	6
Ishay Haviv	2
Ronitt Rubinfeld	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	Biclique coverings of regular bigraphs and minimum semiring ranks of regular matrices	1991	David A. Gregory Norman J. Pullman Kathryn F. Jones J. Richard Lundgren	7
+	A new generalization of the Erdös-Ko-Rado theorem	1986	L. Pyber	4
+	The Boolean rank of the uniform intersection matrix and a family of its submatrices	2019	Michal Parnas Dana Ron Adi Shraibman	3
+	An Extremal Problem for two Families of Sets	1982	Péter Frankl	3
+ PDF Chat	Fractional Biclique Covers and Partitions of Graphs	2006	Valerie L. Watts	2
+	On circulant Boolean matrices	1990	Huang Daode	2
+	Nonnegative rank-preserving operators	1985	LeRoy B. Beasley David A. Gregory Norman J. Pullman	2
+	Almost Cross-Intersecting and Almost Cross-Sperner Pairs of Families of Sets	2012	Dániel Gerbner Nathan Lemons Cory Palmer Dömötör Pálvölgyi Balázs Patkós Vajk Szécsi	2
+ PDF Chat	Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs	2007	Ilan Alon Eldar Fischer Ilan Newman	2
+ PDF Chat	Spanoids---An Abstraction of Spanning Structures, and a Barrier for LCCs	2020	Zeev Dvir Sivakanth Gopi Yuzhou Gu Avi Wigderson	2
+	On the complexity of Boolean matrix ranks	2013	Yaroslav Shitov	2
+	Intersection patterns of convex sets	1984	Gil Kalai	2
+	Boolean rank of Kronecker products	2001	Valerie L. Watts	2
+ PDF Chat	INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS	1961	Péter L. Erdős Chao Ko R. Rado	2
+ PDF Chat	Hypergraphs of Bounded Disjointness	2014	Alex Scott Elizabeth Wilmer	2
+	The augmentation property of binary matrices for the binary and Boolean rank	2018	Michal Parnas Adi Shraibman	2
+ PDF Chat	Communication is Bounded by Root of Rank	2016	Shachar Lovett	2
+	Almost Intersecting Families of Sets	2012	Dániel Gerbner Nathan Lemons Cory Palmer Balázs Patkós Vajk Szécsi	2
+ PDF Chat	Binary ranks and binary factorizations of nonnegative integer matrices	2012	Jin Zhong	2
+	Perspectives of Monge properties in optimization	1996	Rainer E. Burkard Bettina Klinz Rüdiger Rudolf	1
+	Clique Coverings of Complements of Paths and Cycles	1985	D. de Caen David A. Gregory Norman J. Pullman	1
+	Sparse partitions	2002	Baruch Awerbuch David Peleg	1
+ PDF Chat	Decomposition techniques applied to the Clique-Stable set separation problem	2017	Nicolás Bousquet Aurélie Lagoutte Frédéric Maffray Lucas Pastor	1
+ PDF Chat	Testing Matrix Rank, Optimally	2019	Maria-Florina Balcan Yi Li David P. Woodruff Hongyang Zhang	1
+ PDF Chat	Ordered biclique partitions and communication complexity problems	2014	Manami Shigeta Kazuyuki Amano	1
+	On maximal isolation sets in the uniform intersection matrix	2019	Michal Parnas Adi Shraibman	1
+ PDF Chat	Query-to-Communication Lifting Using Low-Discrepancy Gadgets	2021	Arkadev Chattopadhyay Yuval Filmus Sajin Koroth Or Meir Toniann Pitassi	1
+	On maximal isolation sets in the uniform intersection matrix.	2019	Michal Parnas Adi Shraibman	1
+	SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS	1967	A. J. W. Hilton E. C. Milner	1
+	Upper Bounds on the Boolean Rank of Kronecker Products	2021	Ishay Haviv Michal Parnas	1
+	On simple linear programming problems	1963	A. J. Hoffman	1
+	Recent advances on the log-rank conjecture in communication complexity	2014	Shachar Lovett	1
+	Extremal problems for finite sets	1997	Konrad Engel	1
+	Nonnegative ranks, decompositions, and factorizations of nonnegative matrices	1993	Joel E. Cohen Uriel G. Rothblum	1
+	Submodular functions and convexity	1983	László Lovász	1
+ PDF Chat	More Counterexamples to the Alon-Saks-Seymour and Rank-Coloring Conjectures	2011	Sebastian M. Cioabă Michael Tait	1
+	ON SIMPLE LINEAR PROGRAMMING PROBLEMS	2003	Alan J. Hoffman	1
+	Clique–Stable Set separation in perfect graphs with no balanced skew-partitions	2016	Aurélie Lagoutte Théophile Trunck	1
+	On Testing Convexity and Submodularity	2002	Michal Parnas Dana Ron Ronitt Rubinfeld	1
+	The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinear	1992	Alexander Razborov	1
+	A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions	2000	Satoru Iwata Lisa Fleischer Satoru Fujishige	1
+ PDF Chat	The maximum sum and the maximum product of sizes of cross-intersecting families	2013	Peter Borg	1
+	Clique versus independent set	2014	Nicolás Bousquet Aurélie Lagoutte Stéphan Thomassé	1
+	The exact bound in the Erdős-Ko-Rado theorem for cross-intersecting families	1989	Makoto Matsumoto Norihide Tokushige	1
+	Kneser's conjecture, chromatic number, and homotopy	1978	László Lovász	1
+	Combinatorial auctions with decreasing marginal utilities	2001	Benny Lehmann Daniel Lehmann Noam Nisan	1
+	The Rank of Circulant Matrices	1956	A. W. Ingleton	1
+	Decreasing the diameter of bounded degree graphs	2000	Noga Alon András Gyárfás Miklós Ruszinkó	1
+	Inequalities for two set systems with prescribed intersections	1987	Źsolt Tuza	1
+	Some best possible inequalities concerning cross-intersecting families	1992	Péter Frankl Norihide Tokushige	1