Lectures related to Concurrent Programming: Theory to Practice

Covers graph algorithms, modeling relationships between objects, and traversal techniques like BFS and DFS.

Covers the analysis of functions, composition, and mathematical induction.

Covers graph processing with a focus on Oracle Labs PGX, discussing graph analytics, databases, algorithms, and distributed analytics challenges.

Explores statistical analysis of network data, covering graph structures, models, statistics, and sampling methods.

Explores finding the equation of the tangent line to a function's graph at a point.

Covers graph properties, representations, and traversal algorithms using BFS and DFS.

Explores the properties and applications of Cayley graphs in group theory and network analysis.

Explores cache memory design, hits, misses, and eviction policies in computer systems, emphasizing spatial and temporal locality.

Explores the Stein algorithm for polynomial identity testing and the minimization of a cut problem.

Explores real functions of two real variables, illustrating domains, images, and graphs.

Discusses the graph of a relation and the concept of separation.

Covers graphical models for probabilistic distributions using graphs, nodes, and edges.

Explores the ubiquity of graphs in modern data and analytics, focusing on the shift in organizations' perception of graph technologies.

Explains the relationship between two functions through restriction and prolongation, emphasizing the importance of defining a function by its graph.

Explores causal inference through learning graph structures for causal reasoning from observational data.

Covers cache coherence, sharing data in multiprocessor caches, directories, and coherence protocols.

Explores learning from interconnected data using graphs, covering challenges, GNN design, research landscapes, and democratization of Graph ML.

Explores Breadth-First Search and Dijkstra's algorithm for finding shortest paths in graphs.

Explores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.