Computational models are abstract representations of algorithms that capture their essential features and ignore the irrelevant details. For example, a computational model can describe how an ...

For decades we have used the RAM (random-access memory) 2 and PRAM (parallel RAM) models 5 along with asymptotic analysis to measure the complexity of algorithms. The RAM and PRAM models treat all ...

--> Algorithm analysis is an important part of computational complexity theory, which provides theoretical estimation for the required resources of an algorithm to solve a specific computational ...

Shortest Path Algorithms. Chapter 5: Binary search tree, Red black Tree, Binomial heap, B-Tree and Fibonacci Heap. Chapter 6: Approximation Algorithms, Sorting Networks, Matrix operations, Fast ...

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 ...

Vijaya Ramachandran (vlr"at"cs.utexas.edu) --- Algorithm design and analysis, parallel computation, machine models, graph theory, graph algorithms and data structures. Brent Waters --- cryptography.

Algorithm Design Based on Perturbations and Smoothed Analysis. Finally, we hope insights gained from smoothed analysis will lead to new ideas in algorithm design. On a theoretical front, Kelner and ...

Algorithm design and analysis is fundamental to all areas of computer science and gives a rigorous framework for the study optimization. This course provides an introduction to algorithm design ...