Centre for Discrete Mathematics and Theoretical Computer Science


Research Reports


1995 [10]
1996 [15]
1997 [49]
1998 [17]
1999 [26]
2000 [30]
2001 [23]
2002 [35]
171J.J. Arulanandham, C.S. Calude and M.J. Dinneen

Bead--Sort: A Natural Sorting Algorithm

01/2002
172H. Ishihara, B. Khoussainov and S. Rubin

On Isomorphism Invariants of Some Automatic Structures

01/2002
173R.G. Downey

Some Computability-Theoretical Aspects of Reals and Randomness

01/2002
174B. Khoussainov

Games Played on Finite Graphs and Temporal Logic

01/2002
175L. Staiger

How Large is the Set of Disjunctive Sequences?

01/2002
176S.S. Goncharov and B. Khoussainov

On Complexity of Computatable $aleph_1$--Categorical Models

01/2002
177I. Tomescu

On the Number of Occurrences of All Short Factors in Almost All Words

02/2002
178H. Ishihara and B. Khoussainov

Complexity of Some Infinite Games Played on Finite Graphs

02/2002
179K. Svozil

Logical Equivalence Between Generalized Urn Models and Finite Automata

02/2002
180C.S. Calude, E. Calude and S. Marcus

Passages of Proof

02/2002
181B. Khoussainov and T. Kowalski

Computable Isomorphism of Boolean Algebras with Operators

03/2002
182G.J. Chaitin

Meta-Mathematics and the Foundations of Mathematics

05/2002
183K. Svozil

What Could be More Practical than a Good Interpretation?

05/2002
184K. Svozil

n-ary Quantum Information Defined by State Partitions

05/2002
185B. Khoussainov and S. Rubin

Some Thoughts On Automatic Structures

05/2002
186J.J. Arulanandham

Implementing Bead--Sort with P systems

05/2002
187V. Becher and G.J. Chaitin

Another Example of Higher Order Randomness

05/2002
188G.J. Chaitin

Paradoxes of Randomness

05/2002
189B. Khoussainov

Finite State Strategies in One Player McNaughton Games

05/2002
190S.S. Goncharov and B. Khoussainov

Complexity of Computable Models

05/2002
191L. Staiger and H. Yamasaki

A Simple Example of an omega-language Topologically Inequivalent to a Regular One

07/2002
192L. Staiger

The Entropy of Lukasiewicz Languages

08/2002
193N. Zhou

The Broadcasting Problem For Bounded-Degree Directed Networks

09/2002
194M. Ohya and I.V. Volovich

A New Quantum Algorithm for NP-complete Problems

09/2002
195C.S. Calude, M.J. Dinneen and F. Peper (editors)

Supplemental Papers for the 3nd Unconventional Models of Computation Conference

10/2002
196L. Staiger

Weighted Finite Automata and Metrics in Cantor Space

10/2002
197C.S. Calude, S. Marcus and L. Staiger

A Topological Characterization of Random Sequences

10/2002
198V.A. Adamyan, C.S. Calude and B. Pavlov

A Quantum Scattering Approach to Undecidable Problems: Preliminary Version

10/2002
199J.J. Arulanandham, C.S. Calude and M.J. Dinneen

Solving SAT with Bilateral Computing

12/2002
200G. Kapoulas

Infinitesimals Via the Cofinite Filter

12/2002
201A. Nies

Lowness Properties of Reals and Randomness

12/2002
202A. Nies

Reals which Compute Little

12/2002
203J. Yang and U. Guenther

An Improved T-Decomposition Algorithm

12/2002
204U. Guenther

An Entropy Measure for Finite Strings based on the Shannon Entropy of a Code Set

12/2002
205J. Walsh and M.J. Dinneen

Checking for Substructures in Graphs of Bounded Pathwidth and Treewidth

12/2002
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 [10]


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