Gal Beniamini

According to our database, Gal Beniamini authored at least 7 papers between 2017 and 2022.

Collaborative distances:

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

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