5 citations · 11 across the 8 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2020★ 1 cited
Analysis and Evaluation of Non-Blocking Interpolation Search Trees
Aleksandar Prokopec, Trevor Brown, Dan Alistarh
We start by summarizing the recently proposed implementation of the first non-blocking concurrent interpolation search tree (C-IST) data structure. We then analyze the individual o…
cs.DS2018
Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms
Dan Alistarh, Trevor Brown, Justin Kopinsky +1
There has been significant progress in understanding the parallelism inherent to iterative sequential algorithms: for many classic algorithms, the depth of the dependence structure…
cs.DS2017
B-slack trees: Highly Space Efficient B-trees
Trevor Brown
B-slack trees, a subclass of B-trees that have substantially better worst-case space complexity, are introduced. They store keys in height , where is the maxim…