ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1702.04441
  4. Cited By
A Concurrency-Optimal Binary Search Tree
v1v2v3 (latest)

A Concurrency-Optimal Binary Search Tree

15 February 2017
Vitaly Aksenov
Vincent Gramoli
Petr Kuznetsov
A. Malova
Yu Yang
ArXiv (abs)PDFHTML

Papers citing "A Concurrency-Optimal Binary Search Tree"

3 / 3 papers shown
Title
Benchmark Framework with Skewed Workloads
Benchmark Framework with Skewed Workloads
Vitaly Aksenov
Dmitry Ivanov
R. Galiev
35
0
0
18 May 2023
CPMA: An Efficient Batch-Parallel Compressed Set Without Pointers
CPMA: An Efficient Batch-Parallel Compressed Set Without Pointers
Brian Wheatman
Randal C. Burns
A. Buluç
Helen Xu
58
4
0
08 May 2023
PaC-trees: Supporting Parallel and Compressed Purely-Functional
  Collections
PaC-trees: Supporting Parallel and Compressed Purely-Functional Collections
Laxman Dhulipala
G. Blelloch
Yan Gu
Yihan Sun
35
22
0
12 Apr 2022
1