Michael J. Dinneen
Michael J. Dinneen
Computer Science, University of Auckland, New Zealand
Verified email at - Homepage
Cited by
Cited by
Improved mixed-example data augmentation
C Summers, MJ Dinneen
2019 IEEE winter conference on applications of computer vision (WACV), 1262-1270, 2019
Unconventional models of computation
C Calude, J Casti, MJ Dinneen
Springer Science & Business Media, 1998
Computing a glimpse of randomness
CS Calude, MJ Dinneen, CK Shu
Experimental evidence of quantum randomness incomputability
CS Calude, MJ Dinneen, M Dumitrescu, K Svozil
Physical Review A—Atomic, Molecular, and Optical Physics 82 (2), 022102, 2010
Algebraic constructions of efficient broadcast networks
MJ Dinneen, MR Fellows, V Faber
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: 9th …, 1991
New resulta for the degree diameter problem
MJ Dinneen, PR Hafner
Rep. ser./Univ. of Auckland. Dep. of mathematics a. statistics, 1992
QUBO formulations for the graph isomorphism problem and related problems
CS Calude, MJ Dinneen, R Hua
Theoretical Computer Science 701, 54-69, 2017
Four things everyone should know to improve batch normalization
C Summers, MJ Dinneen
arXiv preprint arXiv:1906.03548, 2019
A hybrid geometric approach for measuring similarity level among documents and document clustering
A Heidarian, MJ Dinneen
2016 IEEE second international conference on big data computing service and …, 2016
Unconventional computation
CS Calude, MJ Dinneen, G Paun, G Rozenberg, S Stepney
Springer Berlin/Heidelberg., 2009
Small diameter symmetric networks from linear groups
L Campbell, GE Carlsson, MJ Dinneen, V Faber, MR Fellows, ...
IEEE Transactions on Computers 41 (2), 218-220, 1992
A new measure of the difficulty of problems
CS Calude, E Calude, M Dinneen
Department of Computer Science, The University of Auckland, New Zealand, 2006
Exact approximations of omega numbers
CS Calude, MJ Dinneen
International Journal of Bifurcation and Chaos 17 (06), 1937-1954, 2007
A characterization of graphs with vertex cover up to five
K Cattell, MJ Dinneen
International Workshop on Orders, Algorithms, and Applications, 86-99, 1994
On computing graph minor obstruction sets
K Cattell, MJ Dinneen, RG Downey, MR Fellows, MA Langston
Theoretical Computer Science 233 (1-2), 107-127, 2000
An empirical approach to the normality of π
DH Bailey, JM Borwein, CS Calude, MJ Dinneen, M Dumitrescu, A Yee
Experimental Mathematics 21 (4), 375-384, 2012
Guest column: Adiabatic quantum computing challenges
CS Calude, E Calude, MJ Dinneen
ACM SIGACT News 46 (1), 40-61, 2015
Compound constructions of broadcast networks
MJ Dinneen, JA Ventura, MC Wilson, G Zakeri
Discrete applied mathematics 93 (2-3), 205-232, 1999
A simple linear-time algorithm for finding path-decompositions of small width
K Cattell, MJ Dinneen, MR Fellows
Information processing letters 57 (4), 197-203, 1996
Bead--sort: A natural sorting algorithm
JJ Arulanandham, CS Calude, M Dinneen
Department of Computer Science, The University of Auckland, New Zealand, 2002
The system can't perform the operation now. Try again later.
Articles 1–20