An Improved Bound for Random Binary Search Trees with Concurrent Insertions (Q3304136)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An Improved Bound for Random Binary Search Trees with Concurrent Insertions |
scientific article; zbMATH DE number 7228428
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An Improved Bound for Random Binary Search Trees with Concurrent Insertions |
scientific article; zbMATH DE number 7228428 |
Statements
5 August 2020
0 references
random binary search tree
0 references
buffer
0 references
average depth
0 references
concurrent data structures
0 references
An Improved Bound for Random Binary Search Trees with Concurrent Insertions (English)
0 references
0.9199621
0 references
0.88723993
0 references
0.88669556
0 references
0.88557625
0 references
0.88427836
0 references
0.88194335
0 references
0.88022035
0 references
0.8790714
0 references
0.8783784
0 references
