معرفی
Joseph Sawada is a Professor at the School of Computer Science, University of Guelph, specializing in combinatorial algorithms, graph theory, and universal cycles. His research aims to efficiently list non-isomorphic combinatorial objects like necklaces, Lyndon words, and de Bruijn sequences with constant-change Gray codes.
- Key projects: COS++ (combinatorial object server), debruijnsequence.org
- Software entrepreneurship: Co-founder of FreshBooks (accounting software) and Brown and Beatty (AI-powered labor dispute resolution).
Research keywords: Combinatorial algorithms, de Bruijn sequences, universal cycles, Gray codes, graph theory, combinatorial generation.
Selected publications include work on de Bruijn sequences (Discrete Mathematics 2015), successor rules for pancake flipping (Theoretical Computer Science 2015), and k-critical P5-free graphs (Discrete Applied Mathematics 2015). His algorithms have applications in data compression, quantum error correction, and constraint satisfaction problems.
