Brett Stevens

According to our database1, Brett Stevens authored at least 88 papers between 1998 and 2020.

Collaborative distances:



In proceedings 
PhD thesis 




Scene perception guided crowd anomaly detection.
Neurocomputing, 2020

A construction of 픽<sub>2</sub>-linear cyclic, MDS codes.
Adv. Math. Commun., 2020

A nonexistence certificate for projective planes of order ten with weight 15 codewords.
Appl. Algebra Eng. Commun. Comput., 2020

Nonexistence Certificates for Ovals in a Projective Plane of Order Ten.
Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020

Unsatisfiability Proofs for Weight 16 Codewords in Lam's Problem.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

A General Construction of Ordered Orthogonal Arrays Using LFSRs.
IEEE Trans. Inf. Theory, 2019

Upper bounds on the sizes of variable strength covering arrays using the Lovász local lemma.
Theor. Comput. Sci., 2019

Visual Stimulus Disrupts the Spatial Localization of a Tactile Sensation in Virtual Reality.
Proceedings of the IEEE Conference on Virtual Reality and 3D User Interfaces, 2019

Epistemological Issues in Understanding Games Design, Play-Experience, and Reportage.
Proceedings of the 2019 DiGRA International Conference: Game, 2019

Bounds on Covering Codes in RT Spaces Using Ordered Covering Arrays.
Proceedings of the Algebraic Informatics - 8th International Conference, 2019

Number of <i>t</i>-tuples in arrays from LFSRs.
Electron. Notes Discret. Math., 2018

The Lovász Local Lemma and Variable Strength Covering Arrays.
Electron. Notes Discret. Math., 2018

On the algorithmic complexity of decomposing graphs into regular/irregular structures.
CoRR, 2018

Ordered Orthogonal Array Construction Using LFSR Sequences.
IEEE Trans. Inf. Theory, 2017

Covering arrays from m-sequences and character sums.
Des. Codes Cryptogr., 2017

Sudoku-like arrays, codes and orthogonality.
Des. Codes Cryptogr., 2017

Polynomial Time Graph Families for Arc Kayles.
Integers, 2016

Edge-partitioning graphs into regular and locally irregular components.
Discret. Math. Theor. Comput. Sci., 2016

Constructing new covering arrays from LFSR sequences over finite fields.
Discret. Math., 2016

Locating patterns in the de Bruijn torus.
Discret. Math., 2016

A note on Beckett-Gray codes and the relationship of Gray codes to data structures.
CoRR, 2016

Bipartite edge partitions and the former Alon-Saks-Seymour conjecture.
Australas. J Comb., 2016

Facial Expression-Aware Face Frontalization.
Proceedings of the Computer Vision - ACCV 2016, 2016

Dynamic facial expression recognition using local patch and LBP-TOP.
Proceedings of the 8th International Conference on Human System Interaction, 2015

The Coolest Way to Generate Binary Strings.
Theory Comput. Syst., 2014

A construction for strength-3 covering arrays from linear feedback shift register sequences.
Des. Codes Cryptogr., 2014

A note on packing spanning trees in graphs and bases in matroids.
Australas. J Comb., 2014

Disrupting the Player's Schematised Knowledge of Game Components.
Proceedings of the 2014 DiGRA International Conference: <Active Noun> the <Verb> of game <Plural Noun>, 2014

Ambiguity and Deficiency of Permutations Over Finite Fields With Linearized Difference Map.
IEEE Trans. Inf. Theory, 2013

Sequence variations of the 1-2-3 Conjecture and irregularity strength.
Discret. Math. Theor. Comput. Sci., 2013

Applications and weights of multiples of primitive and other polynomials.
Proceedings of the Handbook of Finite Fields., 2013

Emotional body language displayed by artificial agents.
ACM Trans. Interact. Intell. Syst., 2012

Semantic metadata interoperability in digital libraries: a constructivist grounded theory approach.
Bull. IEEE Tech. Comm. Digit. Libr., 2012

Hamilton Cycles in Restricted and Incomplete Rotator Graphs.
J. Graph Algorithms Appl., 2012

Sets of orthogonal hypercubes of class r.
J. Comb. Theory, Ser. A, 2012

Vertex-colouring edge-weightings with two edge weights.
Discret. Math. Theor. Comput. Sci., 2012

Spanning trees with specified differences in Cayley graphs.
Discret. Math., 2012

Cover starters for covering arrays of strength two.
Discret. Math., 2012

Divisibility of polynomials over finite fields and combinatorial applications.
Des. Codes Cryptogr., 2012

The Coolest Order of Binary Strings.
Proceedings of the Fun with Algorithms - 6th International Conference, 2012

Two New Measures for Permutations: Ambiguity and Deficiency.
IEEE Trans. Inf. Theory, 2011

Digraphs are 2-Weight Choosable.
Electron. J. Comb., 2011

Uncoverings on graphs and network reliability.
Australas. J Comb., 2011

De Bruijn Sequences for the Binary Strings with Maximum Density.
Proceedings of the WALCOM: Algorithms and Computation - 5th International Workshop, 2011

Hamilton Cycles in Restricted Rotator Graphs.
Proceedings of the Combinatorial Algorithms - 22nd International Workshop, 2011

