| 2013 | ||
|---|---|---|
| j8 | Raoul D. Schram, Gerard T. Barkema, Rob H. Bisseling: SAWdoubler: A program for counting self-avoiding walks. Computer Physics Communications 184(3): 891-898 (2013) | |
| 2012 | ||
| j7 | 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) | |
| c13 | Bas Fagginger Auer, Rob H. Bisseling: Abusing a hypergraph partitioner for unweighted graph partitioning. Graph Partitioning and Graph Clustering 2012: 19-36 | |
| c12 | Bas Fagginger Auer, Rob H. Bisseling: Graph coarsening and clustering on the GPU. Graph Partitioning and Graph Clustering 2012: 223- | |
| 2011 | ||
| j6 | A. N. Yzelman, Rob H. Bisseling: Two-dimensional cache-oblivious sparse matrix-vector multiplication. Parallel Computing 37(12): 806-819 (2011) | |
| i1 | B. O. Fagginger Auer, Rob H. Bisseling: A Geometric Approach to Matrix Ordering. CoRR abs/1105.4490 (2011) | |
| 2010 | ||
| c11 | 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 | ||
| j5 | 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) | |
| c10 | Andrea Pietracaprina, Rob H. Bisseling, Emmanuelle Lebhar, Alexander Tiskin: Introduction. Euro-Par 2009: 989 | |
| 2007 | ||
| c9 | Fredrik Manne, Rob H. Bisseling: A Parallel Approximation Algorithm for the Weighted Maximum Matching Problem. PPAM 2007: 708-717 | |
| 2006 | ||
| j4 | 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) | |
| c8 | Karen D. Devine, Erik G. Boman, Robert T. Heaphy, Rob H. Bisseling, Ümit V. Çatalyürek: Parallel hypergraph partitioning for scientific computing. IPDPS 2006 | |
| 2005 | ||
| c7 | Rob H. Bisseling, Ildikó Flesch: Mondriaan Sparse Matrix Partitioning for Attacking Cryptosystems - A Case Study. PARCO 2005: 819-826 | |
| 2004 | ||
| b1 | Rob H. Bisseling: Parallel scientific computation - a structured approach using BSP and MPI. Oxford University Press 2004, isbn 978-0-19-852939-2, pp. I-XVIII, 1-305 | |
| 2001 | ||
| j3 | 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) | |
| c6 | Henk A. van der Vorst, Rob H. Bisseling, Iain S. Duff, Bernard J. Philippe: Topic 11: Numerical Algorithms. Euro-Par 2001: 566-567 | |
| 1999 | ||
| c5 | ||
| 1998 | ||
| j2 | Jonathan M. D. Hill, Bill McColl, Dan C. Stefanescu, Mark W. Goudreau, Kevin J. Lang, Satish Rao, Torsten Suel, Thanasis Tsantilas, Rob H. Bisseling: BSPlib: The BSP programming library. Parallel Computing 24(14): 1947-1980 (1998) | |
| 1996 | ||
| c4 | Rob H. Bisseling: Basic Techniques for Numerical Linear Algebra on Bulk Synchronous Parallel Computers. WNAA 1996: 46-57 | |
| 1994 | ||
| c3 | Rob H. Bisseling, William F. McColl: Scientific Computing on Bulk Synchronous Parallel Architectures. IFIP Congress (1) 1994: 509-514 | |
| 1993 | ||
| j1 | 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 | ||
| c2 | L. D. J. C. Loyens, Rob H. Bisseling: The Formal Construction of a Parallel Triangular System Solver. MPC 1989: 325-334 | |
| 1988 | ||
| c1 | Rob H. Bisseling, Johannes G. G. van de Vorst: Parallel LU Decomposition on a Transputer Network. Shell Conference 1988: 61-77 | |
Colors in the list of coauthors
Last update Sun May 26 04:43:01 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page