Saved in:
| Main Author: | Stocks, Mark |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2311.09922 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Distributed Computing From First Principles
by: Odoh, Kenneth
Published: (2025)
by: Odoh, Kenneth
Published: (2025)
Proven Distributed Memory Parallelization of Particle Methods
by: Pahlke, Johannes, et al.
Published: (2024)
by: Pahlke, Johannes, et al.
Published: (2024)
Binsparse: A Specification for Cross-Platform Storage of Sparse Matrices and Tensors
by: Brock, Benjamin, et al.
Published: (2025)
by: Brock, Benjamin, et al.
Published: (2025)
A parallel algorithm for the odd two-face shortest k-disjoint path problem
by: Chakraborty, Srijan, et al.
Published: (2025)
by: Chakraborty, Srijan, et al.
Published: (2025)
Fast Deterministic Distributed Degree Splitting
by: Maus, Yannic, et al.
Published: (2026)
by: Maus, Yannic, et al.
Published: (2026)
Fast Broadcast in Highly Connected Networks
by: Chandra, Shashwat, et al.
Published: (2024)
by: Chandra, Shashwat, et al.
Published: (2024)
Fast Concurrent Primitives Despite Contention
by: Bender, Michael A., et al.
Published: (2026)
by: Bender, Michael A., et al.
Published: (2026)
Fast and Space-Efficient Parallel Algorithms for Influence Maximization
by: Wang, Letong, et al.
Published: (2023)
by: Wang, Letong, et al.
Published: (2023)
Fast Spanning Tree Sampling in Broadcast Congested Clique
by: Anari, Nima, et al.
Published: (2026)
by: Anari, Nima, et al.
Published: (2026)
A Fast-Converging Decentralized Approach to the Weighted Minimum Vertex Cover Problem
by: Mordacchini, Matteo, et al.
Published: (2025)
by: Mordacchini, Matteo, 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)
by: Polyanskii, Nikita, et al.
Published: (2024)
Skip Hash: A Fast Ordered Map Via Software Transactional Memory
by: Rodriguez, Matthew, et al.
Published: (2024)
by: Rodriguez, Matthew, et al.
Published: (2024)
Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling
by: Feist, Dankrad, et al.
Published: (2025)
by: Feist, Dankrad, et al.
Published: (2025)
Regular mixed-radix DFT matrix factorization for in-place FFT accelerators
by: Salishev, Sergey
Published: (2025)
by: Salishev, Sergey
Published: (2025)
Engineering MultiQueues: Fast Relaxed Concurrent Priority Queues
by: Williams, Marvin, et al.
Published: (2025)
by: Williams, Marvin, et al.
Published: (2025)
Restructuring expression dags for efficient parallelization
by: Wilhelm, Martin
Published: (2018)
by: Wilhelm, Martin
Published: (2018)
Forgetting Alternation and Blossoms: A New Framework for Fast Matching Augmentation and Its Applications to Sequential/Distributed/Streaming Computation
by: Izumi, Taisuke, et al.
Published: (2025)
by: Izumi, Taisuke, et al.
Published: (2025)
Fast multiplication of random dense matrices with fixed sparse matrices
by: Liang, Tianyu, et al.
Published: (2023)
by: Liang, Tianyu, et al.
Published: (2023)
Moser-Tardos Algorithm with small number of random bits
by: Csóka, Endre, et al.
Published: (2022)
by: Csóka, Endre, et al.
Published: (2022)
Efficient Dynamic MaxFlow Computation on GPUs
by: Kannappan, Shruthi, et al.
Published: (2025)
by: Kannappan, Shruthi, et al.
Published: (2025)
Informative Trains: A Memory-Efficient Journey to a Self-Stabilizing Leader Election Algorithm in Anonymous Graphs
by: Blin, Lelia, et al.
Published: (2026)
by: Blin, Lelia, et al.
Published: (2026)
Towards Optimal Distributed Edge Coloring with Fewer Colors
by: Jakob, Manuel, et al.
Published: (2025)
by: Jakob, Manuel, et al.
Published: (2025)
Perfect Matching with Few Link Activations
by: Mirault, Hugo, et al.
Published: (2025)
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)
by: Ghaffari, Mohsen, et al.
Published: (2025)
Designing Parallel Algorithms for Community Detection using Arachne
by: Li, Fuhuan, et al.
Published: (2025)
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)
by: Gil, Yuval, et al.
Published: (2025)
Narrowing the LOCAL$\unicode{x2013}$CONGEST Gaps in Sparse Networks via Expander Decompositions
by: Chang, Yi-Jun, et al.
Published: (2022)
by: Chang, Yi-Jun, et al.
Published: (2022)
WarpSpeed: A High-Performance Library for Concurrent GPU Hash Tables
by: McCoy, Hunter, et al.
Published: (2025)
by: McCoy, Hunter, et al.
Published: (2025)
Improved All-Pairs Approximate Shortest Paths in Congested Clique
by: Bui, Hong Duc, et al.
Published: (2024)
by: Bui, Hong Duc, et al.
Published: (2024)
A Scalable and Unified Framework to Weighted Rank Aggregation
by: Carmel, Amir, et al.
Published: (2026)
by: Carmel, Amir, et al.
Published: (2026)
FractalSortCPU: Bandwidth-Efficient Compressed Radix Sort on CPU
by: Dang'ana, Michael
Published: (2026)
by: Dang'ana, Michael
Published: (2026)
Distributed Santa Claus via Global Rounding
by: de Vos, Tijn, et al.
Published: (2026)
by: de Vos, Tijn, et al.
Published: (2026)
On Distributed Computation of the Minimum Triangle Edge Transversal
by: Censor-Hillel, Keren, et al.
Published: (2024)
by: Censor-Hillel, Keren, et al.
Published: (2024)
Near-Optimal Distributed Ruling Sets for Trees and High-Girth Graphs
by: Baumecker, Malte, et al.
Published: (2025)
by: Baumecker, Malte, et al.
Published: (2025)
Paralleling and Accelerating Arc Consistency Enforcement with Recurrent Tensor Computations
by: Yang, Mingqi
Published: (2024)
by: Yang, Mingqi
Published: (2024)
Parallel Cluster-BFS and Applications to Shortest Paths
by: Wang, Letong, et al.
Published: (2024)
by: Wang, Letong, et al.
Published: (2024)
HiPerMotif: Novel Parallel Subgraph Isomorphism in Large-Scale Property Graphs
by: Dindoost, Mohammad, et al.
Published: (2025)
by: Dindoost, Mohammad, et al.
Published: (2025)
Improved Byzantine Agreement under an Adaptive Adversary
by: Dufoulon, Fabien, et al.
Published: (2025)
by: Dufoulon, Fabien, et al.
Published: (2025)
Constrained Cuts, Flows, and Lattice-Linearity
by: Streit, Robert, et al.
Published: (2025)
by: Streit, Robert, et al.
Published: (2025)
Time-Optimal and Energy-Efficient Deterministic Consensus
by: Meir, Shachar, et al.
Published: (2025)
by: Meir, Shachar, et al.
Published: (2025)
Similar Items
-
Distributed Computing From First Principles
by: Odoh, Kenneth
Published: (2025) -
Proven Distributed Memory Parallelization of Particle Methods
by: Pahlke, Johannes, et al.
Published: (2024) -
Binsparse: A Specification for Cross-Platform Storage of Sparse Matrices and Tensors
by: Brock, Benjamin, et al.
Published: (2025) -
A parallel algorithm for the odd two-face shortest k-disjoint path problem
by: Chakraborty, Srijan, et al.
Published: (2025) -
Fast Deterministic Distributed Degree Splitting
by: Maus, Yannic, et al.
Published: (2026)