Cover Image

Constrained Cuts, Flows, and Lattice-Linearity

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Streit, Robert, Garg, Vijay K.
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms Distributed, Parallel, and Cluster Computing
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Computing Least Fixed Points with Overwrite Semantics in Parallel and Distributed Systems
by: Garg, Vijay K., et al.
Published: (2026)

Eventually Lattice-Linear Algorithms
by: Gupta, Arya Tanmay, et al.
Published: (2023)

Reducing Matroid Optimization to Basis Search
by: Streit, Robert, et al.
Published: (2024)

Distributed Maximum Flow in Planar Graphs
by: Abd-Elhaleem, Yaseen, et al.
Published: (2024)

Efficient Dynamic MaxFlow Computation on GPUs
by: Kannappan, Shruthi, et al.
Published: (2025)

A Cut-Matching Game for Constant-Hop Expanders
by: Haeupler, Bernhard, et al.
Published: (2022)

All-to-All Communication with Mobile Edge Adversary: Almost Linearly More Faults, For Free
by: Fischer, Orr, et al.
Published: (2025)

Slipstream: Ebb-and-Flow Consensus on a DAG with Fast Confirmation for UTXO Transactions
by: Polyanskii, Nikita, et al.
Published: (2024)

Hash & Adjust: Competitive Demand-Aware Consistent Hashing
by: Pourdamghani, Arash, et al.
Published: (2024)

Fully Scalable MPC Algorithms for Clustering in High Dimension
by: Czumaj, Artur, et al.
Published: (2023)

ESCHER: Efficient and Scalable Hypergraph Evolution Representation with Application to Triad Counting
by: Shovan, S. M., et al.
Published: (2025)

Accelerating Sparse Tensor Decomposition Using Adaptive Linearized Representation
by: Laukemann, Jan, et al.
Published: (2024)

A Nearly Linear-Time Distributed Algorithm for Maximum Cardinality Matching
by: Izumi, Taisuke, et al.
Published: (2023)

Composable Coresets for Constrained Determinant Maximization and Beyond
by: Mahabadi, Sepideh, et al.
Published: (2022)

GreedyML: A Parallel Algorithm for Maximizing Constrained Submodular Functions
by: Gopal, Shivaram, et al.
Published: (2024)

Towards Optimal Distributed Edge Coloring with Fewer Colors
by: Jakob, Manuel, et al.
Published: (2025)

Perfect Matching with Few Link Activations
by: Mirault, Hugo, et al.
Published: (2025)

Towards True Work-Efficiency in Parallel Derandomization: MIS, Maximal Matching, and Hitting Set
by: Ghaffari, Mohsen, et al.
Published: (2025)

Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling
by: Feist, Dankrad, et al.
Published: (2025)

Designing Parallel Algorithms for Community Detection using Arachne
by: Li, Fuhuan, et al.
Published: (2025)

New Distributed Interactive Proofs for Planarity: A Matter of Left and Right
by: Gil, Yuval, et al.
Published: (2025)

WarpSpeed: A High-Performance Library for Concurrent GPU Hash Tables
by: McCoy, Hunter, et al.
Published: (2025)

Near-Optimal Distributed Ruling Sets for Trees and High-Girth Graphs
by: Baumecker, Malte, et al.
Published: (2025)

HiPerMotif: Novel Parallel Subgraph Isomorphism in Large-Scale Property Graphs
by: Dindoost, Mohammad, et al.
Published: (2025)

Improved Byzantine Agreement under an Adaptive Adversary
by: Dufoulon, Fabien, et al.
Published: (2025)

A Fast-Converging Decentralized Approach to the Weighted Minimum Vertex Cover Problem
by: Mordacchini, Matteo, et al.
Published: (2025)

Time-Optimal and Energy-Efficient Deterministic Consensus
by: Meir, Shachar, et al.
Published: (2025)

BLEST: Blazingly Efficient BFS using Tensor Cores
by: Elbek, Deniz, et al.
Published: (2025)

Weighted Matching in a Poly-Streaming Model
by: Ullah, Ahammed, et al.
Published: (2025)

Computing in a Faulty Congested Clique
by: Censor-Hillel, Keren, et al.
Published: (2025)

Message Optimality and Message-Time Trade-offs for APSP and Beyond
by: Dufoulon, Fabien, et al.
Published: (2025)

Distributed Interactive Proofs for Planarity with Log-Star Communication
by: Gil, Yuval, et al.
Published: (2025)

Optimal Distributed Replacement Paths
by: Chang, Yi-Jun, et al.
Published: (2025)

Big Atomics
by: Anderson, Daniel, et al.
Published: (2025)

Parallel Algorithms for the One Sided Crossing Minimization Problem
by: Popa, Bogdan-Ioan, et al.
Published: (2025)

A parallel algorithm for the odd two-face shortest k-disjoint path problem
by: Chakraborty, Srijan, et al.
Published: (2025)

Optimal local certification on graphs of bounded pathwidth
by: Baterisna, Dan Alden, et al.
Published: (2025)

Fully Scalable MPC Algorithms for Euclidean k-Center
by: Czumaj, Artur, et al.
Published: (2025)

Õptimal Fault-Tolerant Labeling for Reachability and Approximate Distances in Directed Planar Graphs
by: Boneh, Itai, et al.
Published: (2025)

Round Elimination via Self-Reduction: Closing Gaps for Distributed Maximal Matching
by: Khoury, Seri, et al.
Published: (2025)