79 citations · 186 across the 10 of their papers we have counts for
11 papers
Category Theory for Supercomputing: The Tensor Product of Linear BSP Algorithms
Thomas Koopman, Rob H. Bisseling, Sven-Bodo Scholz
We show that a particular class of parallel algorithm for linear functions can be straightforwardly generalized to a parallel algorithm of their tensor product. The central idea is…
Open Problems in (Hyper)Graph Decomposition
Deepak Ajwani, Rob H. Bisseling, Katrin Casel +26
Large networks are useful in a wide range of applications. Sometimes problem instances are composed of billions of entities. Decomposing and analyzing these structures helps us gai…
Minimizing communication in the multidimensional FFT
Thomas Koopman, Rob H. Bisseling
We present a parallel algorithm for the fast Fourier transform (FFT) in higher dimensions. This algorithm generalizes the cyclic-to-cyclic one-dimensional parallel algorithm to a c…
An improved exact algorithm and an NP-completeness proof for sparse matrix bipartitioning
Timon E. Knigge, Rob H. Bisseling
We investigate sparse matrix bipartitioning -- a problem where we minimize the communication volume in parallel sparse matrix-vector multiplication. We prove, by reduction from gra…
Exact enumeration of self-avoiding walks on BCC and FCC lattices
Raoul D. Schram, Gerard T. Barkema, Rob H. Bisseling +1
Self-avoiding walks on the body-centered-cubic (BCC) and face-centered-cubic (FCC) lattices are enumerated up to lengths 28 and 24, respectively, using the length-doubling method.…
SAWdoubler: a program for counting self-avoiding walks
Raoul D. Schram, Gerard T. Barkema, Rob H. Bisseling
This article presents SAWdoubler, a package for counting the total number Z(N) of self-avoiding walks (SAWs) on a regular lattice by the length-doubling method, of which the basic…