YoVDO

Deterministic and Efficient Interactive Coding from Hard-to-Decode Tree Codes

Offered By: IEEE via YouTube

Tags

Coding Theory Courses Computer Science Courses Cryptography Courses Algorithm Design Courses Information Theory Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a 25-minute IEEE conference talk on deterministic and efficient interactive coding derived from hard-to-decode tree codes, presented by experts Zvika Brakerski from Weizmann Institute, Yael Tauman Kalai from Microsoft and MIT, and Raghuvansh Saxena from Princeton University. Delve into the intricacies of this advanced topic in computer science and cryptography, gaining insights into the latest research and developments in interactive coding techniques.

Syllabus

Deterministic and Efficient Interactive Coding from Hard-to-Decode Tree Codes


Taught by

IEEE FOCS: Foundations of Computer Science

Tags

Related Courses

Probabilistic Graphical Models 1: Representation
Stanford University via Coursera
Computer Security
Stanford University via Coursera
Intro to Computer Science
University of Virginia via Udacity
Introduction to Logic
Stanford University via Coursera
Internet History, Technology, and Security
University of Michigan via Coursera