Abstract
The complexity theory and algorithms topic focuses on the theoretical foundations of parallel computing, especially the exploration of fundamental problems and issues from an algorithmic perspective and the formulation, investigation and evaluation of the appropriate computational models that allow such issues to be addressed in a rigorous, quantitative manner. Following a thorough reviewing process in which each paper was assessed by four referees, two papers have been selected for presentation as regular papers. An additional paper that was originally submitted to Topic 09 (and accepted as a research note) was also moved to this session for presentation. The committee would like to extend its sincere thanks to all those who contributed papers and to the many colleagues who helped with the reviewing process.
Chapter PDF
Similar content being viewed by others
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bilardi, G., Feldmann, R., Herley, K., Maggs, B. (2001). Complexity Theory and Algorithms. In: Sakellariou, R., Gurd, J., Freeman, L., Keane, J. (eds) Euro-Par 2001 Parallel Processing. Euro-Par 2001. Lecture Notes in Computer Science, vol 2150. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44681-8_47
Download citation
DOI: https://doi.org/10.1007/3-540-44681-8_47
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42495-6
Online ISBN: 978-3-540-44681-1
eBook Packages: Springer Book Archive