CS 161: Design and Analysis of Algorithms
Worst and average case analysis. Recurrences and asymptotics. Efficient algorithms for sorting, searching, and selection. Data structures: binary search trees, heaps, hash tables. Algorithm design techniques: divide-and-conquer, dynamic programming, greedy algorithms, randomization. Algorithms for fundamental graph problems: minimum-cost spanning tree, connected components, topological sort, and shortest paths. Possible additional topics: network flow, string searching, amortized analysis, stable matchings and approximation algorithms. Prerequisite: 103 or 103B; 109 or
STATS 116.
Terms: Aut, Win, Sum
| Units: 3-5
| UG Reqs: GER:DB-EngrAppSci, WAY-FR
Instructors:
Anari, N. (PI)
;
Charikar, M. (PI)
;
Rubinstein, A. (PI)
...
more instructors for CS 161 »
Instructors:
Anari, N. (PI)
;
Charikar, M. (PI)
;
Rubinstein, A. (PI)
;
Tullis, I. (PI)
;
Boennighausen, P. (TA)
;
Cai, B. (TA)
;
Chirananthavat, T. (TA)
;
Correa Dias Godoy, F. (TA)
;
Eicher, S. (TA)
;
Emami, G. (TA)
;
Francisco, J. (TA)
;
Garg, R. (TA)
;
Grannis-Vu, R. (TA)
;
Hong, J. (TA)
;
Iswara, A. (TA)
;
Jain, S. (TA)
;
Khanna, S. (TA)
;
Liu, Z. (TA)
;
Lowe, S. (TA)
;
Lu, L. (TA)
;
Luxsuwong, N. (TA)
;
Noyola, T. (TA)
;
Palaparthi, A. (TA)
;
Strassle, C. (TA)
;
Tran, M. (TA)
;
Turati, A. (TA)
;
Villa-Renteria, I. (TA)
;
Vuong, J. (TA)
;
Wang, Y. (TA)
;
Wen, E. (TA)
;
Xia, L. (TA)
;
Yang, A. (TA)
;
Yang, C. (TA)
;
Zhao, J. (TA)
;
Zhu, B. (TA)
CS 261: Optimization and Algorithmic Paradigms
Algorithms for network optimization: max-flow, min-cost flow, matching, assignment, and min-cut problems. Introduction to linear programming. Use of LP duality for design and analysis of algorithms. Approximation algorithms for NP-complete problems such as Steiner Trees, Traveling Salesman, and scheduling problems. Randomized algorithms. Introduction to sub-linear algorithms and decision making under uncertainty. Prerequisite: 161 or equivalent.
Terms: Spr
| Units: 3
Filter Results: