Arrow Research search
Back to MFCS

MFCS 2023

Modern Parallel Algorithms (Invited Talk)

Conference Paper Accepted Paper Algorithms and Complexity ยท Theoretical Computer Science

Abstract

Recent advances in the design of efficient parallel algorithms have been largely focusing on the nowadays classical model of parallel computing called Massive Parallel Computation (MPC), which follows the framework of MapReduce systems. In this talk we will survey recent advances in the design of algorithms for graph problems for the MPC model and will mention some interesting open questions in this area.

Authors

Keywords

  • Distributed computing
  • parallel computing

Context

Venue
International Symposium on Mathematical Foundations of Computer Science
Archive span
1973-2025
Indexed papers
3045
Paper id
910919141404621589
v2026.09.13