Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
1702.04441
Cited By
v1
v2
v3 (latest)
A Concurrency-Optimal Binary Search Tree
15 February 2017
Vitaly Aksenov
Vincent Gramoli
Petr Kuznetsov
A. Malova
Yu Yang
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"A Concurrency-Optimal Binary Search Tree"
3 / 3 papers shown
Title
Benchmark Framework with Skewed Workloads
Vitaly Aksenov
Dmitry Ivanov
R. Galiev
31
0
0
18 May 2023
CPMA: An Efficient Batch-Parallel Compressed Set Without Pointers
Brian Wheatman
Randal C. Burns
A. Buluç
Helen Xu
56
4
0
08 May 2023
PaC-trees: Supporting Parallel and Compressed Purely-Functional Collections
Laxman Dhulipala
G. Blelloch
Yan Gu
Yihan Sun
35
22
0
12 Apr 2022
1