World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
44
Citations
31880
World Ranking
7343
National Ranking
122

Research.com Recognitions

  • 2021 - IEEE Medal of Honor For fundamental contributions to information theory and data compression technology, and for distinguished research leadership.”
  • 2008 - BBVA Foundation Frontiers of Knowledge Award
  • 2004 - Member of the National Academy of Sciences
  • 1998 - Fellow of the American Academy of Arts and Sciences
  • 1997 - ACM Paris Kanellakis Theory and Practice Award Data Compression
  • 1997 - IEEE Claude E. Shannon Award
  • 1995 - IEEE Richard W. Hamming Medal "For contributions to information theory, and the theory and practice of data compression."
  • 1988 - Member of the National Academy of Engineering For major contributions to information theory, and for outstanding leadership in engineering education.

Overview

What is he best known for?

The fields of study he is best known for:

  • Statistics
  • Algorithm
  • Random variable

His primary areas of study are Discrete mathematics, Encoder, Combinatorics, Sequence and Information theory. The concepts of his Discrete mathematics study are interwoven with issues in Communication theory and Context-adaptive binary arithmetic coding. He interconnects Algorithm and Coding in the investigation of issues within Encoder.

His Combinatorics research is multidisciplinary, incorporating perspectives in Rate distortion, Function, Random variable and Distortion. His Sequence study integrates concerns from other disciplines, such as Asymptotically optimal algorithm, Randomness and Substring. As part of one scientific family, Jacob Ziv deals mainly with the area of Information theory, narrowing it down to issues related to the Entropy, and often Data compression.

His most cited work include:

  • A universal algorithm for sequential data compression (4763 citations)
  • Compression of individual sequences via variable-rate coding (3067 citations)
  • The rate-distortion function for source coding with side information at the decoder (2904 citations)

What are the main themes of his work throughout his whole career to date?

Algorithm, Data compression, Discrete mathematics, Combinatorics and Encoder are his primary areas of study. His studies in Algorithm integrate themes in fields like Classifier, Theoretical computer science and Communication channel. His work on Lossless compression as part of general Data compression study is frequently connected to Data compression ratio, therefore bridging the gap between diverse disciplines of science and establishing a new relationship between them.

His Discrete mathematics research includes elements of Function, Sequence and Rate–distortion theory. His studies deal with areas such as Upper and lower bounds, Distortion and Random variable as well as Combinatorics. His work is dedicated to discovering how Encoder, Asymptotically optimal algorithm are connected with Ergodic theory and other disciplines.

He most often published in these fields:

  • Algorithm (35.48%)
  • Data compression (34.41%)
  • Discrete mathematics (27.96%)

What were the highlights of his more recent work (between 2001-2021)?

  • Algorithm (35.48%)
  • Sequence (19.35%)
  • Encoder (21.51%)

In recent papers he was focusing on the following fields of study:

His primary scientific interests are in Algorithm, Sequence, Encoder, Data compression and Decoding methods. The various areas that Jacob Ziv examines in his Algorithm study include Classifier, Entropy, Theoretical computer science and Mutual information. His study in Sequence is interdisciplinary in nature, drawing from both Discrete mathematics, Sublinear function, Measure and Markov process.

He focuses mostly in the field of Discrete mathematics, narrowing it down to topics relating to Rate–distortion theory and, in certain cases, Combinatorics. His study deals with a combination of Data compression and Pseudorandom binary sequence. His Turbo code study in the realm of Decoding methods connects with subjects such as Concatenation.

Between 2001 and 2021, his most popular works were:

  • Extremes of information combining (82 citations)
  • On the Wyner-Ziv problem for individual sequences (26 citations)
  • The Universal LZ77 Compression Algorithm Is Essentially Optimal for Individual Finite-Length $N$ -Blocks (15 citations)

In his most recent research, the most cited papers focused on:

  • Statistics
  • Algorithm
  • Topology

