Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
1712.06687
Cited By
A General Technique for Non-blocking Trees
18 December 2017
Trevor Brown
Faith Ellen
Eric Ruppert
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"A General Technique for Non-blocking Trees"
38 / 38 papers shown
Title
Lock-Free Augmented Trees
P. Fatourou
Eric Ruppert
30
0
0
17 May 2024
FreSh: A Lock-Free Data Series Index
P. Fatourou
Eleftherios Kosmas
Themis Palpanas
G. Paterakis
FedML
25
5
0
17 Oct 2023
Wait-free Trees with Asymptotically-Efficient Range Queries
I. Kokorin
Dan Alistarh
Vitaly Aksenov
24
3
0
08 Oct 2023
Concurrent Deterministic Skiplist and Other Data Structures
Aparna Sasidharan
21
0
0
17 Sep 2023
Learned Lock-free Search Data Structures
Gaurav Bhardwaj
Bapi Chatterjee
Abhinav Sharma
Sathya Peri
Siddharth Nayak
42
0
0
22 Aug 2023
Practically and Theoretically Efficient Garbage Collection for Multiversioning
Yuanhao Wei
G. Blelloch
P. Fatourou
Eric Ruppert
VLM
43
3
0
27 Dec 2022
PathCAS: An Efficient Middle Ground for Concurrent Search Data Structures
Trevor Brown
William Sigouin
Dan Alistarh
18
6
0
19 Dec 2022
The ERA Theorem for Safe Memory Reclamation
Gali Sheffi
E. Petrank
25
7
0
08 Nov 2022
EEMARQ: Efficient Lock-Free Range Queries with Memory Reclamation
Gali Sheffi
P. Ramalhete
E. Petrank
VLM
LRM
49
7
0
31 Oct 2022
Lock-Free Locks Revisited
N. Ben-David
G. Blelloch
Yuanhao Wei
44
8
0
03 Jan 2022
Elimination (a,b)-trees with fast, durable updates
Anubhav Srivastava
Trevor Brown
28
14
0
31 Dec 2021
NBR: Neutralization Based Reclamation
Ajay Singh
Trevor Brown
A. Mashtizadeh
63
22
0
29 Dec 2020
Proving Highly-Concurrent Traversals Correct
Yotam M. Y. Feldman
Artem Khyzha
C. Enea
Adam Morrison
Aleksandar Nanevski
N. Rinetzky
Sharon Shoham
12
17
0
02 Oct 2020
Constant-Time Snapshots with Applications to Concurrent Data Structures
Yuanhao Wei
N. Ben-David
G. Blelloch
P. Fatourou
Eric Ruppert
Yihan Sun
33
1
0
05 Jul 2020
Efficient Partial Snapshot Implementations
Nikolaos D. Kallimanis
E. Kanellou
Charidimos Kiosterakis
VLM
16
0
0
10 Jun 2020
NVTraverse: In NVRAM Data Structures, the Destination is More Important than the Journey
Michal Friedman
N. Ben-David
Yuanhao Wei
G. Blelloch
E. Petrank
39
57
0
06 Apr 2020
Adapting Persistent Data Structures for Concurrency and Speculation
Thomas D. Dickerson
89
2
0
16 Mar 2020
Dynamic Graph Operations: A Consistent Non-blocking Approach
Bapi Chatterjee
Sathya Peri
Muktikanta Sa
11
2
0
03 Mar 2020
A Wait-Free Universal Construct for Large Objects
Andreia Correia
P. Ramalhete
Pascal Felber
16
14
0
05 Nov 2019
Parallel Finger Search Structures
Seth Gilbert
Wei Quan Lim
16
3
0
07 Aug 2019
Tracking in Order to Recover: Detectable Recovery of Lock-Free Data Structures
Hagit Attiya
Ohad Ben-Baruch
P. Fatourou
Danny Hendler
Eleftherios Kosmas
34
8
0
31 May 2019
The Amortized Analysis of a Non-blocking Chromatic Tree
Jeremy Ko
27
2
0
14 Nov 2018
Parallel Working-Set Search Structures
Kunal Agrawal
Seth Gilbert
Wei Quan Lim
22
6
0
15 May 2018
Persistent Non-Blocking Binary Search Trees Supporting Wait-Free Range Queries
P. Fatourou
Eric Ruppert
21
34
0
12 May 2018
Order out of Chaos: Proving Linearizability Using Local Views
Yotam M. Y. Feldman
C. Enea
Adam Morrison
N. Rinetzky
Sharon Shoham
LRM
19
15
0
10 May 2018
Multiversion Concurrency with Bounded Delay and Precise Garbage Collection
N. Ben-David
G. Blelloch
Yihan Sun
Yuanhao Wei
42
17
0
23 Mar 2018
Pragmatic Primitives for Non-blocking Data Structures
Trevor Brown
Faith Ellen
Eric Ruppert
50
38
0
18 Dec 2017
Techniques for Constructing Efficient Lock-free Data Structures
Trevor Brown
96
22
0
14 Dec 2017
B-slack trees: Highly Space Efficient B-trees
Trevor Brown
35
1
0
13 Dec 2017
Reclaiming memory for lock-free data structures: there has to be a better way
Trevor Brown
VLM
43
108
0
04 Dec 2017
A Template for Implementing Fast Lock-free Trees Using HTM
Trevor Brown
44
10
0
16 Aug 2017
Reuse, don't Recycle: Transforming Lock-free Algorithms that Throw Away Descriptors
Maya Arbel-Raviv
Trevor Brown
26
15
0
05 Aug 2017
The Power of Choice in Priority Scheduling
Dan Alistarh
Justin Kopinsky
Jerry Li
Giorgi Nadiradze
LRM
23
26
0
13 Jun 2017
Linearizable Iterators for Concurrent Sets
Archita Agarwal
Zhiyu Liu
Eli Rosenthal
V. Saraph
17
0
0
24 May 2017
PAM: Parallel Augmented Maps
Yihan Sun
Daniel Ferizovic
G. Blelloch
43
62
0
16 Dec 2016
Non-Blocking Doubly-Linked Lists with Good Amortized Complexity
Niloufar Shafiei
52
9
0
08 Aug 2014
Efficient Lock-free Binary Search Trees
Bapi Chatterjee
Nhan Nguyen Dang
P. Tsigas
62
44
0
12 Apr 2014
Non-blocking Patricia Tries with Replace Operations
Niloufar Shafiei
63
29
0
14 Mar 2013
1