| 1. | SAT-Solving | 4:22:37 | |
|
| 2. | Lightning Talks | 2:41:00 | |
|
| 3. | Deep Dive into CDCL Pseudo-Boolean Solvers (focusing on the implementation in Sat4j) | 2:39:41 | |
|
| 4. | SAT and Foundations of Mathematics | 2:33:56 | |
|
| 5. | Maximum Satisfiability Solving | 2:24:00 | |
|
| 6. | Combining SAT and Computer Algebra for Circuit Verification | 2:23:06 | |
|
| 7. | What Maximum Clique Algorithms Can Teach Us, And Vice-Versa | 2:22:31 | |
|
| 8. | Exact Mixed-Integer Programming over the Rational Numbers | 2:21:35 | |
|
| 9. | Knowledge Compilation for Boolean Functional Synthesis | 2:18:01 | |
|
| 10. | A Brief Introduction to Theoretical Foundations of Machine Learning and Machine Teaching | 2:11:11 | |
|
| 11. | Phase Transition in Random Circuit Sampling | Quantum Colloquium | 2:09:44 | |
|
| 12. | The Multilinear Polytope for Acyclic Hypergraphs | 2:07:55 | |
|
| 13. | Black Holes and the Quantum-Extended Church-Turing Thesis | Quantum Colloquium | 2:07:15 | |
|
| 14. | Syntax-Guided Program Synthesis | 2:03:26 | Guide |
|
| 15. | Presentation of Evolvability | 2:03:25 | |
|
| 16. | Finite Model Theory | 2:03:19 | |
|
| 17. | Quantified Boolean Formulas | 2:03:00 | |
|
| 18. | Writing Workshop with Science Communicator in Residence Adam Becker | 2:02:41 | |
|
| 19. | SAT-Solving | 2:02:40 | |
|
| 20. | Pseudo-Boolean Solving and Optimization | 2:02:25 | |
|
| 21. | Reactive Synthesis | 2:01:56 | |
|
| 22. | Beyond NP with Tractable Circuits | 2:01:38 | |
|
| 23. | Step-Wise Explanations for Constraint Programs | 2:01:16 | |
|
| 24. | Panel Discussion on Challenges and Opportunities in Synthesis | 2:01:00 | Discussion |
|
| 25. | Specification, Verification and Synthesis in Cyberphysical Systems | 2:00:34 | |
|
| 26. | Logical Quantum Processor Based On Reconfigurable Atom Arrays | Quantum Colloquium | 2:00:20 | Vlog |
|
| 27. | A Tutorial on Logic, With an Emphasis on the Connections With Automata Theory | 2:00:01 | Vlog |
|
| 28. | Towards ML for Quantification in SMT | 1:59:59 | |
|
| 29. | Linear Growth of Quantum Circuit Complexity | 1:59:41 | |
|
| 30. | The Rise of Approximate Model Counting: Beyond Classical Theory and Practice of SAT | 1:59:40 | |
|
| 31. | Mini Crash Course: Quantum Games and Semi-Definite Programming | 1:58:41 | |
|
| 32. | Non-CDCL Solvers | 1:58:30 | |
|
| 33. | Verification and Control of Partially Observable Probabilistic Systems | 1:56:50 | |
|
| 34. | Theoretically Speaking — A Panel Discussion on the Film Coded Bias | 1:56:25 | Discussion |
|
| 35. | Learning to Predict Arbitrary Quantum Processes | 1:55:26 | |
|
| 36. | Games on Graphs: from Logic and Automata to Algorithms | 1:53:35 | |
|
| 37. | Proof Complexity | 1:53:30 | |
|
| 38. | An Efficient Quantum Factoring Algorithm | Quantum Colloquium | 1:53:19 | |
|
| 39. | The Power of Unentangled Quantum Proofs With Non-negative Amplitudes | Quantum Colloquium | 1:52:15 | |
|
| 40. | The Science of Cause and Effect: From Deep Learning to Deep Understanding | 1:51:26 | |
|
| 41. | Morning Session: Genomics, Medicine, Epidemiology and Data Interpretation | 1:51:15 | Vlog |
|
| 42. | Afternoon Session #2: Policies, Politics, Publics | 1:51:10 | |
|
| 43. | Improved Bounds for the Sunflower Lemma | 1:50:10 | |
|
| 44. | Industry talks and Q&A | 1:45:30 | |
|
| 45. | Efficient Quantum Gibbs Samplers | Quantum Colloquium | 1:45:00 | |
|
| 46. | Mini Crash Course: Tensor Networks | 1:44:48 | |
|
| 47. | Quantum Pseudoentanglement | Quantum Colloquium | 1:44:31 | |
|
| 48. | Matrix Multiplication | 1:44:18 | |
|
| 49. | SAT-Centered Complexity Theory | 1:43:45 | |
|
| 50. | Perspective | 1:43:03 | |
|
| 51. | Pseudo-Boolean Solving and Optimization 2 | 1:42:59 | |
|
| 52. | Mathematics of Lattices | 1:42:08 | |
|
| 53. | Morning Session: Causality | 1:41:48 | |
|
| 54. | Quantum Fault Tolerance with Flag Qubits | Quantum Colloquium | 1:41:02 | |
|
| 55. | Epidemics 3 | 1:40:38 | |
|
| 56. | The Quantum LDPC Manifesto | Quantum Colloquium | 1:40:16 | |
|
| 57. | Afternoon Session #1: Science, Pseudo-science, Canon and Belief | 1:39:40 | |
|
| 58. | Historical Talk on Lattice-Based Cryptography | 1:39:39 | |
|
| 59. | Efficient Quantum Gibbs Samplers | Quantum Colloquium | 1:39:30 | |
|
| 60. | Signatures, Commitments, Zero-Knowledge, and Applications | 1:38:57 | |
|
| 61. | NIZK from LPN and Trapdoor Hash via Correlation Intractability for Approximable Relations | 1:38:40 | Let's Play |
|
| 62. | The Quantum Fourier Transform Has Small Entanglement | Quantum Colloquium | 1:38:31 | |
|
| 63. | Introduction to Regulatory Genomics and Epigenomics III: Hidden Markov Models in Gene Regulation | 1:38:26 | |
|
| 64. | Ridesharing | 1:38:25 | |
|
| 65. | The Information Bottleneck Theory of Deep Neural Networks... | 1:37:56 | |
|
| 66. | Introduction to Automata on Infinite Words | 1:37:55 | |
|
| 67. | Efficient Error Correction in Neutral Atoms via Erasure Conversion | Quantum Colloquium | 1:37:46 | |
|
| 68. | Bayesian Theories of Perception and Cognition | 1:37:39 | |
|
| 69. | On the Growth of Cryptography | 1:37:22 | |
|
| 70. | Graphons and Graph Limits 3 | 1:37:20 | |
|
| 71. | Online Matching for Ride-sharing | 1:36:46 | |
|
| 72. | Matrix Rigidity | 1:36:35 | |
|
| 73. | Mini Crash Course: Quantum Information Theory | 1:36:35 | |
|
| 74. | Sub-Linear Time Algorithms: Fast, Cheap and (Only a Little) Out of Control | 1:36:31 | |
|
| 75. | Tutorial: Implicit Bias II | 1:36:30 | Tutorial |
|
| 76. | Allen Institute Large-scale Datasets and Modeling Tools | 1:36:16 | |
|
| 77. | Mini Crash Course: The Classical PCP Theorem | 1:36:10 | |
|
| 78. | Inferring Single-Trial Neural Population Dynamics Using Sequential Auto-Encoders | 1:36:07 | |
|
| 79. | Algorithms for Algebraic Lattices: Classical and Quantum | 1:35:56 | |
|
| 80. | Deep Robotic Learning | 1:35:22 | |
|
| 81. | Afternoon Session: Governance | 1:35:18 | |
|
| 82. | High Dimensional Expanders - Introduction and Motivation | 1:34:36 | |
|
| 83. | A Polynomial-Time Classical Algorithm for Noisy Random Circuit Sampling | 1:34:21 | |
|
| 84. | Tutorial on Differential Privacy | 1:34:17 | |
|
| 85. | Similarity Alignment: A Missing Link Between Structure, Function and Algorithms | 1:34:14 | |
|
| 86. | Graphons and Graph Limits 1 | 1:33:55 | |
|
| 87. | Algorithmic High-Dimensional Geometry I | 1:33:54 | |
|
| 88. | Algorithmic High-Dimensional Geometry II | 1:33:49 | |
|
| 89. | Introduction to Analysis on the Discrete Cube IV | 1:33:44 | |
|
| 90. | Neural Mechanisms of Vision | 1:33:35 | |
|
| 91. | Matrix Factorizations | 1:33:33 | |
|
| 92. | Adversarial Examples in Deep Learning | 1:33:06 | |
|
| 93. | Mini Crash Course: Quantum Error Correction | 1:32:58 | |
|
| 94. | Approaching the Quantum Singleton Bound with Approximate Error Correction | 1:32:56 | |
|
| 95. | Algorand's Forthcoming Blockchain Technology | 1:32:46 | |
|
| 96. | Locally Convergent Graphs | 1:32:40 | |
|
| 97. | Condition | 1:32:18 | |
|
| 98. | Introduction to Analysis on the Discrete Cube I | 1:32:16 | |
|
| 99. | Networks and Economics 4 | 1:32:05 | |
|
| 100. | High Throughput Connectomics | 1:31:51 | |
|
