 | 2009 |
| 14 |  | Willem L. Fouché:
Fractals Generated by Algorithmically Random Brownian Motion.
CiE 2009: 208-217 |
| 2008 |
| 13 |  | Willem L. Fouché:
Subrecursive Complexity of Identifying the Ramsey Structure of Posets.
CiE 2008: 196-205 |
| 12 |  | Willem L. Fouché:
An Algorithmic Construction of Quantum Circuits of High Descriptive Complexity.
Electr. Notes Theor. Comput. Sci. 221: 61-69 (2008) |
| 11 |  | Willem L. Fouché:
Dynamics of a generic Brownian motion: Recursive aspects.
Theor. Comput. Sci. 394(3): 175-186 (2008) |
| 10 |  | Willem L. Fouché,
Johannes Heidema,
Glyn Jones,
Petrus H. Potgieter:
Universality and programmability of quantum computers.
Theor. Comput. Sci. 403(1): 121-129 (2008) |
| 2005 |
| 9 |  | Willem L. Fouché,
Lourens M. Pretorius,
Conrad Johann Swanepoel:
Ramsey degrees of bipartite graphs: A primitive recursive proof.
Discrete Mathematics 293(1-3): 111-119 (2005) |
| 2004 |
| 8 |  | Willem L. Fouché,
Petrus H. Potgieter:
Kolmogorov complexity and symmetric relational structures
CoRR cs.CC/0402034: (2004) |
| 2001 |
| 7 |  | Willem L. Fouché,
Lourens M. Pretorius,
Conrad Johann Swanepoel:
Partitions of factorisations of parameter words.
Discrete Mathematics 231(1-3): 169-175 (2001) |
| 2000 |
| 6 |  | Willem L. Fouché:
Arithmetical Representations of Brownian Motion I.
J. Symb. Log. 65(1): 421-442 (2000) |
| 1999 |
| 5 |  | Willem L. Fouché:
Symmetries and Ramsey properties of trees.
Discrete Mathematics 197-198: 325-330 (1999) |
| 4 |  | Willem L. Fouché,
Lourens M. Pretorius,
Conrad Johann Swanepoel:
Partition theorems for factorisations of ascending parameter words.
Discrete Mathematics 197-198: 331-350 (1999) |
| 3 |  | Willem L. Fouché:
Symmetry and the Ramsey Degrees of Finite Relational Structures.
J. Comb. Theory, Ser. A 85(2): 135-147 (1999) |
| 1998 |
| 2 |  | Willem L. Fouché,
Petrus H. Potgieter:
Kolmogorov Complexity and Symmetric Relational Structures.
J. Symb. Log. 63(3): 1083-1094 (1998) |
| 1997 |
| 1 |  | Willem L. Fouché:
Symmetry and the Ramsey degree of posets.
Discrete Mathematics 167-168: 309-315 (1997) |