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. 2012.15438
  4. Cited By
Bundled References: An Abstraction for Highly-Concurrent Linearizable
  Range Queries

Bundled References: An Abstraction for Highly-Concurrent Linearizable Range Queries

31 December 2020
Jacob Nelson
Ahmed E. Hassan
Roberto Palmieri
ArXiv (abs)PDFHTML

Papers citing "Bundled References: An Abstraction for Highly-Concurrent Linearizable Range Queries"

3 / 3 papers shown
Title
Learned Lock-free Search Data Structures
Learned Lock-free Search Data Structures
Gaurav Bhardwaj
Bapi Chatterjee
Abhinav Sharma
Sathya Peri
Siddharth Nayak
42
0
0
22 Aug 2023
Wait-Free Updates and Range Search using Uruv
Wait-Free Updates and Range Search using Uruv
Gaurav Bhardwaj
Abhay Jain
Bapi Chatterjee
Sathya Peri
19
0
0
27 Jul 2023
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
1