Centre for Discrete Mathematics and Theoretical Computer Science

Research Reports

CDMTCS

title

serial

author

date listing

1995 [10]

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]

417	R. Nicolescu and H. Wu	New Solutions for Disjoint Paths in P Systems	03/2012
418	J. Hertel	Inductive Complexity of Goodstein's Theorem	04/2012
419	L. Staiger	A Correspondence Principle for Exact Constructive Dimension	04/2012
420	M. McKubre-Jordens and R. Sainudiin (eds.)	Construmath South 2012	04/2012
421	A. Raichev	Leinartas's Partial Fraction Decomposition	06/2012
422	A.A. Abbott, C.S. Calude, J. Conder and K. Svozil	Kochen-Specker Theorem Revisited and Strong Incomputability of Quantum Randomness	07/2012
423	M.J. Dinneen and Y.-B. Kim	A New Universality Result on P Systems	07/2012
424	M.J. Dinneen and K. Wei	On the Analysis of a (1+1) Self-Adjusting Memetic Algorithm	08/2012
425	S. Hartmann and S. Link	The Implication Problem of Data Dependencies over SQL Table Definitions: Axiomatic, Algorithmic and Logical Characterizations	10/2012
426	M. Kirchberg, S. Hartmann and S. Link	Design by Example for SQL Table Definitions with Functional Dependencies	10/2012
427	F. Ferrarotti, S. Hartmann and S. Link	Efficiency Frontiers of XML Cardinality Constraints	10/2012
428	S. Link	Sound Approximate Reasoning about Saturated Conditional Probabilistic Independence under Controlled Uncertainty	10/2012
429	C.S. Calude, E. Calude and M.S. Queen	Inductive Complexity of the P Versus NP Problem	10/2012
430	M.J. Dinneen and R. Versteegen	Obstructions for the Graphs of Vertex Cover Seven	12/2012
431	H. ElGindy, R. Nicolescu and H. Wu	Fast Distributed DFS Solutions for Edge-disjoint Paths in Digraphs	03/2012

2013 [6]