Ambiguity and deficiency of permutations from finite fields.
Proceedings of the 2011 IEEE Information Theory Workshop, 2011

Hamiltonian decompositions of complete k-uniform hypergraphs.
Discret. Math., 2010

Bad Pairs in Software Testing.
Proceedings of the Testing, 2010

Ambiguity and Deficiency in Costas Arrays and APN Permutations.
Proceedings of the LATIN 2010: Theoretical Informatics, 2010

Treadmill Interface for Virtual Reality vs. Overground Walking: A Comparison of Gait in Individuals with and without Pain.
Proceedings of the Annual Review of Cybertherapy and Telemedicine 2009, 2009

Covering arrays avoiding forbidden edges.
Theor. Comput. Sci., 2009

Locating Errors Using ELAs, Covering Arrays, and Adaptive Testing Algorithms.
SIAM J. Discret. Math., 2009

Discret. Math., 2009

Research problems on Gray codes and universal cycles.
Discret. Math., 2009

Universal cycles of (n-1)-partitions of an n-set.
Discret. Math., 2009

A survey of known results and research areas for n-queens.
Discret. Math., 2009

Contextually-Ambiguous Pervasive Games: An Exploratory Study.
Proceedings of the 2009 DiGRA International Conference: Breaking New Ground: Innovation in Games, 2009

Results for the n-queens problem on the Möbius board.
Australas. J Comb., 2008

Facilitating creativity without restrictions: a pilot implementation of an idea generation game.
Proceedings of the 12th international conference on Entertainment and media in the ubiquitous era, 2008

Algorithms to Locate Errors Using Covering Arrays.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

A Sudoku Solution from Orthogonal Latin Squares: 11192.
Am. Math. Mon., 2007

Division of trinomials by pentanomials and orthogonal arrays.
Des. Codes Cryptogr., 2007

Cyclic Storage for Fault-Tolerant Distributed Executions.
IEEE Trans. Parallel Distributed Syst., 2006

The Effect that the Visual and Haptic Problems Associated with Touching a Projection Augmented Model Have on Object-Presence.
Presence Teleoperators Virtual Environ., 2006

The 'detection, perception and object-presence' framework: a unified structure for investigating illusory representations of reality.
Proceedings of the 33. International Conference on Computer Graphics and Interactive Techniques, 2006

The '<i>detection, perception and object-presence</i>' framework: a unified structure for investigating illusory representations of reality.
Proceedings of the 3rd Symposium on Applied Perception in Graphics and Visualization, 2006

Problem 11192.
Am. Math. Mon., 2005

Covering arrays on graphs.
J. Comb. Theory, Ser. B, 2005

Pancomponented 2-factorizations of complete graphs.
Discret. Math., 2005

A Sperner-Type Theorem for Set-Partition Systems.
Electron. J. Comb., 2005

The Effect That Touching a Projection Augmented Model Has on Object-Presence.
Proceedings of the 9th International Conference on Information Visualisation, 2005

Static/Animated Diagrams and their Effect on Students Perceptions of Conceptual Understanding in Computer Aided Learning (CAL) Environments.
Proceedings of the People and Computers XIX, 2005

Packing arrays.
Theor. Comput. Sci., 2004

Class-Uniformly Resolvable Group Divisible Structures II: Frames.
Electron. J. Comb., 2004

Class-Uniformly Resolvable Group Divisible Structures I: Resolvable Group Divisible Designs.
Electron. J. Comb., 2004

Does Touching a Projection Augmented Model and Interacting with it using a Spatially-Coincident Device, Affect a User's Perception of its Size?
Australas. J. Inf. Syst., 2004

The Effect that Haptically Perceiving a Projection Augmented Model has on the Perception of Size.
Proceedings of the 3rd IEEE and ACM International Symposium on Mixed and Augmented Reality (ISMAR 2004), 2004

The anti-Oberwolfach solution: pancyclic 2-factorizations of complete graphs.
Theor. Comput. Sci., 2003

Enumeration of the bases of the bicircular matroid on a complete bipartite graph.
Ars Comb., 2003

Putting the Virtual into Reality: Assessing Object-Presence with Projection-Augmented Models.
Presence Teleoperators Virtual Environ., 2002

Solution of an outstanding conjecture: the non-existence of universal cycles with <i>k</i>=<i>n</i>-2.
Discret. Math., 2002

Packing Arrays and Packing Designs.
Des. Codes Cryptogr., 2002

The Directed Anti-Oberwolfach Solution: Pancyclic 2-Factorizations of Complete Directed Graphs of Odd Order.
Electron. J. Comb., 2002

A direct construction of transversal covers using group divisible designs.
Ars Comb., 2002

Physically augmenting reality : human-computer interaction with projection-augmented models.
PhD thesis, 2001

The Sense of Object-Presence with Projection-Augmented Models.
Proceedings of the Haptic Human-Computer Interaction, First International Workshop, Glasgow, UK, August 31, 2000

Lower Bounds for Transversal Covers.
Des. Codes Cryptogr., 1998

Efficient software testing protocols.
Proceedings of the 1998 conference of the Centre for Advanced Studies on Collaborative Research, November 30, 1998