Disjoint Set Data Structures
Disjoint Set Data Structures is a data structure that partitions a set of elements into disjoint, non-overlapping subsets and supports operations for efficiently determining which subset an element belongs to and merging subsets.
58
Publications
2.8K
Citations
119
Authors
73
Institutions
Publications per year
2017–2026
5
Variants
Disjoint Set Data StructureDisjoint-set Data Structures
Parents
58
On the distributional complexity of disjointness
Alexander Razborov · Theoretical Computer Science · 1992 · 485 citations
A survey of partial difference sets
S. L. · Designs Codes and Cryptography · 1994 · 196 citations
Fast set intersection in memory
Bolin Ding, Arnd Christian König · Proceedings of the VLDB Endowment · 2011 · 94 citations
1–5 of 58
119
6
h-index
3
h-index
3
h-index
3
h-index
3
h-index
1–5 of 119
73
Princeton University
Princeton, United States
4 h-index
5 publications
118 citations
University of Illinois Urbana-Champaign
Urbana, United States
3 h-index
5 publications
192 citations
Stanford University
Stanford, United States
3 h-index
3 publications
338 citations

Tel Aviv University
Tel Aviv, Israel
3 h-index
5 publications
146 citations

University of Toronto
Toronto, Canada
2 h-index
4 publications
120 citations

University of KwaZulu-Natal
Durban, South Africa
2 h-index
2 publications
43 citations
AT&T (United States)
Bedminster, United States
2 h-index
6 publications
216 citations
University of Maryland, College Park
College Park, United States
2 h-index
4 publications
142 citations
1–8 of 73
5 publications · 225 citations
5
h-index
3 publications · 171 citations
3
h-index
3 publications · 69 citations
3
h-index
2 publications · 52 citations
2
h-index
PVLDB · 2 publications · 173 citations
2
h-index
1–5