Gal Beniamini

According to our database, Gal Beniamini authored at least 12 papers between 2017 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

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, Amnon Shashua

CoRR, July, 2025

How Balanced Can Permutations Be?

Gal Beniamini, Nir Lavee, Nati Linial

Comb., February, 2025

Counting Permutation Patterns with Multidimensional Trees.

Gal Beniamini, Nir Lavee

Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

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

The Rank-Ramsey Problem and the Log-Rank Conjecture.

Gal Beniamini, Nati Linial, Adi Shraibman

CoRR, 2024

2022

Algebraic Representations of Unique Bipartite Perfect Matching.

Gal Beniamini

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

The Approximate Degree of Bipartite Perfect Matching.

Gal Beniamini

Proceedings of the 37th Computational Complexity Conference, 2022

2021

Bipartite perfect matching as a real polynomial.

Gal Beniamini, Noam Nisan

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

2020

Sparsifying the Operators of Fast Matrix Multiplication Algorithms.

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

CoRR, 2020

The Dual Polynomial of Bipartite Perfect Matching.

Gal Beniamini

CoRR, 2020

2019

Faster Matrix Multiplication via Sparse Decomposition.

Gal Beniamini, Oded Schwartz

Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

2017

Meaningful identifier names: the case of single-letter variables.

Gal Beniamini, Sarah Gingichashvili, Alon Klein-Orbach, Dror G. Feitelson

Proceedings of the 25th International Conference on Program Comprehension, 2017