This course deals with the principles of parallel algorithm design
and complexity analysis, with emphasis on fundamental techniques and application
oriented algorithms.
Text: Introduction to Parallel Algorithms, by Joseph Jaja,
Addison Wesley, 1992.
Introduction
to Parallel Algorithms and Architectures: Arrays . Trees . Hypercubes,
by F. T. Leighton, Morgan Kaufmann Publishers, 1992.
Papers
from current literature
Prerequisites: Basic ideas in sequential algorithms.
Topics: PRAM, network models, divide and conquer, partitioning, list ranking, Euler-tour techniques, searching merging and sorting, graphs, arithmetic computations, computational geometry, randomized algorithms.
Phone: (225) 578-5238
Fax: (225) 578-5200
E-mail: