Funder
Institute for Research in Fundamental Sciences
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference20 articles.
1. Alon N, Matias Y, Szegedy M (1999) The space complexity of approximating the frequency moments. J Comput Syst Sci 58(1):137–147
2. Bernstein A (2020) Improved bounds for matching in random-order streams. In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference) (Artur Czumaj, Anuj Dawar, and Emanuela Merelli, eds.), LIPIcs, vol 168, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp 12:1–12:13
3. Bury M, Grigorescu E, McGregor A, Monemizadeh M, Schwiegelshohn C, Vorotnikova S, Zhou S (2019) Structural results on matching estimation with applications to streaming. Algorithmica 81(1):367–392
4. Behnezhad S, Hajiaghayi MT, Harris DG (2019) Exponentially faster massively parallel maximal matching. In: 60th IEEE annual symposium on foundations of computer science, FOCS 2019, Baltimore, Maryland, USA, November 9–12, 2019 (David Zuckerman, ed.), IEEE Computer Society, pp 1637–1649
5. Chitnis R, Cormode G, Esfandiari H, Hajiaghayi MT, McGregor A, Monemizadeh M, Vorotnikova S (2016) Kernelization via sampling with applications to finding matchings and related problems in dynamic graph streams. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016 (Robert Krauthgamer, ed.), SIAM, pp 1326–1344
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献