Courses from 1000+ universities
Buried in Coursera’s 300-page prospectus: two failed merger attempts, competing bidders, a rogue shareholder, and a combined market cap that shrank from $3.8 billion to $1.7 billion.
600 Free Google Certifications
Greening the Economy: Sustainable Cities
Introduction to Graphic Illustration
Computational Social Science Methods
Organize and share your learning with Class Central Lists.
View our Lists Showcase
Explore quantum-resistant cryptography, focusing on multivariate function-based systems and their cryptanalysis in the post-quantum era.
Explore code-based cryptography assumptions, including Hamming codes, decoding problems, and cryptosystems. Learn about security analyses and generic attacks in post-quantum cryptography.
Explore quantum computing challenges and potential solutions in random circuit sampling, discussing current research and future directions.
Explore quantum algorithms, post-quantum cryptography, and their impact on computing. Delve into exponential speedups, NIST standards, lattices, and isogeny-based cryptography.
Explore lattice trapdoors in cryptography, their algorithms, complexity, and applications in program obfuscation with expert Shweta Agrawal from IIT Madras.
Explore the Short Integer Solutions Problem, its cryptographic applications, and connections to lattice-based algorithms, complexity, and security in this advanced mathematical lecture.
Explore fundamental concepts and applications of lattice theory in algorithms, complexity, and cryptography with expert insights from UC San Diego researcher Daniele Micciancio.
Explore Algorand's innovative blockchain technology with founder Silvio Micali, discussing its potential to revolutionize digital transactions and decentralized systems.
Explore modular techniques for creating efficient zero-knowledge proofs, focusing on probabilistically checkable and interactive proof systems in cryptography.
Explore algorithmic opportunities in matching markets, focusing on innovative approaches and their potential impact on economic efficiency and social welfare.
Explore dynamically stable matching theory and its applications in economics and computer science, focusing on algorithmic approaches and market design implications.
Explore zero-knowledge proofs, focusing on the discrete logarithm problem. Learn about range proofs, polynomial commitments, and R1CS representation in this advanced cryptography lecture.
Explore the foundations of interactive proofs with Justin Thaler, delving into their significance for consensus and decentralized systems in modern society.
Explore cutting-edge techniques in meta-learning for optimizers and update rules, focusing on advancements in deep learning and their applications in AI research.
Explore techniques for interpreting deep neural networks, focusing on methods to understand and explain their decision-making processes and internal representations.
Get personalized course recommendations, track subjects and courses with reminders, and more.