Chapters
Transcript
Episode notes
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27
Introduction
00:00 • 3min
The Binomial Distribution
03:01 • 2min
What's Behind Door Number Two?
04:32 • 2min
The Odds Aren't Even Close
06:53 • 2min
Is It a Zero Knowledge Proof, or a Way of You Solving a Problem?
08:50 • 3min
Doko Is a Graph Coloring Problem
11:30 • 2min
Using Open Street Map, City Blocks
13:36 • 2min
The Crypto Pal's Crypto Challenge
15:43 • 2min
Using a 32 Bit Incription Key to Detect a Flaw
18:11 • 5min
Book of the Week - Theft of Swords
23:27 • 2min
Is Audible a Sponsor of the Show?
25:38 • 4min
What Realadors Are Selling Houses in My Area?
29:15 • 2min
Scrapy Is a Very Powerful Tone Island
30:53 • 3min
The Scrape Is Cool Being in C S, but I Think I'll Come Up With More Power
34:05 • 2min
How to Make Your Programming Faster
35:49 • 3min
Optimizing for Size vs Speed
39:08 • 2min
How to Optimize a Fore Loop in Java
41:21 • 2min
Keeping Your Code as Compact as Possible
43:44 • 3min
Optimizing the Processor
46:16 • 2min
Ike City, Extremely Fast.
48:30 • 2min
Using a Linear Algebra Library
50:02 • 5min
Is There a Tree or Hashing in Optimization?
55:13 • 2min
Taking Thread Pools to the Next Level
57:41 • 4min
What Is the Histogram of Response Times?
01:01:17 • 3min
Stacka Algarithmic Improvements
01:04:07 • 5min
How to Reduce Algorithm Complexity
01:09:12 • 2min
The Art of Optimization Is Knowing When Not to Optimize
01:10:45 • 5min