 | 2012 |
| 20 |  | A. N. Yzelman,
Rob H. Bisseling:
An object-oriented bulk synchronous parallel library for multicore programming.
Concurrency and Computation: Practice and Experience 24(5): 533-553 (2012) |
| 2011 |
| 19 |  | B. O. Fagginger Auer,
Rob H. Bisseling:
A Geometric Approach to Matrix Ordering
CoRR abs/1105.4490: (2011) |
| 18 |  | A. N. Yzelman,
Rob H. Bisseling:
Two-dimensional cache-oblivious sparse matrix-vector multiplication.
Parallel Computing 37(12): 806-819 (2011) |
| 2010 |
| 17 |  | Patrick Amestoy,
Daniela di Serafino,
Rob H. Bisseling,
Enrique S. Quintana-Ortí,
Marián Vajtersic:
Parallel Numerical Algorithms.
Euro-Par (2) 2010: 63-64 |
| 2009 |
| 16 |  | Andrea Pietracaprina,
Rob H. Bisseling,
Emmanuelle Lebhar,
Alexander Tiskin:
Introduction.
Euro-Par 2009: 989 |
| 15 |  | A. N. Yzelman,
Rob H. Bisseling:
Cache-Oblivious Sparse Matrix--Vector Multiplication by Using Sparse Matrix Partitioning Methods.
SIAM J. Scientific Computing 31(4): 3128-3154 (2009) |
| 2007 |
| 14 |  | Fredrik Manne,
Rob H. Bisseling:
A Parallel Approximation Algorithm for the Weighted Maximum Matching Problem.
PPAM 2007: 708-717 |
| 2006 |
| 13 |  | Karen D. Devine,
Erik G. Boman,
Robert T. Heaphy,
Rob H. Bisseling,
Ümit V. Çatalyürek:
Parallel hypergraph partitioning for scientific computing.
IPDPS 2006 |
| 12 |  | Rob H. Bisseling,
Ildikó Flesch:
Mondriaan sparse matrix partitioning for attacking cryptosystems by a parallel block Lanczos algorithm - a case study.
Parallel Computing 32(7-8): 551-567 (2006) |
| 2005 |
| 11 |  | Rob H. Bisseling,
Ildikó Flesch:
Mondriaan Sparse Matrix Partitioning for Attacking Cryptosystems - A Case Study.
PARCO 2005: 819-826 |
| 2004 |
| 10 |  | Rob H. Bisseling:
Parallel scientific computation - a structured approach using BSP and MPI.
Oxford University Press 2004: I-XVIII, 1-305 |
| 2001 |
| 9 |  | Henk A. van der Vorst,
Rob H. Bisseling,
Iain S. Duff,
Bernard J. Philippe:
Topic 11: Numerical Algorithms.
Euro-Par 2001: 566-567 |
| 8 |  | Márcia A. Inda,
Rob H. Bisseling:
A simple and efficient parallel FFT algorithm using the BSP model.
Parallel Computing 27(14): 1847-1878 (2001) |
| 1999 |
| 7 |  | Guy Horvitz,
Rob H. Bisseling:
Designing a BSP Version of ScaLAPACK.
PPSC 1999 |
| 1998 |
| 6 |  | Jonathan M. D. Hill,
Bill McColl,
Dan C. Stefanescu,
Mark W. Goudreau,
Kevin Lang,
Satish Rao,
Torsten Suel,
Thanasis Tsantilas,
Rob H. Bisseling:
BSPlib: The BSP programming library.
Parallel Computing 24(14): 1947-1980 (1998) |
| 1996 |
| 5 |  | Rob H. Bisseling:
Basic Techniques for Numerical Linear Algebra on Bulk Synchronous Parallel Computers.
WNAA 1996: 46-57 |
| 1994 |
| 4 |  | Rob H. Bisseling,
William F. McColl:
Scientific Computing on Bulk Synchronous Parallel Architectures.
IFIP Congress (1) 1994: 509-514 |
| 1993 |
| 3 |  | Rob H. Bisseling,
T. M. Doup,
L. D. J. C. Loyens:
A parallel interior point algorithm for linear programming on a network of transputers.
Annals OR 43(2): 49-86 (1993) |
| 1989 |
| 2 |  | L. D. J. C. Loyens,
Rob H. Bisseling:
The Formal Construction of a Parallel Triangular System Solver.
MPC 1989: 325-334 |
| 1988 |
| 1 |  | Rob H. Bisseling,
Johannes G. G. van de Vorst:
Parallel LU Decomposition on a Transputer Network.
Shell Conference 1988: 61-77 |