 | 1991 |
|---|
| 8 |       | D. Chevion,
Ehud D. Karnin,
E. Walach:
High Efficiency, Multiplication Free Approximation of Arithmetic Coding.
Data Compression Conference 1991: 43-52 |
| 1984 |
|---|
| 7 | | Ehud D. Karnin:
A Parallel Algorithm for the Knapsack Problem.
IEEE Trans. Computers 33(5): 404-408 (1984) |
| 6 | | Justin M. Reyneri,
Ehud D. Karnin:
Coin flipping by telephone.
IEEE Transactions on Information Theory 30(5): 775- (1984) |
| 1983 |
|---|
| 5 | | Ehud D. Karnin,
Martin E. Hellman:
The largest super-increasing subset of a random set.
IEEE Transactions on Information Theory 29(1): 146- (1983) |
| 4 | | Ehud D. Karnin,
J. W. Greene,
Martin E. Hellman:
On secret sharing systems.
IEEE Transactions on Information Theory 29(1): 35-41 (1983) |
| 1982 |
|---|
| 3 | | Robert M. Gray,
Ehud D. Karnin:
Multiple local optima in vector quantizers.
IEEE Transactions on Information Theory 28(2): 256- (1982) |
| 1981 |
|---|
| 2 | | Hamid R. Amirazizi,
Ehud D. Karnin,
Justin M. Reyneri:
A Polynomial Time Solution for Compact Knapsacks.
CRYPTO 1981: 17-19 |
| 1 | | Martin E. Hellman,
Ehud D. Karnin,
Justin M. Reyneri:
On the Necessity of Exhaustive Search for System-Invariant Cryptanalysis.
CRYPTO 1981: 2-6 |
