IEEE FOCS: Foundations of Computer Science Talks & Presentations

IEEE

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

Explore advanced algorithms for games against nature with Andrew Drucker from the University of Chicago, in a concise, under 1-hour material by IEEE.

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

IEEE

Computation in the Brain Tutorial - Part 2

Dive into brain computation with Christos H. Papadimitriou and Santosh S. Vempala in this 1-2 hour IEEE tutorial. Explore mathematical brain models, language studies, and more.

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

IEEE

Computation in the Brain - Part 1

Explore the origins and development of neuroscience with Christos H. Papadimitriou and Santosh S. Vempala in this 1-2 hour tutorial from IEEE.

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

IEEE

More Barriers for Rank Methods, via a "Numeric to Symbolic" Transfer

Explore tensor rank methods with IEEE's concise material, featuring insights from experts like Ankit Garg and Avi Wigderson. Less than 1-hour commitment.

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

IEEE

Noise Sensitivity on the p-Biased Hypercube

Explore noise sensitivity on the p-Biased Hypercube with IEEE in less than an hour, covering topics from introduction to results summary.

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

IEEE

Breaking of 1RSB in Random MAX-NAE-SAT

Explore the breaking of 1RSB in random MAX-NAE-SAT with IEEE. Dive into solution spaces, model work, and variable branches in under an hour.

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

IEEE

Approximating Constraint Satisfaction Problems on High Dimensional Expanders

Explore constraint satisfaction problems on high-dimensional expanders with IEEE. Gain insights in less than an hour. Ideal for those interested in problem-solving.

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

IEEE

Sampling Graphs Without Forbidden Subgraphs and Unbalanced Expanders With Negligible Error

Dive into graph sampling and expanders with negligible error in this short, intensive program by IEEE. Learn from experts Benny Applebaum and Eliran Kachlon.

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

IEEE

Exponential Separation between Quantum Communication and Logarithm of Approximate Rank

Explore quantum communication and logarithm of approximate rank in less than an hour with IEEE's concise material by Makrand Sinha and Ronald de Wolf.

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

IEEE

Finding Monotone Patterns in Sublinear Time

Explore monotone patterns in sublinear time with IEEE's concise program. Learn about adaptive algorithms, longest increasing subsequences, and more in under an hour.

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

IEEE

Polylogarithmic Guarantees for Generalized Reordering Buffer Management

Explore polylogarithmic guarantees for reordering buffer management with IEEE. Learn about block devices, scheduling, and cost control in under an hour.

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

IEEE

Planar Graphs Have Bounded Queue-Number

Explore planar graphs with IEEE's concise material, covering QueueNumberHistoryExtensionsHD compositions, H petitions, and more in under an hour.

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

IEEE

Hardness Magnification for All Sparse NP Languages

Explore Hardness Magnification for all Sparse NP Languages in under an hour with IEEE. Dive into circuit size problems, lower bounds, algorithms, and open problems.

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

IEEE

Leakage Resilient Secret Sharing Against Colluding Parties

Explore leakage-resilient secret sharing and collusion protocols with IEEE's under 1-hour material, including modeling leakage, tampering adversaries, and open problems.

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

IEEE

Non-Malleable Commitments Using Goldreich-Levin List Decoding

Explore commitment schemes, non-malleability, and Goldreich-Levin theorem in less than an hour with this IEEE offering. Ideal for those interested in semantic security.

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