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 how the U.S. Census Bureau exemplifies effective data stewardship in the modern era, balancing privacy concerns with the need for accessible public information.
Explore X-Ramanujan graphs and their applications in computer science, focusing on advanced concepts beyond randomized rounding and the probabilistic method in graph theory.
Explore advanced concepts in arithmetic geometry, focusing on effective methods and their applications in number theory and algebraic geometry.
Explore the Barrier Method and its application to the Kadison-Singer Problem in this advanced mathematics lecture by Nikhil Srivastava from UC Berkeley.
Explore advanced techniques for robust sparse regression in high-dimensional data, focusing on sublinear algorithms and nearest-neighbor search methods.
Explore advanced techniques for frequency estimation using learning-augmented sketches, enhancing sublinear algorithms and nearest-neighbor search methodologies.
Explore techniques for efficient sparse signal recovery using limited adaptive measurements, with applications in sublinear algorithms and nearest-neighbor search.
Experts discuss cutting-edge research in algorithmic fairness and quantum computation, exploring challenges, advancements, and potential impacts on technology and society.
Explore advanced techniques for outlier-robust regression, focusing on efficient algorithms and their applications in high-dimensional statistics and machine learning.
Explore the underlying mechanisms of deep learning's success, focusing on implicit self-regularization in neural networks and its impact on model performance.
Explore recent advancements in structure lemmas for depth-two threshold circuits, focusing on Boolean devices and their implications in computational complexity theory.
Explore Boolean devices and the Minimum Circuit Size Problem (MCSP) in this comprehensive survey, delving into computational complexity theory and its implications.
Explore efficient algorithms for nearest neighbor search in high-dimensional spaces, focusing on locality-sensitive hashing and its applications in data science.
Explore dimensionality reduction and CountSketch techniques in linear algebra, focusing on advanced applications and theoretical foundations for data science.
Explore key impossibility results in distributed computing, focusing on fundamental limitations and theoretical challenges in the field.
Get personalized course recommendations, track subjects and courses with reminders, and more.