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. 2108.04202
  4. Cited By
FliT: A Library for Simple and Efficient Persistent Algorithms
v1v2 (latest)

FliT: A Library for Simple and Efficient Persistent Algorithms

9 August 2021
Yuanhao Wei
N. Ben-David
Michal Friedman
G. Blelloch
E. Petrank
    VLM
ArXiv (abs)PDFHTML

Papers citing "FliT: A Library for Simple and Efficient Persistent Algorithms"

3 / 3 papers shown
Title
The Fence Complexity of Persistent Sets
The Fence Complexity of Persistent Sets
Gaetano Coccimiglio
Trevor Brown
Yu Yang
71
0
0
11 Sep 2023
Practical Detectability for Persistent Lock-Free Data Structures
Practical Detectability for Persistent Lock-Free Data Structures
K. Cho
Seungmin Jeon
Jeehoon Kang
32
2
0
15 Mar 2022
Efficient Multi-word Compare and Swap
Efficient Multi-word Compare and Swap
R. Guerraoui
Alex Kogan
Virendra J. Marathe
I. Zablotchi
39
13
0
06 Aug 2020
1