default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEhud D. Karnin
Person information
- affiliation: IBM Research, Haifa, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
[c6]Ehud D. Karnin, Eugene Walach, Tal Drory:
Crowdsourcing in the Document Processing Practice - (A Short Practitioner/Visionary Paper). ICWE Workshops 2010: 408-411
1990 – 1999
- 1994
- [c5]Geir E. Øien, Zachi Baharav, Skjalg Lepsøy, Ehud D. Karnin:
A new improved collage theorem with applications to multiresolution fractal image coding. ICASSP (5) 1994: 565-568 - 1991
- [c4]Dan Chevion, Ehud D. Karnin, Eugene Walach:
High Efficiency, Multiplication Free Approximation of Arithmetic Coding. Data Compression Conference 1991: 43-52 - 1990
- [j8]Ehud D. Karnin:
A simple procedure for pruning back-propagation trained neural networks. IEEE Trans. Neural Networks 1(2): 239-242 (1990)
1980 – 1989
- 1986
- [c3]Eugene Walach, Ehud D. Karnin:
A fractal based approach to image compression. ICASSP 1986: 529-532 - 1984
- [j7]Ehud D. Karnin:
A Parallel Algorithm for the Knapsack Problem. IEEE Trans. Computers 33(5): 404-408 (1984) - [j6]Justin M. Reyneri, Ehud D. Karnin:
Coin flipping by telephone. IEEE Trans. Inf. Theory 30(5): 775-776 (1984) - 1983
- [j5]Hamid R. Amirazizi, Ehud D. Karnin, Justin M. Reyneri:
Compact knapsacks are polynomially solvable. SIGACT News 15(1): 20-22 (1983) - [j4]Martin E. Hellman, Ehud D. Karnin, Justin M. Reyneri:
On the necessity of cryptanalytic exhaustive search. SIGACT News 15(1): 40-44 (1983) - [j3]Ehud D. Karnin, J. W. Greene, Martin E. Hellman:
On secret sharing systems. IEEE Trans. Inf. Theory 29(1): 35-41 (1983) - [j2]Ehud D. Karnin, Martin E. Hellman:
The largest super-increasing subset of a random set. IEEE Trans. Inf. Theory 29(1): 146-148 (1983) - 1982
- [j1]Robert M. Gray, Ehud D. Karnin:
Multiple local optima in vector quantizers. IEEE Trans. Inf. Theory 28(2): 256-261 (1982) - 1981
- [c2]Martin E. Hellman, Ehud D. Karnin, Justin M. Reyneri:
On the Necessity of Exhaustive Search for System-Invariant Cryptanalysis. CRYPTO 1981: 2-6 - [c1]Hamid R. Amirazizi, Ehud D. Karnin, Justin M. Reyneri:
A Polynomial Time Solution for Compact Knapsacks. CRYPTO 1981: 17-19
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 2025-11-22 05:04 CET 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:
