YoVDO

The Word RAM Model - Lecture 6c of CS Theory Toolkit

Offered By: Ryan O'Donnell via YouTube

Tags

Theoretical Computer Science Courses Radix Sort Courses Algorithms Courses

Course Description

Overview

Explore the Word RAM model for algorithms and delve into the complexity of sorting integers in this graduate-level lecture from Carnegie Mellon University's "CS Theory Toolkit" course. Gain insights into math and computer science fundamentals essential for research in theoretical computer science. Learn about the Word RAM model, examine practical examples, and discuss its applications. Investigate sorting algorithms, with a focus on Radix Sort. Taught by Professor Ryan O'Donnell, this 26-minute lecture provides a comprehensive overview of key concepts in algorithm design and analysis.

Syllabus

Intro
Word RAM Model
Example
Discussion
Sorting
Radix Sort


Taught by

Ryan O'Donnell

Related Courses

Information Theory
The Chinese University of Hong Kong via Coursera Intro to Computer Science
University of Virginia via Udacity Analytic Combinatorics, Part I
Princeton University via Coursera Algorithms, Part I
Princeton University via Coursera Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Stanford University via Coursera