Explore cutting-edge theoretical computer science research in this Allen School Colloquium featuring talks on revenue maximization, multiplier commutativity verification, efficient data structures, the Santa Claus problem, and counting stable matchings. Gain insights into interdimensional revenue optimization, proof complexity in SAT-solvers, nearly-optimal binary search trees for non-adaptive computations, approximation algorithms for gift assignment, and the growth rate of stable matchings. Delve into topics like combinatorial optimization, propositional logic, and stable matching theory through accessible presentations by PhD students working on algorithms, incentives, economics, proof complexity, communication complexity, information theory, and probabilistic combinatorics.