Sebastian Wild (Lectures)

COMP526 (Fall 2022) 3-8 §3.6 Python's list sort & Powersort

COMP335 (2022-23) - Unit 4 - Lesson plans

Feature Demo of TeXStudio

COMP526 (Fall 2022) 6-9 §6.8 The LCP Array

COMP526 Fall 2022 Lecture 16

COMP526 (Fall 2022) 9-4 §9.4 Cartesian trees

COMP526 Unit 6-5 2020-03-09 Text Indexing: suffix arrays

COMP526 Fall 2022 Lecture 18

COMP526 Fall 2022 Lecture 22

COMP526 (Fall 2022) 9-1 §9.1 The range minimum query problem

9 5 §9 5 Exhaustive tabulation

COMP526 Fall 2022 Lecture 14

COMP526 Fall 2023 Lecture 01

COMP526 (Fall 2022) 9-2 §9.2 RMQ LCE LCP LCA

COMP526 Fall 2023 Lecture 07

COMP526 Unit 8-2 2020-04-21 Error-Correcting Codes: Hamming Codes

COMP526 Unit 7-6 2020-03-24 Compression: Move-to-front transform

COMP526 3-8 §3.7 Parallel sorting

COMP526 (Fall 2023) 7-1 §7.1 The PRAM Model

COMP526 8-1 §8.1 Error correcting codes introduction

COMP526 (Fall 2022) 4-3 §4.3 String matching with finite automata

COMP526 (Fall 2022) 7-1 §7.1 Compression context, terminology, fundamental limits

COMP526 8-4 §8.3 Hamming codes

COMP526 (Spring 2022) 9-1 §9.1 Range min queries introduction

COMP526 (Fall 2022) 4-4 §4.4 Constructing string matching automata

COMP526 3-7 §3.6 Parallel primitives, Prefix sum

COMP526 (Fall 2022) 6-7 §6.6 Linear time suffix sorting - Overview

COMP526 (Fall 2023) 4-7 §4.7 The Rabin-Karp algorithm

COMP526 Fall 2022 Lecture 17

COMP526 (Spring 2022) 6-7 §6.6 Linear time suffix sorting - Overview

Advanced Data Structures (Summer 2026) - 03-04 Fibonacci Heaps Informal Overview