Pages that link to "Item:Q5259593"
From MaRDI portal
The following pages link to Parallel algorithms for geometric graph problems (Q5259593):
Displaying 16 items.
- Neighborhood hypergraph model for topological data analysis (Q2111089) (← links)
- Distributed algorithms for matching in hypergraphs (Q2117684) (← links)
- Equivalence classes and conditional hardness in massively parallel computations (Q2121067) (← links)
- Breaking the linear-memory barrier in \(\mathsf{MPC}\): fast \(\mathsf{MIS}\) on trees with strongly sublinear memory (Q2215966) (← links)
- A unified framework for clustering constrained data without locality property (Q2300724) (← links)
- FPTAS for minimizing the earth mover's distance under rigid transformations and related problems (Q2408088) (← links)
- Brief Announcement: MapReduce Algorithms for Massive Trees (Q5002852) (← links)
- On Geometric Prototype and Applications (Q5009580) (← links)
- (Q5075750) (← links)
- Preconditioning for the Geometric Transportation Problem (Q5088942) (← links)
- (Q5091075) (← links)
- (Q5091162) (← links)
- Round Compression for Parallel Matching Algorithms (Q5130844) (← links)
- (Q5875463) (← links)
- Deterministic Massively Parallel Connectivity (Q6069413) (← links)
- Component stability in low-space massively parallel computation (Q6126138) (← links)
