Find Operation is a fundamental query procedure in disjoint set data structures that determines the canonical representative of the set containing a given element by traversing parent pointers until reaching the root of the tree, often optimized with path compression.
8
Publications
190
Citations
16
Authors
12
Institutions
Publications per year
2017–2026
0
Publications
8
Meldable heaps and boolean union-find
Haim Kaplan, Nira Shafrir, Robert E. Tarjan · 2002 · 39 citations
Non-blocking Patricia Tries with Replace Operations
Niloufar Shafiei · 2013 · 33 citations · Full text
1–5 of 8
Authors
16
- PK
2
h-index
- KYKe Yi
Hong Kong University of Science and Technology, Hong Kong SAR China
2 publications · 55 citations
2
h-index
- PM
2
h-index
- LA
2
h-index
- KW
2
h-index
1–5 of 16
Institutions
12
Humboldt-Universität zu Berlin
Berlin, Germany
2 h-index
2 publications
29 citations
University of Rostock
Rostock, Germany
2 h-index
2 publications
29 citations
Duke University
Durham, United States
2 h-index
4 publications
129 citations
Tel Aviv University
Tel Aviv, Israel
2 h-index
3 publications
92 citations
Hong Kong University of Science and Technology
Hong Kong, Hong Kong
1 h-index
1 publications
18 citations
Center for Massive Data Algorithmics
Aarhus, Denmark
1 h-index
1 publications
18 citations
Stanford University
Stanford, United States
1 h-index
2 publications
40 citations
University of Copenhagen
Copenhagen, Denmark
1 h-index
2 publications
28 citations
1–8 of 12
Venues
- ACM Transactions on Algorithms
TALG · 2 publications · 32 citations
2
h-index
- Journal of Computational Physics
1 publications · 20 citations
1
h-index
- International Journal of Business Process Integration and Management
IJBPIM · 1 publications · 16 citations
1
h-index
1–3