Asynchronous programming has gained significant popularity over the last...
Writing concurrent code that is both correct and efficient is notoriousl...
Designing and implementing efficient parallel priority schedulers is an
...
Dynamic Connectivity is a fundamental algorithmic graph problem, motivat...
A bounded container maintains a collection of elements that can be inser...
Several classic problems in graph processing and computational geometry ...
Union-Find (or Disjoint-Set Union) is one of the fundamental problems in...