Simons Institute Courses

Auto-Bidding, Auctions, and Ad Allocation

Explore automated bidding in online advertising, its impact on auction design, and challenges in ad allocation. Learn about recent research at the intersection of auto-bidding and auction theory.

• YouTube
• 42 minutes
• Self-Paced
• Free Video

Matching and Disclosure

Explore economic theories of matching and disclosure in market design, focusing on online platforms and their impact on market efficiency and participant strategies.

• YouTube
• 32 minutes
• Self-Paced
• Free Video

Simple Proofs of Important Results in Market Design

Explore key algorithms and theorems in matching theory and market design, focusing on deferred acceptance and top trading cycles, with simple proofs of fundamental concepts.

• YouTube
• 43 minutes
• Self-Paced
• Free Video

Streaming - Synchronous, Recursion, and Incremental Computation

Explore synchronous streaming operators for elegant support of recursion and incremental computation in databases. Learn about algebraic equivalences and their analogy to discrete signal processing.

• YouTube
• 1 hour 5 minutes
• Self-Paced
• Free Video

Insights from Engineering Sketches for Production and Using Sketches at Scale

Explore insights on engineering sketches for large-scale production, covering Yahoo's journey in developing and implementing sketching algorithms across multiple languages and platforms.

• YouTube
• 1 hour 4 minutes
• Self-Paced
• Free Video

Error Correction for Streaming Messages

Explores error-resilient encoding for streaming data, enabling accurate sketch computation despite message corruption while maintaining efficiency in communication and space complexity.

• YouTube
• 33 minutes
• Self-Paced
• Free Video

Sublinear Time Eigenvalue Approximation via Random Sampling

Explore efficient algorithms for approximating eigenvalues of large matrices using random sampling techniques, with applications in data analysis and machine learning.

• YouTube
• 47 minutes
• Self-Paced
• Free Video

Streaming Lower Bounds for the Needle Problems

Exploring tight lower bounds for frequency estimation in random order data streams, focusing on the needle problem and its implications for streaming algorithm design.

• YouTube
• 44 minutes
• Self-Paced
• Free Video

Streaming Euclidean K-Median and K-Means With O-Log N Space

Innovative algorithm for Euclidean k-median and k-means clustering in data streams, achieving (1+ε)-approximation with significantly reduced memory usage, breaking long-standing space complexity barriers.

• YouTube
• 1 hour
• Self-Paced
• Free Video

Pseudorandom Hashing for Space-Bounded Computation with Applications in Streaming

Explores a new pseudorandom generator for space-bounded computation, improving update time in streaming algorithms without sacrificing space. Applications in Fp estimation and CountSketch are discussed.

• YouTube
• 57 minutes
• Self-Paced
• Free Video

Resizable Sketches

Explore techniques for maintaining fixed accuracy in sketches while allowing size growth, addressing challenges in data stream processing and algorithm design.

• YouTube
• 43 minutes
• Self-Paced
• Free Video

A Simple Quantum Sketch With Applications to Graph Algorithms

Explore quantum sketching for set analysis and its applications in graph algorithms, including triangle counting and Max-Dicut, with potential for significant space efficiency gains.

• YouTube
• 57 minutes
• Self-Paced
• Free Video

Accessing Answers to Unions of Conjunctive Queries with Ideal Time Guarantees - I

Explore efficient algorithms for accessing answers to unions of conjunctive queries, focusing on ideal time guarantees and fine-grained complexity in query evaluation.

• YouTube
• 1 hour 9 minutes
• Self-Paced
• Free Video

Fine Grained Complexity

Explore fine-grained complexity theory, its applications in logic, and its role in query evaluation, offering insights into computational efficiency and algorithmic analysis.

• YouTube
• 54 minutes
• Self-Paced
• Free Video

Intermediate Relational Algorithm Design

Explore fine-grained complexity logic and query evaluation in relational algorithms, focusing on advanced techniques for optimizing database operations and query processing.

• YouTube
• 44 minutes
• Self-Paced
• Free Video