Conrad Johann Swanepoel Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2006
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNoam D. Elkies, Lourens M. Pretorius, Conrad Johann Swanepoel: Sylvester-Gallai Theorems for Complex Numbers and Quaternions. Discrete & Computational Geometry 35(3): 361-373 (2006)
2005
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWillem 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)
2003
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLConrad Johann Swanepoel, W. O. Doku: New goodness-of-fit tests for the error distribution of autoregressive time-series models. Computational Statistics & Data Analysis 43(3): 333-340 (2003)
2001
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWillem L. Fouché, Lourens M. Pretorius, Conrad Johann Swanepoel: Partitions of factorisations of parameter words. Discrete Mathematics 231(1-3): 169-175 (2001)
1999
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWillem L. Fouché, Lourens M. Pretorius, Conrad Johann Swanepoel: Partition theorems for factorisations of ascending parameter words. Discrete Mathematics 197-198: 331-350 (1999)
1997
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLConrad Johann Swanepoel, Lourens M. Pretorius: Factor-complement partitions of ascending k-parameter words. Discrete Mathematics 167-168: 583-592 (1997)

Coauthor Index

1W. O. Doku [4]
2Noam D. Elkies [6]
3Willem L. Fouché [2] [3] [5]
4Lourens M. Pretorius [1] [2] [3] [5] [6]

Colors in the list of coauthors

Copyright © Sun Dec 20 20:26:47 2009 by Michael Ley (ley@uni-trier.de)