Centre for Discrete Mathematics and Theoretical Computer Science


Research Reports


1995 [10]
002J. Gibbons

Computing Downwards Accumulations on Trees Quickly

03/1995
001J. Gibbons

An Initial-Algebra Approach to Directed Acyclic Graphs

04/1995
003J. Gibbons

Deriving Tidy Drawings of Trees

06/1995
004P.R. Hafner

Large Cayley Graphs and Digraphs with Small Degree and Diameter

06/1995
005J. Gibbons

The Third Homomorphism Theorem

07/1995
006J. Gibbons and K. Wansbrough

Tracing Lazy Functional Languages

08/1995
007C.S. Calude and S. Yu

Language-Theoretic Complexity of Disjunctive Sequences

09/1995
008G.J. Chaitin, A. Arslanov and C.S. Calude

Program-Size Complexity Computes the Halting Problem

09/1995
009C.S. Calude and J. Hromkovic

Complexity: A Language-Theoretic Point of View

10/1995
010L.S. Dediu

Higman's Embedding Theorem. An Elementary Proof

10/1995
1996 [15]
1997 [49]
1998 [17]
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 [21]
2014 [24]
2015 [17]
2016 [10]
2017 [8]


Please give us your feedback or ask us a question

This message is...


My feedback or question is...


My email address is...

(Only if you need a reply)

A to Z Directory | Site map | Accessibility | Copyright | Privacy | Disclaimer | Feedback on this page