default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRob H. Bisseling
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j20]Thomas Koopman
, Rob H. Bisseling:
Minimizing Communication in the Multidimensional FFT. SIAM J. Sci. Comput. 45(3): 330-347 (2023)- [i6]Deepak Ajwani, Rob H. Bisseling, Katrin Casel, Ümit V. Çatalyürek, Cédric Chevalier, Florian Chudigiewitsch, Marcelo Fonseca Faraj, Michael R. Fellows, Lars Gottesbüren, Tobias Heuer, George Karypis, Kamer Kaya, Jakub Lacki, Johannes Langguth, Xiaoye Sherry Li, Ruben Mayer, Johannes Meintrup, Yosuke Mizutani, François Pellegrini, Fabrizio Petrini, Frances A. Rosamond, Ilya Safro, Sebastian Schlag, Christian Schulz, Roohani Sharma, Darren Strash, Blair D. Sullivan, Bora Uçar, Albert-Jan Yzelman:
Open Problems in (Hyper)Graph Decomposition. CoRR abs/2310.11812 (2023) - [i5]George Karypis, Christian Schulz, Darren Strash, Deepak Ajwani, Rob H. Bisseling, Katrin Casel, Ümit V. Çatalyürek, Cédric Chevalier, Florian Chudigiewitsch, Marcelo Fonseca Faraj, Michael R. Fellows, Lars Gottesbüren, Tobias Heuer, Kamer Kaya, Jakub Lacki, Johannes Langguth, Xiaoye Sherry Li, Ruben Mayer, Johannes Meintrup, Yosuke Mizutani, François Pellegrini, Fabrizio Petrini, Frances A. Rosamond, Ilya Safro, Sebastian Schlag, Roohani Sharma, Blair D. Sullivan, Bora Uçar, Albert-Jan Yzelman:
Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331). Dagstuhl Reports 13(8): 1-45 (2023) - 2022
- [c19]Engelina L. Jenneskens, Rob H. Bisseling:
Exact k-way sparse matrix partitioning. IPDPS Workshops 2022: 754-763 - [i4]Thomas Koopman, Rob H. Bisseling:
Minimizing communication in the multidimensional FFT. CoRR abs/2203.11795 (2022) - 2020
- [j19]Timon E. Knigge, Rob H. Bisseling:
An improved exact algorithm and an NP-completeness proof for sparse matrix bipartitioning. Parallel Comput. 96: 102640 (2020) - [c18]Filip Pawlowski, Rob H. Bisseling, Bora Uçar, A. N. Yzelman:
Combinatorial Tiling for Sparse Neural Networks. HPEC 2020: 1-7 - [c17]Jan-Willem Buurlage, Rob H. Bisseling, Willem Jan Palenstijn, Kees Joost Batenburg:
A projection-based data partitioning method for distributed tomographic reconstruction. PP 2020: 58-68
2010 – 2019
- 2019
- [j18]Jan-Willem Buurlage, Rob H. Bisseling, Kees Joost Batenburg:
A geometric partitioning method for distributed tomographic reconstruction. Parallel Comput. 81: 104-121 (2019) - 2018
- [c16]Jan-Willem Buurlage, Tom Bannink, Rob H. Bisseling:
Bulk: A Modern C++ Interface for Bulk-Synchronous Parallel Programs. Euro-Par 2018: 519-532 - [i3]Timon E. Knigge, Rob H. Bisseling:
An improved exact algorithm and an NP-completeness proof for sparse matrix bipartitioning. CoRR abs/1811.02043 (2018) - 2015
- [j17]Daniël Maria Pelt, Rob H. Bisseling:
An exact algorithm for sparse matrix bipartitioning. J. Parallel Distributed Comput. 85: 79-90 (2015) - 2014
- [j16]A. N. Yzelman, Rob H. Bisseling, Dirk Roose, Karl Meerbergen:
MulticoreBSP for C: A High-Performance Library for Shared-Memory Parallel Programming. Int. J. Parallel Program. 42(4): 619-642 (2014) - [j15]B. O. Fagginger Auer, Rob H. Bisseling:
Efficient Matching for Column Intersection Graphs. ACM J. Exp. Algorithmics 19(1) (2014) - [c15]Daniël Maria Pelt, Rob H. Bisseling:
A Medium-Grain Method for Fast 2D Bipartitioning of Sparse Matrices. IPDPS 2014: 529-539 - 2013
- [j14]Raoul D. Schram, Gerard T. Barkema, Rob H. Bisseling:
SAWdoubler: A program for counting self-avoiding walks. Comput. Phys. Commun. 184(3): 891-898 (2013) - [j13]Oliver Fortmeier, H. Martin Bücker, B. O. Fagginger Auer, Rob H. Bisseling:
A new metric enabling an exact hypergraph model for the communication volume in distributed-memory parallel applications. Parallel Comput. 39(8): 319-335 (2013) - 2012
- [j12]A. N. Yzelman, Rob H. Bisseling:
An object-oriented bulk synchronous parallel library for multicore programming. Concurr. Comput. Pract. Exp. 24(5): 533-553 (2012) - [c14]Bas Fagginger Auer, Rob H. Bisseling:
Abusing a hypergraph partitioner for unweighted graph partitioning. Graph Partitioning and Graph Clustering 2012: 19-36 - [c13]Bas Fagginger Auer, Rob H. Bisseling:
Graph coarsening and clustering on the GPU. Graph Partitioning and Graph Clustering 2012: 223- - 2011
- [j11]A. N. Yzelman, Rob H. Bisseling:
Two-dimensional cache-oblivious sparse matrix-vector multiplication. Parallel Comput. 37(12): 806-819 (2011) - [c12]Bas Fagginger Auer, Rob H. Bisseling:
A GPU Algorithm for Greedy Graph Matching. Facing the Multicore-Challenge 2011: 108-119 - [i2]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
2000 – 2009
- 2009
- [j10]A. N. Yzelman, Rob H. Bisseling:
Cache-Oblivious Sparse Matrix--Vector Multiplication by Using Sparse Matrix Partitioning Methods. SIAM J. Sci. Comput. 31(4): 3128-3154 (2009) - [c10]Andrea Pietracaprina, Rob H. Bisseling, Emmanuelle Lebhar, Alexander Tiskin:
Introduction. Euro-Par 2009: 989 - [i1]Rob H. Bisseling, Tristan van Leeuwen, Ümit V. Çatalyürek:
Combinatorial Problems in High-Performance Computing: Partitioning. Combinatorial Scientific Computing 2009 - 2007
- [c9]Fredrik Manne, Rob H. Bisseling:
A Parallel Approximation Algorithm for the Weighted Maximum Matching Problem. PPAM 2007: 708-717 - 2006
- [j9]Rob H. Bisseling, Ildikó Flesch:
Mondriaan sparse matrix partitioning for attacking cryptosystems by a parallel block Lanczos algorithm - a case study. Parallel Comput. 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
- [j8]Brendan Vastenhouw, Rob H. Bisseling:
A Two-Dimensional Data Distribution Method for Parallel Sparse Matrix-Vector Multiplication. SIAM Rev. 47(1): 67-95 (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
- [j7]Márcia A. Inda, Rob H. Bisseling:
A simple and efficient parallel FFT algorithm using the BSP model. Parallel Comput. 27(14): 1847-1878 (2001) - [j6]Márcia A. Inda, Rob H. Bisseling, David Keith Maslen:
On the Efficient Parallel Computation of Legendre Transforms. SIAM J. Sci. Comput. 23(1): 271-303 (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
1990 – 1999
- 1999
- [c5]Guy Horvitz, Rob H. Bisseling:
Designing a BSP Version of ScaLAPACK. PP 1999 - 1998
- [j5]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 Comput. 24(14): 1947-1980 (1998) - 1996
- [j4]Rob H. Bisseling:
Third Utrecht Computational Science Symposium. Future Gener. Comput. Syst. 12(4): 263-264 (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
- [j3]Rob H. Bisseling, T. M. Doup, L. D. J. C. Loyens:
A parallel interior point algorithm for linear programming on a network of transputers. Ann. Oper. Res. 43(2): 49-86 (1993) - [j2]A. Frank van der Stappen, Rob H. Bisseling, Johannes G. G. van de Vorst:
Parallel Sparse LU Decomposition on a Mesh Network of Transputers. SIAM J. Matrix Anal. Appl. 14(3): 853-879 (1993) - 1991
- [j1]Rob H. Bisseling, Johannes G. G. van de Vorst:
Parallel Triangular System Solving on a Mesh Network of Transputers. SIAM J. Sci. Comput. 12(4): 787-799 (1991)
1980 – 1989
- 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
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
