ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 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

European Conference on Parallel Processing (Euro-Par), 2017
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
Benchmark Framework with Skewed Workloads
Benchmark Framework with Skewed Workloads
Vitaly Aksenov
Dmitry Ivanov
R. Galiev
85
0
0
18 May 2023
CPMA: An Efficient Batch-Parallel Compressed Set Without Pointers
CPMA: An Efficient Batch-Parallel Compressed Set Without PointersACM SIGPLAN Symposium on Principles & Practice of Parallel Programming (PPoPP), 2023
Brian Wheatman
Randal C. Burns
A. Buluç
Helen Xu
240
6
0
08 May 2023
PaC-trees: Supporting Parallel and Compressed Purely-Functional
  Collections
PaC-trees: Supporting Parallel and Compressed Purely-Functional CollectionsACM-SIGPLAN Symposium on Programming Language Design and Implementation (PLDI), 2022
Laxman Dhulipala
G. Blelloch
Yan Gu
Yihan Sun
159
28
0
12 Apr 2022
1
Page 1 of 1