Centre for Discrete Mathematics and Theoretical Computer Science


Research Reports

CDMTCS title serial author date listingsearch
1995 [10]

001

J. Gibbons

An Initial-Algebra Approach to Directed Acyclic Graphs

04/1995

002

J. Gibbons

Computing Downwards Accumulations on Trees Quickly

03/1995

003

J. Gibbons

Deriving Tidy Drawings of Trees

06/1995

004

P.R. Hafner

Large Cayley Graphs and Digraphs with Small Degree and Diameter

06/1995

005

J. Gibbons

The Third Homomorphism Theorem

07/1995

006

J. Gibbons and K. Wansbrough

Tracing Lazy Functional Languages

08/1995

007

C. Calude and S. Yu

Language-Theoretic Complexity of Disjunctive Sequences

09/1995

008

G.J. Chaitin, A. Arslanov and C. Calude

Program-Size Complexity Computes the Halting Problem

09/1995

009

C. Calude and J. Hromkovic

Complexity: A Language-Theoretic Point of View

10/1995

010

L.S. Dediu

Higman's Embedding Theorem. An Elementary Proof

10/1995

1996 [15]
1997 [49]
1998 [18]
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 [6]