A Polynomial Time Solution for Compact Knapsacks. - Hamid R. Amirazizi; Ehud D. Karnin; Justin M. Reyneri (CRYPTO, 1981)

On the Necessity of Exhaustive Search for System-Invariant Cryptanalysis. - Martin E. Hellman; Ehud D. Karnin; Justin M. Reyneri (CRYPTO, 1981)

Multiple local optima in vector quantizers. - Robert M. Gray; Ehud D. Karnin (IEEE Trans. Inf. Theory, 1982)

Compact knapsacks are polynomially solvable. - Hamid R. Amirazizi; Ehud D. Karnin; Justin M. Reyneri (SIGACT News, 1983)

On the necessity of cryptanalytic exhaustive search. - Martin E. Hellman; Ehud D. Karnin; Justin M. Reyneri (SIGACT News, 1983)

On secret sharing systems. - Ehud D. Karnin; J. W. Greene; Martin E. Hellman (IEEE Trans. Inf. Theory, 1983)

The largest super-increasing subset of a random set. - Ehud D. Karnin; Martin E. Hellman (IEEE Trans. Inf. Theory, 1983)

A Parallel Algorithm for the Knapsack Problem. - Ehud D. Karnin (IEEE Trans. Computers, 1984)

Coin flipping by telephone. - Justin M. Reyneri; Ehud D. Karnin (IEEE Trans. Inf. Theory, 1984)

A fractal based approach to image compression. - Eugene Walach; Ehud D. Karnin (ICASSP, 1986)

A simple procedure for pruning back-propagation trained neural networks. - Ehud D. Karnin (IEEE Trans. Neural Networks, 1990)

High Efficiency, Multiplication Free Approximation of Arithmetic Coding. - Dan Chevion; Ehud D. Karnin; Eugene Walach (Data Compression Conference, 1991)

A new improved collage theorem with applications to multiresolution fractal image coding. - Geir E. Øien; Zachi Baharav; Skjalg Lepsøy; Ehud D. Karnin (ICASSP (5), 1994)

Crowdsourcing in the Document Processing Practice - (A Short Practitioner/Visionary Paper). - Ehud D. Karnin; Eugene Walach; Tal Drory (ICWE Workshops, 2010)