default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCurtis Bright
Person information
- affiliation: University of Windsor, Ontario, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c22]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: 23480-23481- [c21]Zhengyu Li, Curtis Bright, Vijay Ganesh:
A SAT Solver and Computer Algebra Attack on the Minimum Kochen-Specker Problem (Student Abstract). AAAI 2024: 23559-23560 - [c20]Zhengyu Li, Curtis Bright, Vijay Ganesh:
A SAT Solver + Computer Algebra Attack on the Minimum Kochen-Specker Problem. IJCAI 2024: 1898-1906 - [c19]Yameen Ajani, Curtis Bright:
SAT and Lattice Reduction for Integer Factorization. ISSAC 2024: 391-399 - [c18]Nahiyan Alamgir, Saeed Nejati, Curtis Bright:
SHA-256 Collision Attack with Programmatic SAT. PAAR+SC²@IJCAR 2024: 91-110 - [c17]Aaron Barnoff, Curtis Bright, Jeffrey O. Shallit:
Using Finite Automata to Compute the Base-b Representation of the Golden Ratio and Other Quadratic Irrationals. CIAA 2024: 35-50 - [i20]Piyush Jha, Zhengyu Li, Zhengyang Lu, Curtis Bright, Vijay Ganesh:
AlphaMapleSAT: An MCTS-based Cube-and-Conquer SAT Solver for Hard Combinatorial Problems. CoRR abs/2401.13770 (2024) - [i19]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 abs/2405.02727 (2024) - [i18]Yameen Ajani, Curtis Bright:
SAT and Lattice Reduction for Integer Factorization. CoRR abs/2406.20071 (2024) - [i17]Nahiyan Alamgir, Saeed Nejati, Curtis Bright:
SHA-256 Collision Attack with Programmatic SAT. CoRR abs/2406.20072 (2024) - [i16]Tyler Lumsden, Ilias Kotsireas, Curtis Bright:
New Results on Periodic Golay Pairs. CoRR abs/2408.15611 (2024) - 2023
- [c16]Yameen Ajani, Curtis Bright:
A Hybrid SAT and Lattice Reduction Approach for Integer Factorization. SC-Square@ISSAC 2023: 39-43 - [i15]Curtis Bright:
A New Lower Bound in the abc Conjecture. CoRR abs/2301.11056 (2023) - [i14]Zhengyu Li, Curtis Bright, Vijay Ganesh:
A SAT Solver and Computer Algebra Attack on the Minimum Kochen-Specker Problem. CoRR abs/2306.13319 (2023) - 2022
- [j9]Curtis Bright, Ilias S. Kotsireas, Vijay Ganesh:
When satisfiability solving meets symbolic computation. Commun. ACM 65(7): 64-72 (2022) - [c15]Noah Rubin, Curtis Bright, Brett Stevens, Kevin K. H. Cheung:
Integer and Constraint Programming Revisited for Mutually Orthogonal Latin Squares (Student Abstract). AAAI 2022: 13037-13038 - [c14]Daniel Dallaire, Curtis Bright:
Enumerating Projective Planes of Order Nine with Proof Verification. SC-Square@FLoC 2022: 45-54 - [c13]Zhengyu Li, Curtis Bright, Vijay Ganesh:
An SC-Square Approach to the Minimum Kochen-Specker Problem. SC-Square@FLoC 2022: 55-66 - [e1]Curtis Bright, James H. Davenport:
Proceedings of the 6th SC-Square Workshop co-located with the SIAM Conference on Applied Algebraic Geometry, SC-Square@SIAM AG 2021, Virtual Event, College Station, USA, August 19-20, 2021. CEUR Workshop Proceedings 3273, CEUR-WS.org 2022 [contents] - 2021
- [j8]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: 153-172 (2021) - [c12]Curtis Bright, Kevin K. H. Cheung, Brett Stevens, Ilias S. Kotsireas, Vijay Ganesh:
A SAT-based Resolution of Lam's Problem. AAAI 2021: 3669-3676 - [c11]Noah Rubin, Curtis Bright, Kevin K. H. Cheung, Brett Stevens:
Improving Integer and Constraint Programming for Graeco-Latin Squares. ICTAI 2021: 604-608 - [i13]Noah Rubin, Curtis Bright, Kevin K. H. Cheung, Brett Stevens:
Integer and Constraint Programming Revisited for Mutually Orthogonal Latin Squares. CoRR abs/2103.11018 (2021) - 2020
- [j7]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): 195-213 (2020) - [j6]Curtis Bright, Ilias S. Kotsireas, Vijay Ganesh:
Applying computer algebra systems with SAT solvers to the Williamson conjecture. J. Symb. Comput. 100: 187-209 (2020) - [j5]Curtis Bright, Ilias S. Kotsireas, Vijay Ganesh:
New Infinite Families of Perfect Quaternion Sequences and Williamson Sequences. IEEE Trans. Inf. Theory 66(12): 7739-7751 (2020) - [c10]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: 1460-1466 - [c9]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: 97-111 - [i12]Curtis Bright, Kevin K. H. Cheung, Brett Stevens, Ilias S. Kotsireas, Vijay Ganesh:
Unsatisfiability Proofs for Weight 16 Codewords in Lam's Problem. CoRR abs/2001.11973 (2020) - [i11]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 abs/2001.11974 (2020) - [i10]Curtis Bright, Kevin K. H. Cheung, Brett Stevens, Ilias S. Kotsireas, Vijay Ganesh:
A SAT-based Resolution of Lam's Problem. CoRR abs/2012.04715 (2020)
2010 – 2019
- 2019
- [j4]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): 321-342 (2019) - [c8]Curtis Bright, Dragomir Z. Ðokovic, Ilias S. Kotsireas, Vijay Ganesh:
A SAT+CAS Approach to Finding Good Matrices: New Examples and Counterexamples. AAAI 2019: 1435-1442 - [c7]Curtis Bright, Ilias S. Kotsireas, Vijay Ganesh:
SAT solvers and computer algebra systems: a powerful combination for mathematics. CASCON 2019: 323-328 - [c6]Curtis Bright, Jürgen Gerhard, Ilias S. Kotsireas, Vijay Ganesh:
Effective Problem Solving Using SAT Solvers. MC 2019: 205-219 - [i9]Curtis Bright, Ilias S. Kotsireas, Vijay Ganesh:
New Infinite Families of Perfect Quaternion Sequences and Williamson Sequences. CoRR abs/1905.00267 (2019) - [i8]Curtis Bright, Jürgen Gerhard, Ilias S. Kotsireas, Vijay Ganesh:
Effective problem solving using SAT solvers. CoRR abs/1906.06251 (2019) - [i7]Curtis Bright, Ilias S. Kotsireas, Vijay Ganesh:
SAT Solvers and Computer Algebra Systems: A Powerful Combination for Mathematics. CoRR abs/1907.04408 (2019) - [i6]Curtis Bright, Dragomir Z. Dokovic, Ilias S. Kotsireas, Vijay Ganesh:
The SAT+CAS Method for Combinatorial Search with Applications to Best Matrices. CoRR abs/1907.04987 (2019) - [i5]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 abs/1907.11981 (2019) - [i4]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 abs/1911.04032 (2019) - 2018
- [j3]Curtis Bright, Ilias S. Kotsireas, Vijay Ganesh:
The SAT+CAS paradigm and the Williamson conjecture. ACM Commun. Comput. Algebra 52(3): 82-84 (2018) - [c5]Curtis Bright, Ilias S. Kotsireas, Vijay Ganesh:
A SAT+CAS Method for Enumerating Williamson Matrices of Even Order. AAAI 2018: 6573-6580 - [c4]Curtis Bright, Ilias S. Kotsireas, Albert Heinle, Vijay Ganesh:
Enumeration of Complex Golay Pairs via Programmatic SAT. ISSAC 2018: 111-118 - [i3]Curtis Bright, Ilias S. Kotsireas, Vijay Ganesh:
Applying Computer Algebra Systems and SAT Solvers to the Williamson Conjecture. CoRR abs/1804.01172 (2018) - [i2]Curtis Bright, Ilias S. Kotsireas, Albert Heinle, Vijay Ganesh:
Enumeration of Complex Golay Pairs via Programmatic SAT. CoRR abs/1805.05488 (2018) - [i1]Curtis Bright, Dragomir Z. Djokovic, Ilias S. Kotsireas, Vijay Ganesh:
A SAT+CAS Approach to Finding Good Matrices: New Examples and Counterexamples. CoRR abs/1811.05094 (2018) - 2017
- [b1]Curtis Bright:
Computational Methods for Combinatorial and Number Theoretic Problems. University of Waterloo, Ontario, Canada, 2017 - [j2]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): 313-339 (2017) - 2016
- [j1]Curtis Bright, Raymond R. Devillers, Jeffrey O. Shallit:
Minimal Elements for the Prime Numbers. Exp. Math. 25(3): 321-331 (2016) - [c3]Curtis Bright, Vijay Ganesh, Albert Heinle, Ilias S. Kotsireas, Saeed Nejati, Krzysztof Czarnecki:
MathCheck2: A SAT+CAS Verifier for Combinatorial Conjectures. CASC 2016: 117-133 - [c2]Curtis Bright, Vijay Ganesh, Albert Heinle, Ilias S. Kotsireas, Saeed Nejati, Krzysztof Czarnecki:
MathCheck2: A SAT+CAS Verifier for Combinatorial Conjectures. SC²@SYNASC 2016: 13-19 - 2011
- [c1]Curtis Bright, Arne Storjohann:
Vector rational number reconstruction. ISSAC 2011: 51-58
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-21 21:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
