The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Willem L. Fouché: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Willem L. Fouché, Petrus H. Potgieter
    Kolmogorov complexity and symmetric relational structures [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  2. Willem L. Fouché, Lourens M. Pretorius, Conrad Johann Swanepoel
    Partitions of factorisations of parameter words. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:231, n:1-3, pp:169-175 [Journal]
  3. Willem L. Fouché, Lourens M. Pretorius, Conrad Johann Swanepoel
    Ramsey degrees of bipartite graphs: A primitive recursive proof. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:293, n:1-3, pp:111-119 [Journal]
  4. Willem L. Fouché
    Symmetry and the Ramsey Degrees of Finite Relational Structures. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1999, v:85, n:2, pp:135-147 [Journal]
  5. Willem L. Fouché
    Arithmetical Representations of Brownian Motion I. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2000, v:65, n:1, pp:421-442 [Journal]
  6. Willem L. Fouché, Petrus H. Potgieter
    Kolmogorov Complexity and Symmetric Relational Structures. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1998, v:63, n:3, pp:1083-1094 [Journal]
  7. Willem L. Fouché, Lourens M. Pretorius, Conrad Johann Swanepoel
    Partition theorems for factorisations of ascending parameter words. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:331-350 [Journal]
  8. Willem L. Fouché
    Symmetries and Ramsey properties of trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:325-330 [Journal]
  9. Willem L. Fouché
    Symmetry and the Ramsey degree of posets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:167, n:, pp:309-315 [Journal]

  10. Fractals Generated by Algorithmically Random Brownian Motion. [Citation Graph (, )][DBLP]


  11. Subrecursive Complexity of Identifying the Ramsey Structure of Posets. [Citation Graph (, )][DBLP]


  12. An Algorithmic Construction of Quantum Circuits of High Descriptive Complexity. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002