| 1. | Ms. Kitty Reacts to The Grapist | 1,891 | |
|
| 2. | Story Time with Prof Page with No Context (for Really Big Girls and Boys!) | 1,068 | |
|
| 3. | Darn You Yoku Blocks [Mega Man: Dr. Wily's Revenge] | 984 | | Mega Man: Dr. Wily's Revenge
|
| 4. | It's Poppin' Time! | 835 | |
|
| 5. | Big-Oh Bootcamp | 574 | |
|
| 6. | Approximation Algorithms for Makespan Minimization on Unrelated Parallel Machines [Research Talk] | 566 | |
|
| 7. | Divisible By Ms. Kitty (The Fall of Ms. Kitty) | 500 | |
|
| 8. | Raking in the Lives! [Mega Man II] | 500 | | Mega Man II
|
| 9. | Proving Harmonic Number H(n) is O(log n), A Bit About Logarithms [Big-Oh Bootcamp] | 466 | |
|
| 10. | I'm Number One, ha HA [with my Narwal friend] | 458 | |
|
| 11. | Lecture 10: Hash Functions, Polynomial Hash Codes, Separate Chaining [Advanced Data Structures] | 445 | |
|
| 12. | Ms. Kitty goes Cruis'n | 438 | |
|
| 13. | The State of Academic Freedom in Canada | 432 | |
|
| 14. | Proving log n is O(n) [Big-Oh Bootcamp] | 420 | |
|
| 15. | Graphs/Networks, Terminology, and How to Explore Them! | 410 | |
|
| 16. | Lecture 1: Data Structures [Advanced Data Structures] | 410 | |
|
| 17. | Frances Widdowson: A Hope for a Reckoning in Canadian Universities | 358 | |
|
| 18. | Inclusion Through Exclusion: The Culling of Academics in Canadian Universities | 348 | |
|
| 19. | Lecture 5: RAM model, Exact Algorithm Analysis, Complexity Classes, Big-Oh[Advanced Data Structures] | 340 | |
|
| 20. | Lecture 0: Overview [Advanced Data Structures] | 326 | |
|
| 21. | Discrete Structures - 1. Set Theory | 298 | |
|
| 22. | Dan Plays Sonic Classic 2 (Sonic Fan Game) | 272 | | Sonic the Hedgehog
|
| 23. | A Darkest Day in the RM of Springfield - Procedure By-Law 24-10, Council Meeting, December 17, 2024 | 226 | |
|
| 24. | Smoothness [Big-Oh Bootcamp] | 222 | |
|
| 25. | Designing Pushdown Automata (Theory of Computing) | 218 | |
|
| 26. | Let's Make Something New! (Spring/Summer 2023 Updates) | 214 | Vlog |
|
| 27. | Why Dijkstra's Algorithm Fails for Negative Weight Edges (Graphs: Algorithms & Theory) | 208 | |
|
| 28. | Prove 6n^2 is O(n^2) [Big-Oh Bootcamp] | 207 | |
|
| 29. | Transitivity of Big-Oh [Big-Oh Bootcamp] | 204 | |
|
| 30. | RM of Springfield 2025 Financial Plan Hearing, April 22, 2025 (Zoom Footage) | 199 | |
|
| 31. | Lecture 18: Amortized Analysis (Aggregate Method), Ordered Dictionary ADT [Advanced Data Structures] | 196 | |
|
| 32. | General Big-Oh Proof Technique for Polynomials [Big-Oh Bootcamp] | 195 | |
|
| 33. | Proof of Smoothness Rule [Big-Oh Bootcamp] | 182 | |
|
| 34. | Merry Christmas, Happy New Year 2020! | 177 | |
|
| 35. | Proving Smooth Functions are b-Smooth [Big-Oh Bootcamp] | 176 | |
|
| 36. | Introduction to Debugging (Python) | 175 | |
|
| 37. | Lecture 6: Big-Oh, Proving f is O(g), Proving f is not O(g) [Advanced Data Structures] | 175 | |
|
| 38. | Ms. Kitty Disrupts Dr. Page's Lecture All Wet | 162 | |
|
| 39. | Something is in those markers! | 158 | |
|
| 40. | Prove 4n^4 + 3n^3 + 2n^2 + n is O(n^4) [Big-Oh Bootcamp] | 156 | |
|
| 41. | RM of Springfield Planning Meeting January 23, 2025 (Zoom Footage) | 155 | |
|
| 42. | Mayor of RM of Springfield Limits Video Documentation of Meetings by Residents - COW Feb 11, 2025 | 146 | |
|
| 43. | Logic By Machine | 145 | |
|
| 44. | Overview [Big-Oh Bootcamp] | 144 | |
|
| 45. | Cut Property of Minimum Spanning Trees & Algorithms (Graphs: Algorithms & Theory) | 138 | |
|
| 46. | Regular Languages are Context-Free & More! (Theory of Computing) | 135 | |
|
| 47. | Designing Context-Free Grammars III (Theory of Computing) | 134 | |
|
| 48. | What is a Formal Language? Decision Problems and Discussion [Theory of Computing] | 133 | |
|
| 49. | Budget Consultation Meeting of RM of Springfield, February 13, 2025 | 133 | |
|
| 50. | Beware Mochi the Cat, Search Breadth-Wise! | 133 | |
|
| 51. | Pi Day 2022 Talk - Limits of Approximability, Magic Numbers in Scheduling | 128 | |
|
| 52. | Caesar Cipher, Shift Cipher Cryptanalysis (Introductory Cryptography) | 125 | |
|
| 53. | For any n+1 integers, some difference of two of them is divisible by n - Pigeonhole Principle | 125 | |
|
| 54. | Designing Deterministic Finite Automata (DFAs) [Theory of Computing] | 124 | |
|
| 55. | Lecture 27: Minimum Spanning Trees, Cut Property, Kruskal's Algorithm [Advanced Data Structures] | 123 | |
|
| 56. | Lecture 9: Dictionaries, Hashing [Advanced Data Structures] | 123 | |
|
| 57. | Lecture 2: Data Structures, Problems, Input Size [Advanced Data Structures] | 122 | |
|
| 58. | Dr. Page's Presentation to RM of Springfield Council on Charter Rights Concerns, September 17, 2024 | 121 | |
|
| 59. | CSCI355 - Lecture 1 (Part 1): Course Introduction | 120 | |
|
| 60. | Lecture 30 - Multiway Search Trees [Advanced Data Structures] | 119 | |
|
| 61. | Lecture 17: Binary Heaps, Heapify Analysis, Sorting, Amortized Analysis [Advanced Data Structures] | 118 | |
|
| 62. | Summations, Closed Forms, and Simplifying Them: A Tutorial | 118 | Tutorial |
|
| 63. | What are Deterministic Finite Automata (DFAs)? A Conceptual Overview [Theory of Computing] | 118 | |
|
| 64. | Basics of Counting Principles, Permutations, and Combinations | 116 | |
|
| 65. | January 2021 Updates - New Setup, Upcoming Content & More, Cute Mochi Cat Outtakes! | 114 | |
|
| 66. | Lecture 28: Prim's Algorithm, Classic and Heap-Based Implementations [Advanced Data Structures] | 112 | |
|
| 67. | Lecture 33: B-Trees, Memory Hierarchy, Reducing Memory Accesses [Advanced Data Structures] | 112 | |
|
| 68. | Lecture 26: Applications of Depth-First Search, Breadth-First Search [Advanced Data Structures] | 108 | |
|
| 69. | Dr. Page's Presentation to RM of Springfield Council on Procedure By-Law, December 17, 2024 | 108 | |
|
| 70. | Introduction to Turing Machines - Live Lecture Feb 17, 2025 | 106 | |
|
| 71. | Introduction to Pushdown Automata (Theory of Computing) | 106 | |
|
| 72. | Regular Operators (Theory of Computing) | 99 | |
|
| 73. | Product Rule of Big-Oh [Big-Oh Bootcamp] | 99 | |
|
| 74. | Ms. Kitty Learns Dijkstra's Algorithm with Ms. Kitty | 97 | |
|
| 75. | Harmonic Number H(n) is O(log n)) (Big-Oh Bootcamp) | 95 | Vlog |
|
| 76. | Discrete Structures - 3. Set Theory | 93 | |
|
| 77. | Introduction and Complexity Functions (Big-Oh Bootcamp) | 91 | |
|
| 78. | Prove n^2 + 12n is O(n^2) [Big-Oh Bootcamp] | 91 | |
|
| 79. | Lecture 25: Graphs, Representations, Planar Graphs, Depth-First Search [Advanced Data Structures] | 90 | |
|
| 80. | The Formal Definition of Big-Oh and Example Proof within 13 Minutes! | 89 | |
|
| 81. | Series and Summations (with full examples) [Mathematics for CS] | 86 | |
|
| 82. | Big-Oh Bootcamp 1 (Test Live Steam) **WARNING, LOUD NOISES** | 85 | |
|
| 83. | The Things I Do For Scotch Tape! | 84 | |
|
| 84. | Discrete Structures - 2. Set Theory | 84 | |
|
| 85. | Adversarial Argument and Searching Lower Bound (Searching: Algorithms and Lower Bounds) | 84 | |
|
| 86. | The Last Question of the Last Question Period: RM of Springfield, Council Meeting Dec 17, 2024. | 80 | |
|
| 87. | Lecture 31: More on Multiway Search Trees, (2,4)-Trees [Advanced Data Structures] | 80 | |
|
| 88. | Why Algorithms Matter: A Common Misunderstanding in Computing | 79 | |
|
| 89. | Updates October 2020, Shout Outs and Thank You! | 79 | |
|
| 90. | December 2020 Updates - New Book Available, Upcoming Teaser Content, New Mic Equipment | 79 | |
|
| 91. | Lecture 3: Algorithms, Search Problem, Linear Search [Advanced Data Structures] | 78 | |
|
| 92. | Smashing The Genie in Legend of Zelda: Link's Awakening [Gameboy Colour] | 78 | | The Legend of Zelda: Link's Awakening
|
| 93. | Permutations and k-Permutations (Mathematics for Computer Science) | 76 | |
|
| 94. | Every Proper Binary Tree of Height h has at Most 2^h Leaves [PROOF] (Maths for Computer Science) | 75 | |
|
| 95. | Lecture 29: Single-Source Shortest Paths, Dijkstra's Algorithm [Advanced Data Structures] | 75 | |
|
| 96. | Summing Two Functions of the Same Order [Big-Oh Bootcamp] | 74 | |
|
| 97. | Generalized Pigeonhole Principle [PROOF & EXAMPLE] (Mathematics for Computer Science) | 74 | |
|
| 98. | Discrete Structures - 6. Counting | 74 | |
|
| 99. | Special: Lessons & Goodbye for Lola (Our First Computer Program/Complexity Analysis) | 72 | |
|
| 100. | Lecture 4: Complexity Analysis, Case-Based Analysis, Experiments [Advanced Data Structures] | 72 | |
|
