Search Results - "Akhremtsev, Yaroslav"
-
1
High-Quality Shared-Memory Graph Partitioning
Published in IEEE transactions on parallel and distributed systems (01-11-2020)“…Partitioning graphs into blocks of roughly equal size such that few edges run between blocks is a frequently needed operation in processing graphs. Recently,…”
Get full text
Journal Article -
2
Fast Parallel Operations on Search Trees
Published in 2016 IEEE 23rd International Conference on High Performance Computing (HiPC) (01-12-2016)“…Using (a, b)-trees as an example, we show how to perform a parallel split with logarithmic latency and parallel join, bulk updates, intersection, union (or…”
Get full text
Conference Proceeding -
3
Fast Parallel Operations on Search Trees
Published 19-10-2015“…Using (a,b)-trees as an example, we show how to perform a parallel split with logarithmic latency and parallel join, bulk updates, intersection, union (or…”
Get full text
Journal Article -
4
High-Quality Hypergraph Partitioning
Published 16-06-2021“…This paper considers the balanced hypergraph partitioning problem, which asks for partitioning the vertices into $k$ disjoint blocks of bounded size while…”
Get full text
Journal Article -
5
High-Quality Shared-Memory Graph Partitioning
Published 23-10-2017“…Partitioning graphs into blocks of roughly equal size such that few edges run between blocks is a frequently needed operation in processing graphs. Recently,…”
Get full text
Journal Article -
6
(Semi-)External Algorithms for Graph Partitioning and Clustering
Published 18-04-2014“…In this paper, we develop semi-external and external memory algorithms for graph partitioning and clustering problems. Graph partitioning and clustering are…”
Get full text
Journal Article -
7
Social Hash Partitioner: A Scalable Distributed Hypergraph Partitioner
Published 20-07-2017“…We design and implement a distributed algorithm for balanced $k$-way hypergraph partitioning that minimizes fanout, a fundamental hypergraph quantity also…”
Get full text
Journal Article