Compressed Data Structures is a data organization method that belongs to the class of space-efficient algorithmic constructs, distinguished by its design to represent data in a compact form while supporting efficient query operations without full decompression.
340
Publications
18.6K
Citations
761
Authors
308
Institutions
Publications per year
2017–2026
65
Publications
340
J. Nievergelt, Hans Hinterberger, Kenneth C. Sevcik · ACM Transactions on Database Systems · 1984 · 1.1K citations · Full text
Opportunistic data structures with applications
Paolo Ferragina, Giovanni Manzini · 2002 · 1.1K citations
Paolo Ferragina, Giovanni Manzini · Journal of the ACM · 2005 · 715 citations
1–5 of 340
Authors
761
- GN
12
h-index
- RG
10
h-index
- JS
10
h-index
- WH
9
h-index
- PF
9
h-index
1–5 of 761
Institutions
308
University of Pisa
Pisa, Italy
17 h-index
33 publications
3.6K citations
University of Chile
Santiago, Chile
15 h-index
25 publications
1K citations
University of Helsinki
Helsinki, Finland
10 h-index
17 publications
725 citations
Kyushu University
Fukuoka, Japan
10 h-index
11 publications
908 citations
Purdue University West Lafayette
West Lafayette, United States
10 h-index
21 publications
803 citations
Universidade da Coruña
A Coruña, Spain
10 h-index
24 publications
543 citations
Universidad de Valladolid
Valladolid, Spain
8 h-index
17 publications
359 citations
Tsinghua University
Beijing, China
8 h-index
31 publications
679 citations
1–8 of 308
Venues
- arXiv (Cornell University)
Repository · 8 publications · 375 citations
8
h-index
- Theoretical Computer Science
7 publications · 264 citations
7
h-index
- ACM Journal of Experimental Algorithmics
JEA · 6 publications · 314 citations
6
h-index
- Proceedings of the VLDB Endowment
PVLDB · 5 publications · 204 citations
5
h-index
- Algorithmica
5 publications · 268 citations
5
h-index
1–5