Page 1 MORGAN & CLAYPOOL PUBLISHERS Distributed Graph Coloring Fundamentals and
Recent Developments Leonid Barenboim Michael Elkin HESIS SYNTHESIS LECTURES ON …

A local algorithm is a distributed algorithm that runs in constant time, independently of the
size of the network. Being highly scalable and fault tolerant, such algorithms are ideal in the …

New cache coherent interconnects such as CXL have recently attracted great attention
thanks to their excellent hardware heterogeneity management and resource disaggregation …

We present a simple polylogarithmic-time deterministic distributed algorithm for network
decomposition. This improves on a celebrated 2 O (√ log n)-time algorithm of Panconesi …

In Distributed Algorithms, Nancy Lynch provides a blueprint for designing, implementing,
and analyzing distributed algorithms. She directs her book at a wide audience, including …

This paper provides an overview of AMG methods for solving large-scale systems of
equations, such as those from discretizations of partial differential equations. AMG is often …

Distributed computing concerns environments in which many processors, located at different
sites, must operate in a noninterfering and cooperative manner. Each of the processors …

Randomized algorithms have become a central part of the algorithms curriculum based on
their increasingly widespread use in modern applications. This book presents a coherent …

SuiteSparse: GraphBLAS is a full implementation of the GraphBLAS standard, which defines
a set of sparse matrix operations on an extended algebra of semirings using an almost …

Abstract hypre is a software library for the solution of large, sparse linear systems on
massively parallel computers. Its emphasis is on modern powerful and scalable …