Compression Bounds
Compression Bounds is a theoretical construct in lossless data compression that specifies the fundamental limits on the achievable compression ratio for a given source, distinguishing itself by quantifying the minimum average codeword length attainable under optimal encoding.
305
Publications
16.7K
Citations
543
Authors
274
Institutions
Publications per year
2017–2026
62
Parents
305
Opportunistic data structures with applications
Paolo Ferragina, Giovanni Manzini · 2002 · 1.1K citations
Compressed representations of sequences and full-text indexes
Paolo Ferragina, Giovanni Manzini, Veli Mäkinen et al. · ACM Transactions on Algorithms · 2007 · 382 citations
1–5 of 305
543
12
h-index
10
h-index
8
h-index
7
h-index
7
h-index
1–5 of 543
274
Technion – Israel Institute of Technology
Haifa, Israel
16 h-index
33 publications
1.7K citations
Argonne National Laboratory
Lemont, United States
12 h-index
32 publications
1.8K citations
University of California, Berkeley
Berkeley, United States
11 h-index
18 publications
620 citations
Stanford University
Stanford, United States
10 h-index
18 publications
931 citations

University of Waterloo
Waterloo, Canada
9 h-index
10 publications
707 citations
University of California, Riverside
Riverside, United States
9 h-index
19 publications
1.4K citations
Massachusetts Institute of Technology
Cambridge, United States
9 h-index
15 publications
454 citations
Princeton University
Princeton, United States
9 h-index
12 publications
900 citations
1–8 of 274
62 publications · 5K citations
32
h-index
Repository · 20 publications · 499 citations
13
h-index
5 publications · 457 citations
5
h-index
JACM · 5 publications · 850 citations
5
h-index
Repository · 4 publications · 121 citations
4
h-index
1–5