SENG 475 Lecture 7 (2019-05-21) — Compile-Time Computation
Seng 475 lecture 7 2019 05 21 compile time computation
SENG 475 Lecture 26 (2019-07-05) — Concurrency
SENG 475 Lecture 24 (2019-06-28) — Cache-Efficient Algorithms
SENG 475 Lecture 1 (2019-05-07) — Course Introduction
SENG 475 Lecture 14 (2019-06-05) — Exceptions
SENG 475 Lecture 15 (2019-06-07) — Exceptions, Interval Arithmetic
SENG 475 Lecture 2 (2019-05-08) — Algorithms and Data Structures
SENG 475 Lecture 8 (2019-05-22) — Compile-Time Computation, Temporary Objects
SENG 475 Lecture 25 (2019-07-03) — Cache-Efficient Algorithms, Concurrency
SENG 475 Lecture 6 (2019-05-17) — Some C++ Review (Const and Other Stuff), Compile-Time Computation
goSLP - Globally Optimized Superword Level Parallelism Framework
SENG 475 Lecture 4 (2019-05-14) — Data Structures, Some C++ Review (Const and Other Stuff)
14.2.11 Worked Examples: Cache Benefits
Oblix: An Efficient Oblivious Search Index
IEE 475: Lecture E1 (2019-09-26) - Random Number Generation [slides with audio overlay]
C++ AI Chess Engine - UVIC SENG 475 Demo
Memory Efficient Algorithms for Finding Needles in Haystacks
Singly Linked List - Parametric & Intrusive
15. Cache-Oblivious Algorithms
![IEE 475: Lecture E1 (2019-09-26) - Random Number Generation [slides with audio overlay]](https://img.youtube.com/vi/9b17vqieZb4/0.jpg)
