Theory and algorithms for parallel computation

Topic 13


The goal of algorithm design and complexity theory in parallel/distributed computing is to develop efficient solutions for problems and to study limitations on their complexity, taking into account relevant quantities such as the number of processing nodes and the amount of communication or other resources required, in addition to the classical time and space measures. Research areas related to the development of efficient parallel algorithms including realistic models of parallel computation, randomization and approximation techniques, communication complexity, parallel complexity classes, and lower bounds for specific problems, have received a lot of attention in recent years, but many important issues remain open. Papers in these areas are solicited.

Global Chair:
Prof. Kaklamanis Christos
Computer Engineering & Informatics Department
University of Patras

Vice Chair:
Prof. Nancy Amato
Department of Computer Science
Texas A&M University, US

Vice Chair:
Prof. Danny Krizanc
Computer Science Group
Mathematics Department
Wesleyan University
Middletown, CT 06459 USA

Local Chair: Prof. Andrea Pietracaprina
Dipartimento di Ingegneria dell'Informazione
Universita' di Padova

Last modified: Fri Nov 28 19:29:47 CET 2003
Next topic Previous topic