Can I read Polynomial Pass Lower Bounds for Graph Streaming Algorithms on EtoBox?

Polynomial Pass Lower Bounds for Graph Streaming Algorithms by Sepehr Assadi, Yu Chen, and Sanjeev Khanna is a scholarly article available to read on EtoBox.

What is Polynomial Pass Lower Bounds for Graph Streaming Algorithms about?

Graph streaming,Lower bounds,Communication complexity - Theory of computation -> Streaming, sublinear and near linear time algorithms.Graph algorithms analysis.Lower bounds and information complexity.

Author

Sepehr Assadi, Yu Chen, and Sanjeev Khanna