1. Tight Space-Approximation Tradeoff for the Multi-Pass Streaming Set Cover Problem
2. Sepehr Assadi and Soheil Behnezhad . 2021 . Beating Two-Thirds For Random-Order Streaming Matching. In 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12--16, 2021, Glasgow, Scotland (Virtual Conference) (LIPIcs , Vol. 198), Nikhil Bansal, Emanuela Merelli, and James Worrell (Eds.). Schloss Dagstuhl - Leibniz-Zentrum fü r Informatik, 19:1--19: 13 . Sepehr Assadi and Soheil Behnezhad. 2021. Beating Two-Thirds For Random-Order Streaming Matching. In 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12--16, 2021, Glasgow, Scotland (Virtual Conference) (LIPIcs, Vol. 198), Nikhil Bansal, Emanuela Merelli, and James Worrell (Eds.). Schloss Dagstuhl - Leibniz-Zentrum fü r Informatik, 19:1--19:13.
3. Tight Bounds for Single-Pass Streaming Complexity of the Set Cover Problem
4. Streaming Set Cover in Practice