Vector rational number reconstruction. - Curtis Bright; Arne Storjohann (ISSAC, 2011)

MathCheck2: A SAT+CAS Verifier for Combinatorial Conjectures. - Curtis Bright; Vijay Ganesh 001; Albert Heinle; Ilias S. Kotsireas; Saeed Nejati; Krzysztof Czarnecki 001 (SC²@SYNASC, 2016)

Minimal Elements for the Prime Numbers. - Curtis Bright; Raymond Devillers; Jeffrey O. Shallit (Exp. Math., 2016)

Combining SAT Solvers with Computer Algebra Systems to Verify Combinatorial Conjectures. - Edward Zulkoski; Curtis Bright; Albert Heinle; Ilias S. Kotsireas; Krzysztof Czarnecki 001; Vijay Ganesh 001 (J. Autom. Reason., 2017)

Computational Methods for Combinatorial and Number Theoretic Problems. - Curtis Bright (2017)

A SAT+CAS Method for Enumerating Williamson Matrices of Even Order. - Curtis Bright; Ilias S. Kotsireas; Vijay Ganesh 001 (AAAI, 2018)

Enumeration of Complex Golay Pairs via Programmatic SAT. - Curtis Bright; Ilias S. Kotsireas; Albert Heinle; Vijay Ganesh 001 (ISSAC, 2018)

The SAT+CAS paradigm and the Williamson conjecture. - Curtis Bright; Ilias S. Kotsireas; Vijay Ganesh 001 (ACM Commun. Comput. Algebra, 2018)

Applying Computer Algebra Systems and SAT Solvers to the Williamson Conjecture. - Curtis Bright; Ilias S. Kotsireas; Vijay Ganesh 001 (CoRR, 2018)

A SAT+CAS Approach to Finding Good Matrices: New Examples and Counterexamples. - Curtis Bright; Dragomir Z. Ðokovic; Ilias S. Kotsireas; Vijay Ganesh 001 (AAAI, 2019)

SAT solvers and computer algebra systems: a powerful combination for mathematics. - Curtis Bright; Ilias S. Kotsireas; Vijay Ganesh 001 (CASCON, 2019)

Effective Problem Solving Using SAT Solvers. - Curtis Bright; Jürgen Gerhard; Ilias S. Kotsireas; Vijay Ganesh 001 (MC, 2019)

The SAT+CAS method for combinatorial search with applications to best matrices. - Curtis Bright; Dragomir Z. Dokovic; Ilias S. Kotsireas; Vijay Ganesh 001 (Ann. Math. Artif. Intell., 2019)

Unsatisfiability Proofs for Weight 16 Codewords in Lam's Problem. - Curtis Bright; Kevin K. H. Cheung; Brett Stevens; Ilias S. Kotsireas; Vijay Ganesh 001 (IJCAI, 2020)

Nonexistence Certificates for Ovals in a Projective Plane of Order Ten. - Curtis Bright; Kevin K. H. Cheung; Brett Stevens; Ilias S. Kotsireas; Vijay Ganesh 001 (IWOCA, 2020)

A nonexistence certificate for projective planes of order ten with weight 15 codewords. - Curtis Bright; Kevin K. H. Cheung; Brett Stevens; Dominique Roy; Ilias S. Kotsireas; Vijay Ganesh 001 (Appl. Algebra Eng. Commun. Comput., 2020)

Applying computer algebra systems with SAT solvers to the Williamson conjecture. - Curtis Bright; Ilias S. Kotsireas; Vijay Ganesh 001 (J. Symb. Comput., 2020)

New Infinite Families of Perfect Quaternion Sequences and Williamson Sequences. - Curtis Bright; Ilias S. Kotsireas; Vijay Ganesh 001 (IEEE Trans. Inf. Theory, 2020)

A SAT-based Resolution of Lam's Problem. - Curtis Bright; Kevin K. H. Cheung; Brett Stevens; Ilias S. Kotsireas; Vijay Ganesh 001 (AAAI, 2021)

Improving Integer and Constraint Programming for Graeco-Latin Squares. - Noah Rubin; Curtis Bright; Kevin K. H. Cheung; Brett Stevens (ICTAI, 2021)

