Advanced Topics in Algorithms and Complexity

Subject: 
Computer Science (CS)
Catalog number: 
860
Unit weight: 
0.50
Meet type: 
SEM
Grading basis: 
NUM
Cross-listing(s): 
N/A
Requisites: 
N/A
Description: 
Topic titles: 
1 Algorithmic Prblms : Internet
2 Algorithms for Polyhedra
3 Formal Languages&Number Theory
4 Algorithmic Found of Internet
5 Computational Geometry
6 Intro to Kolmogorov Complexity
7 Quantum algorithm & complexity
8 5 Prob in Algo Design & Analys
9 Automatic Sequences
10 Adaptive+Output Sensitive Algs
11 Complexity and Lower Bounds
12 Randomness & Complexity
13 Pattern Avoidability
14 Search Engines, Design to Impl
15 Geometric Construction
16 Parameterized/Exact Algorithms
17 Kolgomorov Complexity & Appl.
18 Geometric Reconstruction
19 On-line Algorithms
20 Geometric Data Structures
21 Patterns in Words
22 Parameterize & Reconfigure
23 Online Algorithms&Applications
24 Emerging Technologies
25 Sub linear-time Algorithms
26 Algorithms for Shortest Paths
27 Concentration Inequalities
28 The state of P vs NP
29 Communication Complexity
30 Reconfiguration Problems
Faculty: 
Mathematics (MAT)
Academic level: 
GRD
Course ID: 
011091