Centre for Discrete Mathematics and Theoretical Computer Science


Research Reports

CDMTCS title serial author date listingsearch
1995 [10]
1996 [15]
1997 [49]
1998 [18]

075

P.H. Hertling (editor)

Unconventional Models of Computation'98: Posters

01/1998

076

C. Martin-Vide, G. Paun, G. Rosenberg and A. Salomaa

X-Families: An Approach to the Study of Families of Syntactically Similar Languages

01/1998

077

P.H. Hertling

A Lower Bound for Range Enclosure in Interval Arithmetic

01/1998

078

R. Laue

Halvings on Small Point Sets

01/1998

079

P.H. Hertling and K. Weihrauch

Randomness Spaces

01/1998

080

M.J. Dinneen, G. Pritchard and M.C. Wilson

Degree- and Time- Constrained Broadcast Networks

04/1998

081

A. Arslanov

On Hypersimple Sets and Chaitin Complexity

04/1998

082

C.S. Calude

News from New Zealand

05/1998

082

M.J. Dinneen

Group-Theoretic Methods for Designing Networks

05/1998

083

C.S. Calude, E. Calude and C. Stefanescu

Computational Complementarity for Mealy Automata

05/1998

084

C.S. Calude and M.J. Dinneen

Breaking the Turing Barrier

05/1998

085

P.C. Denny

Search and Enumeration Techniques for Incidence Structures

05/1998

086

C.S. Calude, W. Merkle and Y. Wang

A Note on Pseudorandom Generators

05/1998

087

H. Ishihara, B. Khoussainov and A. Nerode

Computable Kripke Models and Intermediate Logics

07/1998

088

L. Staiger

The Hausdorff Measure of Regular Omega-Languages is Computable

08/1998

089

F.W. Meyerstein

Is Movement An Illusion? Zeno's Paradox From a Modern Viewpoint

09/1998

090

C.S. Calude, R.J. Coles, P.H. Hertling and B. Khoussainov

Degree-Theoretic Aspects of Computably Enumerable Reals

09/1998

091

M.J. Dinneen (editor)

Abstracts of the 2nd Japan - New Zealand Workshop on Logic in Computer Science

10/1998

1999 [26]
2000 [30]
2001 [23]
2002 [35]
2003 [22]
2004 [31]
2005 [17]
2006 [18]
2007 [23]
2008 [27]
2009 [31]
2010 [22]
2011 [20]
2012 [15]
2013 [10]