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. 1905.13600
  4. Cited By
Tracking in Order to Recover: Detectable Recovery of Lock-Free Data
  Structures

Tracking in Order to Recover: Detectable Recovery of Lock-Free Data Structures

31 May 2019
Hagit Attiya
Ohad Ben-Baruch
P. Fatourou
Danny Hendler
Eleftherios Kosmas
ArXivPDFHTML

Papers citing "Tracking in Order to Recover: Detectable Recovery of Lock-Free Data Structures"

4 / 4 papers shown
Title
NVTraverse: In NVRAM Data Structures, the Destination is More Important
  than the Journey
NVTraverse: In NVRAM Data Structures, the Destination is More Important than the Journey
Michal Friedman
N. Ben-David
Yuanhao Wei
G. Blelloch
E. Petrank
33
56
0
06 Apr 2020
Efficient Lock-Free Durable Sets
Efficient Lock-Free Durable Sets
Yoav Zuriel
Michal Friedman
Gali Sheffi
Nachshon Cohen
E. Petrank
21
60
0
02 Sep 2019
A General Technique for Non-blocking Trees
A General Technique for Non-blocking Trees
Trevor Brown
Faith Ellen
Eric Ruppert
33
114
0
18 Dec 2017
Reclaiming memory for lock-free data structures: there has to be a
  better way
Reclaiming memory for lock-free data structures: there has to be a better way
Trevor Brown
VLM
33
108
0
04 Dec 2017
1