Technology Is Responsible for Increasing Inequality
Explore how technology impacts societal inequality, examining its role as both a potential divider and equalizer in modern life.
A Conversation with Walter Isaacson
Explore innovation and genius with Walter Isaacson as he discusses traits of great innovators like Einstein, da Vinci, Gates, and Jobs, drawing insights from his acclaimed biographies.
Simpler Open Source Application Ops on K8s
Explore simplified open-source application operations on Kubernetes with Mark Shuttleworth, focusing on integration, discourse, and practical implementation strategies.
It's Not Just about Accuracy - Metrics That Matter When Modeling Expert Sketching Ability
Explores metrics beyond accuracy for modeling expert sketching ability, discussing features that differentiate expert and novice sketches to improve intelligent tutoring systems for design sketching.
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.
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.
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.
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.
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.
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.
Explicit Near-Fully X-Ramanujan Graphs
Explore finite graphs resembling infinite ones, focusing on Ramanujan graphs and spectral properties. Learn about matrix-weighted polynomials and permutation-based approaches.
Independent Set on P_k-Free Graphs in Quasi-Polynomial Time
Explore efficient algorithms for solving the Independent Set problem on P_k-Free Graphs, including novel approaches and complexity analysis.
On Light Spanners, Low-Treewidth Embeddings and Efficient Traversing in Minor-Free Graphs
Explore efficient graph traversal techniques using light spanners and low-treewidth embeddings, with applications to minor-free graphs and approximation algorithms.
Pseudospectral Shattering the Sign Function and Diagonalization in Nearly Matrix Multiplication Time
Explore advanced matrix algorithms, including pseudospectral shattering and diagonalization techniques, for efficient computation in nearly matrix multiplication time.
Near Optimal Linear Algebra in the Online and Sliding Window Models
Explore near-optimal linear algebra techniques for streaming and sliding window models, focusing on randomized algorithms and their applications in data analysis.
Stochastic Weighted Matching - 1-Epsilon Approximation
Explore stochastic weighted matching algorithms, including Monte Carlo analysis, vertex-independent matching, and greedy approaches for efficient approximation solutions.
Circulation Control for Faster Minimum Cost Flow in Unit-Capacity Graphs
Explores advanced techniques for optimizing minimum cost flow in unit-capacity graphs, focusing on circulation control methods to enhance efficiency and reduce computational complexity.
Hypergraph K-Cut for Fixed K in Deterministic Polynomial Time
Explore deterministic polynomial-time algorithms for hypergraph k-cut problems, focusing on fixed k values. Learn about structural theorems, techniques, and open questions in this field.
Rigid Matrices from Rectangular PCPs
Explore rigid matrices, low rank matrices, and rectangular PCPs in this technical talk on advanced mathematical concepts and their applications.
Subexponential LPs Approximate Max-Cut
Explore subexponential linear programs for approximating Max-Cut, comparing LPs and SDPs, and examining refutation in pseudorandom graphs. Gain insights into combinatorial optimization techniques.
Sum-of-Squares Lower Bounds for Sherrington-Kirkpatrick via Planted Affine Planes
Explore optimization techniques for Sherrington-Kirkpatrick problems using sum-of-squares lower bounds and planted affine planes, with insights on certification and hierarchies.