A top algorithms researcher of his generation, Nick Harvey has contributed a sequence of elegant and high-impact advances on long-standing problems in the foundations of computing, such as graph sparsification (distilling a network to its core), and efficient algorithms for finding rare objects (the Lovász Local Lemma). Nick has also made significant contributions in other computer science disciplines, namely learning theory and computer systems. His work has been published in the top computer science conferences and has also had major impact on industry products. He has co-organized several high-profile workshops in his areas of expertise, enabling others to learn about cutting-edge theoretical research. He has also served on numerous conference program committees. Nick is an outstanding teacher and research advisor, and a highly sought-after invited speaker. He holds a Canada Research Chair and an Alfred P. Sloan Fellowship, awarded to “early-career scientists and scholars of outstanding promise”.