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. ,
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. ,
Analyzing graph structure via linear measurements, Proc. of the 23rd annual ACM-SIAM Symp. on Discrete Algorithms, pp.459-467, 2012. ,
Parallel algorithms for geometric graph problems, Proc. of the 46th annual ACM Symp. on Theory of computing, pp.574-583, 2014. ,
Parallel graph connectivity in log diameter rounds, 59th IEEE Annual Symp. on Foundations of Computer Science, FOCS 2018, pp.674-685, 2018. ,
Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms, 45th International Colloquium on Automata, Languages, and Programming, vol.107, pp.1-7, 2018. ,
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. ,
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. ,
Fully dynamic maximal matching in O(log n) update time, IEEE 52nd Annual Symp. on Foundations of Computer Science, pp.383-392, 2011. ,
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 deamortization approach for dynamic spanner and dynamic maximal matching, Proc. of the 31st Annual ACM-SIAM Symp. on Discrete Algorithms, 2019. ,
Optimal dynamic distributed MIS, Proc. of the 2016 ACM Symp. on Principles of Distributed Computing, PODC '16, pp.217-226, 2016. ,
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. ,
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. ,
Round compression for parallel matching algorithms, Proc. of the 50th Annual ACM SIGACT Symp. on Theory of Computing, STOC 2018, pp.471-484, 2018. ,
A new approach to dynamic all pairs shortest paths, Journal of the ACM (JACM), vol.51, issue.6, pp.968-992, 2004. ,
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. ,
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. ,
Sorting, searching, and simulation in the mapreduce framework, International Symp. on Algorithms and Computation, pp.374-383, 2011. ,
Randomized fully dynamic graph algorithms with polylogarithmic time per operation, Journal of the ACM (JACM), vol.46, issue.4, pp.502-516, 1999. ,
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. ,
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 fast and simple randomized parallel algorithm for maximal matching, Information Processing Letters, vol.22, issue.2, pp.77-80, 1986. ,
A model of computation for MapReduce, Proc. of the 21st annual ACM-SIAM Symp. on Discrete Algorithms, pp.938-948, 2010. ,
, Connected components at scale via local contractions, 2018.
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. ,
Improved distributed approximate matching, Proc. of the 20th annual Symp. on Parallelism in algorithms and architectures, pp.129-136, 2008. ,
Fast connected components computation in large graphs by vertex pruning, IEEE Transactions on Parallel & Distributed Systems, issue.1, pp.1-1, 2017. ,
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. ,
Simple deterministic algorithms for fully dynamic maximal matching, ACM Transactions on Algorithms (TALG), vol.12, issue.1, p.7, 2016. ,
Fully dynamic maximal matching in constant update time, IEEE 57th Annual Symp. on Foundations of Computer Science, pp.325-334, 2016. ,
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. ,