Conceptio › Archive › arXiv (All)
arXiv (All)open access

Polynomial Lower Bounds for Distributed Graph Sketching with Tiny Error: Connectivity and Spanning Tree Construction

Robinson, Peter et al.
arXiv (All) · Papers · License: Open Access
Open Source ↗Direct PDF ↓
and-cluster-computingdata-structures-and-algorithmsdistributedparallel
data structures and algorithms, distributed, parallel, and cluster computing
This document is indexed with metadata only — full text is not available in the archive for this record. Open the official source ↗
Record · ID 973425
Retrieved via Conceptio — every document is proof-bundled with source, license, and retrieval metadata.