Остановите войну!
for scientists:
default search action
Brett Stevens
- > Home > Persons > Brett Stevens
Publications
- 2023
- [j66]Karen Meagher, Mahsa N. Shirazi, Brett Stevens:
An extension of the Erdős-Ko-Rado theorem to uniform set partitions. Ars Math. Contemp. 23(4) (2023) - [j65]Daniel Panario, Lucas Pandolfo Perin, Brett Stevens:
Comparing balanced sequences obtained from ElGamal function to random balanced sequences. Cryptogr. Commun. 15(3): 675-707 (2023) - 2022
- [c32]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 - [c31]Odae Al Aboud, Daniel Panario, Brett Stevens:
Maximum-Length Low-Density MDS Codes and Near Resolvable Designs. ISIT 2022: 2178-2183 - [c30]Kirsten Nelson, Daniel Panario, Brett Stevens:
Equivalence Classes and Balance Properties of Interleaved Sequences. IWSDA 2022: 1-5 - [i14]André Guerino Castoldi, Lucia Moura, Daniel Panario, Brett Stevens:
Ordered Orthogonal Array Construction Using LFSR Sequences. CoRR abs/2208.00333 (2022) - [i13]André Guerino Castoldi, Emerson L. Monte Carmelo, Lucia Moura, Daniel Panario, Brett Stevens:
Ordered Covering Arrays and Upper Bounds on Covering Codes in NRT spaces. CoRR abs/2208.01410 (2022) - [i12]André Guerino Castoldi, Emerson Luiz do Monte Carmelo, Lucia Moura, Daniel Panario, Brett Stevens:
Bounds on Covering Codes in RT spaces using Ordered Covering Arrays. CoRR abs/2208.01412 (2022) - [i11]Charles J. Colbourn, Colin Ingalls, Jonathan Jedwab, Mark Saaltink, Ken W. Smith, Brett Stevens:
Sets of mutually orthogoval projective and affine planes. CoRR abs/2210.11961 (2022) - 2021
- [c29]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 - [c28]Noah Rubin, Curtis Bright, Kevin K. H. Cheung, Brett Stevens:
Improving Integer and Constraint Programming for Graeco-Latin Squares. ICTAI 2021: 604-608 - [i10]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) - [i9]Melissa A. Huggan, Svenja Huntemann, Brett Stevens:
The combinatorial game nofil played on Steiner Triple Systems. CoRR abs/2103.13501 (2021) - [i8]Daniel Panario, Lucas Pandolfo Perin, Brett Stevens:
Comparing balanced Zv-sequences obtained from ElGamal function to random balanced sequences. CoRR abs/2112.12032 (2021) - 2020
- [j60]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) - [j59]Sara D. Cardell, Joan-Josep Climent, Daniel Panario, Brett Stevens:
A construction of 픽2-linear cyclic, MDS codes. Adv. Math. Commun. 14(3): 437-453 (2020) - [c27]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 - [c26]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 - [i7]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) - [i6]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) - [i5]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) - 2019
- [j56]Lucia Moura, Sebastian Raaphorst, Brett Stevens:
Upper bounds on the sizes of variable strength covering arrays using the Lovász local lemma. Theor. Comput. Sci. 800: 146-154 (2019) - [j55]Daniel Panario, Mark Saaltink, Brett Stevens, Daniel Wevrick:
A General Construction of Ordered Orthogonal Arrays Using LFSRs. IEEE Trans. Inf. Theory 65(7): 4316-4326 (2019) - [c25]André Guerino Castoldi, Emerson Luiz do Monte Carmelo, Lucia Moura, Daniel Panario, Brett Stevens:
Bounds on Covering Codes in RT Spaces Using Ordered Covering Arrays. CAI 2019: 100-111 - [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
- [j54]Daniel Panario, Brett Stevens, Georgios Tzanakis:
Number of t-tuples in arrays from LFSRs. Electron. Notes Discret. Math. 65: 17-22 (2018) - [j53]Lucia Moura, Sebastian Raaphorst, Brett Stevens:
The Lovász Local Lemma and Variable Strength Covering Arrays. Electron. Notes Discret. Math. 65: 43-49 (2018) - [i3]Arash Ahadi, Ali Dehghan, Mohammad-Reza Sadeghi, Brett Stevens:
On the algorithmic complexity of decomposing graphs into regular/irregular structures. CoRR abs/1801.08876 (2018) - 2017
- [j52]Melissa A. Huggan, Gary L. Mullen, Brett Stevens, David Thomson:
Sudoku-like arrays, codes and orthogonality. Des. Codes Cryptogr. 82(3): 675-693 (2017) - [j51]Georgios Tzanakis, Lucia Moura, Daniel Panario, Brett Stevens:
Covering arrays from m-sequences and character sums. Des. Codes Cryptogr. 85(3): 437-456 (2017) - [j50]André Guerino Castoldi, Lucia Moura, Daniel Panario, Brett Stevens:
Ordered Orthogonal Array Construction Using LFSR Sequences. IEEE Trans. Inf. Theory 63(2): 1336-1347 (2017) - 2016
- [j49]Zhicheng Gao, Brendan D. McKay, Reza Naserasr, Brett Stevens:
Bipartite edge partitions and the former Alon-Saks-Seymour conjecture. Australas. J Comb. 66: 211-228 (2016) - [j48]Georgios Tzanakis, Lucia Moura, Daniel Panario, Brett Stevens:
Constructing new covering arrays from LFSR sequences over finite fields. Discret. Math. 339(3): 1158-1171 (2016) - [j47]Victoria Horan, Brett Stevens:
Locating patterns in the de Bruijn torus. Discret. Math. 339(4): 1274-1282 (2016) - [j45]Melissa A. Huggan, Brett Stevens:
Polynomial Time Graph Families for Arc Kayles. Integers 16: A86 (2016) - 2014
- [j44]Robert F. Bailey, Mike Newman, Brett Stevens:
A note on packing spanning trees in graphs and bases in matroids. Australas. J Comb. 59: 24-38 (2014) - [j43]Sebastian Raaphorst, Lucia Moura, Brett Stevens:
A construction for strength-3 covering arrays from linear feedback shift register sequences. Des. Codes Cryptogr. 73(3): 949-968 (2014) - [j42]Brett Stevens, Aaron Williams:
The Coolest Way to Generate Binary Strings. Theory Comput. Syst. 54(4): 551-577 (2014) - 2013
- [j41]Ben Seamone, Brett Stevens:
Sequence variations of the 1-2-3 Conjecture and irregularity strength. Discret. Math. Theor. Comput. Sci. 15(1): 15-28 (2013) - [j40]Daniel Panario, Amin Sakzad, Brett Stevens, David Thomson, Qiang Wang:
Ambiguity and Deficiency of Permutations Over Finite Fields With Linearized Difference Map. IEEE Trans. Inf. Theory 59(9): 5616-5626 (2013) - 2012
- [j39]Daniel Panario, Olga Sosnovski, Brett Stevens, Qiang Wang:
Divisibility of polynomials over finite fields and combinatorial applications. Des. Codes Cryptogr. 63(3): 425-445 (2012) - [j38]Jason R. Lobb, Charles J. Colbourn, Peter Danziger, Brett Stevens, Jose Torres-Jimenez:
Cover starters for covering arrays of strength two. Discret. Math. 312(5): 943-956 (2012) - [j37]Ben Seamone, Brett Stevens:
Spanning trees with specified differences in Cayley graphs. Discret. Math. 312(17): 2561-2565 (2012) - [j36]Mahdad Khatirinejad, Reza Naserasr, Mike Newman, Ben Seamone, Brett Stevens:
Vertex-colouring edge-weightings with two edge weights. Discret. Math. Theor. Comput. Sci. 14(1): 1-20 (2012) - [j35]John T. Ethier, Gary L. Mullen, Daniel Panario, Brett Stevens, David Thomson:
Sets of orthogonal hypercubes of class r. J. Comb. Theory, Ser. A 119(2): 430-439 (2012) - [j34]Brett Stevens, Aaron Williams:
Hamilton Cycles in Restricted and Incomplete Rotator Graphs. J. Graph Algorithms Appl. 16(4): 785-810 (2012) - [c19]Brett Stevens, Aaron Williams:
The Coolest Order of Binary Strings. FUN 2012: 322-333 - [i1]Ben Seamone, Brett Stevens:
Sequence variations of the 1-2-3 Conjecture and irregularity strength. CoRR abs/1211.0463 (2012) - 2011
- [j31]Robert F. Bailey, Brett Stevens:
Uncoverings on graphs and network reliability. Australas. J Comb. 50: 219-232 (2011) - [j30]Mahdad Khatirinejad, Reza Naserasr, Mike Newman, Ben Seamone, Brett Stevens:
Digraphs are 2-Weight Choosable. Electron. J. Comb. 18(1) (2011) - [j29]Daniel Panario, Amin Sakzad, Brett Stevens, Qiang Wang:
Two New Measures for Permutations: Ambiguity and Deficiency. IEEE Trans. Inf. Theory 57(11): 7648-7657 (2011) - [c18]Daniel Panario, Amin Sakzad, Brett Stevens, Qiang Wang:
Ambiguity and deficiency of permutations from finite fields. ITW 2011: 165-169 - [c17]Brett Stevens, Aaron Williams:
Hamilton Cycles in Restricted Rotator Graphs. IWOCA 2011: 324-336 - [c16]Joe Sawada, Brett Stevens, Aaron Williams:
De Bruijn Sequences for the Binary Strings with Maximum Density. WALCOM 2011: 182-190 - 2010
- [j28]Robert F. Bailey, Brett Stevens:
Hamiltonian decompositions of complete k-uniform hypergraphs. Discret. Math. 310(22): 3088-3095 (2010) - [c15]Daniel Panario, Brett Stevens, Qiang Wang:
Ambiguity and Deficiency in Costas Arrays and APN Permutations. LATIN 2010: 397-406 - 2009
- [j26]Brett Stevens, Glenn Hurlbert, Bradley Jackson:
Preface. Discret. Math. 309(17): 5255-5258 (2009) - [j24]Brad Jackson, Brett Stevens, Glenn Hurlbert:
Research problems on Gray codes and universal cycles. Discret. Math. 309(17): 5341-5348 (2009) - [j23]Conrado Martínez, Lucia Moura, Daniel Panario, Brett Stevens:
Locating Errors Using ELAs, Covering Arrays, and Adaptive Testing Algorithms. SIAM J. Discret. Math. 23(4): 1776-1799 (2009) - [j22]Peter Danziger, Eric Mendelsohn, Lucia Moura, Brett Stevens:
Covering arrays avoiding forbidden edges. Theor. Comput. Sci. 410(52): 5403-5414 (2009) - 2008
- [c12]Peter Danziger, Eric Mendelsohn, Lucia Moura, Brett Stevens:
Covering Arrays Avoiding Forbidden Edges. COCOA 2008: 296-308 - [c11]Conrado Martínez, Lucia Moura, Daniel Panario, Brett Stevens:
Algorithms to Locate Errors Using Covering Arrays. LATIN 2008: 504-519 - 2007
- [j20]Michael Dewar, Lucia Moura, Daniel Panario, Brett Stevens, Qiang Wang:
Division of trinomials by pentanomials and orthogonal arrays. Des. Codes Cryptogr. 45(1): 1-17 (2007) - 2005
- [j16]Karen Meagher, Lucia Moura, Brett Stevens:
A Sperner-Type Theorem for Set-Partition Systems. Electron. J. Comb. 12 (2005) - [j15]Dalibor Froncek, Brett Stevens:
Pancomponented 2-factorizations of complete graphs. Discret. Math. 299(1-3): 99-112 (2005) - [j14]Karen Meagher, Brett Stevens:
Covering arrays on graphs. J. Comb. Theory, Ser. B 95(1): 134-151 (2005) - 2004
- [j11]Peter Danziger, Brett Stevens:
Class-Uniformly Resolvable Group Divisible Structures I: Resolvable Group Divisible Designs. Electron. J. Comb. 11(1) (2004) - [j10]Peter Danziger, Brett Stevens:
Class-Uniformly Resolvable Group Divisible Structures II: Frames. Electron. J. Comb. 11(1) (2004) - [j9]Brett Stevens, Eric Mendelsohn:
Packing arrays. Theor. Comput. Sci. 321(1): 125-148 (2004) - 2002
- [j6]Brett Stevens, Alan C. H. Ling, Eric Mendelsohn:
A direct construction of transversal covers using group divisible designs. Ars Comb. 63 (2002) - [j4]Brett Stevens, Eric Mendelsohn:
Packing Arrays and Packing Designs. Des. Codes Cryptogr. 27(1-2): 165-176 (2002) - [j3]Brett Stevens, Paul Buskell, Paule Ecimovic, Cristian Ivanescu, Abid Muslim Malik, Anamaria Savu, Tzvetalin S. Vassilev, Helen Verrall, Boting Yang, Zhiduo Zhao:
Solution of an outstanding conjecture: the non-existence of universal cycles with k=n-2. Discret. Math. 258(1-3): 193-204 (2002) - [c4]Brett Stevens, Eric Mendelsohn:
Packing Arrays. LATIN 2002: 293-305 - 1998
- [j1]Brett Stevens, Lucia Moura, Eric Mendelsohn:
Lower Bounds for Transversal Covers. Des. Codes Cryptogr. 15(3): 279-299 (1998) - [c1]Brett Stevens, Eric Mendelsohn:
Efficient software testing protocols. CASCON 1998: 22
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-04-25 02:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint