Bead--sort: A natural sorting algorithm JJ Arulanandham, CS Calude, M Dinneen Department of Computer Science, The University of Auckland, New Zealand, 2002 | 34 | 2002 |
Implementing bead-sort with P systems JJ Arulanandham International Conference on Unconventional Methods of Computation, 115-125, 2002 | 29 | 2002 |
A fast natural algorithm for searching JJ Arulanandham, CS Calude, MJ Dinneen Theoretical Computer Science 320 (1), 3-13, 2004 | 7 | 2004 |
Solving SAT with bilateral computing JJ Arulanandham, CS Calude, M Dinneen Department of Computer Science, The University of Auckland, New Zealand, 2002 | 7 | 2002 |
Balance machines: Computing= balancing JJ Arulanandham, CS Calude, MJ Dinneen Aspects of Molecular Computing: Essays Dedicated to Tom Head, on the …, 2004 | 4 | 2004 |
Unconventional “Stateless” Turing–Like Machines JJ Arulanandham International Conference on Unconventional Computation, 55-61, 2007 | 2 | 2007 |
Natural algorithms JJ Arulanandham University of Auckland, 2005 | 2 | 2005 |
Balance machines: A new formalism for computing JJ Arulanandham, M Dinneen Department of Computer Science, The University of Auckland, New Zealand, 2004 | 1 | 2004 |
CD TCS Research Report S eries JJ Arulanandham, CS Calude, MJ Dinneen | | 2003 |
A Fast Natural Algorithm for Searching: Preliminary version JJ Arulanandham, CS Calude, MJ Dinneen | | |