Ehud D. Karnin

Eugene Walach

Tal Drory

Proceedings of the Current Trends in Web Engineering, 2010

1994

A new improved collage theorem with applications to multiresolution fractal image coding.

[BibT_eX]

[DOI]

Proceedings of ICASSP '94: IEEE International Conference on Acoustics, 1994

1991

High Efficiency, Multiplication Free Approximation of Arithmetic Coding.

[BibT_eX]

[DOI]

Dan Chevion

Eugene Walach

Proceedings of the IEEE Data Compression Conference, 1991

1990

A simple procedure for pruning back-propagation trained neural networks.

[BibT_eX]

[DOI]

IEEE Trans. Neural Networks, 1990

1986

A fractal based approach to image compression.

[BibT_eX]

[DOI]

Eugene Walach

Proceedings of the IEEE International Conference on Acoustics, 1986

1984

Coin flipping by telephone.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1984

A Parallel Algorithm for the Knapsack Problem.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1984

1983

The largest super-increasing subset of a random set.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1983

On secret sharing systems.

[BibT_eX]

[DOI]

J. W. Greene

IEEE Trans. Inf. Theory, 1983

On the necessity of cryptanalytic exhaustive search.

[BibT_eX]

[DOI]

SIGACT News, 1983

Compact knapsacks are polynomially solvable.

[BibT_eX]

[DOI]

Hamid R. Amirazizi

SIGACT News, 1983

1982

Multiple local optima in vector quantizers.

[BibT_eX]

[DOI]

Robert M. Gray

IEEE Trans. Inf. Theory, 1982

1981

On the Necessity of Exhaustive Search for System-Invariant Cryptanalysis.

[BibT_eX]

Proceedings of the Advances in Cryptology: A Report on CRYPTO 81, 1981

A Polynomial Time Solution for Compact Knapsacks.

[BibT_eX]

Hamid R. Amirazizi