Lecture

Total Order Broadcast: Consensus Transformation

Related lectures (25)

Optimization Algorithms: Greedy Approach

Explores optimization problems and greedy algorithms for efficient decision-making.

Algorithms in Computer Science: Search and Sort Techniques

Provides an overview of essential search and sort algorithms in computer science.

Sorting Algorithms: Selection and Insertion

Introduces selection and insertion sorting algorithms, explaining their correctness and time complexity.

Merge Sort: Sorting Algorithm

Explains the merge sort algorithm, its correctness, and time complexity compared to other sorting algorithms.

The Power of Registers

Covers wait-free implementations of atomic objects, focusing on counters and snapshots, discussing key ideas for enforcing atomicity and wait-freedom.

Conformal Transformations: Theory and Applications

Explores the theory and applications of conformal transformations, covering special conformal transformations and isomorphic transformations.

Lecture 5: Conformal Transformations

Explores Conformal Transformations, emphasizing scale transformations and correlation functions.

Complexity & Induction: Algorithms & Proofs

Covers worst-case complexity, algorithms, and proofs including mathematical induction and recursion.

Causal & Total Order Broadcast

Covers exercises on reliable broadcast, uniform reliable broadcast, and total order broadcast in distributed algorithms.

Ergo: ergometry figures

Covers the analysis of ergometry figures using Excel and the interpretation of respiratory and cardiovascular parameters.

Insertion Sort: Basics and Analysis

Introduces Insertion Sort, explaining its basics, insertion process, and correctness analysis.

Hashing and Sorting

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

Analysis of Algorithms

Covers the analysis of algorithms, focusing on insertion sort and computational models.

Algorithm Design: Divide and Conquer

Covers recursion, dynamic programming, and algorithm design using divide and conquer strategies.

Merge Sort: Divide and Conquer

Explores the Merge Sort algorithm, applying the Divide and Conquer approach to sorting arrays efficiently.

Sorting Algorithms: Merge Sort

Presents the merge sort algorithm for sorting integers and the concept of fusion for merging ordered lists efficiently.

Merge Sort: Divide-and-Conquer

Introduces Merge Sort, a divide-and-conquer algorithm for efficient array sorting, discussing correctness, runtime analysis, linear-time merging, and recurrence solving techniques.

Translations and Homotheties

Covers translations, homotheties, and their analytical expressions, emphasizing stability by composition.

Recursive Sorting: Merge Sort

Explains recursive sorting using Merge Sort and its linearithmic complexity.

Merge Sort: Divide, Conquer, Combine

Explores Merge Sort, a sorting algorithm that divides, conquers, and combines arrays efficiently to achieve O(nlog n) time complexity.