On the Optimality of Coloring with a Lattice. - Yael Ben-Haim; Tuvi Etzion (SIAM J. Discret. Math., 2005)

Exact Minimum Density of Codes Identifying Vertices in the Square Grid. - Yael Ben-Haim; Simon Litsyn (SIAM J. Discret. Math., 2005)

Upper bounds on the rate of LDPC codes as a function of minimum distance. - Yael Ben-Haim; Simon Litsyn (IEEE Trans. Inf. Theory, 2006)

Bounds for Codes in the Grassmann Manifold. - Christine Bachoc; Yael Ben-Haim; Simon Litsyn (ISIT, 2007)

A new upper bound on the rate of non-binary codes. - Yael Ben-Haim; Simon Litsyn (Adv. Math. Commun., 2007)

Adaptive identification in graphs. - Yael Ben-Haim; Sylvain Gravier; Antoine Lobstein; Julien Moncel (J. Comb. Theory A, 2008)

Bounds for Codes in Products of Spaces, Grassmann, and Stiefel Manifolds. - Christine Bachoc; Yael Ben-Haim; Simon Litsyn (IEEE Trans. Inf. Theory, 2008)

Improved Upper Bounds on the Reliability Function of the Gaussian Channel. - Yael Ben-Haim; Simon Litsyn (IEEE Trans. Inf. Theory, 2008)

A Streaming Parallel Decision Tree Algorithm. - Yael Ben-Haim; Elad Tom-Tov (J. Mach. Learn. Res., 2010)

Adaptive Identification in Torii in the King Lattice. - Yael Ben-Haim; Sylvain Gravier; Antoine Lobstein; Julien Moncel (Electron. J. Comb., 2011)

Perfect Hashing and CNF Encodings of Cardinality Constraints. - Yael Ben-Haim; Alexander Ivrii; Oded Margalit; Arie Matsliah (SAT, 2012)

Using Graph-Based CSP to Solve the Address Translation Problem. - Merav Aharoni; Yael Ben-Haim; Shai Doron; Anatoly Koyfman; Elena Tsanko; Michael Veksler (CP, 2016)

Qiskit Experiments: A Python package to characterize and calibrate quantum computers. - Naoki Kanazawa; Daniel J. Egger; Yael Ben-Haim; Helena Zhang; William E. Shanks; Gadi Aleksandrowicz; Christopher J. Wood (J. Open Source Softw., 2023)