# Optimal Lower Bounds for Distributed and Streaming Spanning Forest Computation

@article{Nelson2018OptimalLB,
title={Optimal Lower Bounds for Distributed and Streaming Spanning Forest Computation},
author={Jelani Nelson and Huacheng Yu},
journal={ArXiv},
year={2018},
volume={abs/1807.05135}
}
• Published in
Electronic Colloquium on…
2018
• Computer Science, Mathematics
• ArXiv
• We show optimal lower bounds for spanning forest computation in two different models: * One wants a data structure for fully dynamic spanning forest in which updates can insert or delete edges amongst a base set of $n$ vertices. The sole allowed query asks for a spanning forest, which the data structure should successfully answer with some given (potentially small) constant probability $\epsilon>0$. We prove that any such data structure must use $\Omega(n\log^3 n)$ bits of memory. * There is… CONTINUE READING

Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

2

#### Citations

##### Publications citing this paper.
SHOWING 1-7 OF 7 CITATIONS

## Streaming Complexity of Spanning Tree Computation

• Computer Science, Mathematics
• STACS
• 2020

## Broadcast Congested Clique: Planted Cliques and Pseudorandom Generators

• Mathematics, Computer Science
• PODC '19
• 2019

## Dynamic Streaming Spectral Sparsification in Nearly Linear Time and Space

• Mathematics, Computer Science
• ArXiv
• 2019

## Lp Samplers and Their Applications: A Survey

• Computer Science
• CSUR
• 2019
VIEW 1 EXCERPT
CITES BACKGROUND

## Random k-out Subgraph Leaves only O(n/k) Inter-Component Edges

• Computer Science, Mathematics
• 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)
• 2019
VIEW 2 EXCERPTS
CITES BACKGROUND & RESULTS

## 1 L p Samplers and Their Applications : A Survey GRAHAM CORMODE

VIEW 1 EXCERPT
CITES BACKGROUND

#### References

##### Publications referenced by this paper.
SHOWING 1-7 OF 7 REFERENCES

## Beating the Direct Sum Theorem in Communication Complexity with Implications for Sketching

• Mathematics, Computer Science
• SODA
• 2013

## Dynamic graph connectivity in polylogarithmic worst case time

• Computer Science, Mathematics
• SODA
• 2013

## How to Compress Interactive Communication

• Computer Science
• SIAM J. Comput.
• 2013

## Analyzing graph structure via linear measurements

• Computer Science
• SODA
• 2012

## Direct Products in Communication Complexity

• Mathematics, Computer Science
• 2013 IEEE 54th Annual Symposium on Foundations of Computer Science
• 2012

## An information statistics approach to data stream and communication complexity

• Computer Science
• The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.
• 2002