共 50 条
- [1] An Unconditional Lower Bound for Two-Pass Streaming Algorithms for Maximum Matching Approximation PROCEEDINGS OF THE 2024 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2024, : 2881 - 2899
- [2] A Two-Pass (Conditional) Lower Bound for Semi-Streaming Maximum Matching PROCEEDINGS OF THE 2022 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2022, : 708 - 742
- [3] Near-Quadratic Lower Bounds for Two-Pass Graph Streaming Algorithms 2020 IEEE 61ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2020), 2020, : 342 - 353
- [6] Polynomial Pass Lower Bounds for Graph Streaming Algorithms PROCEEDINGS OF THE 51ST ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '19), 2019, : 265 - 276
- [7] Two-pass video encoding for low bit rate streaming applications VISUAL COMMUNICATIONS AND IMAGE PROCESSING 2002, PTS 1 AND 2, 2002, 4671 : 202 - 208
- [8] Approximation Algorithms for the Maximum Carpool Matching Problem COMPUTER SCIENCE - THEORY AND APPLICATIONS (CSR 2017), 2017, 10304 : 206 - 216
- [9] ETPS: EFFICIENT TWO-PASS ENCODING SCHEME FOR ADAPTIVE LIVE STREAMING 2022 IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING, ICIP, 2022, : 1516 - 1520