A Fast Parallelizable Algorithm for Constructing Balanced Binary Search Trees
Ruzankin, Pavel S.
- Link zu diesem Datensatz
- https://d-nb.info/1268262684
- Titel
- A Fast Parallelizable Algorithm for Constructing Balanced Binary Search Trees
- Art des Inhalts
- Teil eines Werks
- Verfassangaben
- by Pavel S. Ruzankin
- Autor
- Ruzankin, Pavel S.
- Organisation(en)
-
- SpringerLink (Online service)
- Zeitliche Einordnung
- Erscheinungsdatum: 2022
- Umfang/Format
- Online-Ressource
- ISSN
26618907- DOI
- 10.1007/s42979-022-01285-9
- Online
- https://doi.org/10.1007/s42979-022-01285-9
- Sprache
- eng
- Schlagwörter
-
- (lcsh)Computer science.
- (lcsh)Computer organization.
- (lcsh)Software engineering.
- (lcsh)Computers.
- (lcsh)Computer graphics.
- Computer Science, general.
- Computer Systems Organization and Communication Networks.
- Software Engineering/Programming and Operating Systems.
- Data Structures and Information Theory.
- Information Systems and Communication Service.
- Computer Imaging, Vision, Pattern Recognition and Graphics.
- Frühere/spätere Titel
-
- Enthalten in: SN Computer Science
- Enthalten in: SN Computer Science
- Enthalten in: SN Computer Science
- Stand
- 17.09.2022 06:13
- Im Katalog seit
- 07.03.2026