Advances in Garbled Circuits
Oct 27, 2025 - 48:12
Radio and PodcastLive Radio & PodcastsEducation
Strachey Lecture: From classical to non-classical stochastic shortest path problems
Professor Christel Baier delivers the Hillary Term 2024 Strachey Lecture Abstract: The classical stochastic shortest path (SSP) problems asks to find a policy for traversing a weighted stochastic graph until reaching a d...
About This Episode
Strachey Lecture: From classical to non-classical stochastic shortest path problems is an episode from Computer Science by Oxford University. Professor Christel Baier delivers the Hillary Term 2024 Strachey Lecture Abstract: The classical s...
Podcast
This episode belongs to Computer Science.
Listen Online
Use the player on this page to stream the episode online.
Episode Details
Published Feb 6, 2024, 57:09 long, audio available.
Related Episodes
Continue listening to more episodes from Computer Science.
Will Computers prove theorems?
May 15, 2025 - 46:25
Formalizing the Future: Lean’s Impact on Mathematics, Programming, and AI
May 15, 2025 - 47:14
Privacy, Verification, Robustness: A Cryptographer's perspective on ML
Mar 11, 2025 - 64:18
From probabilistic bisimulation to representation learning via metrics
Dec 2, 2024 - 55:03
Strachey Lecture: The Computer in the Sky
May 16, 2024 - 62:09
Strachey Lecture: How Can Algorithms Help to Protect our Privacy
Nov 13, 2023 - 54:48
Strachey Lecture: Use or Be Used - Regaining Control of AI
Sep 4, 2023 - 50:26