1. Directors Professor D. S. Bridges (Waikato) and Professor C. S. Calude (Auckland)
  2. AURC Representative on Management Committee Not nominated.
  3. Participating members The CDMTCS includes the following faculty members: P. Bonnington (Mathematics, Tamaki), D. S. Bridges (Mathematics, Waikato), C. Calude (Computer Science, Auckland), J. Cleary, (Computer Science, Waikato), M. D. E. Conder (Mathematics, Auckland), R. W. Doran (Computer Science, Auckland), A. G. French (Mathematics, Waikato), J. Gibbons (Computer Science, Auckland), P. Gibbons (Computer Science, Auckland), H. Guesgen (Computer Science, Auckland), P. R. Hafner (Mathematics, Auckland), F. Kroon (Philosophy, Auckland), M. Lennon (Computer Science, Tamaki), I. Melchert (Mathematics, Waikato), S. Reeves (Computer Science, Waikato), M.R. Titchener (Computer Science, Tamaki), I. H. Witten (Computer Science, Waikato).
  4. International Board The following distinguished experts are serving on the CDMTCS International Advisory Board: M. Arslanov, R. C. Backhouse, J. Casti, G. J. Chaitin, C. J. Colbourn, E. W. Dijkstra, J. H. Dinitz, J. A. Goguen, R. L. Graham, J. Hartmanis, H. Jürgensen, C. C. Lindner, R. Mathon, B. D. McKay, A. Nerode, G. Rozenberg, A. Salomaa, J. Seberry, D. van Dalen.
  5. Aim The Centre, which is a joint venture involving the Computer Science and Mathematics Departments of the Universities of Auckland and Waikato, was founded in 1995 to support basic research on the interface between mathematics and computing, to increase local knowledge in these areas, and to broaden research skills in New Zealand. The aim of the Centre's Management Committee is to build one of the world's best centres in Discrete Mathematics and Theoretical Computer Science, comparable to those of the most important similar centres in North America and Europe. By doing so, the Committee hopes to foster research and development in these areas within the South Pacific region, and to create links between researchers in that region and their counterparts in the rest of the world.
  6. Research Matters The research aims of the Centre are in the following broad areas:
  7. Artificial Intelligence: theoretical aspects of artificial intelligence; formal concepts of artificial intelligence; efficient algorithms for solving complex AI problems like scheduling, planning, constraint satisfaction, etc.
  8. Combinatorial Optimization: computational techniques for the efficient construction and analysis of many optimal types of combinatorial configurations (including graphs, codes and designs), using deterministic methods exploiting symmetries and algebraic properties, and, when deterministic methods become infeasible, probabilistic methods such as simulated annealing, hill-climbing, and genetic programming.
  9. Computability and Complexity: computability and non-computability in pure mathematics (in particular, functional analysis and operator theory), theoretical physics (specifically, quantum mechanics), theoretical economics, and other areas; complexity of computation in those fields. Algorithmic information theory.
  10. Constructive Algorithmics: methods for calculating programs from their specifications, and the design of notations for such calculation; also, the investigation of software support for the calculational process.
  11. Research Grants
  12. M. Apperley, J. Grundy, S. Reeves and J. Venable, FoRST Grant $ 360,000 (over 3 years),
  13. S. Reeves, UWRC Grant, $ 10,500 (over 2 years),
  14. C.S. Calude, AURC Grant, $ 5,000
  15. M.D.E. Conder, AURC Grant, $ 1,000
  16. M.D.E. Conder, Marsden Fund Award, $ 84,000 (over 3 years)
  17. M.D.E. Conder, Claude McCarthy Fellowship, $ 5,000
  18. H. Guesgen, AURC Grant, $1,008
  19. I. Witten et al. NZ Lottery Grants Board, $ 20,000
  20. I. Witten et al., FoRST Grant, $192,000 (over 5 years)
  21. R. Nicolescu & M.R. Titchener, AURC Grant, $ 13,000
  22. M.R. Titchener, AURC Grant, $ 2,500
  23. M.R. Titchener & Ulrich Guenther, AURC Grad Fund, $ 2,700
  24. Educational Activities

    The Centre has supported the following undergraduate and graduate courses:

  25. 0654.418/518 Foundations of Mathematics (taught by A.G. French and D.S. Bridges)
  26. 26.225 Discrete Mathematics (taught by Paul Bonnington and John Pearson)
  27. 26.315 Logic (taught by Maths and Philosophy Departments)
  28. 26.325 Combinatorial Structures (taught by Margaret Morton)
  29. 07.350 Mathematical Foundations of Computer Science (taught by Cristian Calude and Fred Kroon),
  30. 26.416 Algebraic Combinatorics (taught by Marston Conder)
  31. 07.755 Algorithmic Information Theory (taught by Cristian Calude)
  32. 07.320 Algorithmics (taught by Peter Gibbons and Cristian Calude)
  33. 07.750 Program Derivation (taught by Jeremy Gibbons)
  34. 07.720 Advanced Design and Analysis of Algorithms (taught by Peter Gibbons)
  35. 07.457 Data Structures (taught by Ioan Tomescu, Bucharest University, CDMTCS visitor),
  36. 07.458 Computation Theoretic Aspects of Cellular Automata (taught by Sheng Yu, University of Western Ontario, CDMTCS visitor),
  37. 07.765 Advanced Artificial Intelligence (taught by Hans Guesgen)
  38. 0654.317 Discrete Mathematics & Theoretical Computer Science (taught by D.S Bridges, A.G. French, K.A. Broughan and I. Melchert)
  39. 0654.240 Mathematical Foundations of Computer Science (taught by G. French and I. Melchert)
  40. 0657.416A Topics in Artificial Intelligence (taught by I. Witten)
  41. 415.742 Data Communications (taught by Peter Fenwick and M.R. Titchener)
  42. The following graduate students are working in close connection with the research program of the Centre:

  43. Asat Arslanov (PhD student, ``Theoretical Computer Science"),
  44. Elena Calude (PhD student, ``Theoretical Aspects of Artificial Intelligence"),
  45. Peter Dobcsanyi (PhD student, ``Combinatorial Computation using Distributed Processing"),
  46. Matt Humphrey (PhD student, ``Human-computer Interaction Using Relational Algebra"),
  47. Stuart Inglis (PhD student, ``Textual Image Processing"),
  48. James Webb: (PhD student, ``Computational Techniques for Solving Chessboard Problems"),
  49. S. Irvine (PhD student),
  50. John Pearson (PhD student, ``Studies in Combinatorics and Group Theory"),
  51. Cameron Walker (PhD student, ``Compact Presentations for the Symmetric Groups"),
  52. Michael Wang (PhD student, ``Constructive Aspects of the Dirichlet Problem"),
  53. Craig Nevill-Manning (PhD student, ``Programming by Example"),
  54. Tony Smith (PhD student, ``Probability-based Grammar Induction"),
  55. Ulrich Guenther (PhD student, ``Robust Image Compression Coding''), Wang Yuchuan (PhD student, ``Constructive aspects of the Dirichlet Problem"),
  56. Robyn Curtis (Masters student, ``The Cycle Double Cover Problem")
  57. Samantha Stephenson (Masters student, ``Sharply Transitive Sets and Finite Projective Planes"),
  58. Brent Martin (Masters student, ``Instance-based Learning: Nearest Neighbour with Generalisation"),
  59. James Littin (Masters student, ``Learning Rules with Inter-attribute Dependencies").
  60. Visitors Prof. Helmut Jürgensen (University Western Ontario, Canada), Prof. Ioan Tomescu (Bucharest University, Romania), A/Prof. Sheng Yu (University Western Ontario, Canada), Prof. Tudor Zamfirescu (Dortmund University, Germany), Dr Mike Newman (Australian National University), Dr Eamonn O'Brien (Australian National University), Prof Cheryl Praeger (Univerity of Western Australia).
  61. Financial Statement The Centre has been started only for half a year, so there has been no financial activity for 1995.
  62. Publications and Technical Reports