Asymptotics of Orthogonal Polynomial Ensembles via Integrable Methods
Explore statistical properties of random matrices and point processes, focusing on asymptotics of orthogonal polynomial ensembles and their applications in various fields of mathematics and physics.
Asymptotics for the Lower Tail of the KPZ Equation
Exploration of asymptotic behavior in the KPZ equation's lower tail, covering motivation, proofs, and generalizations for advanced mathematics researchers.
Phi and the Tribonacci Monster
Explore the fascinating connections between the golden ratio, Fibonacci sequence, and tribonacci constant through mathematical miracles, formulas, and real-world applications.
Learn Divide & Conquer Algorithms - Great Learning
Explore divide and conquer algorithms: Binary Search, Quick Sort, and Merge Sort. Learn concepts, implementations, and complexities in this comprehensive session on efficient problem-solving techniques.
Data Structures and Algorithms for Tech Interviews - Tips & Tricks to Crack Interviews
Learn essential data structures and algorithms for tech interviews, covering arrays, linked lists, stacks, queues, searching, and sorting techniques with practical implementations and complexity analysis.
Top 5 Sorting Algorithms - Data Structures and Algorithms - Sorting Algorithms
Explore five key sorting algorithms: Bubble, Selection, Insertion, Quick, and Merge. Learn concepts, implementations, time/space complexity, and compare their efficiency for various scenarios.
Leslie G. Valiant - Turing Award Lecture 2010
Explore computational learning theory, machine learning, and brain modeling with Leslie G. Valiant, 2010 ACM Turing Award winner, as he discusses his groundbreaking research and insights.
Shafi Goldwasser: Journey from Israel to Turing Award - A Life in Computer Science
Explore Shafi Goldwasser's journey from childhood in Israel to becoming a pioneering computer scientist, covering her education, influences, and experiences that shaped her career.
Fine-Grained Cryptography: A New Frontier?
Explore fine-grained cryptography's frontier with Alon Rosen. Delve into public key encryption, polynomial proofs of work, and MA proof systems, uncovering new possibilities in cryptographic complexity.
Private Aggregation from Fewer Anonymous Messages
Explore innovative techniques for private data aggregation, focusing on reducing anonymous messages while maintaining accuracy and privacy in distributed systems.
Row, Row, Row Your Boat - How to Not Find Weak Keys in Pilsung
Explore Pilsung's cryptographic vulnerabilities, focusing on round sub-processes, permutations, and randomness. Learn about distinguishers and weak key detection in this cryptanalysis discussion.
Asiacrypt 2022 - Lattice Algorithms and Cryptanalysis
Explore lattice algorithms and cryptanalysis, covering topics like psychotomic fields, quantum decomposition, and optimization frameworks in this comprehensive talk from Asiacrypt 2022.
Why Does Human Intelligence Beat AI? - With Gerd Gigerenzer
Explore the limitations of AI and the superiority of human intelligence in decision-making, risk assessment, and adapting to uncertain situations with insights from cognitive scientist Gerd Gigerenzer.
Algorithms That Control Our Lives - With David Sumpter
Mathematician David Sumpter explores the impact and limitations of algorithms in shaping our online behaviors, from social media influence to fake news, offering insights into their real-world effectiveness.
What Computers Can't Do - With Kevin Buzzard
Explore the P vs NP problem in computer science with mathematician Kevin Buzzard, delving into computational complexity, security implications, and unsolved mathematical challenges.
Should Computers Run the World? - With Hannah Fry
Explore the impact of algorithms on decision-making in various fields, examining their benefits, limitations, and ethical implications compared to human judgment.
Neural Nets for NLP 2021 - Conditioned Generation
Explore encoder-decoder models, conditional generation, search techniques, ensembling, evaluation methods, and various data types for conditioning in neural network-based natural language processing.
Randomised Computation
Explore probabilistic Turing machines, complexity classes, and efficient randomised algorithms. Dive into Monte Carlo methods, polynomial identity testing, and the P = BPP problem.
Optimal Merging in Quantum K-XOR and K-Sum Algorithms
Explore quantum algorithms for k-xor and k-sum problems, focusing on optimal merging techniques and their impact on computational complexity in cryptography.
PCPs and Global Hyper-contractivity - Lecture 1
Explore advanced concepts in theoretical computer science, focusing on Probabilistically Checkable Proofs and global hyper-contractivity with expert Dor Minzer.
Multigroup Fairness - Polylogues
Explore key themes of multigroup fairness in algorithmic systems with Stanford's Omer Reingold, discussing statistical judgment validity and societal implications of AI decision-making.