This course examines such topics as greedy algorithms, dynamic programming, graph algorithms, string processing, and algorithms for computational geometry. We will discuss how to use these techniques ...

Brief Description of Course Content. Covers the fundamentals of algorithms and various algorithmic strategies, including time and space complexity, sorting algorithms, recurrence relations, divide and ...

Greedy Algorithms; Dynamic Programming Algorithms; Algorithms for the following primitives: Sorting: bubblesort, mergesort, heapsort, quicksort. Searching; Graph Algorithms: Depth/Breadth First Search ...

Richard M. Karp, Michael Held, Finite-State Processes and Dynamic Programming, SIAM Journal on Applied Mathematics, Vol. 15, No. 3 (May, 1967), pp. 693-718. ... and this characterization is used in ...

Introduction to programming in Java. Introduction to the theory of algorithms: running time and correctness of an algorithm. Recursion. Data structures: arrays, linked lists, stacks, queues, binary ...

Most beautiful algorithm: Dynamic programming (e.g., Viterbi, forward-backward, variable elimination & belief propagation algorithms). Dynamic programming is one of the most elegant algorithmic ...