Michael Dinneen
From Wikipedia, the free encyclopedia
Michael J. Dinneen is an American-New Zealand mathematician and computer scientist working at the University of Auckland, New Zealand. Co-director of the Centre for Discrete Mathematics and Theoretical Computer Science.
Research in combinatorial algorithms, distributive programming, experimental graph theory, and experimental algorithmic information theory.
[edit] Selected Bibliography
- Michael J. Dinneen, Georgy Gimel'farb, and Mark C. Wilson. Introduction to Algorithms, Data Structures and Formal Languages. Pearson (Education New Zealand), 2004. ISBN 1-877258-79-2 (pages 253).
- Cristian S. Calude, Michael J. Dinneen, and Chi-Kou Shu. Computing a glimpse of randomness. "Experimental Mathematics", 11(2):369-378, 2002. http://www.cs.auckland.ac.nz/~cristian/Calude361_370.pdf
- Joshua J. Arulanandham, Cristian S. Calude, and Michael J. Dinneen. A fast natural algorithm for searching. "Theoretical Computer Science", 320(1):3-13, 2004. http://authors.elsevier.com/sd/article/S0304397504001914
[edit] External links
- Michael J. Dinneen Home Page
- List of publications of Michael J. Dinneen
- CDMTCS at the University of Auckland
| Persondata | |
|---|---|
| NAME | Dinneen, Michael |
| ALTERNATIVE NAMES | |
| SHORT DESCRIPTION | American mathematician and computer scientist |
| DATE OF BIRTH | |
| PLACE OF BIRTH | USA |
| DATE OF DEATH | |
| PLACE OF DEATH | |
