default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndreas Beckmann
Person information
- affiliation: Goethe University of Frankfurt, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j3]Bartosz Kohnke
, Carsten Kutzner, Andreas Beckmann, Gert Lube, Ivo Kabadshow, Holger Dachsel, Helmut Grubmüller:
A CUDA fast multipole method with highly efficient M2L far field evaluation. Int. J. High Perform. Comput. Appl. 35(1) (2021)- [j2]Andreas Beckmann, Uthayasankar Sivarajah, Zahir Irani:
Circular economy versus planetary limits: a Slovak forestry sector case study. J. Enterp. Inf. Manag. 34(6): 1673-1698 (2021) - 2020
- [c10]Laura Morgenstern, David Haensel, Andreas Beckmann, Ivo Kabadshow:
NUMA-Awareness as a Plug-In for an Eventify-Based Fast Multipole Method. ICCS (7) 2020: 428-441 - [c9]David Haensel, Laura Morgenstern, Andreas Beckmann, Ivo Kabadshow, Holger Dachsel:
Eventify: Event-Based Task Parallelism for Strong Scaling. PASC 2020: 14:1-14:10 - [p2]Bartosz Kohnke, Thomas R. Ullmann, Andreas Beckmann, Ivo Kabadshow, David Haensel, Laura Morgenstern, Plamen Dobrev, Gerrit Groenhof, Carsten Kutzner, Berk Hess, Holger Dachsel, Helmut Grubmüller:
GROMEX: A Scalable and Versatile Fast Multipole Method for Biomolecular Simulation. Software for Exascale Computing 2020: 517-543
2010 – 2019
- 2016
- [c8]Sebastian Pape, Julian Flake, Andreas Beckmann, Jan Jürjens:
STAGE: a software tool for automatic grading of testing exercises: case study paper. ICSE (Companion Volume) 2016: 491-500 - [p1]Alberto Garcia-Garcia, Andreas Beckmann, Ivo Kabadshow:
Accelerating an FMM-Based Coulomb Solver with GPUs. Software for Exascale Computing 2016: 485-504 - 2013
- [c7]Andreas Beckmann, Ulrich Meyer, David Veith:
An Implementation of I/O-Efficient Dynamic Breadth-First Search Using Level-Aligned Hierarchical Clustering. ESA 2013: 121-132 - 2012
- [c6]Deepak Ajwani, Andreas Beckmann, Ulrich Meyer, David Veith:
I/O-efficient approximation of graph diameters by parallel cluster growing - a first experimental study. ARCS Workshops 2012: 493-504 - [c5]Andreas Beckmann, Jaroslaw Fedorowicz, Jörg Keller, Ulrich Meyer:
A structural analysis of the A5/1 state transition graph. GRAPHITE 2012: 5-19 - 2011
- [j1]Andreas Beckmann, Ulrich Meyer, Peter Sanders, Johannes Singler:
Energy-efficient sorting using solid state disks. Sustain. Comput. Informatics Syst. 1(2): 151-163 (2011) - 2010
- [c4]Andreas Beckmann, Ulrich Meyer, Peter Sanders, Johannes Singler:
Energy-efficient sorting using solid state disks. Green Computing Conference 2010: 191-202
2000 – 2009
- 2009
- [c3]Andreas Beckmann, Roman Dementiev, Johannes Singler:
Building a parallel pipelined external memory algorithm library. IPDPS 2009: 1-10 - [c2]Deepak Ajwani, Andreas Beckmann, Riko Jacob, Ulrich Meyer, Gabriel Moruz:
On Computational Models for Flash Memory Devices. SEA 2009: 16-27 - 2007
- [c1]Andreas Beckmann, Jörg Keller:
Parallel-External Computation of the Cycle Structure of Invertible Cryptographic Functions. PDP 2007: 526-533
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-15 20:48 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:
