scientific article; zbMATH DE number 7559089
From MaRDI portal
DOI10.4230/LIPIcs.ITCS.2019.46MaRDI QIDQ5090424
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/1811.08205
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Spectral sparsification in the semi-streaming setting
- Random generation of combinatorial structures from a uniform distribution
- Finding repeated elements
- On data structures and asymmetric communication complexity
- Linear programming in the semi-streaming model with application to the maximum matching problem
- A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning
- Single Pass Spectral Sparsification in Dynamic Streams
- Estimating PageRank on graph streams
- Approximating the Permanent
- Improved Approximation Guarantees for Weighted Matching in the Semi-streaming Model
- Better streaming algorithms for clustering problems
- Undirected connectivity in log-space
- Using PageRank to Locally Partition a Graph
- An improved data stream summary: the count-min sketch and its applications
- Finding sparse cuts locally using evolving sets
- Better bounds for matchings in the streaming model