Performance Evaluation on Parallel Speculation-Based Construction of a Binary Search Tree
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
1 Online-Ressource.
- Language
-
Englisch
- Bibliographic citation
-
Performance Evaluation on Parallel Speculation-Based Construction of a Binary Search Tree ; volume:11 ; number:2 ; day:8 ; month:11 ; year:2023 ; pages:88-111 ; date:12.2023
International journal of networked and distributed computing ; 11, Heft 2 (8.11.2023), 88-111, 12.2023
- Creator
-
Hirata, Hiroaki
Nunome, Atsushi
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s44227-023-00013-w
- URN
-
urn:nbn:de:101:1-2024021309044130203041
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:30 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Hirata, Hiroaki
- Nunome, Atsushi
- SpringerLink (Online service)
Other Objects (12)
Binary search trees, rectangles and patterns
On Weighted Depths in Random Binary Search Trees
Calculating a functional module for binary search trees
On the subtree size profile of binary search trees
Retraction Note: Strong limiting behavior in binary search trees
RETRACTED ARTICLE: Strong limiting behavior in binary search trees
Parallel Tree Search in Volunteer Computing: a Case Study
Smoothed analysis of binary search trees and quicksort under additive noise
Approximability of cycle covers and smoothed analysis of binary search trees
Speculation in parallel and distributed event processing systems
Simulating binary trees on x-trees
Programming Heterogeneous Parallel Machines Using Refactoring and Monte–Carlo Tree Search
Binary search trees, rectangles and patterns
On Weighted Depths in Random Binary Search Trees
Calculating a functional module for binary search trees
On the subtree size profile of binary search trees
Retraction Note: Strong limiting behavior in binary search trees
RETRACTED ARTICLE: Strong limiting behavior in binary search trees
Parallel Tree Search in Volunteer Computing: a Case Study
Smoothed analysis of binary search trees and quicksort under additive noise
Approximability of cycle covers and smoothed analysis of binary search trees
Speculation in parallel and distributed event processing systems
Simulating binary trees on x-trees
Programming Heterogeneous Parallel Machines Using Refactoring and Monte–Carlo Tree Search
Binary search trees, rectangles and patterns
On Weighted Depths in Random Binary Search Trees
Calculating a functional module for binary search trees
On the subtree size profile of binary search trees
Retraction Note: Strong limiting behavior in binary search trees
RETRACTED ARTICLE: Strong limiting behavior in binary search trees
Parallel Tree Search in Volunteer Computing: a Case Study
Smoothed analysis of binary search trees and quicksort under additive noise
Approximability of cycle covers and smoothed analysis of binary search trees
Speculation in parallel and distributed event processing systems
Simulating binary trees on x-trees