Integer and Constraint Programming Revisited for Mutually Orthogonal Latin Squares. - Noah Rubin; Curtis Bright; Kevin K. H. Cheung; Brett Stevens (CoRR, 2021)

Complex Golay pairs up to length 28: A search via computer algebra and programmatic SAT. - Curtis Bright; Ilias S. Kotsireas; Albert Heinle; Vijay Ganesh 001 (J. Symb. Comput., 2021)

Integer and Constraint Programming Revisited for Mutually Orthogonal Latin Squares (Student Abstract). - Noah Rubin; Curtis Bright; Brett Stevens; Kevin K. H. Cheung (AAAI, 2022)

Enumerating Projective Planes of Order Nine with Proof Verification. - Daniel Dallaire; Curtis Bright (SC-Square@FLoC, 2022)

An SC-Square Approach to the Minimum Kochen-Specker Problem. - Zhengyu Li 002; Curtis Bright; Vijay Ganesh 001 (SC-Square@FLoC, 2022)

When satisfiability solving meets symbolic computation. - Curtis Bright; Ilias S. Kotsireas; Vijay Ganesh 001 (Commun. ACM, 2022)

A Hybrid SAT and Lattice Reduction Approach for Integer Factorization. - Yameen Ajani; Curtis Bright (SC-Square@ISSAC, 2023)

A New Lower Bound in the abc Conjecture. - Curtis Bright (CoRR, 2023)

A SAT Solver and Computer Algebra Attack on the Minimum Kochen-Specker Problem. - Zhengyu Li 002; Curtis Bright; Vijay Ganesh 001 (CoRR, 2023)

A SAT Solver and Computer Algebra Attack on the Minimum Kochen-Specker Problem (Student Abstract). - Zhengyu Li 002; Curtis Bright; Vijay Ganesh 001 (AAAI, 2024)

A SAT + Computer Algebra System Verification of the Ramsey Problem R(3, 8) (Student Abstract). - Conor Duggan; Zhengyu Li 002; Curtis Bright; Vijay Ganesh 001 (AAAI, 2024)

A SAT Solver + Computer Algebra Attack on the Minimum Kochen-Specker Problem. - Zhengyu Li 002; Curtis Bright; Vijay Ganesh 001 (IJCAI, 2024)

SAT and Lattice Reduction for Integer Factorization. - Yameen Ajani; Curtis Bright (ISSAC, 2024)

SHA-256 Collision Attack with Programmatic SAT. - Nahiyan Alamgir; Saeed Nejati; Curtis Bright (PAAR+SC²@IJCAR, 2024)

Using Finite Automata to Compute the Base-b Representation of the Golden Ratio and Other Quadratic Irrationals. - Aaron Barnoff; Curtis Bright; Jeffrey O. Shallit (CIAA, 2024)

AlphaMapleSAT: An MCTS-based Cube-and-Conquer SAT Solver for Hard Combinatorial Problems. - Piyush Jha; Zhengyu Li 002; Zhengyang Lu 002; Curtis Bright; Vijay Ganesh 001 (CoRR, 2024)

New Results on Periodic Golay Pairs. - Tyler Lumsden; Ilias S. Kotsireas; Curtis Bright (CoRR, 2024)

Understanding the Popularity of Packages in Maven Ecosystem. - Sadman Jashim Sakib; Muhammad Asaduzzaman; Curtis Bright; Cole Morgan (MSR, 2025)

Verified Certificates via SAT and Computer Algebra Systems for the Ramsey R(3, 8) and R(3, 9) Problems. - Zhengyu Li 002; Conor Duggan; Curtis Bright; Vijay Ganesh 001 (CoRR, 2025)

Myrvold's Results on Orthogonal Triples of 10 ⨉ 10 Latin Squares: A SAT Investigation. - Curtis Bright; Amadou Keita; Brett Stevens (CoRR, 2025)

Symbolic Sets for Proving Bounds on Rado Numbers. - Tanbir Ahmed; Lamina Zaman; Curtis Bright (CoRR, 2025)