Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
2010.00911
Cited By
v1
v2 (latest)
Proving Highly-Concurrent Traversals Correct
2 October 2020
Yotam M. Y. Feldman
Artem Khyzha
C. Enea
Adam Morrison
Aleksandar Nanevski
N. Rinetzky
Sharon Shoham
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"Proving Highly-Concurrent Traversals Correct"
3 / 3 papers shown
Title
Concurrent Data Structures Made Easy (Extended Version)
Callista Le
K. Gopinathan
Koon Wen Lee
Seth Gilbert
Ilya Sergey
128
1
0
25 Aug 2024
Linearizability Analysis of the Contention-Friendly Binary Search Tree
U. Abraham
Avi Hayoun
16
0
0
12 May 2023
Practically and Theoretically Efficient Garbage Collection for Multiversioning
Yuanhao Wei
G. Blelloch
P. Fatourou
Eric Ruppert
VLM
43
3
0
27 Dec 2022
1
