Curtis Bright

ORCID

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 47

Top Venues

University of Waterloo, Ontario, Canada (PHD)

Education History

University of Waterloo, Ontario, Canada

PHD

Publications

Yameen Ajani, Curtis Bright
SAT and Lattice Reduction for Integer Factorization. CoRR (2024)
Aaron Barnoff, Curtis Bright, Jeffrey O. Shallit
Using finite automata to compute the base-b representation of the golden ratio and other quadratic irrationals. CoRR (2024)
Nahiyan Alamgir, Saeed Nejati, Curtis Bright
SHA-256 Collision Attack with Programmatic SAT. PAAR+SC²@IJCAR (2024)
Yameen Ajani, Curtis Bright
SAT and Lattice Reduction for Integer Factorization. ISSAC (2024)
Nahiyan Alamgir, Saeed Nejati, Curtis Bright
SHA-256 Collision Attack with Programmatic SAT. CoRR (2024)
Zhengyu Li, Curtis Bright, Vijay Ganesh
A SAT Solver and Computer Algebra Attack on the Minimum Kochen-Specker Problem (Student Abstract). AAAI (2024)
Piyush Jha, Zhengyu Li, Zhengyang Lu, Curtis Bright, Vijay Ganesh
AlphaMapleSAT: An MCTS-based Cube-and-Conquer SAT Solver for Hard Combinatorial Problems. CoRR (2024)
Conor Duggan, Zhengyu Li, Curtis Bright, Vijay Ganesh
A SAT + Computer Algebra System Verification of the Ramsey Problem R(3, 8) (Student Abstract). AAAI (2024)
Curtis Bright
A New Lower Bound in the abc Conjecture. CoRR (2023)
Yameen Ajani, Curtis Bright
A Hybrid SAT and Lattice Reduction Approach for Integer Factorization. SC-Square@ISSAC (2023)
Zhengyu Li, Curtis Bright, Vijay Ganesh
A SAT Solver and Computer Algebra Attack on the Minimum Kochen-Specker Problem. CoRR (2023)
Noah Rubin, Curtis Bright, Brett Stevens, Kevin K. H. Cheung
Integer and Constraint Programming Revisited for Mutually Orthogonal Latin Squares (Student Abstract). AAAI (2022)
Zhengyu Li, Curtis Bright, Vijay Ganesh
An SC-Square Approach to the Minimum Kochen-Specker Problem. SC-Square@FLoC (2022)
Curtis Bright, Ilias S. Kotsireas, Vijay Ganesh
When satisfiability solving meets symbolic computation. Commun. ACM 65 (7) (2022)
Daniel Dallaire, Curtis Bright
Enumerating Projective Planes of Order Nine with Proof Verification. SC-Square@FLoC (2022)
Noah Rubin, Curtis Bright, Kevin K. H. Cheung, Brett Stevens
Integer and Constraint Programming Revisited for Mutually Orthogonal Latin Squares. CoRR (2021)
Curtis Bright, Ilias S. Kotsireas, Albert Heinle, Vijay Ganesh
Complex Golay pairs up to length 28: A search via computer algebra and programmatic SAT. J. Symb. Comput. 102 (2021)
Curtis Bright, Kevin K. H. Cheung, Brett Stevens, Ilias S. Kotsireas, Vijay Ganesh
A SAT-based Resolution of Lam's Problem. AAAI (2021)
Noah Rubin, Curtis Bright, Kevin K. H. Cheung, Brett Stevens
Improving Integer and Constraint Programming for Graeco-Latin Squares. ICTAI (2021)
Curtis Bright, Kevin K. H. Cheung, Brett Stevens, Dominique Roy, Ilias S. Kotsireas, Vijay Ganesh
A nonexistence certificate for projective planes of order ten with weight 15 codewords. Appl. Algebra Eng. Commun. Comput. 31 (3-4) (2020)
Curtis Bright, Kevin K. H. Cheung, Brett Stevens, Ilias S. Kotsireas, Vijay Ganesh
A SAT-based Resolution of Lam's Problem. CoRR (2020)
Curtis Bright, Kevin K. H. Cheung, Brett Stevens, Ilias S. Kotsireas, Vijay Ganesh
Nonexistence Certificates for Ovals in a Projective Plane of Order Ten. CoRR (2020)
Curtis Bright, Ilias S. Kotsireas, Vijay Ganesh
New Infinite Families of Perfect Quaternion Sequences and Williamson Sequences. IEEE Trans. Inf. Theory 66 (12) (2020)
Curtis Bright, Kevin K. H. Cheung, Brett Stevens, Ilias S. Kotsireas, Vijay Ganesh
Nonexistence Certificates for Ovals in a Projective Plane of Order Ten. IWOCA (2020)
Curtis Bright, Kevin K. H. Cheung, Brett Stevens, Ilias S. Kotsireas, Vijay Ganesh
Unsatisfiability Proofs for Weight 16 Codewords in Lam's Problem. CoRR (2020)
Curtis Bright, Ilias S. Kotsireas, Vijay Ganesh
Applying computer algebra systems with SAT solvers to the Williamson conjecture. J. Symb. Comput. 100 (2020)
Curtis Bright, Kevin K. H. Cheung, Brett Stevens, Ilias S. Kotsireas, Vijay Ganesh
Unsatisfiability Proofs for Weight 16 Codewords in Lam's Problem. IJCAI (2020)
Curtis Bright, Jürgen Gerhard, Ilias S. Kotsireas, Vijay Ganesh
Effective problem solving using SAT solvers. CoRR (2019)
Curtis Bright, Kevin K. H. Cheung, Brett Stevens, Dominique Roy, Ilias S. Kotsireas, Vijay Ganesh
A Nonexistence Certificate for Projective Planes of Order Ten with Weight 15 Codewords. CoRR (2019)
Curtis Bright, Dragomir Z. Ðokovic, Ilias S. Kotsireas, Vijay Ganesh
A SAT+CAS Approach to Finding Good Matrices: New Examples and Counterexamples. AAAI (2019)
Curtis Bright, Dragomir Z. Dokovic, Ilias S. Kotsireas, Vijay Ganesh
The SAT+CAS Method for Combinatorial Search with Applications to Best Matrices. CoRR (2019)
Curtis Bright, Ilias S. Kotsireas, Vijay Ganesh
New Infinite Families of Perfect Quaternion Sequences and Williamson Sequences. CoRR (2019)
Curtis Bright, Dragomir Z. Dokovic, Ilias S. Kotsireas, Vijay Ganesh
The SAT+CAS method for combinatorial search with applications to best matrices. Ann. Math. Artif. Intell. 87 (4) (2019)
Curtis Bright, Ilias S. Kotsireas, Vijay Ganesh
SAT Solvers and Computer Algebra Systems: A Powerful Combination for Mathematics. CoRR (2019)
Curtis Bright, Ilias S. Kotsireas, Vijay Ganesh
SAT solvers and computer algebra systems: a powerful combination for mathematics. CASCON (2019)
Curtis Bright, Ilias S. Kotsireas, Albert Heinle, Vijay Ganesh
Complex Golay Pairs up to Length 28: A Search via Computer Algebra and Programmatic SAT. CoRR (2019)
Curtis Bright, Jürgen Gerhard, Ilias S. Kotsireas, Vijay Ganesh
Effective Problem Solving Using SAT Solvers. MC (2019)
Curtis Bright, Ilias S. Kotsireas, Vijay Ganesh
The SAT+CAS paradigm and the Williamson conjecture. ACM Commun. Comput. Algebra 52 (3) (2018)
Curtis Bright, Ilias S. Kotsireas, Vijay Ganesh
Applying Computer Algebra Systems and SAT Solvers to the Williamson Conjecture. CoRR (2018)
Curtis Bright, Dragomir Z. Djokovic, Ilias S. Kotsireas, Vijay Ganesh
A SAT+CAS Approach to Finding Good Matrices: New Examples and Counterexamples. CoRR (2018)
Curtis Bright, Ilias S. Kotsireas, Vijay Ganesh
A SAT+CAS Method for Enumerating Williamson Matrices of Even Order. AAAI (2018)
Curtis Bright, Ilias S. Kotsireas, Albert Heinle, Vijay Ganesh
Enumeration of Complex Golay Pairs via Programmatic SAT. ISSAC (2018)
Curtis Bright, Ilias S. Kotsireas, Albert Heinle, Vijay Ganesh
Enumeration of Complex Golay Pairs via Programmatic SAT. CoRR (2018)
Edward Zulkoski, Curtis Bright, Albert Heinle, Ilias S. Kotsireas, Krzysztof Czarnecki, Vijay Ganesh
Combining SAT Solvers with Computer Algebra Systems to Verify Combinatorial Conjectures. J. Autom. Reason. 58 (3) (2017)
Curtis Bright, Raymond R. Devillers, Jeffrey O. Shallit
Minimal Elements for the Prime Numbers. Exp. Math. 25 (3) (2016)
Curtis Bright, Vijay Ganesh, Albert Heinle, Ilias S. Kotsireas, Saeed Nejati, Krzysztof Czarnecki
MathCheck2: A SAT+CAS Verifier for Combinatorial Conjectures. CASC (2016)
Curtis Bright, Vijay Ganesh, Albert Heinle, Ilias S. Kotsireas, Saeed Nejati, Krzysztof Czarnecki
MathCheck2: A SAT+CAS Verifier for Combinatorial Conjectures. SC²@SYNASC (2016)
Curtis Bright, Arne Storjohann
Vector rational number reconstruction. ISSAC (2011)

Curtis Bright.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Curtis Bright