Stephen Melczer is an Assistant Professor in the Department of Combinatorics and Optimization at the University of Waterloo. Prior to joining Waterloo, he was a CRM-ISM postdoctoral fellow at the Université du Québec à Montréal, a postdoctoral fellow at the University of Pennsylvania, and a visiting scholar at the University of Illinois Urbana-Champaign. His research adapts methods from algebraic and differential geometry, analysis, and topology to create effective tools for combinatorics, mathematics, and computer science. He received doctorates from the École normale supérieure de Lyon and the University of Waterloo in 2017, and is a recipient of a Governor General Silver Academic Medal.

• Introduction.- Background and Motivation.- Smooth ACSV and Applications.- Non-Smooth ACSV.

“Melczer has done a good job of mathematically encompassing the issues related to computation and complexity in this domain, adopting an algorithmic approach to explain the underlying computer algebra and its associated software. … I found the theory and applications to be quite lucidly explained … . The target readership includes graduate and advanced undergraduate students of mathematics and computer science, as well as researchers of these and allied areas.” (Soubhik Chakraborty, Computing Reviews, August 17, 2022)“This book is grounded in computation, which is useful for the comprehension of the subject to the reader. This book provides an accessible introduction to the subject for researchers in combinatorics and broader areas.” (Andrés R. Vindas Meléndez, zbMATH 1468.05002, 2021)