The goal of algorithm design and complexity theory in parallel/distributed computing is to study efficient algorithms for (and limitations on the complexity of) problems, taking into account such parallel complexity measures as the number of processing nodes, the amount of communication or other resources in addition to classical measures such as time and space. Research areas such as development of efficient parallel algorithms including new techniques on randomization and approximation, on realistic parallel computation models, communication complexity, parallel complexity classes, and lower bounds for specific problems have received a lot of attention in recent years, but many important problems remain open. We invite papers concerning investigations in these areas.
Prof. Christos Kaklamanis
Computer Technology Institute and
Department of Computer Engineering & Informatics
University of Patras, Greece
Prof. Michael Kaufmann
Wilhelm-Schickard-Institut für Informatik
Universität Tübingen, Germany