Brief Announcement: The Laplacian Paradigm in Deterministic Congested Clique
From MaRDI portal
Publication:6202226
DOI10.1145/3583668.3594577arXiv2304.02315OpenAlexW4380880046MaRDI QIDQ6202226
Sebastian Forster, Tijn de Vos
Publication date: 26 March 2024
Published in: Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2304.02315
Cites Work
- Algebraic methods in the congested clique
- Maximal Flow Through a Network
- Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
- Deterministic coin tossing with applications to optimal parallel list ranking
- Near-Optimal Distributed Maximum Flow
- Distributed Algorithms for Planar Networks II: Low-Congestion Shortcuts, MST, and Min-Cut
- Approximate Undirected Maximum Flows in O(mpolylog(n)) Time
- Approximate Max-Flow on Small Depth Networks
- Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models
- Faster parallel algorithm for approximate shortest path
- Parallel approximate undirected shortest paths via low hop emulators
- Faster energy maximization for faster maximum flow
- Optimal deterministic routing and sorting on the congested clique
- An efficient parallel solver for SDD linear systems
- Solving SDD linear systems in nearly m log 1/2 n time
- Sparsified Cholesky and multigrid solvers for connection laplacians
- An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations
- Approaching Optimality for Solving SDD Linear Systems
- A Nearly-m log n Time Solver for SDD Linear Systems
- A simple, combinatorial algorithm for solving SDD systems in nearly-linear time
- Minimum-Weight Spanning Tree Construction in O(log log n) Communication Rounds
This page was built for publication: Brief Announcement: The Laplacian Paradigm in Deterministic Congested Clique