His scientific interests lie mostly in Algorithm, Data compression, Decoding methods, Encoder and Pseudorandom binary sequence. In his study, Pattern matching is inextricably linked to Entropy, which falls within the broad field of Algorithm. His studies link Discrete mathematics with Data compression.

His Decoding methods research incorporates themes from Iterative method, Mutual information and Combinatorics. His Combinatorics study combines topics from a wide range of disciplines, such as Sequence, Block code, Rate–distortion theory and Universal code. His Encoder research includes elements of Lossless compression, Statistical classification and Adaptive algorithm.

Best Publications

  • A universal algorithm for sequential data compression

    J. Ziv;A. Lempel

  • Compression of individual sequences via variable-rate coding

    J. Ziv;A. Lempel

  • The rate-distortion function for source coding with side information at the decoder

    A. Wyner;J. Ziv

  • On the Complexity of Finite Sequences

    A. Lempel;J. Ziv

  • Some lower bounds on signal parameter estimation

    J. Ziv;M. Zakai

  • A theorem on the entropy of certain binary sequences and applications--II

    A. Wyner;J. Ziv

  • Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression

    A.D. Wyner;J. Ziv

  • Apparatus and method for compressing data signals and restoring the compressed data signals

    Willard L. Eastman;Abraham Lempel;Jacob Ziv;Martin Cohn

  • Transmission of noisy information to a noisy receiver with minimum distortion

    J. Wolf;J. Ziv

  • Compression of two-dimensional data

    A. Lempel;J. Ziv

  • Improved Lower Bounds on Signal Parameter Estimation

    D. Chazan;M. Zakai;J. Ziv

  • Source coding for multiple descriptions

    J. K. Wolf;A. D. Wyner;J. Ziv

  • Coding theorems for individual sequences

    J. Ziv

  • When is the generalized likelihood ratio test optimal

    O. Zeitouni;J. Ziv;N. Merhav

  • A measure of relative entropy between individual sequences with application to universal classification

    J. Ziv;N. Merhav

  • On classification with empirically observed statistics and universal data compression

    J. Ziv

  • Mutual information of the white Gaussian channel with and without feedback

    T. Kadota;M. Zakai;J. Ziv

  • Universal decoding for finite-state channels

    J. Ziv

  • On the estimation of the order of a Markov chain and universal data compression

    N. Merhav;M. Gutman;J. Ziv

  • Upper bounds on the probability of sequences emitted by finite-state sources and on the redundancy of the Lempel-Ziv algorithm

    E. Plotnik;M.J. Weinberger;J. Ziv

  • The sliding-window Lempel-Ziv algorithm is asymptotically optimal

    A.D. Wyner;J. Ziv

Frequent Co-Authors

Neri Merhav
Neri Merhav Technion – Israel Institute of Technology
A.D. Wyner
A.D. Wyner Nokia (United States)
A. Lempel
A. Lempel Technion – Israel Institute of Technology
Jack K. Wolf
Jack K. Wolf University of California, San Diego
Yossi Matias
Yossi Matias Google (United States)
Shlomo Shamai
Shlomo Shamai Technion – Israel Institute of Technology
Subbaratnam Muthukrishnan
Subbaratnam Muthukrishnan Kansas State University
Martin Farach
Martin Farach New York University
János Körner
János Körner Sapienza University of Rome

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Pursuing Computer Science in the USA opens doors to diverse online degrees and career pathways. For those aiming to advance their leadership and management skills, an executive online mba offers a flexible way to gain business expertise crucial for tech-driven industries.

If your interests extend to information organization, an mlis degree (Master of Library and Information Science) can lead to IT-oriented roles in libraries, archives, and research organizations.

Affordability also matters. Many students opt for programs listed among the least expensive online masters, enabling them to gain advanced credentials without accumulating significant debt.

For those interested in higher-level leadership, a doctorate in organizational leadership online prepares graduates for executive and academic roles. These degrees support various pathways, whether you focus on technology, management, research, or education—expanding your career options in the digital age.

Best Scientists Citing Jacob Ziv

Trending Scientists

Recently Published Articles