![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Joost VandeVondele
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [i6]Enrique G. Paredes, Linus Groner, Stefano Ubbiali, Hannes Vogt, Alberto Madonna, Kean Mariotti, Felipe A. Cruz, Lucas Benedicic, Mauro Bianco, Joost VandeVondele, Thomas C. Schulthess:
GT4Py: High Performance Stencils for Weather and Climate Applications using Python. CoRR abs/2311.08322 (2023) - 2021
- [j6]Patrick Zulian
, Alena Kopanicáková
, Maria Giuseppina Chiara Nestola, Andreas Fink, Nur Aiman Fadel, Joost VandeVondele, Rolf Krause
:
Large scale simulation of pressure induced phase-field fracture propagation using Utopia. CCF Trans. High Perform. Comput. 3(4): 407-426 (2021) - [j5]Anton Afanasyev, Mauro Bianco, Lukas Mosimann, Carlos Osuna, Felix Thaler
, Hannes Vogt, Oliver Fuhrer
, Joost VandeVondele
, Thomas C. Schulthess
:
GridTools: A framework for portable weather and climate applications. SoftwareX 15: 100707 (2021) - [c6]Grzegorz Kwasniewski, Marko Kabic, Tal Ben-Nun, Alexandros Nikolaos Ziogas
, Jens Eirik Saethre, André Gaillard, Timo Schneider, Maciej Besta, Anton Kozhevnikov, Joost VandeVondele, Torsten Hoefler:
On the parallel I/O optimality of linear algebra kernels: near-optimal matrix factorizations. SC 2021: 70 - [c5]Marko Kabic, Simon Pintarelli, Anton Kozhevnikov
, Joost VandeVondele:
COSTA: Communication-Optimal Shuffle and Transpose Algorithm with Process Relabeling. ISC 2021: 217-236 - [i5]Marko Kabic, Simon Pintarelli, Anton Kozhevnikov, Joost VandeVondele:
COSTA: Communication-Optimal Shuffle and Transpose Algorithm with Process Relabeling. CoRR abs/2106.06601 (2021) - [i4]Grzegorz Kwasniewski, Marko Kabic, Tal Ben-Nun, Alexandros Nikolaos Ziogas, Jens Eirik Saethre, André Gaillard, Timo Schneider, Maciej Besta, Anton Kozhevnikov, Joost VandeVondele, Torsten Hoefler:
On the Parallel I/O Optimality of Linear Algebra Kernels: Near-Optimal Matrix Factorizations. CoRR abs/2108.09337 (2021) - 2020
- [i3]Patrick Zulian, Alena Kopanicáková, Maria Giuseppina Chiara Nestola, Andreas Fink, Nur Aiman Fadel, Joost VandeVondele, Rolf Krause:
Large scale simulation of pressure induced phase-field fracture propagation using Utopia. CoRR abs/2007.12908 (2020)
2010 – 2019
- 2019
- [c4]Grzegorz Kwasniewski, Marko Kabic, Maciej Besta, Joost VandeVondele, Raffaele Solcà
, Torsten Hoefler:
Red-blue pebbling revisited: near optimal parallel matrix-matrix multiplication. SC 2019: 24:1-24:22 - [i2]Grzegorz Kwasniewski, Marko Kabic, Maciej Besta, Joost VandeVondele, Raffaele Solcà, Torsten Hoefler:
Red-blue pebbling revisited: near optimal parallel matrix-matrix multiplication. CoRR abs/1908.09606 (2019) - 2017
- [c3]Alfio Lazzaro, Joost VandeVondele, Jürg Hutter, Ole Schütt
:
Increasing the Efficiency of Sparse Matrix-Matrix Multiplication with a 2.5D Algorithm and One-Sided MPI. PASC 2017: 3:1-3:9 - [i1]Alfio Lazzaro, Joost VandeVondele, Jürg Hutter, Ole Schütt:
Increasing the Efficiency of Sparse Matrix-Matrix Multiplication with a 2.5D Algorithm and One-Sided MPI. CoRR abs/1705.10218 (2017) - 2015
- [j4]Mauro Del Ben, Ole Schütt
, Tim Wentz, Peter Messmer, Jürg Hutter, Joost VandeVondele
:
Enabling simulation at the fifth rung of DFT: Large scale RPA calculations with excellent time to solution. Comput. Phys. Commun. 187: 120-129 (2015) - [c2]Mauro Calderara, Sascha Brück, Andreas Pedersen
, Mohammad H. Bani-Hashemian
, Joost VandeVondele, Mathieu Luisier:
Pushing back the limit of ab-initio quantum transport simulations on hybrid supercomputers. SC 2015: 3:1-3:12 - 2014
- [j3]Urban Borstnik, Joost VandeVondele
, Valéry Weber, Jürg Hutter:
Sparse matrix multiplication: The distributed block-compressed sparse row library. Parallel Comput. 40(5-6): 47-58 (2014) - 2013
- [c1]Christiane Pousa Ribeiro, Jürg Hutter, Joost VandeVondele:
Improving Communication Performance of Sparse Linear Algebra for an Atomistic Simulation Application. PARCO 2013: 405-414
2000 – 2009
- 2005
- [j2]Joost VandeVondele
, Matthias Krack
, Fawzi Mohamed, Michele Parrinello, Thomas Chassaing, Jürg Hutter:
Quickstep: Fast and accurate density functional calculations using a mixed Gaussian and plane waves approach. Comput. Phys. Commun. 167(2): 103-128 (2005) - [j1]Matthew J. McGrath
, J. Ilja Siepmann, I-Feng W. Kuo
, Christopher J. Mundy
, Joost VandeVondele
, Michiel Sprik, Jürg Hutter, Fawzi Mohamed, Matthias Krack
, Michele Parrinello:
Toward a Monte Carlo program for simulating vapor-liquid phase equilibria from first principles. Comput. Phys. Commun. 169(1-3): 289-294 (2005)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-05-08 21:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint