Fundamental Algorithms (CSE) (IN2157)




  • Fundamentals: Models of Computation, Complexity Measures
  • Sorting: Bubble-Sort, Merge-Sort, Quick-Sort, Median-Algorithms, Lower Bounds, etc.: sorting in parallel
  • Searching: Hashing, Search Trees, etc.
  • Arithmetic Problems: parallel prefix computation, parallel matrix and vector operations
  • Foundations of parallel algorithms and simple models of parallel computation
  • Algorithms on (weighted) graphs: traversals, shortest paths, etc.

Literature: Cormen, Leiserson, Rivest, Stein: Introduction to Algorithms. MIT Press.
For parallel algorithms, see Berman, Paul: Algorithms: Sequential, Parallel, and Distributed, or JaJa: Introduction to Parallel Algorithms