Dr Michael J Dinneen

BSc, MSc, PhD

Profile Image
Senior Lecturer

Biography

  • University of Victoria (Canada) MSc and PhD
  • Washington State University (Pullman USA)
  • University of Idaho (Moscow USA) BSc Mathematics (Cum Laude) and BSc Computer Science (Magna Cum Laude)
  • Sessional Lecturer at University of Victoria
  • Worked at Los Alamos National Laboratory (New Mexico USA)

Research | Current

Research in

  • Combinatorial algorithms
  • Graph theory
  • Network design

Interests in

  • Distributive programming
  • Computational complexity
  • Programming trends
  • Quantum computing
  • Computer-assisted mathematics

Postgraduate supervision

Web link to a list of my former students with research topics.

Areas of expertise

  • Theoretical Computer Science
  • Graph and Combinatorial Algorithms
  • Parallel and Distributed Computing (incl. P Systems and GPGPU programming)

Committees/Professional groups/Services

  • Theory Research Group Director (Computer Science)
  • Deputy Director CDMTCS
  • Stage 3 Coordinator and Student Advisor (Computer Science Academic Committee)

Selected publications and creative works (Research Outputs)

  • Dinneen, M. J., & Wei, K. (2013). A (1+1) adaptive memetic algorithm for the maximum clique problem. Paper presented at 2013 IEEE Congress on Evolutionary Computation, CEC 2013, Cancun, Mexico. 20 June - 23 June 2013. Evolutionary Computation (CEC) 2013. 10.1109/CEC.2013.6557756
    URL: http://hdl.handle.net/2292/23556
  • Dinneen, M. J., Khosravani, M., & Wei, K. (2012). A Comparative Study of Parallel Algorithms for the Girth Problem. Paper presented at Australasian Symposium on Parallel and Distributed Computing (AusPDC 2012), Melbourne, Australia. 30 January - 3 February 2012. 10th Australasian Symposium on Parallel and Distributed Computing (AusPDC 2012). Related URL.
  • Dinneen, M. J., Kim, Y.-B., & Nicolescu, R. (2012). Faster synchronization in P systems. Natural Computing, 11 (1), 107-115. 10.1007/s11047-011-9271-z
    Other University of Auckland co-authors: Radu Nicolescu
  • Dinneen, M. J. (2012). A Program-size Complexity Measure for Mathematical Problems and Conjectures. Paper presented at International Workshop on Theoretical Computer Science (WTCS 2012), Auckland, New Zealand. 21 February - 24 February 2012. Proceedings of the International Workshop on Theoretical Computer Science (WTCS 2012). 10.1007/978-3-642-27654-5_7
  • Bailey, D. H., Borwein, J. M., Calude, C. S., Dinneen, M. J., Dumitrescu, M., & Yee, A. (2012). An Empirical Approach to the Normality of π. Experimental Mathematics, 21 (4), 1-10. 10.1080/10586458.2012.665333
    Other University of Auckland co-authors: Cristian Calude
  • Dinneen, M. J., Khosravani, M., & Probert, A. (2011). Using OpenCL for Implementing Simple Parallel Graph Algorithms. Paper presented at PDPTA'11 - The 2011 International Conference on Parallel and Distributed Processing Techniques and Applications, Las Vegas, Nevada. 18 July - 21 July 2011. Proceedings of the 17th annual conference on Parallel and Distributed Processing Techniques and Applications (PDPTA’11) , part of WORLDCOMP’11. (pp. 6).

Contact details

Primary location

SCIENCE CENTRE 303 - Bldg 303
Level 4, Room 425
38 PRINCES ST
AUCKLAND 1010
New Zealand

Social links

Web links