Gal Beniamini

I am a third year Ph.D. student under the supervision of Professor Nati Linial.

I completed my M.Sc. under the supervision of Professor Noam Nisan.

I'm interested in theoretical computer science, combinatorics and Boolean functions (and other stuff too!).

Papers

Counting Permutation Patterns with Multidimensional Trees

Gal Beniamini and Nir Lavee.

The Rank-Ramsey Problem and the Log-Rank Conjecture

Gal Beniamini, Nati Linial and Adi Shraibman.

How Balanced Can Permutations Be? (Combinatorica 2025)

Gal Beniamini, Nir Lavee and Nati Linial.

The F2-Rank and Size of Graphs

Gal Beniamini, Asaf Etgar and Yael Kirkpatrick.

Algebraic Representations of Unique Bipartite Perfect Matching (MFCS'22)

Gal Beniamini.

The Approximate Degree of Bipartite Perfect Matching (CCC'22)

Gal Beniamini.

Bipartite Perfect Matching as a Real Polynomial (STOC'21) [recording]

Gal Beniamini and Noam Nisan.

Faster Matrix Multiplication via Sparse Decomposition (SPAA'19)

Gal Beniamini and Oded Schwartz.

Sparsifying the Operators of Fast Matrix Multiplication Algorithms

Gal Beniamini, Nathan Cheng, Olga Holtz, Elaye Karstadt and Oded Schwartz.

M.Sc. Thesis

Bipartite Perfect Matching as a Real Polynomial