About us

We study theoretical computer science, the branch of computer science that focuses on the abstract, mathematical nature of computation.

Our main interests lie in the general areas of automata theory, computational biology, computational complexity, computability and randomness, design and analysis of algorithms, unconventional models of computation. We are also interested in related areas, such as biology, combinatorics, logic, and theoretical physics.

Members also belong to the Centre for Discrete Mathematics and Theoretical Computer Science (CDMTCS), and we contribute to the CDMTCS report series. We have seminars throughout the year and visitors are welcome.


Staff - principal members

Cristian S. Calude (professor) works in algorithmic information theory (theory and applications to logic and computation) and unconventional computing (quantum computing and physics of computation). Cris's publications.
Michael J. Dinneen (senior lecturer) works in the field of combinatorial algorithms, graph theory and network design. Interests in distributive programming, computational complexity, programming trends, computational biology and computer-assisted mathematics. He is actively involved in both the NZ and ACM programming contests and has coached several teams at the world finals. Michael's publications.
Alexei Drummond (professor) is interested in evolutionary bioinformatics. His focus in on the use of Markov chain Monte Carlo to perform Bayesian inference of probablistic models of molecular evolution and coalescent-based models of population genetics. His methods have been applied to understanding the evolution of viruses, genomes and languages. Alexei's publications.
Bakhadyr Khoussainov (professor) is interested in logic and computability with an emphasis on automata theory and its applications, computable algebra and model theory, games on graphs and graph algorithms, Kolmogorov complexity, and algebraic specifications of abstract data types. Bakh's publications.
Sebastian Link (associate professor) is interestsed in XML constraints, complex-value databases, data dependencies and conceptual modelling. Sabastian's publications.
Simone Linz (lecturer) is interestsed in mathematical and computational biology; in particular algorithmic and combinatorial problems arising in phylogenetics (evolutionary biology). Simone's publications.
Andre Nies (professor) works in (1) Computability theory and (2) algebra and automatic structures. (1) In earlier papers he has investigated degree structures using model theoretic methods. In recent years he has studied the interplay of computability and randomness. (2) He applies logical methods especially to groups, and studies which structures can be described by automata. Andre's publications.
David Welch (senior lecturer) interests in Bayesian computational methods, including MCMC and ABC statistical models and inference for epidemiology, epidemics on networks, and inference for coalescent-based population genetics. David's publications.
Mark C. Wilson (senior lecturer) studies combinatorics, algorithms, discrete probability, and their interactions. Particular topics of recent interest are: theory and applications of generating functions; probabilistic analysis of algorithms; social choice theory. Mark's publications.

Associate members

G. J. Chaitin (honorary visiting professor) works in algorithmic information theory and digital philosophy. Greg's publications. LISP interpreter for The Limits of Mathematics, The Unknowable, Exploring Randomness.
Gill Dobbie (professor) studies databases, the web, and software engineering. Particular interests include the foundations of database systems, defining logical models for various kinds of database systems, and reasoning about the correctness of algorithms in that setting.
Radu Nicolescu (senior lecturer) Discrete mathematical models; Information coding and complexity; Service oriented computing; Integrating objects, XML and databases. Radu's publications.
Alexander Raichev (postdoctoral research fellow) works in combinatorics, studying the asymptotics of coefficients of multivariate generating functions. One application of this research is to the analysis of algorithms. He is also interested in mathematical logic, computability theory, and Kolmogorov complexity. Alex's publications.
Gerald Weber (senior lecturer) studies software architecture, software engineering, computer supported cooperative work (CSCW) web services and the semantic web and computational Geometry, theory of computation.

Postgraduate Students

News and Events


We are involved in a variety of courses at undergraduate level, mostly those with a strong ``theory" component. At graduate level, we offer several courses. More details to come.