Compression Algorithms
Compression Algorithm is a computational method designed to reduce the size of data representations without loss of information by exploiting statistical redundancies and structural patterns inherent in the data.
2.6K
Publications
152.8K
Citations
5.9K
Authors
1.7K
Institutions
Publications per year
2017–2026
550
Variants
Compression Algorithm
Parents
2.6K
Arithmetic coding for data compression
Ian H. Witten, Radford M. Neal, John G. Cleary · Communications of the ACM · 1987 · 2.9K citations · Full text
Robert M. Gray · Elsevier eBooks · 1984 · 2.4K citations · Full text
A Block-sorting Lossless Data Compression Algorithm
Michael T. Burrows, D. J. Wheeler · 1994 · 2.4K citations
1–5 of 2.6K
5.9K
18
h-index
17
h-index
16
h-index
13
h-index
13
h-index
1–5 of 5.9K
1.7K

The University of Melbourne
Melbourne, Australia
24 h-index
49 publications
3.3K citations
University of Illinois Urbana-Champaign
Urbana, United States
22 h-index
56 publications
4.1K citations

University of Pisa
Pisa, Italy
21 h-index
45 publications
4.9K citations
Technion – Israel Institute of Technology
Haifa, Israel
21 h-index
53 publications
14.7K citations
Princeton University
Princeton, United States
21 h-index
51 publications
10.8K citations
École Polytechnique Fédérale de Lausanne
Lausanne, Switzerland
21 h-index
49 publications
3.3K citations
Stanford University
Stanford, United States
21 h-index
73 publications
7.2K citations
AT&T (United States)
Bedminster, United States
20 h-index
45 publications
4K citations
1–8 of 1.7K
64 publications · 14.3K citations
37
h-index
40 publications · 4.1K citations
26
h-index
Repository · 46 publications · 2.5K citations
22
h-index
23 publications · 1.8K citations
19
h-index
50 publications · 2K citations
18
h-index
1–5