I. Abraham, S. Chechik, and S. Krinninger, Fully dynamic all-pairs shortest paths with worst-case update-time revisited, Proc. of the 28th Annual ACM-SIAM Symp. on Discrete Algorithms, pp.440-452, 2017.

K. J. Ahn and S. Guha, Access to data and number of iterations: Dual primal algorithms for maximum matching under resource constraints, ACM Transactions on Parallel Computing (TOPC), vol.4, issue.4, p.17, 2018.

K. J. Ahn, S. Guha, and A. Mcgregor, Analyzing graph structure via linear measurements, Proc. of the 23rd annual ACM-SIAM Symp. on Discrete Algorithms, pp.459-467, 2012.

A. Andoni, A. Nikolov, K. Onak, and G. Yaroslavtsev, Parallel algorithms for geometric graph problems, Proc. of the 46th annual ACM Symp. on Theory of computing, pp.574-583, 2014.

A. Andoni, Z. Song, C. Stein, Z. Wang, and P. Zhong, Parallel graph connectivity in log diameter rounds, 59th IEEE Annual Symp. on Foundations of Computer Science, FOCS 2018, pp.674-685, 2018.

M. Arar, S. Chechik, S. Cohen, C. Stein, and D. Wajc, Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms, 45th International Colloquium on Automata, Languages, and Programming, vol.107, pp.1-7, 2018.

S. Assadi, M. Bateni, A. Bernstein, V. Mirrokni, and C. Stein, Coresets meet edcs: algorithms for matching and vertex cover on massive graphs, Proc. of the 30th Annual ACM-SIAM Symp. on Discrete Algorithms, pp.1616-1635, 2019.

S. Assadi, K. Onak, B. Schieber, and S. Solomon, Fully dynamic maximal independent set with sublinear update time, Proc. of the 50th Annual ACM SIGACT Symp. on Theory of Computing, STOC 2018, pp.815-826, 2018.

S. Baswana, M. Gupta, and S. Sen, Fully dynamic maximal matching in O(log n) update time, IEEE 52nd Annual Symp. on Foundations of Computer Science, pp.383-392, 2011.

P. Beame, P. Koutris, and D. Suciu, Communication steps for parallel query processing, Proc. of the 32nd ACM SIGMOD-SIGACT-SIGAI Symp. on Principles of database systems, pp.273-284, 2013.

A. Bernstein, S. Forster, and M. Henzinger, A deamortization approach for dynamic spanner and dynamic maximal matching, Proc. of the 31st Annual ACM-SIAM Symp. on Discrete Algorithms, 2019.

K. Censor-hillel, E. Haramaty, and Z. Karnin, Optimal dynamic distributed MIS, Proc. of the 2016 ACM Symp. on Principles of Distributed Computing, PODC '16, pp.217-226, 2016.

M. Charikar and S. Solomon, Fully Dynamic Almost-Maximal Matching: Breaking the Polynomial Worst-Case Time Barrier, 45th International Colloquium on Automata, Languages, and Programming, vol.33, pp.1-33, 2018.

L. Chitnis, A. Sarma, A. Machanavajjhala, and V. Rastogi, Finding connected components in map-reduce in logarithmic rounds, Proc. of the 2013 IEEE International Conference on Data Engineering, ICDE '13, pp.50-61, 2013.

A. Czumaj, J. ??cki, A. M?dry, S. Mitrovi?, K. Onak et al., Round compression for parallel matching algorithms, Proc. of the 50th Annual ACM SIGACT Symp. on Theory of Computing, STOC 2018, pp.471-484, 2018.

C. Demetrescu and G. F. Italiano, A new approach to dynamic all pairs shortest paths, Journal of the ACM (JACM), vol.51, issue.6, pp.968-992, 2004.

M. Ghaffari, T. Gouleakis, C. Konrad, S. Mitrovi?, and R. Rubinfeld, Improved massively parallel computation algorithms for MIS, Matching, and Vertex cover, Proc. of the 2018 ACM Symp. on Principles of Distributed Computing, PODC '18, pp.129-138, 2018.

M. Ghaffari and J. Uitto, Sparsifying distributed algorithms with ramifications in massively parallel computation and centralized local computation, Proc. of the 30th Annual ACM-SIAM Symp. on Discrete Algorithms, pp.1636-1653, 2019.

M. T. Goodrich, N. Sitchinava, and Q. Zhang, Sorting, searching, and simulation in the mapreduce framework, International Symp. on Algorithms and Computation, pp.374-383, 2011.

M. R. Henzinger and V. King, Randomized fully dynamic graph algorithms with polylogarithmic time per operation, Journal of the ACM (JACM), vol.46, issue.4, pp.502-516, 1999.

J. Holm, K. D. Lichtenberg, and M. Thorup, Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity, Journal of the ACM (JACM), vol.48, issue.4, pp.723-760, 2001.

J. E. Hopcroft and R. M. Karp, An O(n 5/2 ) algorithm for maximum matchings in bipartite graphs, SIAM Journal on computing, vol.2, issue.4, pp.225-231, 1973.

A. Israeli and A. Itai, A fast and simple randomized parallel algorithm for maximal matching, Information Processing Letters, vol.22, issue.2, pp.77-80, 1986.

H. Karloff, S. Suri, and S. Vassilvitskii, A model of computation for MapReduce, Proc. of the 21st annual ACM-SIAM Symp. on Discrete Algorithms, pp.938-948, 2010.

J. ??cki, V. Mirrokni, and M. W?odarczyk, Connected components at scale via local contractions, 2018.

S. Lattanzi, B. Moseley, S. Suri, and S. Vassilvitskii, Filtering: a method for solving graph problems in MapReduce, Proc. of the 23th annual ACM Symp. on Parallelism in algorithms and architectures, pp.85-94, 2011.

Z. Lotker, B. Patt-shamir, and S. Pettie, Improved distributed approximate matching, Proc. of the 20th annual Symp. on Parallelism in algorithms and architectures, pp.129-136, 2008.

A. Lulli, E. Carlini, P. Dazzi, C. Lucchese, and L. Ricci, Fast connected components computation in large graphs by vertex pruning, IEEE Transactions on Parallel & Distributed Systems, issue.1, pp.1-1, 2017.

D. Nanongkai, T. Saranurak, and C. Wulff-nilsen, Dynamic minimum spanning forest with subpolynomial worst-case update time, 2017 IEEE 58th Annual Symp. on Foundations of Computer Science (FOCS), pp.950-961, 2017.

O. Neiman and S. Solomon, Simple deterministic algorithms for fully dynamic maximal matching, ACM Transactions on Algorithms (TALG), vol.12, issue.1, p.7, 2016.

S. Solomon, Fully dynamic maximal matching in constant update time, IEEE 57th Annual Symp. on Foundations of Computer Science, pp.325-334, 2016.

G. Yaroslavtsev and A. Vadapalli, Massively parallel algorithms and hardness for single-linkage clustering under ? p distances, Proc. of the 35th International Conference on Machine Learning, vol.80, pp.10-15, 2018.