Meaningful identifier names: the case of single-letter variables. - Gal Beniamini; Sarah Gingichashvili; Alon Klein-Orbach; Dror G. Feitelson (ICPC, 2017)

Faster Matrix Multiplication via Sparse Decomposition. - Gal Beniamini; Oded Schwartz (SPAA, 2019)

The Dual Polynomial of Bipartite Perfect Matching. - Gal Beniamini (CoRR, 2020)

Sparsifying the Operators of Fast Matrix Multiplication Algorithms. - Gal Beniamini; Nathan Cheng; Olga Holtz; Elaye Karstadt; Oded Schwartz (CoRR, 2020)

Bipartite perfect matching as a real polynomial. - Gal Beniamini; Noam Nisan (STOC, 2021)

The Approximate Degree of Bipartite Perfect Matching. - Gal Beniamini (CCC, 2022)

Algebraic Representations of Unique Bipartite Perfect Matching. - Gal Beniamini (MFCS, 2022)

The Rank-Ramsey Problem and the Log-Rank Conjecture. - Gal Beniamini; Nati Linial; Adi Shraibman (CoRR, 2024)

Artificial Expert Intelligence through PAC-reasoning. - Shai Shalev-Shwartz; Amnon Shashua; Gal Beniamini; Yoav Levine; Or Sharir; Noam Wies; Ido Ben-Shaul; Tomer Nussbaum; Shir Granot Peled (CoRR, 2024)

Counting Permutation Patterns with Multidimensional Trees. - Gal Beniamini; Nir Lavee (ICALP, 2025)

How Balanced Can Permutations Be? - Gal Beniamini; Nir Lavee; Nati Linial (Comb., 2025)

FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming. - Gal Beniamini; Yuval Dor; Alon Vinnikov; Shir Granot Peled; Or Weinstein; Or Sharir; Noam Wies; Tomer Nussbaum; Ido Ben-Shaul; Tomer Zekharya; Yoav Levine; Shai Shalev-Shwartz; et al. (CoRR, 2025)