YoVDO

Innovations in Theoretical Computer Science 2020 - Session 6

Offered By: Paul G. Allen School via YouTube

Tags

Theoretical Computer Science Courses Algorithm Design Courses Computational Complexity Courses Scheduling Algorithms Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore cutting-edge research in theoretical computer science through this conference session from the Innovations in Theoretical Computer Science (ITCS) 2020 conference. Delve into five presentations covering diverse topics such as scheduling with predictions, online computation with untrusted advice, network coordination games, tournament rules, and prophet inequalities. Chaired by Anna Karlin, the session features talks by renowned researchers including Michael Mitzenmacher, Spyros Angelopoulos, Shant Boodaghians, Ariel Schvartzman, and Aviad Rubinstein. Gain insights into new concepts, models, and techniques that are shaping the future of computer science. Recorded on January 13, 2020, this 71-minute video includes closed captions for accessibility.

Syllabus

Innovations in Theoretical Computer Science 2020 Session 6


Taught by

Paul G. Allen School

Related Courses

Natural Language Processing
Columbia University via Coursera
Intro to Algorithms
Udacity
Conception et mise en œuvre d'algorithmes.
École Polytechnique via Coursera
Paradigms of Computer Programming
Université catholique de Louvain via edX
Data Structures and Algorithm Design Part I | 数据结构与算法设计(上)
Tsinghua University via edX