
Search the dblp DataBase
Ehud D. Karnin:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Hamid R. Amirazizi, Ehud D. Karnin, Justin M. Reyneri
A Polynomial Time Solution for Compact Knapsacks. [Citation Graph (0, 0)][DBLP] CRYPTO, 1981, pp:1719 [Conf]
 Martin E. Hellman, Ehud D. Karnin, Justin M. Reyneri
On the Necessity of Exhaustive Search for SystemInvariant Cryptanalysis. [Citation Graph (0, 0)][DBLP] CRYPTO, 1981, pp:26 [Conf]
 D. Chevion, Ehud D. Karnin, E. Walach
High Efficiency, Multiplication Free Approximation of Arithmetic Coding. [Citation Graph (0, 0)][DBLP] Data Compression Conference, 1991, pp:4352 [Conf]
 Ehud D. Karnin
A Parallel Algorithm for the Knapsack Problem. [Citation Graph (0, 0)][DBLP] IEEE Trans. Computers, 1984, v:33, n:5, pp:404408 [Journal]
 Robert M. Gray, Ehud D. Karnin
Multiple local optima in vector quantizers. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1982, v:28, n:2, pp:2560 [Journal]
 Ehud D. Karnin, J. W. Greene, Martin E. Hellman
On secret sharing systems. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1983, v:29, n:1, pp:3541 [Journal]
 Ehud D. Karnin, Martin E. Hellman
The largest superincreasing subset of a random set. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1983, v:29, n:1, pp:1460 [Journal]
 Justin M. Reyneri, Ehud D. Karnin
Coin flipping by telephone. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1984, v:30, n:5, pp:7750 [Journal]
Search in 0.003secs, Finished in 0.003secs
