Courses from 1000+ universities
$7.2 billion in combined revenue since 2020. $8 billion in lost market value. This merger marks the end of an era in online education.
600 Free Google Certifications
Computer Science
Psychology
Microsoft Excel
Lean Production
Viruses & How to Beat Them: Cells, Immunity, Vaccines
Learn Like a Pro: Science-Based Tools to Become Better at Anything
Organize and share your learning with Class Central Lists.
View our Lists Showcase
Explore formal abstractions for packet scheduling in software-defined networking, focusing on PIFO trees' syntax, semantics, and compilation algorithms for optimizing network performance.
Explore a mechanically verified compiler translating SQL to imperative code, addressing implementation challenges and leveraging formalization advances in query compilation.
Explore Mat2Stencil, a novel domain-specific language for PDE solvers on structured grids. Learn about its matrix abstraction, compiler, and automatic parallelization techniques for efficient implementation.
Explore finite-aspect checkable languages and their role in decidable learning, connecting expression syntax tree evaluation to finite tree automata for new learning results.
Explore explainable program synthesis through subspecifications, enhancing implementation understanding with logical formulas. Learn algorithms for constructing and verifying subspecifications, their properties, and impact on code comprehension.
Explore interactive debugging techniques for Datalog programs using a top-down evaluation strategy. Learn about small-step operational semantics and efficient step-over interactions for complex programming tasks.
Explore Outcome Logic, a unified theory for correctness and incorrectness reasoning in program logics, generalizing Hoare Logic to capture computational effects and reachability.
Explore a novel cocktail approach for efficient call graph construction in C-based software, improving precision and scalability for vulnerability detection and code understanding.
Explore bidirectional object-oriented programming for programmatic and direct object manipulation, focusing on a novel language extension and its application in HTML document generation through GUI design.
Explore algebro-geometric algorithms for template-based synthesis of polynomial programs, offering a scalable approach to program sketching without sacrificing completeness.
Explore StructTensor, a framework for symbolically computing tensor structure at compile-time, enhancing efficiency in data-intensive workloads across computational domains.
Explore the performance trade-offs between AST and bytecode interpreters in meta-compilation systems. Gain insights into interpreter efficiency, memory usage, and engineering considerations for language implementations.
Explore the relationship between structural subtyping and parametric polymorphism in programming languages, focusing on their expressive power and potential encodings.
Explore proof automation for linearizability in separation logic, enhancing verification of fine-grained concurrent programs through innovative proof rules and search strategies.
Explore a novel L0 robustness verifier for neural networks, addressing few-pixel attacks through dynamic programming, sampling, and covering designs to enhance verification efficiency.
Get personalized course recommendations, track subjects and courses with reminders, and more.