COMP526 (Spring 2022) 5-1 §5.1 Elementary parallel string matching

(21:16)

COMP526 (Spring 2022) 9-5 §9.5 Exhaustive Tabulation

(21:57)

COMP526 (Spring 2022) 1-2 §1.2 The RAM model

(18:48)

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

(11:50)

COMP526 (Spring 2022) 0-1 Administrativa

(43:23)

COMP526 (Spring 2022) 7-8 §7.8 Move-to-front transform

(17:24)

COMP526 (Spring 2022) 6-10 §6.9 LCP array construction

(18:13)

COMP526 (Spring 2022) 5-3 §5.3 Text Indexing Motivation, Tries

(15:28)

COMP526 (Spring 2022) 7-10 §7.10 Inverse BWT

(8:27)

COMP526 (Spring 2022) 6-8 §6.7 Linear time suffix sorting - DC3 recursion

(11:59)

COMP526 (Spring 2022) 6-3 §6.2 Suffix trees

(16:58)

COMP526 (Spring 2022) 7-9 §7.9 Burrows-Wheeler transform

(21:1econd)

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

(28:25)

COMP526 (Spring 2022) 3-10 §3.9 Parallel sorting

(14:15)

COMP526 Spring 2022 Lecture 02

(1:24:27)

COMP526 Spring 2022 Lecture 13

(1:20:56)

COMP526 Spring 2022 Lecture 17

(1:26:57)