The Complexity of Computing a Fourier Perturbation. - Nir Ailon; Gal Yehuda (CoRR, 2016)

Monitoring Properties of Large, Distributed, Dynamic Graphs. - Gal Yehuda; Daniel Keren; Islam Akaria (IPDPS, 2017)

It's Not What Machines Can Learn, It's What We Cannot Teach. - Gal Yehuda; Moshe Gabel; Assaf Schuster (ICML, 2020)

A Distance-Based Scheme for Reducing Bandwidth in Distributed Geometric Monitoring. - Yuval Alfassi; Moshe Gabel; Gal Yehuda; Daniel Keren (ICDE, 2021)

Slicing the hypercube is not easy. - Gal Yehuda; Amir Yehudayoff (CoRR, 2021)

Pseudorandom Self-Reductions for NP-Complete Problems. - Reyad Abed Elrazik; Robert Robere; Assaf Schuster; Gal Yehuda (Electron. Colloquium Comput. Complex., 2021)

The complexity of computing (almost) orthogonal matrices with ε-copies of the Fourier transform. - Nir Ailon; Gal Yehuda (Inf. Process. Lett., 2021)

Coin Flipping Neural Networks. - Yuval Sieradzki; Nitzan Hodos; Gal Yehuda; Assaf Schuster (ICML, 2022)

On Low-End Obfuscation and Learning. - Elette Boyle; Yuval Ishai; Pierre Meyer; Robert Robere; Gal Yehuda (ITCS, 2023)

Probabilistic Invariant Learning with Randomized Linear Classifiers. - Leonardo Cotta; Gal Yehuda; Assaf Schuster; Chris J. Maddison (NeurIPS, 2023)

A Lower Bound for Essential Covers of the Cube. - Gal Yehuda; Amir Yehudayoff (Comb., 2024)

Geometric covering using random fields. - Amit Shahar; Daniel Keren; Felipe Goncalves; Gal Yehuda (Theor. Comput. Sci., 2025)