Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Lecture
Parallel Programming in Scala: Performance Analysis
Graph Chatbot
Related lectures (26)
Previous
Page 1 of 3
Next
Algorithmic Complexity: Travel Time Analysis
Covers algorithmic complexity and travel time analysis, focusing on measuring the time taken by algorithms and evaluating their performance.
Principles of Parallelism
Covers the basics of parallelism, including physical examples, historical context, multicore era, and parallel collections in Scala.
Parallel Computing: Principles and OpenMP
Covers the principles of parallel computing and introduces OpenMP for creating concurrent code from serial code.
Elements of computational complexity
Covers classical and quantum computational complexity concepts and implications.
Complexity of Algorithms
Explores algorithm complexity, analyzing efficiency and worst-case scenarios of sorting algorithms.
Algorithmic Complexity: Theta Notation
Explores algorithmic complexity, comparing growth rates using Theta notation and characterizing different complexity classes.
Parallel Programming I
Covers the basics of parallel programming, including concurrency, forms of parallelism, synchronization, and programming models like PThreads and OpenMP.
Complexity & Induction: Algorithms & Proofs
Covers worst-case complexity, algorithms, and proofs including mathematical induction and recursion.
Theory of Computation: Complexity of Problems
Explores the theory of computation, undecidable problems, complexity measurement, and the P complexity class.
Conc-Trees: Parallel Programming in Scala
Covers the implementation of Conc-Trees in Scala for parallel programming.
