default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAbraham Lempel
Person information
- award (2007): IEEE Richard W. Hamming Medal
- award (1997): Paris Kanellakis Award
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1996
[j50]Amnon Gavish, Abraham Lempel:
Match-length functions for data compression. IEEE Trans. Inf. Theory 42(5): 1375-1380 (1996)- 1995
- [j49]Dafna Sheinwald, Abraham Lempel, Jacob Ziv:
On Encoding and Decoding with Two-Way Head Machines. Inf. Comput. 116(1): 128-133 (1995) - 1994
- [j48]Amnon Gavish, Abraham Lempel:
On ternary complementary sequences. IEEE Trans. Inf. Theory 40(2): 522-526 (1994) - 1993
- [c6]Abraham Lempel, Gadiel Seroussi:
Application of Finte Fields to Memory Interleaving. AAECC 1993: 244-256 - [c5]Amnon Gavish, Abraham Lempel:
On Complementary Sequences. Algebraic Coding 1993: 126-140 - 1992
- [j47]Abraham Lempel, Gadiel Seroussi:
Systematic derivation of spline bases. Comput. Aided Geom. Des. 9(5): 349-363 (1992) - [j46]Ron M. Roth, Abraham Lempel:
t-sum generators of finite Abelian groups. Discret. Math. 103(3): 279-292 (1992) - [j45]Marcelo J. Weinberger, Jacob Ziv, Abraham Lempel:
On the optimal asymptotic performance of universal ordering and of discrimination of individual sequences. IEEE Trans. Inf. Theory 38(2): 380-385 (1992) - [j44]Marcelo J. Weinberger, Abraham Lempel, Jacob Ziv:
A sequential algorithm for the universal coding of finite memory sources. IEEE Trans. Inf. Theory 38(3): 1002-1014 (1992) - [c4]Marcelo J. Weinberger, Abraham Lempel, Jacob Ziv:
On the Coding Delay of a General Coder. Data Compression Conference 1992: 102-111 - 1991
- [j43]Abraham Lempel, Gadiel Seroussi:
Explicit formulas for self-complementary normal bases in certain finite fields. IEEE Trans. Inf. Theory 37(4): 1220-1222 (1991) - [c3]Dafna Sheinwald, Abraham Lempel, Jacob Ziv:
On Compression with Two-Way Head Machines. Data Compression Conference 1991: 218-227 - [c2]Marcelo J. Weinberger, Jacob Ziv, Abraham Lempel:
On the Optimal Asymptotic Performance of Universal Ordering and Discrimination of Individual Sequences. Data Compression Conference 1991: 239-246 - 1990
- [j42]Marcelo J. Weinberger, Abraham Lempel:
Factorization of symmetric circulant matrices in finite fields. Discret. Appl. Math. 28(3): 271-285 (1990) - [j41]Dafna Sheinwald, Abraham Lempel, Jacob Ziv:
Two-dimensional encoding by finite-state encoders. IEEE Trans. Commun. 38(3): 341-347 (1990) - [j40]Ron M. Roth, Abraham Lempel:
Application of circulant matrices to the construction and decoding of linear codes. IEEE Trans. Inf. Theory 36(5): 1157-1163 (1990)
1980 – 1989
- 1989
- [j39]Ron M. Roth, Abraham Lempel:
A construction of non-Reed-Solomon type MDS codes. IEEE Trans. Inf. Theory 35(3): 655-657 (1989) - [j38]Ron M. Roth, Abraham Lempel:
On MDS codes via Cauchy matrices. IEEE Trans. Inf. Theory 35(6): 1314-1319 (1989) - 1988
- [j37]Abraham Lempel, Marcelo J. Weinberger:
Self-Complementary Normal Bases in Finite Fields. SIAM J. Discret. Math. 1(2): 193-198 (1988) - [j36]Ron M. Roth, Abraham Lempel:
Composition of Reed-Solomon codes and geometric designs. IEEE Trans. Inf. Theory 34(4): 810-816 (1988) - 1986
- [j35]Tuvi Etzion, Abraham Lempel:
An Efficient Algorithm for Generating Linear Transformations in a Shuffle-Exchange Network. SIAM J. Comput. 15(1): 216-221 (1986) - [j34]Abraham Lempel, Jacob Ziv:
Compression of two-dimensional data. IEEE Trans. Inf. Theory 32(1): 2-8 (1986) - [j33]Abraham Lempel:
On multiset decipherable codes. IEEE Trans. Inf. Theory 32(5): 714-716 (1986) - 1985
- [j32]Shimon Even, Oded Goldreich
, Abraham Lempel:
A Randomized Protocol for Signing Contracts. Commun. ACM 28(6): 637-647 (1985) - [j31]Gérard D. Cohen, Abraham Lempel:
Linear intersecting codes. Discret. Math. 56(1): 35-43 (1985) - [j30]Abraham Lempel, Martin Cohn:
Design of universal test sequences for VLSI. IEEE Trans. Inf. Theory 31(1): 10-17 (1985) - 1984
- [j29]Gadiel Seroussi, Abraham Lempel:
On Symmetric Algorithms for Bilinear Forms over Finite Fields. J. Algorithms 5(3): 327-344 (1984) - [j28]Tuvi Etzion, Abraham Lempel:
Algorithms for the generation of full-length shift-register sequences. IEEE Trans. Inf. Theory 30(3): 480-484 (1984) - [j27]Tuvi Etzion, Abraham Lempel:
On the distribution of de Bruijn sequences of given complexity. IEEE Trans. Inf. Theory 30(4): 611-614 (1984) - [j26]Tuvi Etzion, Abraham Lempel:
Construction of de Bruijn sequences of minimal complexity. IEEE Trans. Inf. Theory 30(5): 705-708 (1984) - 1983
- [j25]Abraham Lempel, Gadiel Seroussi, Shmuel Winograd:
On the Complexity of Multiplication in Finite Fields. Theor. Comput. Sci. 22: 285-296 (1983) - [j24]Gadiel Seroussi, Abraham Lempel:
Maximum likelihood decoding of certain Reed - Muller codes. IEEE Trans. Inf. Theory 29(3): 448-450 (1983) - 1982
- [j23]Abraham Lempel, Martin L. Cohn:
Maximal families of bent sequences. IEEE Trans. Inf. Theory 28(6): 865-868 (1982) - [j22]Abraham Lempel, Gadiel Seroussi, Jacob Ziv:
On the power of straight- line computations in finite fields. IEEE Trans. Inf. Theory 28(6): 875-879 (1982) - [j21]Abraham Lempel, Martin L. Cohn:
Look-ahead coding for input- restricted channels. IEEE Trans. Inf. Theory 28(6): 933-937 (1982) - [c1]Shimon Even, Oded Goldreich, Abraham Lempel:
A Randomized Protocol for Signing Contracts. CRYPTO 1982: 205-210 - 1980
- [j20]Gadiel Seroussi, Abraham Lempel:
Factorization of Symmetric Matrices and Trace-Orthogonal Bases in Finite Fields. SIAM J. Comput. 9(4): 758-767 (1980)
1970 – 1979
- 1979
- [j19]Abraham Lempel:
Cryptology in Transition. ACM Comput. Surv. 11(4): 285-303 (1979) - 1978
- [j18]Jacob Ziv, Abraham Lempel:
Compression of individual sequences via variable-rate coding. IEEE Trans. Inf. Theory 24(5): 530-536 (1978) - 1977
- [j17]Abraham Lempel, Martin Cohn, Willard L. Eastman:
A class of balanced binary sequences with optimal autocorrelation properties. IEEE Trans. Inf. Theory 23(1): 38-42 (1977) - [j16]Martin Cohn, Abraham Lempel:
On fast M-sequence transforms (Corresp.). IEEE Trans. Inf. Theory 23(1): 135-137 (1977) - [j15]Jacob Ziv, Abraham Lempel:
A universal algorithm for sequential data compression. IEEE Trans. Inf. Theory 23(3): 337-343 (1977) - [j14]Abraham Lempel, Shmuel Winograd:
A new approach to error-correcting codes. IEEE Trans. Inf. Theory 23(4): 503-508 (1977) - 1976
- [j13]Abraham Lempel, Jacob Ziv:
On the Complexity of Finite Sequences. IEEE Trans. Inf. Theory 22(1): 75-81 (1976) - 1975
- [j12]Abraham Lempel:
Matrix Factorization Over GF(2) and Trace-Orthogonal Bases of GF(2n). SIAM J. Comput. 4(2): 175-186 (1975) - [j11]Martin Cohn, Abraham Lempel:
Difference codes with desirable spectral properties (Corresp.). IEEE Trans. Inf. Theory 21(5): 593-596 (1975) - 1974
- [j10]Frank Harary, Abraham Lempel:
On clique-extremal (p, q)-graphs. Networks 4(4): 371-378 (1974) - [j9]Abraham Lempel, Haim Greenberger:
Families of sequences with optimal Hamming-correlation properties. IEEE Trans. Inf. Theory 20(1): 90-94 (1974) - 1973
- [j8]Abraham Lempel, Shimon Even, Martin Cohn:
An algorithm for optimal prefix parsing of a noiseless and memoryless channel. IEEE Trans. Inf. Theory 19(2): 208-214 (1973) - 1972
- [j7]Shimon Even, Abraham Lempel:
Generation and Enumeration of All Solutions of the Characteristic Sum Condition. Inf. Control. 21(5): 476-482 (1972) - [j6]Shimon Even, Amir Pnueli, Abraham Lempel:
Permutation Graphs and Transitive Graphs. J. ACM 19(3): 400-410 (1972) - [j5]Martin Cohn, Abraham Lempel:
Cycle Decomposition by Disjoint Transpositions. J. Comb. Theory A 13(1): 83-89 (1972) - 1971
- [j4]Abraham Lempel, Willard L. Eastman:
High Speed Generation of Maximal Length Sequences. IEEE Trans. Computers 20(2): 227-229 (1971) - [j3]Abraham Lempel:
Analysis and synthesis of polynomials and sequences over GF(2). IEEE Trans. Inf. Theory 17(3): 297-303 (1971) - 1970
- [j2]Abraham Lempel:
On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers. IEEE Trans. Computers 19(12): 1204-1209 (1970)
1960 – 1969
- 1969
- [j1]Abraham Lempel:
On k-Stable Feedback Shift Registers. IEEE Trans. Computers 18(7): 652-660 (1969)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
