Track 5 - Theory and Algorithms
CHAIRS
- Anne Benoit, École Normale Supérieure de Lyon (ENS Lyon), France
- Geppino Pucci, University of Padua, Italy
Program Committee
- Ruben Becker, Ca' Foscari University of Venice, Italy
- Ioana Bercea, KTH Royal Institute of Technology, Sweden
- Petra Berenbrink, University of Hamburg, Germany
- Vittorio Bilò, University of Salento, Italy
- Tiziana Calamoneri, Sapienza University of Rome, Italy
- Matteo Ceccarello, University of Padova, Italy
- Fabien Dufoulon, Lancaster University, United Kingdom
- Lionel Eyraud-Dubois, LaBRI -- Inria Bordeaux Sud-Ouest, France
- Leszek Gasieniec, University of Liverpool, United Kingdom
- Sayaka Kamei, University of Hiroshima, Japan
- Loris Marchal, CNRS, France
- Achour Mostéfaoui, Université Nantes, France
- Yusuke Nagasaka, Fujitsu Limited, Japan
- Manuel Penschuck, University of Southern Denmark, Denmark
- Lucas Perotin, INRIA, France
- Ilie Sarpe, KTH Stockholm, Sweden
- Jonas Sauer, Karlsruhe Institute of Technology, Germany
- Hongyang Sun, Univeristy of Kansas, USA
- Jesper Träff, TU Wien, Austria
- Bora Ucar, CNRS, France
- Helen Xu, Georgia Tech, USA
- Andrea Clementi, University of Rome Tor Vergata, Italy
- Christos Kaklamanis, University of Patras, Greece
- Sotiris Nikoletseas, Patras University, Greece
FOCUS
- Design, analysis, and engineering of distributed and parallel algorithms
- Theoretical foundations, models, complexity, and lower bounds for parallel/distributed computing
- Data structures for parallel and distributed algorithms
- Emerging paradigms for parallel and distributed computation
- Theory and algorithms for emerging parallel/distributed architectures
- Approximation, randomized, and power/energy-efficient algorithms
- Algorithms for combinatorial and graph problems
- Algorithms for sparse/dense numerical linear algebra and tensor operations
- Algorithms and models for big data and data-intensive computing
- Algorithms for routing and information dissemination in networks
- Algorithms for dynamic and social networks
- Algorithms for cloud and edge computing
- Fault-tolerant and self-stabilizing algorithms
- Theoretical aspects of dependable, secure, and privacy-preserving distributed systems
- Parallel/distributed aspects of learning and mining algorithms
- Theoretical aspects of emerging architectures