A Fast Parallelizable Algorithm for Constructing Balanced Binary Search Trees Full article
| Journal |
SN Computer Science
ISSN: 2662-995X , E-ISSN: 2661-8907 |
||
|---|---|---|---|
| Output data | Year: 2022, Volume: 3, Number: 5, Article number : 367, Pages count : 5 DOI: 10.1007/s42979-022-01285-9 | ||
| Tags | Binary search tree. Parallel algorithm | ||
| Authors |
|
||
| Affiliations |
|
Funding (1)
| 1 | Sobolev Institute of Mathematics | FWNF-2022-0009 |
Cite:
Ruzankin P.S.
A Fast Parallelizable Algorithm for Constructing Balanced Binary Search Trees
SN Computer Science. 2022. V.3. N5. 367 :1-5. DOI: 10.1007/s42979-022-01285-9 Scopus РИНЦ OpenAlex
A Fast Parallelizable Algorithm for Constructing Balanced Binary Search Trees
SN Computer Science. 2022. V.3. N5. 367 :1-5. DOI: 10.1007/s42979-022-01285-9 Scopus РИНЦ OpenAlex
Dates:
| Submitted: | Aug 28, 2021 |
| Accepted: | Jul 1, 2022 |
Identifiers:
| ≡ Scopus: | 2-s2.0-85134247476 |
| ≡ Elibrary: | 51529634 |
| ≡ OpenAlex: | W4285387731 |