Topic 12: Theory and Algorithms for Parallel Computation

  • Danny Krizanc
  • Michael Kaufmann
  • Pierre Fraigniaud
  • Christos Zaroliagis
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4128)

Abstract

Parallelism exists at all levels in computing systems from circuits to grids. Effective use of parallelism crucially relies on the availability of suitable models of computation for algorithm design and analysis, and on efficient strategies for the solution of key computational problems on prominent classes of platforms. The study of foundational and algorithmic issues has led to many important advances in parallel computing and has been well represented in the Euro-Par community over that past two decades. A distinctive feature of this topic is the variety of results it as reported over the years that address classical problems as well as the new challenges posed by emerging computing paradigms. This year was no different.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Danny Krizanc
    • 1
  • Michael Kaufmann
    • 1
  • Pierre Fraigniaud
    • 1
  • Christos Zaroliagis
    • 1
  1. 1.Topic Chairs 

Personalised recommendations