:: Library Catalog

Okładka

Zapisane w:

Opis bibliograficzny
Główni autorzy:	Garg, Vijay K., Garg, Rohan
Format:	Preprint
Wydane:	2026
Hasła przedmiotowe:	Distributed, Parallel, and Cluster Computing Data Structures and Algorithms
Dostęp online:	https://arxiv.org/abs/2602.10486
Etykiety:	Dodaj etykietę Nie ma etykietki, Dołącz pierwszą etykiete!

Podobne zapisy

Constrained Cuts, Flows, and Lattice-Linearity
od: Streit, Robert, i wsp.
Wydane: (2025)

Parallel Point-to-Point Shortest Paths and Batch Queries
od: Dong, Xiaojun, i wsp.
Wydane: (2025)

Distributed-Memory Parallel Algorithms for Fixed-Radius Near Neighbor Graph Construction
od: Raulet, Gabriel, i wsp.
Wydane: (2025)

Paralleling and Accelerating Arc Consistency Enforcement with Recurrent Tensor Computations
od: Yang, Mingqi
Wydane: (2024)

Optimal Parallel Algorithms for Dendrogram Computation and Single-Linkage Clustering
od: Dhulipala, Laxman, i wsp.
Wydane: (2024)

Parallel, Distributed, and Quantum Exact Single-Source Shortest Paths with Negative Edge Weights
od: Ashvinkumar, Vikrant, i wsp.
Wydane: (2023)

On Distributed Computation of the Minimum Triangle Edge Transversal
od: Censor-Hillel, Keren, i wsp.
Wydane: (2024)

Parallel Dynamic Maximal Matching
od: Ghaffari, Mohsen, i wsp.
Wydane: (2024)

Parallel Integer Sort: Theory and Practice
od: Dong, Xiaojun, i wsp.
Wydane: (2024)

Parallel Algorithms for Hierarchical Nucleus Decomposition
od: Shi, Jessica, i wsp.
Wydane: (2023)

Parallel Scan on Ascend AI Accelerators
od: Wróblewski, Bartłomiej, i wsp.
Wydane: (2025)

Encoding Schemes for Parallel In-Place Algorithms
od: Hutton, Chase, i wsp.
Wydane: (2025)

Massively Parallel Maximum Coverage Revisited
od: Bui, Thai, i wsp.
Wydane: (2024)

Parallel Batch-Dynamic Maximal Independent Set
od: Blelloch, Guy, i wsp.
Wydane: (2026)

Parallel Cluster-BFS and Applications to Shortest Paths
od: Wang, Letong, i wsp.
Wydane: (2024)

Massively Parallel Ruling Set Made Deterministic
od: Giliberti, Jeff, i wsp.
Wydane: (2024)

Adaptive Massively Parallel Coloring in Sparse Graphs
od: Latypov, Rustam, i wsp.
Wydane: (2024)

Parallel Contraction Hierarchies Can Be Efficient and Scalable
od: Wan, Zijin, i wsp.
Wydane: (2024)

Massively Parallel Algorithms for Approximate Shortest Paths
od: Dory, Michal, i wsp.
Wydane: (2024)

Parallel $k$-Core Decomposition: Theory and Practice
od: Liu, Youzhe, i wsp.
Wydane: (2025)

PASGAL: Parallel And Scalable Graph Algorithm Library
od: Dong, Xiaojun, i wsp.
Wydane: (2024)

Parallel and (Nearly) Work-Efficient Dynamic Programming
od: Ding, Xiangyun, i wsp.
Wydane: (2024)

Exploiting Multi-Core Parallelism in Blockchain Validation and Construction
od: Karmegam, Arivarasan, i wsp.
Wydane: (2026)

Designing Parallel Algorithms for Community Detection using Arachne
od: Li, Fuhuan, i wsp.
Wydane: (2025)

Parallel Algorithms for the One Sided Crossing Minimization Problem
od: Popa, Bogdan-Ioan, i wsp.
Wydane: (2025)

Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering
od: De Man, Quinten, i wsp.
Wydane: (2025)

Fast and Space-Efficient Parallel Algorithms for Influence Maximization
od: Wang, Letong, i wsp.
Wydane: (2023)

Improved Massively Parallel Triangle Counting in $O(1)$ Rounds
od: Liu, Quanquan C., i wsp.
Wydane: (2024)

Parallel $k$-Core Decomposition with Batched Updates and Asynchronous Reads
od: Liu, Quanquan C., i wsp.
Wydane: (2024)

Enhancing Scalability and Performance in Influence Maximization with Optimized Parallel Processing
od: Wu, Hanjiang, i wsp.
Wydane: (2024)

A Parallel Scan Algorithm in the Tensor Core Unit Model
od: Zouzias, Anastasios, i wsp.
Wydane: (2024)

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation
od: Blelloch, Guy, i wsp.
Wydane: (2026)

Parallel Joinable B-Trees in the Fork-Join I/O Model
od: Goodrich, Michael, i wsp.
Wydane: (2025)

Parallel Batch-Dynamic Maximal Matching with Constant Work per Update
od: Blelloch, Guy E., i wsp.
Wydane: (2025)

Parallel Set Cover and Hypergraph Matching via Uniform Random Sampling
od: Dhulipala, Laxman, i wsp.
Wydane: (2024)

Towards True Work-Efficiency in Parallel Derandomization: MIS, Maximal Matching, and Hitting Set
od: Ghaffari, Mohsen, i wsp.
Wydane: (2025)

HiPerMotif: Novel Parallel Subgraph Isomorphism in Large-Scale Property Graphs
od: Dindoost, Mohammad, i wsp.
Wydane: (2025)

Parallel Batch Dynamic Vertex Coloring in $O(\log Δ)$ Amortized Update Time
od: Hutton, Chase, i wsp.
Wydane: (2025)

Proven Distributed Memory Parallelization of Particle Methods
od: Pahlke, Johannes, i wsp.
Wydane: (2024)

Distributed Stochastic Graph Algorithms
od: Censor-Hillel, Keren, i wsp.
Wydane: (2026)