Lomont.org

(Also lomonster.com and clomont.com)

30 Algorithms in 60 Minutes

Published

This is a 60 minute talk in which I tried to cover 30 algorithms and data structures in a concise manner. It covers all sorts of areas: sorting, string searching and matching, backtracking, randomness, skip lists, hashing, bloom filters, graph algorithms, space partitioning, concurrent and immutable data structures, cache oblivious techniques, compression, boolean satisfiability, and control theory.

PDF, 1.3MB

PPTX, 3.1MB