908 citations · 2.4k across the 149 of their papers we have counts for
3 papers · 2 filters
Efficiency Guarantees for Parallel Incremental Algorithms under Relaxed Schedulers
Dan Alistarh, Nikita Koval, Giorgi Nadiradze
Several classic problems in graph processing and computational geometry are solved via incremental algorithms, which split computation into a series of small tasks acting on shared…
Dynamic Averaging Load Balancing on Cycles
Dan Alistarh, Giorgi Nadiradze, Amirmojtaba Sabour
We consider the following dynamic load-balancing process: given an underlying graph with nodes, in each step , one unit of load is created, and placed at a randoml…
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…