Algorithms to Live By: Optimal Stopping and Logarithmic Regret

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (27)

Page 1 of 3

Randomness in Social Self-Organization

Discusses randomness in social self-organization, exploring its role in democratic processes and the challenges of representation and accuracy.

Randomness in Social Process

Explores randomness in social processes, focusing on the selection of authority roles.

Merge Sort: Sorting Algorithm

Explains the merge sort algorithm, its correctness, and time complexity compared to other sorting algorithms.

Quantum Random Number Generation

Explores quantum random number generation, discussing the challenges and implementations of generating good randomness using quantum devices.

Optimization Algorithms: Greedy Approach

Explores optimization problems and greedy algorithms for efficient decision-making.

Introduction to Algorithms: Course Overview and Basics

Introduces the CS-250 Algorithms course, covering its structure, objectives, and key topics in algorithmic problem-solving.

Standard Library: Containers and Algorithms

Explores C++ standard library containers and algorithms, including associative tables, stacks, queues, and random number generation.

Quick Sort: Divide-and-Conquer

Explores the Quick Sort algorithm, focusing on its divide-and-conquer approach and time complexity analysis.

Building the Internet Computer: A Glimpse into an Ambitious Adventure

Explores building the 'Internet Computer' and 'Beyond Blockchains', covering WebAssembly, consensus algorithms, state machine replication, and challenges in deriving randomness.

Abstract Data Structures and Standard Libraries

Covers abstract data structures and the C++ standard library, including linked lists, stacks, queues, and complex numbers.