Mutual Empowerment Between Circuit Obfuscation and Circuit Minimization
Exploring connections between Indistinguishability Obfuscation and Minimum Circuit Size Problem, revealing implications for cryptography and computational complexity theory.
Designing Machine Learning Processes for Equitable Health Care Systems
Explore machine learning processes for creating fair and inclusive healthcare systems, focusing on addressing sex and gender biases in medical data and AI applications.
David Silver: Simulation-Based Search
Explore simulation-based search algorithms with DeepMind's David Silver, covering Monte Carlo tree search and its applications in AI and game-playing systems.
Simple and Fast Rounding Algorithms for Directed and Node Weighted Multiway Cut
Explore efficient algorithms for directed and node-weighted multiway cut problems, focusing on simple rounding techniques and integrality gap analysis in graph theory and combinatorial optimization.
Embedding as a Tool for Algorithm Design
Explore embedding algorithms for structured data prediction, combinatorial optimization, and dynamic network processes. Learn innovative approaches to algorithm design using latent variable models and mean field techniques.
Quantum Algorithms and Post-Quantum Cryptography
Explore quantum algorithms, post-quantum cryptography, and their impact on computing. Delve into exponential speedups, NIST standards, lattices, and isogeny-based cryptography.
Optimal Iterative Algorithms for Problems With Random Data
Explore optimal iterative algorithms for statistical problems with random data, focusing on computational complexity and efficient solutions in statistical inference.
SAT-Solving
Explore the theory and practice of SAT-solving, delving into satisfiability concepts and advanced techniques in this comprehensive lecture by Armin Biere.
A 1.5-Approximation for Path TSP
Explores a 1.5-approximation algorithm for the Metric Path Traveling Salesman Problem, introducing novel techniques to handle larger s-t cuts and achieve a simplified approach matching Christofides' TSP algorithm.
Introduction to Parameterized Algorithms, Lecture I
Gentle introduction to parameterized complexity, focusing on basic techniques like branching, color coding, and kernelization. Explores connections to linear programming and discrete optimization.
Parameterized Problems Complete for Nondeterministic FPT Time and Logarithmic Space
Exploration of XNLP-complete problems in parameterized complexity, including List Coloring, Scheduling, Bandwidth, and CNF-Satisfiability variants, with implications for W[t]-hardness and long-standing questions.
Parametrized Algorithms and Possible Future Directions
Explore current research and future directions in Parameterized Complexity, focusing on algorithmic approaches and potential areas for further investigation.
Michal Pilipczuk: Introduction to Parameterized Algorithms, Lecture II
Explore parameterized complexity, focusing on LP-related methods. Learn branching, color coding, kernelization, and dynamic programming techniques for algorithm design and optimization.
A Survey on Quantum Algorithms for Computing Class Groups
Explore quantum algorithms for class group computation, covering classical methods, quantum computing basics, hidden subgroup problems, and a polynomial-time quantum algorithm for ideal class groups.
Bandits - Kevin Jamieson - University of Washington
Explore bandit algorithms and their applications in machine learning, from drug development to content recommendation, with a focus on regret minimization and stochastic models.
Simple Steps for Solving Dynamic Programming Problems
Learn a systematic approach to tackle dynamic programming problems, illustrated with examples like longest increasing subsequence and optimal box stacking.
Quantum Query Complexity - Quantum Computation at CMU
Explore quantum query complexity, decision problems, and key concepts like Simon's algorithm and element distinctness in this advanced lecture on quantum computation.
Dynamic Algorithms for Packing-Covering LPs via Multiplicative Weight Updates
Explore dynamic algorithms for packing-covering LPs using multiplicative weight updates, focusing on near-optimal approximation algorithms and complexity analysis in dynamic settings.
Online List Labeling - Breaking the Log^2 N Barrier
Explores a randomized data structure for online list labeling, improving the upper bound to O(log^{3/2} n) items moved per insertion/deletion, breaking the long-standing log^2 n barrier.
Faster High Accuracy Multi-Commodity Flows via Graph Techniques
Explore graph techniques to accelerate multi-commodity flow algorithms, improving accuracy and efficiency. Discover connections to linear programming and open problems in algorithm design.
Dynamic Graphs on the GPU
Explore GPU-accelerated techniques for dynamic graph algorithms, focusing on efficient data structures and parallel processing for real-time graph updates and analysis.