Succinct Dynamic Data Structures
Succinct Dynamic Data Structures is a dynamic data structure that supports efficient updates and queries while using space close to the information-theoretic lower bound for the data it represents.
8
Publications
233
Citations
23
Authors
20
Institutions
Publications per year
2017–2026
2
Parents
8
Dynamic data structures for fat objects and their applications
Alon Efrat, Matthew J. Katz, Frank Nielsen et al. · Computational Geometry · 2000 · 53 citations
Compressed Dynamic Binary Relations
Nieves R. Brisaboa, Guillermo de Bernardo, Gonzalo Navarro · 2012 · 21 citations
1–5 of 8
23
2
h-index
2
h-index
1
h-index
1
h-index
1
h-index
1–5 of 23
20
New York University
New York, United States
2 h-index
2 publications
76 citations

Tel Aviv University
Tel Aviv, Israel
2 h-index
5 publications
175 citations

University of Waterloo
Waterloo, Canada
2 h-index
3 publications
117 citations
Courant Institute of Mathematical Sciences
New York, United States
2 h-index
2 publications
76 citations
Wuhan University
Wuhan, China
1 h-index
1 publications
31 citations

Federico Santa María Technical University
Valparaíso, Chile
1 h-index
1 publications
17 citations
University of Chile
Santiago, Chile
1 h-index
1 publications
21 citations
Max Planck Institute for Informatics
Saarbrücken, Germany
1 h-index
1 publications
19 citations
1–8 of 20
2 publications · 76 citations
2
h-index
1 publications · 19 citations
1
h-index
1 publications · 17 citations
1
h-index
TDSC · 1 publications · 31 citations
1
h-index
Conference · 1 publications · 49 citations
1
h-index
1–5