IEEE FOCS: Foundations of Computer Science Talks & Presentations

IEEE

Indistinguishability Obfuscation from Well Founded Assumptions - Part 1

Explore the concept of indistinguishability obfuscation, its historical perspective, and related topics like pseudorandom objects and learning with errors in computer science.

• YouTube
• 50 minutes
• On-Demand
• Conference Talk

IEEE

Edge-Weighted Online Bipartite Matching

Learn techniques for edge-weighted online bipartite matching, including competitive ratio analysis, greedy algorithms, and online correlated selection. Explore primal-dual methods and factor-revealing linear programs.

• YouTube
• 28 minutes
• On-Demand
• Conference Talk

IEEE

An Improved Exponential-Time Approximation Algorithm for Fully-Alternating Games Against Nature

Explore improved exponential-time approximation algorithms for fully-alternating games against nature, covering adversarial versions, MA formulas, and steepener algorithms.

• YouTube
• 33 minutes
• On-Demand
• Conference Talk

IEEE

Computation in the Brain Tutorial - Part 2

Explore neural computation models, focusing on assembly calculus and its applications in language processing, with insights from leading researchers in computational neuroscience.

• YouTube
• 1 hour 52 minutes
• On-Demand
• Conference Talk

IEEE

Computation in the Brain - Part 1

Explore neural computation through a historical lens, from ancient theories to modern discoveries in neuroscience, covering key concepts like synapses, neurotransmitters, and brain structures.

• YouTube
• 1 hour 9 minutes
• On-Demand
• Conference Talk

IEEE

Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model

Explore spectral independence in high-dimensional expanders and its application to the hardcore model, focusing on Glauber dynamics, complexity phase transitions, and future research directions.

• YouTube
• 26 minutes
• On-Demand
• Conference Talk

IEEE

Cookbook Lower Bounds for Statistical Inference in Distributed and Constrained Settings - Part 1

Explore statistical inference in distributed and constrained settings, focusing on lower bounds, protocols, and models for discrete distributions and high-dimensional domains.

• YouTube
• 32 minutes
• On-Demand
• Conference Talk

IEEE

Cookbook - Lower Bounds for Statistical Inference in Distributed and Constrained Settings - Part 4

Explore statistical inference in distributed and constrained settings, focusing on lower bounds, simulation techniques, and non-interactive inference methods.

• YouTube
• 38 minutes
• On-Demand
• Conference Talk

IEEE

Towards a Proof of the Fourier Entropy Conjecture

Explore the Fourier Entropy Conjecture through concentration, entropies, and influence, with insights from leading researchers in mathematical analysis and theoretical computer science.

• YouTube
• 23 minutes
• On-Demand
• Conference Talk

IEEE

Relaxed Locally Decodable Codes

Explore advanced concepts in coding theory, focusing on relaxed locally decodable codes and their applications in data storage and transmission.

• YouTube
• 51 minutes
• On-Demand
• Conference Talk

IEEE

Relaxed Locally Decodable Codes - Part 1

Explore coding theory, locally decodable codes, and their relaxed variants, focusing on applications, logical polynomials, and synthesis techniques in this IEEE presentation.

• YouTube
• 34 minutes
• On-Demand
• Conference Talk

IEEE

Indistinguishability Obfuscation from Well Founded Assumptions - Part 3

Explore advanced cryptographic concepts like indistinguishability obfuscation, learning parity with noise, and structured seed PRGs. Delve into degree-2.5 integer PRGs and their applications in cryptography.

• YouTube
• 54 minutes
• On-Demand
• Conference Talk

IEEE

Unique Decoding of Explicit Epsilon-Balanced Codes Near the Gilbert–Varshamov Bound

Explore error-correcting codes near the Gilbert-Varshamov bound, focusing on unique decoding, expansion, and distance amplification techniques in coding theory.

• YouTube
• 24 minutes
• On-Demand
• Conference Talk

IEEE

Twin-width I - Tractable FO Model Checking

Explore tractable FO model checking using twin-width, covering trigraphs, contraction sequences, and dynamic programming for efficient graph analysis.

• YouTube
• 24 minutes
• On-Demand
• Conference Talk

IEEE

Benchmark Design and Prior-independent Optimization

Learn techniques for designing benchmarks and optimizing algorithms without prior knowledge, focusing on Bayesian, prior-independent, and prior-free analyses in mechanism design.

• YouTube
• 24 minutes
• On-Demand
• Conference Talk