COURSE GOALS: This course will cover the theoretical aspects of algorithm design and analysis. Starting with a matching problem, we will first discuss the three central tasks of algorithm design: ...

Algorithm design strategies such as divide and conquer. Elementary techniques for analysis; asymptotic analysis, recursion equations, estimation methods, elementary combinatorial arguments.

Advanced study in models of computation, programming languages and algorithms with a specific focus on concurrent programming. The course includes models of computation, programming language paradigms ...

An introduction to the analysis and implementation of algorithms and data structures including linear data structures, trees, graphs, hash tables, searching algorithms, sorting algorithms, ...

Brief Description of Course Content Examines the structure and function of operating systems as an intermediary between applications and computer hardware. Topics include OS design goals, hardware ...

In this paper, the maximum likelihood estimation of a general two-level structural equation model with an unbalanced design is formulated as a missing data problem by treating the latent random ...

In this paper we examine the Cuthill-McKee algorithm for ordering the unknowns and equations in systems of linear equations, Ax = b, where A is sparse, symmetric, and positive definite. This algorithm ...