default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYael Ben-Haim
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j10]Naoki Kanazawa
, Daniel J. Egger, Yael Ben-Haim, Helena Zhang, William E. Shanks, Gadi Aleksandrowicz, Christopher J. Wood:
Qiskit Experiments: A Python package to characterize and calibrate quantum computers. J. Open Source Softw. 8(87): 5329 (2023)
2010 – 2019
- 2016
- [c6]Merav Aharoni, Yael Ben-Haim, Shai Doron, Anatoly Koyfman, Elena Tsanko, Michael Veksler:
Using Graph-Based CSP to Solve the Address Translation Problem. CP 2016: 843-858 - 2012
- [c5]Yael Ben-Haim, Alexander Ivrii, Oded Margalit, Arie Matsliah:
Perfect Hashing and CNF Encodings of Cardinality Constraints. SAT 2012: 397-409 - 2011
- [j9]Yael Ben-Haim, Sylvain Gravier, Antoine Lobstein, Julien Moncel:
Adaptive Identification in Torii in the King Lattice. Electron. J. Comb. 18(1) (2011) - 2010
- [j8]Yael Ben-Haim, Elad Tom-Tov:
A Streaming Parallel Decision Tree Algorithm. J. Mach. Learn. Res. 11: 849-872 (2010)
2000 – 2009
- 2008
- [j7]Yael Ben-Haim, Sylvain Gravier, Antoine Lobstein, Julien Moncel:
Adaptive identification in graphs. J. Comb. Theory A 115(7): 1114-1126 (2008) - [j6]Yael Ben-Haim, Simon Litsyn:
Improved Upper Bounds on the Reliability Function of the Gaussian Channel. IEEE Trans. Inf. Theory 54(1): 5-12 (2008) - [j5]Christine Bachoc, Yael Ben-Haim, Simon Litsyn:
Bounds for Codes in Products of Spaces, Grassmann, and Stiefel Manifolds. IEEE Trans. Inf. Theory 54(3): 1024-1035 (2008) - 2007
- [j4]Yael Ben-Haim, Simon Litsyn:
A new upper bound on the rate of non-binary codes. Adv. Math. Commun. 1(1): 83-92 (2007) - [c4]Christine Bachoc, Yael Ben-Haim, Simon Litsyn:
Bounds for Codes in the Grassmann Manifold. ISIT 2007: 1796-1800 - 2006
- [j3]Yael Ben-Haim, Simon Litsyn:
Upper bounds on the rate of LDPC codes as a function of minimum distance. IEEE Trans. Inf. Theory 52(5): 2092-2100 (2006) - [c3]Yael Ben-Haim, Simon Litsyn:
A New Upper Bound on the Rate of Non-Binary Codes. ISIT 2006: 297-301 - [c2]Yael Ben-Haim, Simon Litsyn:
Improved Upper Bounds on the Reliability Function of the Gaussian Channel. ISIT 2006: 709-713 - 2005
- [j2]Yael Ben-Haim, Tuvi Etzion:
On the Optimality of Coloring with a Lattice. SIAM J. Discret. Math. 18(4): 844-878 (2005) - [j1]Yael Ben-Haim, Simon Litsyn:
Exact Minimum Density of Codes Identifying Vertices in the Square Grid. SIAM J. Discret. Math. 19(1): 69-82 (2005) - [c1]Yael Ben-Haim, Simon Litsyn:
Upper bounds on the rate of LDPC codes as a function of minimum distance. ISIT 2005: 47-51
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
