Overview
Background
Dr Richard Bean is an affiliate at the UQ Cyber Research Centre.
Richard brings to his work a rich background in data science honed in academia in Australia and Iran, as well as in government (Queensland Health) and industry sectors (ROAM Consulting, Redback, and the Australian Energy Market Operator). With over 60 publications to his name, his research interests span a wide range of areas, including combinatorics, statistics, power systems, classical cryptography, and transport. He is a Fellow of the Australian Institute of Energy and current chair of the Newcastle branch.
Richard is well-known in the public sphere, frequently appearing on radio shows to share his insights into the solutions for various unsolved ciphers. His research extends into areas of national science and research priorities, such as Energy, Transport, Health, and Cyber Security.
In addition to his academic pursuits, Richard has a passion for cycling and is active in cycling advocacy. He also enjoys tackling classical cryptography challenges in his free time.
Availability
- Dr Richard Bean is:
- Not available for supervision
- Media expert
Qualifications
- Doctor of Philosophy, The University of Queensland
Research interests
-
Renewable energy
-
Power systems
-
Combinatorics
-
Classical cryptography
Research impacts
Richard has previously focused his research on a broad array of topics. These include the combinatorics of Latin squares and designs, the analysis of gene microarray expression data, clustering techniques, and scheduling battery charging using energy forecasting. His research in transport has shed light on the effect of weather and land-use on bike share demand in cities worldwide.
Whether in academia, industry, or the public sphere, Richard's work consistently strives to make an impact by shedding new light on complex data and helping to shape the future of energy, transport, health, and cyber security.
Works
Search Professor Richard Bean’s works on UQ eSpace
2003
Journal Article
A new bound on the size of the largest critical set in a Latin square
Bean, Richard and Mahmoodian, E. S. (2003). A new bound on the size of the largest critical set in a Latin square. Discrete Mathematics, 267 (1-3), 13-21. doi: 10.1016/S0012-365X(02)00599-X
2003
Journal Article
Modelling High-Dimensional Data by Mixtures of Factor Analyzers
McLachlan, G. J., Peel, D. and Bean, R. W. (2003). Modelling High-Dimensional Data by Mixtures of Factor Analyzers. Computational Statistics & Data Analysis, 41 (3-4), 379-388. doi: 10.1016/S0167-9473(02)00183-4
2003
Journal Article
A census of critical sets in the Latin squares of order at most six
Adams, P, Bean, R and Khodkar, A (2003). A census of critical sets in the Latin squares of order at most six. Ars Combinatoria, 68 (1), 203-223.
2002
Journal Article
Steiner trades that give rise to completely decomposable latin interchanges
Bean, Richard, Donovan, Diane, Khodkar, Abdollah and Street, Anne Penfold (2002). Steiner trades that give rise to completely decomposable latin interchanges. International Journal of Computer Mathematics, 79 (12), 1273-1284. doi: 10.1080/00207160214654
2002
Journal Article
A mixture model-based approach to the clustering of microarray expression data
McLachlan, GJ, Bean, RW and Peel, D (2002). A mixture model-based approach to the clustering of microarray expression data. Bioinformatics, 18 (3), 413-422. doi: 10.1093/bioinformatics/18.3.413
2001
Journal Article
Disjoint critical sets in Latin squares
Adams, P., Bean, R. W. and Khodkar, A. (2001). Disjoint critical sets in Latin squares. Congressus Numerantium, 153, 33-48.
2001
Other Outputs
Critical sets in Latin squares and associated structures
Bean, Richard Winston (2001). Critical sets in Latin squares and associated structures. PhD Thesis, School of Physical Sciences, The University of Queensland. doi: 10.14264/uql.2016.77
2000
Conference Publication
Steiner trades that give rise to completely decomposable latin interchanges
Bean, R., Donovan, D. M., Khodkar, A. and Street, A. P. (2000). Steiner trades that give rise to completely decomposable latin interchanges. Eleventh Australasian Workshop on Combinatorial Algorithms, Hunter Valley, NSW, Australia, 20th July - 1st August 2000. Newcastle, Australia: The University of Newcastle.
2000
Journal Article
Closing a gap in the spectrum of critical sets
Bean, R. and Donovan, D. M. (2000). Closing a gap in the spectrum of critical sets. Australasian Journal of Combinatorics, 22, 191-200.
Media
Enquiries
Contact Dr Richard Bean directly for media enquiries about:
- ciphers
- codes
- combinatorics
- cryptanalysis
- cryptography
- cryptology
Need help?
For help with finding experts, story ideas and media enquiries, contact our Media team: