2003

• B.H.H. Juurlink, P. Kolman, F. Meyer auf der Heide, I. Rieping
  Optimal Broadcast on Parallel Locality Models
  Journal of Discrete Algorithms - selected papers of SIROCCO 2000, pp. 151-166, April 2003, Vol. 1, No. 2, Elsevier publishers
  PS-File.
  
  
• O. Bonorden, B. Juurlink, I. von Otte, I. Rieping
  The Paderborn University BSP (PUB) Library
  Parallel Computing, volume 29, no. 2 (February 2003), pages 187-207.
  HTML-Abstract, PS-File, PDF-File

2002

• O. Bonorden, F. Meyer auf der Heide, R. Wanka
  Composition of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example
  In Proc. of the Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA), 2002
  HTML-Abstract, PS-File, PDF-File
• O. Bonorden
  Ein System zur automatischen Konfiguration effizienter paralleler Algorithmen im BSP-Modell
  Februar 2002. Diplomarbeit, Universität Paderborn
  PS-File, PDF-File

2001

• O. Bonorden, J. von zur Gathen, J. Gerhard, Olaf Müller, M. Nöcker
  Factoring a binary Polynomial of Degree over one Million
  ACM SIGSAM Bulletin, 35(1):16-18, 2001
• B. Juurlink, I. Rieping
  Performance Relevant Issues for Parallel Computation Models
  Proc. of the Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA), volume 4, Seiten 1841-1847, 2001
  PS-File

2000

• B.H.H. Juurlink, P. Kolman, F. Meyer auf der Heide, I. Rieping
  Optimal Broadcast on Parallel Locality Models
  Proc. of 7th Colloquium on Structural Information and Communication Complexity (SIROCCO), L'Aquila, Italy, June 20 - June 22, 2000
  HTML-Abstract, PS-File.
  
  
• O. Bonorden, N. Hüppelshäuser, B. Juurlink, I. Rieping
  PUB-Library, Release 7.0, User Guide and Function Reference
  Technical Report tr-rsfb-00-070, Heinz Nixdorf Institute, Department of Computer Science, University of Paderborn, Germany.
  PS-File.
  
  
• O. Bonorden, N. Hüppelshäuser, B. Juurlink, I. Rieping
  The Paderborn University BSP (PUB) Library on the Cray T3E
  Project report, June 2000.
  PS-File.
  
  

1999

• O. Bonorden, B. Juurlink, I. von Otte, I. Rieping
  The Paderborn University BSP (PUB) Library - Design, Implementation and Performance
  Proc. of 13th International Parallel Processing Symposium & 10th Symposium on Parallel and Distributed Processing (IPPS/SPDP), San Juan, Puerto Rico, April 12 - April 16, 1999
  HTML-Abstract, PS-File.

1998

• O. Bonorden, B. Juurlink, I. von Otte, I. Rieping
  The Paderborn University BSP (PUB) Library - Design, Implementation and Performance
  Heinz Nixdorf Institute, Departement of Computer Science, University of Paderborn, Germany.
  HTML-Abstract, Technical Report tr-rsfb-98-063 Postscript-File.
• M. Adler, W. Dittrich, B. Juurlink, M. Kutylowski, I. Rieping
  Communication-Optimal Parallel Minimum Spanning Tree Algorithms
  Tenth Annual ACM Symposium on PARALLEL ALGORITHMS AND ARCHITECTURES (SPAA 98), Puerto Vallarta, Mexico, June 28 - July 2, 1998.
  HTML-Abstract, SPAA Postscript-File, Technical Report tr-rsfb-98-059 Postscript-File.
• F. Meyer auf der Heide and G. Teran Martinez.
  Communication-efficient parallel multiway and approximate minimum cut computation
  in Proceedings of the Third Latin American Symposium on Theoretical Informatics LATIN '98,
  Lecture Notes in Computer Science, 1998, volume 1380, pp. 316--330
  Postscript-File

1997

• E. Caceres, F. Dehne, A. Ferreira, P. Flocchini, I. Rieping, A. Roncato, N.Santoro, and S. W. Song.
  Efficient parallel graph algorithms for coarse grained multicomputers and BSP
  to appear in Proc. ICALP'97, Bologna, Italy, 1997.
  HTML-Abstract, ICALP Postscript-File.
  

1996

• A. Bäumker, W. Dittrich, F. Meyer auf der Heide.
  Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model Technical Report tr-rsfb-96-008, Paderborn University, January 1996
  abstract, compressed postscript
• A. Bäumker, W. Dittrich, F. Meyer auf der Heide, and I. Rieping:
  Realistic Parallel Algorithms: Priority Queue Operations and Selection for the BSP* Model
  in Euro-Par'96, LIP, École Normale Supérieure de Lyon, Lyon, France, August 27-29, 1996.
  HTML-Abstract, Euro-Par Postscript-File, Technical Report Postscript-File.
  
• Armin Bäumker, Wolfgang Dittrich, Friedhelm Meyer auf der Heide, Ingo Rieping.
  Priority queue operations and selection for the BSP model
  Technical Report tr-rsfb-96-027, Paderborn University, October 1996.
  abstract, compressed postscript
• A. Bäumker and W. Dittrich.
  Parallel Algorithm for Image Processing: Practical Algorithms with Experiments.
  Proc. of the 10th IPPS, 1996, pp. 429-433.
  Postscript .
• A. Bäumker, W. Dittrich, A. Pietracaprina.
  The deterministic complexity of parallel multisearch.
  Proc. 5th SWAT, 1996.
  Postscript .
• A. Bäumker and W. Dittrich.
  Fully dynamic search trees for an extension of the BSP model.
  Proc. of the 8th SPAA, 1996, pp. 233-242.
  Postscript .

1995

• A. Bäumker, W. Dittrich, F. Meyer auf der Heide.
  Truly Efficient Parallel Algorithms: c-Optimal Multisearch for an Extension of the BSP model.
  Proc. of European Symposium on Algorithms, 1995, pp. 17-30.
  Postscript .