Euro-Par 2024 | Track 5: Theory and Algorithms | International European Conference on Parallel and Distributed Computing Track 5: Theory and AlgorithmsEuro-par

Track 5 - Theory and Algorithms

Chairs

  • Kengo Nakajima, RIKEN, Japan.
  • Henning Meyerhenke, Humboldt-Universität zu Berlin, Germany.

Program Committee

  • Sanjukta Bhowmick, University of North Texas
  • Erin Carson, Charles University
  • Jee Choi, University of Oregon
  • Lisa Claus, Lawrence Berkeley National Laboratory
  • Alfredo Cristobal-Salas, Universidad Veracruzana
  • Lionel Eyraud-Dubois, LaBRI -- Inria Bordeaux Sud-Ouest
  • Jeremy Fineman, Georgetown University
  • Pierre Fraigniaud, Université Paris Cité and CNRS
  • Takeshi Fukaya, Hokkaido University
  • Assefaw Gebremedhin, Washington State University
  • Pieter Ghysels, Lawrence Berkeley National Laboratory
  • Feng-Nan Hwang, National Central University
  • Masado Ishii, RIKEN R-CCS
  • Kamesh Madduri, The Pennsylvania State University
  • Fredrik Manne, University of Bergen
  • Othon Michail, University of Liverpool
  • Achour Mostefaoui, Nantes Université
  • Yusuke Nagasaka, FUJITSU LIMITED
  • Maria Potop-Butucaru, Sorbonne University
  • Ilya Safro, University of Delaware
  • Francesco Silvestri, University of Padova
  • Yihan Sun, University of California, Riverside
  • Flavio Vella, University of Trento
  • Helen Xu, Lawrence Berkeley Laboratories
  • Rio Yokota, Tokyo Institute of Technology

Focus

  • Design, analysis, and engineering of distributed and parallel algorithms
  • Theoretical foundations, models, and complexity issues
  • Data structures for parallel and distributed algorithms
  • Emerging paradigms for parallel and distributed computation
  • Theory and algorithms for emerging parallel/distributed architectures
  • Lower bounds for parallel/distributed computing
  • Approximation and randomized algorithms
  • Algorithms for combinatorial and graph problems
  • Algorithms for sparse and dense numerical linear algebra
  • Algorithms and models for Big Data/Data-intensive computing
  • Algorithms for routing and information dissemination in networks
  • Algorithms for social networks
  • Algorithms for dynamic networks
  • Algorithms for cloud and edge computing
  • Fault-tolerant and self-stabilizing algorithms
  • Power/energy-efficient algorithms
  • Tensor operations, low-rank approximation
  • Theoretical aspects of dependable, secure, and privacy-preserving distributed systems
  • Parallel/distributed aspects of learning and mining algorithms
  • Theoretical aspects of emerging architectures

In cooperation

Organized by

Supported by

Awards support