Modern Parallel Algorithms (Invited Talk)

Author Artur Czumaj

Thumbnail PDF


  • Filesize: 438 kB
  • 2 pages

Document Identifiers

Author Details

Artur Czumaj
  • University of Warwick, Coventry, UK

Cite AsGet BibTex

Artur Czumaj. Modern Parallel Algorithms (Invited Talk). In 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 272, pp. 3:1-3:2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)


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.

Subject Classification

ACM Subject Classification
  • Theory of computation → Massively parallel algorithms
  • Theory of computation → Distributed algorithms
  • Mathematics of computing → Graph algorithms
  • Distributed computing
  • parallel computing


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail