Search the dblp DataBase
Lourens M. Pretorius: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Noam D. Elkies, Lourens M. Pretorius, Conrad Johann Swanepoel
Sylvester-Gallai Theorems for Complex Numbers and Quaternions. [Citation Graph (0, 0)][DBLP]
Discrete & Computational Geometry, 2006, v:35, n:3, pp:361-373 [Journal] - 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] - 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] - 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] - Conrad Johann Swanepoel, Lourens M. Pretorius
Factor-complement partitions of ascending k-parameter words. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1997, v:167, n:, pp:583-592 [Journal]
Blocking sets in small finite linear spaces. [Citation Graph (, )][DBLP]
The Sylvester-Gallai theorem, colourings and algebra. [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.001secs
| 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 |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002