Остановите войну!
for scientists:
default search action
Brett Stevens
- > Home > Persons > Brett Stevens
Publications
- 2022
- [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) - 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) - [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 - 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) - 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
- [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) - 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) - 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) - 1998
- [j1]Brett Stevens, Lucia Moura, Eric Mendelsohn:
Lower Bounds for Transversal Covers. Des. Codes Cryptogr. 15(3): 279-299 (1998)
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