Gal Beniamini - RankMe

15 papers A* 2A 2B 2Journal 9

Year	Rank	Type	Title / Venue / Authors
2025	A*	`conf`	Counting Permutation Patterns with Multidimensional Trees. ICALP Gal Beniamini, Nir Lavee
2025	J	`jnl`	FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming. CoRR 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
2025	J	`jnl`	How Balanced Can Permutations Be? Comb. Gal Beniamini, Nir Lavee, Nati Linial
2024	J	`jnl`	Artificial Expert Intelligence through PAC-reasoning. CoRR Shai Shalev-Shwartz, Amnon Shashua, Gal Beniamini, Yoav Levine, Or Sharir, Noam Wies, Ido Ben-Shaul, Tomer Nussbaum, Shir Granot Peled
2024	J	`jnl`	Counting Permutation Patterns with Multidimensional Trees. CoRR Gal Beniamini, Nir Lavee
2024	J	`jnl`	The Rank-Ramsey Problem and the Log-Rank Conjecture. CoRR Gal Beniamini, Nati Linial, Adi Shraibman
2022	B	`conf`	Algebraic Representations of Unique Bipartite Perfect Matching. MFCS Gal Beniamini
2022	J	`jnl`	Algebraic Representations of Unique Bipartite Perfect Matching. CoRR Gal Beniamini
2022	A	`conf`	The Approximate Degree of Bipartite Perfect Matching. CCC Gal Beniamini
2021	A*	`conf`	Bipartite perfect matching as a real polynomial. STOC Gal Beniamini, Noam Nisan
2020	J	`jnl`	Bipartite Perfect Matching as a Real Polynomial. CoRR Gal Beniamini, Noam Nisan
2020	J	`jnl`	Sparsifying the Operators of Fast Matrix Multiplication Algorithms. CoRR Gal Beniamini, Nathan Cheng, Olga Holtz, Elaye Karstadt, Oded Schwartz
2020	J	`jnl`	The Dual Polynomial of Bipartite Perfect Matching. CoRR Gal Beniamini
2019	B	`conf`	Faster Matrix Multiplication via Sparse Decomposition. SPAA Gal Beniamini, Oded Schwartz
2017	A	`conf`	Meaningful identifier names: the case of single-letter variables. ICPC Gal Beniamini, Sarah Gingichashvili, Alon Klein-Orbach, Dror G. Feitelson