- A SAT-based resolution of Lam's problem (PDF) by Curtis Bright (video, highlight)
- 35th AAAI Conference on Artificial Intelligence (AAAI 2021)
- Vancouver, Canada (Held Online) on February 3, 2021
- Unsatisfiability Proofs for Weight 16 Codewords in Lam's Problem (PDF) by Curtis Bright (video, highlight)
- 29th International Joint Conference on Artificial Intelligence (IJCAI-20)
- Yokohama, Japan (Held Online) on January 14, 2021
- A Resolution of Lam's Problem via Satisfiability Solvers (PDF) by Curtis Bright (video)
- Canadian Mathematical Society Winter Meeting (CMS 2020)
- Montréal, Canada (Held Online) on December 4, 2020
- Nonexistence Certificates for Ovals in a Projective Plane of Order Ten (PDF) by Curtis Bright (video)
- 31st International Workshop on Combinatorial Algorithms (IWOCA 2020)
- University of Bordeaux in Bordeaux, France (Held Online) on June 8, 2020
- SAT Solving with Computer Algebra for Fast, Verified Mathematical Search (PDF) by Curtis Bright
- University of Windsor School of Computer Science Seminar
- University of Windsor in Windsor, Canada on March 12, 2020
- SAT Solving with Computer Algebra and its Application to Graph Theory and Geometry (PDF) by Curtis Bright
- Computational Geometry Lab Seminar
- Carleton University in Ottawa, Canada on February 28, 2020
- SAT Solvers and Computer Algebra Systems: A Powerful Combination for Mathematics (PDF) by Curtis Bright
- 29th International Conference on Computer Science and Software Engineering (CASCON 2019)
- Hilton Toronto / Markham Suites Conference Center and Spa in Markham, Canada on November 4, 2019
- SAT Solving with Computer Algebra: A Powerful Combinatorial Search Method (PDF) by Curtis Bright
- UBC Discrete Math Seminar
- University of British Columbia in Vancouver, Canada on September 10, 2019
- SAT Solving with Computer Algebra: A Powerful Combinatorial Search Method (PDF) by Curtis Bright
- University of Victoria Discrete Math Seminar
- University of Victoria in Victoria, Canada on September 6, 2019
- SAT Solving with Computer Algebra: A Powerful Combinatorial Search Method (PDF) by Curtis Bright
- SFU Discrete Math Seminar
- Simon Fraser University in Vancouver, Canada on September 3, 2019
- Searching for Projective Planes with Computer Algebra and SAT Solvers (PDF) by Curtis Bright
- 25th Conference on Applications of Computer Algebra (ACA 2019)
- École de technologie supérieure in Montréal, Canada on July 19, 2019
- SAT+CAS: A Powerful New Combinatorial Search Method (PDF) by Curtis Bright
- Ottawa–Carleton Combinatorics & Optimization Seminar
- Carleton University in Ottawa, Canada on October 5, 2018
- MathCheck: A SAT+CAS Mathematical Conjecture Verifier (PDF) by Curtis Bright
- 6th International Congress on Mathematical Software (ICMS 2018)
- University of Notre Dame in Notre Dame, U.S.A. on July 26, 2018
- Enumeration of Complex Golay Pairs via Programmatic SAT (PDF) by Curtis Bright
- 43rd International Symposium on Symbolic and Algebraic Computation (ISSAC 2018)
- City University of New York Graduate Center in New York, U.S.A. on July 17, 2018
- Hard Combinatorial Problems: A Challenge for Satisfiability (PDF) by Ilias Kotsireas
- Invited talk at the Third International Workshop on Satisfiability Checking and Symbolic Computation (SC2 2018)
- University of Oxford in Oxford, United Kingdom on July 11, 2018
- SAT Solvers and Computer Algebra Systems: A Powerful Combination for Mathematics (PDF) by Vijay Ganesh
- Plenary talk at the 24th Conference on Applications of Computer Algebra (ACA 2018)
- University of Santiago de Compostela in Santiago de Compostela, Spain on June 21, 2018
- A SAT+CAS Method for Enumerating Williamson Matrices of Even Order (PDF) by Curtis Bright
- Second International Workshop on Satisfiability Checking and Symbolic Computation (SC2 2017)
- Technische Universität Kaiserslautern in Kaiserslautern, Germany on July 29, 2017
- Computational Methods for Combinatorial and Number Theoretic Problems (PDF) by Curtis Bright
- University of Waterloo in Waterloo, Canada on March 23, 2017
- MathCheck2: Combining Learning-based Search (SAT) with Symbolic Computation (CAS) (PDF) by Vijay Ganesh and Curtis Bright
- First International Workshop on Satisfiability Checking and Symbolic Computation (SC2 2016)
- Universitatea de Vest Timisoara in Timișoara, Romania on September 24, 2016
- MathCheck2: A SAT+CAS Verifier for Combinatorial Conjectures (PDF) by Curtis Bright
- 18th International Workshop on Computer Algebra in Scientific Computing (CASC 2016)
- Universitatea din București in Bucharest, Romania on September 20, 2016
- MathCheck2: Combining CAS and SAT (PDF) by Albert Heinle
- 22nd Conference on Applications of Computer Algebra (ACA 2016)
- Universität Kassel in Kassel, Germany on August 2, 2016
- MathCheck: A Math Assistant Combining SAT with Computer Algebra Systems (PDF) by Curtis Bright
- 25th International Joint Conference on Artificial Intelligence (IJCAI-16)
- New York Hilton Midtown in New York, U.S.A. on July 12, 2016
- MathCheck2: A SAT+CAS Verifier for Combinatorial Conjectures (PDF) by Curtis Bright
- 14th International Workshop on Satisfiability Modulo Theories (SMT 2016)
- Universidade de Coimbra in Coimbra, Portugal on July 2, 2016
- MathCheck2: A SAT+CAS Verifier for Combinatorial Conjectures (PDF) by Curtis Bright
- Computationally Assisted Mathematical Discovery and Experimental Mathematics (ACMES2)
- Western University in London, Canada on May 13, 2016
- PhD Research Proposal: A SAT+CAS system for checking math conjectures (PDF) by Curtis Bright
- University of Waterloo in Waterloo, Canada on March 14, 2016
- Computational Approaches to Open Problems in Combinatorics (PDF) by Ilias Kotsireas
- 14th International Symposium on Artificial Intelligence and Mathematics (ISAIM 2016)
- Embassy Suites Fort Lauderdale in Fort Lauderdale, U.S.A. on January 5, 2016
- MathCheck: A Math Assistant Combining SAT with Computer Algebra Systems (PDF) by Ed Zulkoski
- The 25th jubilee edition of the International Conference on Automated Deduction (CADE-25)
- Freie Universität Berlin in Berlin, Germany on August 7, 2015
