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. 2012.12868
  4. Cited By
Flat-Combining-Based Persistent Data Structures for Non-Volatile Memory
v1v2v3v4 (latest)

Flat-Combining-Based Persistent Data Structures for Non-Volatile Memory

Safety-critical Systems Symposium (SSS), 2020
23 December 2020
M. Rusanovsky
Hagit Attiya
Ohad Ben-Baruch
Tom Gerby
Danny Hendler
P. Ramalhete
    FedML
ArXiv (abs)PDFHTML

Papers citing "Flat-Combining-Based Persistent Data Structures for Non-Volatile Memory"

3 / 3 papers shown
Highly-Efficient Persistent FIFO Queues
Highly-Efficient Persistent FIFO Queues
Panagiota Fatourou
Nikos Giachoudis
George Mallis
88
2
0
27 Feb 2024
Recoverable and Detectable Self-Implementations of Swap
Recoverable and Detectable Self-Implementations of SwapInternational Conference on Principles of Distributed Systems (OPODIS), 2023
Tomer Lev Lehman
Hagit Attiya
Danny Hendler
187
2
0
07 Aug 2023
Practical Detectability for Persistent Lock-Free Data Structures
Practical Detectability for Persistent Lock-Free Data Structures
K. Cho
Seungmin Jeon
Jeehoon Kang
175
1
0
15 Mar 2022
1
Page 1 of 1