Search the dblp DataBase
Abraham Lempel :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Jacob Ziv , Abraham Lempel A Universal Algorithm for Sequential Data Compression. [Citation Graph (11, 0)][DBLP ] IEEE Transactions on Information Theory, 1977, v:23, n:3, pp:337-343 [Journal ] Jacob Ziv , Abraham Lempel Compression of Individual Sequences via Variable-Rate Coding. [Citation Graph (9, 0)][DBLP ] IEEE Transactions on Information Theory, 1978, v:24, n:5, pp:530-536 [Journal ] Shimon Even , Oded Goldreich , Abraham Lempel A Randomized Protocol for Signing Contracts. [Citation Graph (1, 0)][DBLP ] Commun. ACM, 1985, v:28, n:6, pp:637-647 [Journal ] Abraham Lempel Cryptology in Transition. [Citation Graph (1, 0)][DBLP ] ACM Comput. Surv., 1979, v:11, n:4, pp:285-303 [Journal ] Abraham Lempel , Gadiel Seroussi Application of Finte Fields to Memory Interleaving. [Citation Graph (0, 0)][DBLP ] AAECC, 1993, pp:244-256 [Conf ] Shimon Even , Oded Goldreich , Abraham Lempel A Randomized Protocol for Signing Contracts. [Citation Graph (0, 0)][DBLP ] CRYPTO, 1982, pp:205-210 [Conf ] Dafna Sheinwald , Abraham Lempel , Jacob Ziv On Compression with Two-Way Head Machines. [Citation Graph (0, 0)][DBLP ] Data Compression Conference, 1991, pp:218-227 [Conf ] Marcelo J. Weinberger , Abraham Lempel , Jacob Ziv On the Coding Delay of a General Coder. [Citation Graph (0, 0)][DBLP ] Data Compression Conference, 1992, pp:102-111 [Conf ] Marcelo J. Weinberger , Jacob Ziv , Abraham Lempel On the Optimal Asymptotic Performance of Universal Ordering and Discrimination of Individual Sequences. [Citation Graph (0, 0)][DBLP ] Data Compression Conference, 1991, pp:239-246 [Conf ] Amnon Gavish , Abraham Lempel On Complementary Sequences. [Citation Graph (0, 0)][DBLP ] Algebraic Coding, 1993, pp:126-140 [Conf ] Abraham Lempel , Gadiel Seroussi Systematic derivation of spline bases. [Citation Graph (0, 0)][DBLP ] Computer Aided Geometric Design, 1992, v:9, n:5, pp:349-363 [Journal ] Shimon Even , Abraham Lempel Generation and Enumeration of All Solutions of the Characteristic Sum Condition [Citation Graph (0, 0)][DBLP ] Information and Control, 1972, v:21, n:5, pp:476-482 [Journal ] Dafna Sheinwald , Abraham Lempel , Jacob Ziv On Encoding and Decoding with Two-Way Head Machines [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1995, v:116, n:1, pp:128-133 [Journal ] Shimon Even , Amir Pnueli , Abraham Lempel Permutation Graphs and Transitive Graphs. [Citation Graph (0, 0)][DBLP ] J. ACM, 1972, v:19, n:3, pp:400-410 [Journal ] Gadiel Seroussi , Abraham Lempel On Symmetric Algorithms for Bilinear Forms over Finite Fields. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1984, v:5, n:3, pp:327-344 [Journal ] Martin Cohn , Abraham Lempel Cycle Decomposition by Disjoint Transpositions. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1972, v:13, n:1, pp:83-89 [Journal ] Tuvi Etzion , Abraham Lempel An Efficient Algorithm for Generating Linear Transformations in a Shuffle-Exchange Network. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1986, v:15, n:1, pp:216-221 [Journal ] Abraham Lempel Matrix Factorization Over GF(2) and Trace-Orthogonal Bases of GF(2^n). [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1975, v:4, n:2, pp:175-186 [Journal ] Gadiel Seroussi , Abraham Lempel Factorization of Symmetric Matrices and Trace-Orthogonal Bases in Finite Fields. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1980, v:9, n:4, pp:758-767 [Journal ] Abraham Lempel , Marcelo J. Weinberger Self-Complementary Normal Bases in Finite Fields. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1988, v:1, n:2, pp:193-198 [Journal ] Abraham Lempel , Gadiel Seroussi , Shmuel Winograd On the Complexity of Multiplication in Finite Fields. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1983, v:22, n:, pp:285-296 [Journal ] Tuvi Etzion , Abraham Lempel Algorithms for the generation of full-length shift-register sequences. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1984, v:30, n:3, pp:480-484 [Journal ] Tuvi Etzion , Abraham Lempel On the distribution of de Bruijn sequences of given complexity. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1984, v:30, n:4, pp:611-614 [Journal ] Tuvi Etzion , Abraham Lempel Construction of de Bruijn sequences of minimal complexity. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1984, v:30, n:5, pp:705-708 [Journal ] Amnon Gavish , Abraham Lempel On ternary complementary sequences. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1994, v:40, n:2, pp:522-0 [Journal ] Amnon Gavish , Abraham Lempel Match-length functions for data compression. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1375-1380 [Journal ] Abraham Lempel On multiset decipherable codes. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1986, v:32, n:5, pp:714-0 [Journal ] Abraham Lempel , Martin L. Cohn Maximal families of bent sequences. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1982, v:28, n:6, pp:865-868 [Journal ] Abraham Lempel , Martin L. Cohn Look-ahead coding for input- restricted channels. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1982, v:28, n:6, pp:933-0 [Journal ] Abraham Lempel , Martin Cohn Design of universal test sequences for VLSI. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1985, v:31, n:1, pp:10-17 [Journal ] Abraham Lempel , Gadiel Seroussi Explicit formulas for self-complementary normal bases in certain finite fields. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1991, v:37, n:4, pp:1220-0 [Journal ] Abraham Lempel , Gadiel Seroussi , Jacob Ziv On the power of straight- line computations in finite fields. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1982, v:28, n:6, pp:875-879 [Journal ] Abraham Lempel , Jacob Ziv Compression of two-dimensional data. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1986, v:32, n:1, pp:2-8 [Journal ] Ron M. Roth , Abraham Lempel Composition of Reed-Solomon codes and geometric designs. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1988, v:34, n:4, pp:810-816 [Journal ] Ron M. Roth , Abraham Lempel A construction of non-Reed-Solomon type MDS codes. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1989, v:35, n:3, pp:655-0 [Journal ] Ron M. Roth , Abraham Lempel On MDS codes via Cauchy matrices. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1989, v:35, n:6, pp:1314-0 [Journal ] Ron M. Roth , Abraham Lempel Application of circulant matrices to the construction and decoding of linear codes. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1990, v:36, n:5, pp:1157-0 [Journal ] Gadiel Seroussi , Abraham Lempel Maximum likelihood decoding of certain Reed - Muller codes. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1983, v:29, n:3, pp:448-0 [Journal ] Marcelo J. Weinberger , Abraham Lempel , Jacob Ziv A sequential algorithm for the universal coding of finite memory sources. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1992, v:38, n:3, pp:1002-1014 [Journal ] Marcelo J. Weinberger , Jacob Ziv , Abraham Lempel On the optimal asymptotic performance of universal ordering and of discrimination of individual sequences. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1992, v:38, n:2, pp:380-385 [Journal ] Gérard D. Cohen , Abraham Lempel Linear intersecting codes. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1985, v:56, n:1, pp:35-43 [Journal ] Ron M. Roth , Abraham Lempel t-sum generators of finite Abelian groups. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1992, v:103, n:3, pp:279-292 [Journal ] Factorization of symmetric circulant matrices in finite fields. [Citation Graph (, )][DBLP ] Search in 0.005secs, Finished in 0.007secs