Copertina

Composable Coresets for Constrained Determinant Maximization and Beyond

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Mahabadi, Sepideh, Vuong, Thuy-Duong
Natura:	Preprint
Pubblicazione:	2022
Soggetti:	Data Structures and Algorithms Computational Geometry Distributed, Parallel, and Cluster Computing
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Lagrangian Simulation Volume-Based Contour Tree Simplification
di: Dilys, Domantas, et al.
Pubblicazione: (2025)

A Surprisingly Simple Method for Distributed Euclidean-Minimum Spanning Tree / Single Linkage Dendrogram Construction from High Dimensional Embeddings via Distance Decomposition
di: Lettich, Richard
Pubblicazione: (2024)

Extremely Scalable Distributed Computation of Contour Trees via Pre-Simplification
di: Li, Mingzhe, et al.
Pubblicazione: (2025)

Distributed-Memory Parallel Algorithms for Fixed-Radius Near Neighbor Graph Construction
di: Raulet, Gabriel, et al.
Pubblicazione: (2025)

Parallel Dynamic Maximal Matching
di: Ghaffari, Mohsen, et al.
Pubblicazione: (2024)

Dynamic Maximal Matching in Clique Networks
di: Li, Minming, et al.
Pubblicazione: (2024)

Efficient Enumeration of Large Maximal k-Plexes
di: Cheng, Qihao, et al.
Pubblicazione: (2024)

Parallel Batch-Dynamic Maximal Independent Set
di: Blelloch, Guy, et al.
Pubblicazione: (2026)

Energy-Efficient Maximal Independent Sets in Radio Networks
di: Banasik, Dominick, et al.
Pubblicazione: (2025)

When MIS and Maximal Matching are Easy in the Congested Clique
di: Censor-Hillel, Keren, et al.
Pubblicazione: (2025)

Fast and Space-Efficient Parallel Algorithms for Influence Maximization
di: Wang, Letong, et al.
Pubblicazione: (2023)

Enhancing Scalability and Performance in Influence Maximization with Optimized Parallel Processing
di: Wu, Hanjiang, et al.
Pubblicazione: (2024)

Parallel Batch-Dynamic Maximal Matching with Constant Work per Update
di: Blelloch, Guy E., et al.
Pubblicazione: (2025)

Constrained Cuts, Flows, and Lattice-Linearity
di: Streit, Robert, et al.
Pubblicazione: (2025)

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

Parallel Sampling via Autospeculation
di: Anari, Nima, et al.
Pubblicazione: (2025)

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

Restructuring expression dags for efficient parallelization
di: Wilhelm, Martin
Pubblicazione: (2018)

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

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

Beyond BFS: A Comparative Study of Rooted Spanning Tree Algorithms on GPUs
di: Sahu, Abhijeet, et al.
Pubblicazione: (2026)

Scalable Distributed Algorithms for Size-Constrained Submodular Maximization in the MapReduce and Adaptive Complexity Models
di: Chen, Yixin, et al.
Pubblicazione: (2022)

TC-MIS: Maximal Independent Set on Tensor-cores
di: Nijhara, Prajjwal, et al.
Pubblicazione: (2026)

$O(1)$-Round MPC Algorithms for Multi-dimensional Grid Graph Connectivity, EMST and DBSCAN
di: Gan, Junhao, et al.
Pubblicazione: (2025)

A Primal-Dual Framework for Symmetric Cone Programming
di: Zheng, Jiaqi, et al.
Pubblicazione: (2024)

Narrowing the LOCAL$\unicode{x2013}$CONGEST Gaps in Sparse Networks via Expander Decompositions
di: Chang, Yi-Jun, et al.
Pubblicazione: (2022)

New Concurrent Order Maintenance Data Structure
di: Guo, Bin, et al.
Pubblicazione: (2022)

A $(3+\varepsilon)$-Approximate Correlation Clustering Algorithm in Dynamic Streams
di: Cambus, Mélanie, et al.
Pubblicazione: (2022)

Near Optimal Bounds for Replacement Paths and Related Problems in the CONGEST Model
di: Manoharan, Vignesh, et al.
Pubblicazione: (2022)

Distributed Subgraph Finding: Progress and Challenges
di: Censor-Hillel, Keren
Pubblicazione: (2022)

What Can We Compute in a Single Round of the Congested Clique?
di: Robinson, Peter
Pubblicazione: (2022)

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

Informative Trains: A Memory-Efficient Journey to a Self-Stabilizing Leader Election Algorithm in Anonymous Graphs
di: Blin, Lelia, et al.
Pubblicazione: (2026)

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

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

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

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

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

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

Improved All-Pairs Approximate Shortest Paths in Congested Clique
di: Bui, Hong Duc, et al.
Pubblicazione: (2024)