Classifying lattice walks in restricted lattices is an important problem in enumerative combinatorics. Recently, computer algebra has been used to explore and to solve a number of difficult questions related to lattice walks. We give an overview of recent results on structural properties (e.g., algebraicity versus transcendence) and on explicit formulas for generating functions of walks with small steps in the quarter plane. In doing so, we emphasize the algorithmic nature of the methodology, especially two important paradigms: "guess-and-prove" and "creative telescoping".