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. 1805.04779
  4. Cited By
Persistent Non-Blocking Binary Search Trees Supporting Wait-Free Range
  Queries

Persistent Non-Blocking Binary Search Trees Supporting Wait-Free Range Queries

12 May 2018
P. Fatourou
Eric Ruppert
ArXiv (abs)PDFHTML

Papers citing "Persistent Non-Blocking Binary Search Trees Supporting Wait-Free Range Queries"

4 / 4 papers shown
Title
EEMARQ: Efficient Lock-Free Range Queries with Memory Reclamation
EEMARQ: Efficient Lock-Free Range Queries with Memory Reclamation
Gali Sheffi
P. Ramalhete
E. Petrank
VLMLRM
49
7
0
31 Oct 2022
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
Space and Time Bounded Multiversion Garbage Collection
Space and Time Bounded Multiversion Garbage Collection
N. Ben-David
G. Blelloch
P. Fatourou
Eric Ruppert
Yihan Sun
Yuanhao Wei
39
8
0
05 Aug 2021
NBR: Neutralization Based Reclamation
NBR: Neutralization Based Reclamation
Ajay Singh
Trevor Brown
A. Mashtizadeh
65
22
0
29 Dec 2020
1