Yael Ben-Haim  Yael Ben-Haim photo       

contact information

Research Staff Member
IBM Research - Haifa
  +972dash4dash8296263

links


more information

More information:  CSPSAT'15  |  CSPSAT'14  |  CSPSAT'13  |  CSPSAT'12  |  CSPSAT'11


2016

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


2012

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


2011

Adaptive Identification in Torii in the King Lattice
Yael Ben-Haim, Sylvain Gravier, Antoine Lobstein, Julien Moncel
The Electronic Journal of Combinatorics 18, 2011


2010

A Streaming Parallel Decision Tree Algorithm
Yael Ben-Haim, Elad Tom-Tov
Large-scale learning challenge, pp. 849-872, MIT Press, 2010


2008

Adaptive identification in graphs
Y Ben-Haim, S Gravier, A Lobstein, J Moncel
Journal of Combinatorial Theory, Series A 115(7), 1114--1126, Elsevier, 2008

Bounds for Codes in Products of Spaces, Grassmann, and Stiefel Manifolds
Christine Bachoc, Yael Ben-Haim, Simon Litsyn
IEEE Transactions on Information Theory 54(3), 1024-1035, 2008

Improved upper bounds on the reliability function of the Gaussian channel
Y. Ben-Haim and S. Litsyn
IEEE Trans. Information Theory 54(1), 5--12, 2008


2007

Bounds for Codes in the Grassmann Manifold
C Bachoc, Y Ben-Haim, S Litsyn
IEEE International Symposium on Information Theory, pp. 1796--1800, 2007

A new upper bound on the rate of non-binary codes
Y. Ben-Haim and S. Litsyn
Advances in Mathematics of Communications 1(1), 83--92, 2007


2006

Upper bounds on the rate of LDPC codes as a function of minimum distance
Y Ben-Haim, S Litsyn
IEEE Transactions on Information Theory 52(5), 2006

A new upper bound on the rate of non-binary codes
Y Ben-Haim, S Litsyn
2006 IEEE International Symposium on Information Theory, pp. 297--301

Improved Upper Bounds on the Reliability Function of the Gaussian Channel
Yael Ben-Haim, Simon Litsyn
2006 IEEE International Symposium on Information Theory, pp. 5-12

Exact minimum density of codes identifying vertices in the square grid
Y Ben-Haim, S Litsyn
SIAM Journal on Discrete Mathematics 19(1), 69--82, 2006


2005

Upper bounds on the rate of LDPC codes as a function of minimum distance
Y. Ben-Haim and S. Litsyn
ISIT 2005

On the Optimality of Coloring with a Lattice
Y Ben-Haim, T Etzion
SIAM Journal on Discrete Mathematics 18(4), 844--878, 2005


2004

On the optimality of coloring with a lattice
Y. Merksamer [my maiden name] and T. Etzion
ISIT 2004