Lectures related to AVL tree | EPFL Graph Search

Binary Search Trees: Operations and Procedures

Covers operations and procedures related to binary search trees, including finding successors and predecessors.

The Forgotten Operator: Delete Tradeoffs in Data Stores

Explores the tradeoffs of delete operations in data stores, focusing on logical deletes and introducing the Lethe storage engine.

Tree-Structured Indexing: B+ Trees Explained

Covers B+ Trees, a key data structure for efficient indexing in databases.

Binary trees and Catalan numbers

Covers the definition of binary trees, recursive formulas, and generating functions for Catalan numbers.

Implementing Combiners

Covers the implementation of combiners in parallel programming in Scala, including efficient combine methods and set data structures.

Automorphism groups of trees and graphs II

Explores the uniqueness of trees, automorphism groups, Cayley-Abels graphs, and constructing vertex-transitive subgroups with prescribed local actions.

Phenomenological Applications of the Standard Model

Explores the verification of the standard model through scattering experiments and the implications of minimal dark matter models.

Functional Data Structures: Collections and Operations

Covers functional data structures and their relationships, implementations, and efficiency.

Binary Search Trees: Operations and Implementations

Explores Binary Search Trees, covering operations like searching, finding min/max, successors, and printing.

Binary Search Trees: Operations and Implementations

Covers operations and implementations of binary search trees.

Conc-Trees: Parallel Programming in Scala

Covers the implementation of Conc-Trees in Scala for parallel programming.

Disk Storage & Indexing

Explores disk storage anatomy, access times, buffer management, and tree-structured indexing techniques like B+ Trees.

Structured Classifications: Decision Trees and Boosting

Explores decision trees, overfitting elimination, boosting techniques, and their practical applications in predictive modeling.

Hashing and Sorting

Covers hashing, sorting, extendible hashing, linear hashing, and external sorting.

Structural Induction on Trees

Introduces structural induction on trees, demonstrating with IntSets and their laws.

Fast Interval Queries

Focuses on designing a data structure for fast interval queries on a complete binary tree.

Hashing and Sorting Techniques in Database Systems

Provides an overview of hashing and sorting techniques in database management systems, focusing on their implementation and performance optimization.

Automorphism groups: Trees and Graphs

Explores automorphism groups in trees and graphs, focusing on ends and types of automorphisms.

Understanding Statistics & Experimental Design

Covers basic probability theory, ANOVA, experimental design, and statistical reporting errors.

Fold Reduce Operations

Explores fold (reduce) operations in parallel programming using Scala, covering associative operations, expression trees, parallel reduction, and array reduction.