Abraham Lempel | Academic Influence

Abraham Lempel's AcademicInfluence.com Rankings

Abraham Lempel

Computer Science

#246

World Rank

#257

Historical Rank

Algorithms

#9

World Rank

#9

Historical Rank

computer-science Degrees

Abraham Lempel

Mathematics

#2151

World Rank

#3363

Historical Rank

Measure Theory

#1215

World Rank

#1545

Historical Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

Abraham Lempel's Degrees

PhD Mathematics Technion – Israel Institute of Technology
Bachelors Mathematics Technion – Israel Institute of Technology

Similar Degrees You Can Earn

Best Online Bachelor's in Math 2025

Why Is Abraham Lempel Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Abraham Lempel was an Israeli computer scientist and one of the fathers of the LZ family of lossless data compression algorithms. Biography Lempel was born on 10 February 1936 in Lwów, Poland . He studied at Technion - Israel Institute of Technology, and received a B.Sc. in 1963, an M.Sc. in 1965, and a D.Sc. in 1967. Since 1977 he held the title of full professor, and was a professor emeritus at Technion.

(See a Problem?)

Abraham Lempel's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

A universal algorithm for sequential data compression (1977) (5559)
Compression of individual sequences via variable-rate coding (1978) (3576)
On the Complexity of Finite Sequences (1976) (2374)
A randomized protocol for signing contracts (1985) (1469)
Families of sequences with optimal Hamming-correlation properties (1974) (290)
Transitive Orientation of Graphs and Identification of Permutation Graphs (1971) (274)
Compression of two-dimensional data (1986) (195)
Permutation Graphs and Transitive Graphs (1972) (176)
A class of balanced binary sequences with optimal autocorrelation properties (1977) (156)
On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers (1970) (144)
On fast M-sequence transforms (Corresp.) (1977) (116)
A sequential algorithm for the universal coding of finite memory sources (1992) (95)
Factorization of Symmetric Matrices and Trace-Orthogonal Bases in Finite Fields (1980) (92)
Algorithms for the generation of full-length shift-register sequences (1984) (90)
On MDS codes via Cauchy matrices (1989) (82)
A new approach to error-correcting codes (1977) (68)
Cryptology in Transition (1979) (65)
Maximal families of bent sequences (1982) (64)
Minimum Feedback Arc and Vertex Sets of a Directed Graph (1966) (63)
Matrix Factorization Over GF(2) and Trace-Orthogonal Bases of GF(2n) (1975) (59)
Linear intersecting codes (1984) (56)
On the Complexity of Multiplication in Finite Fields (1983) (56)
High Speed Generation of Maximal Length Sequences (1971) (55)
Cycle Decomposition by Disjoint Transpositions (1972) (54)
Self-Complementary Normal Bases in Finite Fields (1988) (54)
On ternary complementary sequences (1994) (52)
Construction of de Bruijn sequences of minimal complexity (1984) (49)
Design of universal test sequences for VLSI (1985) (45)
Compression of Two-Dimensional Images (1985) (41)
m-ary closed sequences (1971) (39)
On multiset decipherable codes (1986) (33)
Look-ahead coding for input- restricted channels (1982) (29)
An algorithm for optimal prefix parsing of a noiseless and memoryless channel (1973) (28)
On the distribution of de Bruijn sequences of given complexity (1984) (28)
A construction of non-Reed-Solomon type MDS codes (1989) (26)
Characterization and synthesis of self-complementary normal bases in finite fields (1988) (25)
Two-dimensional encoding by finite-state encoders (1990) (22)
Generation and Enumeration of All Solutions of the Characteristic Sum Condition (1972) (21)
Hadamard and M-Sequence transforms are permutationally similar. (1979) (20)
On Complementary Sequences (1993) (19)
Match-length functions for data compression (1994) (18)
On extremal factors of the de Bruijn graph (1971) (15)
On Encoding and Decoding with Two-Way Head Machines (1995) (14)
An Efficient Algorithm for Generating Linear Transformations in a Shuffle-Exchange Network (1986) (13)
Maximum likelihood decoding of certain Reed - Muller codes (1983) (12)
Interpolation in the Network Sense (1966) (11)
On Symmetric Representations of Finite Fields (1983) (11)
Analysis and synthesis of polynomials and sequences over GF(2) (1971) (10)
On the power of straight- line computations in finite fields (1982) (10)
Application of circulant matrices to the construction and decoding of linear codes (1990) (9)
On a Problem of Diagnosis (1967) (9)
On a Homomorphism of thede Bruijn Graph and ItsApplications totheDesign of Feedback ShiftRegisters (1970) (9)
Parallel Interconnection of n-Port Networks (1967) (9)
On k-Stable Feedback Shift Registers (1969) (8)
The K Matrix of n-Port Networks: Analysis and Synthesis (1969) (7)
Terminal Configurations of n-Port Networks (1968) (7)
A Note on Interpolation (1967) (7)
Explicit Formulas For Self-complementary Normal Bases In Certain Finite Fields (1991) (6)
t-sum generators of finite Abelian groups (1992) (6)
Systematic derivation of spline bases (1992) (5)
On Symmetric Algorithms for Bilinear Forms over Finite Fields (1984) (5)
On compression with two-way head machines (1991) (4)
Compression of pictures by finite state encoders (1990) (4)
On clique-extremal (p, q)-graphs (1974) (4)
Second Order Polynomial Recursions (1977) (3)
Factorization of symmetric circulant matrices in finite fields (1990) (3)
A Randomized Protocol for (2)
Composition of Reed-Solomon codes and geometric designs (1988) (2)
On the Minimal Synthesis of One Terminal-Pair Contact Networks (1966) (1)
A Note on Orientation of Graphs (1968) (1)
The Stability of Counting Sequences Under Stage Delays (1971) (1)
On the coding delay of a general coder (1992) (1)
Author's reply to Comments on 'On the Determination of Minimum Feedback Arc and Vertex Sets' (1968) (1)
Internal structure and parametric representation of equivalent resistive n-port networks (1968) (0)
On The Optimal Asymptotic Performance Of Universal Ordering And Discrimination Of Individual Sequences (1991) (0)
Device for memory interleave and method for the same (1992) (0)
Author's reply to Comments on 'On Double Contact Switching Functions and their Realization' (1968) (0)
On the Minimal Svnthesis of . One Terminal -Pair Co&act Networks (1966) (0)
Difference codes with desirable spectral properties (Corresp.) (1975) (0)
Monotonicity-Based Fast Algorithms for MAP Estimation of Markov Sequences Over Noisy Channels (2004) (0)
On the Derivation of Spline Bases (1993) (0)
Method and apparatus for managing multiple dictionaries for data compression by content addressing (1993) (0)
Application of Finte Fields to Memory Interleaving (1993) (0)
Data compression method using dictionaries less for application to network packets (1993) (0)
United States Patent ( 19 ) Chu ( 54 ) MULTI-CODEBOOK CODING PROCESS 75 ) (2017) (0)

This paper list is powered by the following services:

Other Resources About Abraham Lempel

en.wikipedia.org

What Schools Are Affiliated With Abraham Lempel?

Abraham Lempel is affiliated with the following schools:

Image Attributions

Image Source for Abraham Lempel