default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKlaus Reuter
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c3]Andreas Marek, Markus Rampp, Klaus Reuter
, Erwin Laure:
Beyond the Fourth Paradigm - the Rise of AI. e-Science 2023: 1-4- 2020
- [j11]Victor Artigues, Katharina Kormann, Markus Rampp, Klaus Reuter:
Evaluation of performance portability frameworks for the implementation of a particle-in-cell code. Concurr. Comput. Pract. Exp. 32(11) (2020)
2010 – 2019
- 2019
- [j10]Klaus Reuter, Jürgen Köfinger:
CADISHI: Fast parallel calculation of particle-pair distance histograms on CPUs and GPUs. Comput. Phys. Commun. 236: 274-284 (2019) - [j9]Katharina Kormann, Klaus Reuter, Markus Rampp:
A massively parallel semi-Lagrangian solver for the six-dimensional Vlasov-Poisson equation. Int. J. High Perform. Comput. Appl. 33(5) (2019) - [c2]Luka Stanisic, Klaus Reuter:
MPCDF HPC Performance Monitoring System: Enabling Insight via Job-Specific Analysis. Euro-Par Workshops 2019: 613-625 - [i3]Katharina Kormann, Klaus Reuter, Markus Rampp:
A massively parallel semi-Lagrangian solver for the six-dimensional Vlasov-Poisson equation. CoRR abs/1903.00308 (2019) - [i2]Luka Stanisic, Klaus Reuter:
MPCDF HPC Performance Monitoring System: Enabling Insight via Job-Specific Analysis. CoRR abs/1909.11704 (2019) - [i1]Victor Artigues, Katharina Kormann, Markus Rampp, Klaus Reuter:
Evaluation of performance portability frameworks for the implementation of a particle-in-cell code. CoRR abs/1911.08394 (2019)
2000 – 2009
- 2008
- [j8]Klaus Reuter, Frank Jenko, Cary B. Forest, R. Adam Bayliss:
A parallel implementation of an MHD code for the simulation of mechanically driven, turbulent dynamos in spherical geometry. Comput. Phys. Commun. 179(4): 245-249 (2008)
1990 – 1999
- 1999
- [j7]Utz Leimich, Klaus Reuter:
The fractional dimension of subsets of Boolean lattices and of cartesian products. Discret. Math. 201(1-3): 157-170 (1999) - [j6]Stefan Felsner, Klaus Reuter:
The Linear Extension Diameter of a Poset. SIAM J. Discret. Math. 12(3): 360-373 (1999) - 1997
- [j5]Jutta Mitas, Klaus Reuter:
CoverPpreserving Embeddings of Bipartite Orders Into Boolean Lattices. Theor. Comput. Sci. 175(2): 337-347 (1997) - 1991
- [j4]Klaus Reuter:
The jump number and the lattice of maximal antichains. Discret. Math. 88(2-3): 289-307 (1991) - 1990
- [j3]Klaus Reuter:
On the Order Dimension of Convex Polytopes. Eur. J. Comb. 11(1): 57-63 (1990) - [c1]Klaus Reuter, Ivan Rival:
Genus of Order and Lattices. WG 1990: 260-275
1980 – 1989
- 1987
- [j2]Klaus Reuter:
Matchings for linearly indecomposable modular lattices. Discret. Math. 63(2-3): 245-247 (1987) - [j1]Klaus Reuter:
Note on the Ahlswede-Daykin inequality. Discret. Math. 65(2): 209-212 (1987)
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:15 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:
