Plancherel Theorems for Coxeter groups and Hecke algebras: It is elementary that each trace functional on a finite dimensional semisimple complex algebra can be written as a linear combination of the irreducible characters of the algebra. Explicitly computing such a formula is called a Plancherel Theorem. In this talk we will: (1) Expand on what is meant by a Plancherel Theorem (for example, outside of the finite dimensional setting), and explain why we might care about them, (2) Sketch some well understood cases (finite dimensional Hecke algebras and affine Hecke algebras), and (3) Say what we would like to understand outside of these cases.