Course Name: CS6170 : Parallel and Randomized Algorithms

Description: Flynn classification? SIMD algorithms for sorting and searching? Parallel graph algorithms or connectivity? Biconnectivity? Bridges? Parallel tree contraction and expression evaluation? Complexity measure for VLSI algorithm? AT 2optimal algorithms? Lower bounds for VLSI computations? Randomized algorithms? Parallel randomized algorithms in computational geometry? Randomized graph algorithms? Recent trends in parallel algorithms.

Slot: R

RoomNo:

Instructor: Jayalal Sarma M N

Period: JUL-NOV 2013

This page was created on: Thursday 19th of September 2013 09:38:50 PM