default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRobert Krasny
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i3]Zhen Chao, Weihua Geng, Robert Krasny:
Integral equation method for the 1D steady-state Poisson-Nernst-Planck equations. CoRR abs/2304.04371 (2023)- 2022
- [j12]Leighton Wilson
, Jingzhen Hu, Jiahui Chen, Robert Krasny, Weihua Geng:
Computing electrostatic binding energy with the TABI Poisson-Boltzmann solver. Commun. Inf. Syst. 22(2): 247-273 (2022) - [j11]Leighton Wilson, Robert Krasny, Tyler Luchko:
Accelerating the 3D reference interaction site model theory of molecular solvation with treecode summation and cut-offs. J. Comput. Chem. 43(18): 1251-1270 (2022) - 2021
- [j10]Leighton Wilson, Nathan Vaughn, Robert Krasny:
A GPU-accelerated fast multipole method based on barycentric Lagrange interpolation and dual tree traversal. Comput. Phys. Commun. 265: 108017 (2021) - [j9]Leighton Wilson, Robert Krasny:
Comparison of the MSMS and NanoShaper molecular surface triangulation codes in the TABI Poisson-Boltzmann solver. J. Comput. Chem. 42(22): 1552-1560 (2021) - [j8]Nathan Vaughn, Vikram Gavini, Robert Krasny:
Treecode-accelerated Green iteration for Kohn-Sham density functional theory. J. Comput. Phys. 430: 110101 (2021) - 2020
- [c4]Nathan Vaughn, Leighton Wilson, Robert Krasny:
A GPU-Accelerated Barycentric Lagrange Treecode. IPDPS Workshops 2020: 701-710 - [i2]Nathan Vaughn, Leighton Wilson, Robert Krasny:
A GPU-Accelerated Barycentric Lagrange Treecode. CoRR abs/2003.01836 (2020) - [i1]Leighton Wilson, Nathan Vaughn, Robert Krasny:
A GPU-Accelerated Fast Summation Method Based on Barycentric Lagrange Interpolation and Dual Tree Traversal. CoRR abs/2012.06925 (2020)
2010 – 2019
- 2017
- [j7]Peter A. Bosler, James Kent, Robert Krasny, Christiane Jablonowski:
A Lagrangian particle method with remeshing for tracer transport on the sphere. J. Comput. Phys. 340: 639-654 (2017) - 2013
- [j6]Henry A. Boateng, Robert Krasny:
Comparison of treecodes for computing electrostatic potentials in charged particle systems with disjoint targets and sources. J. Comput. Chem. 34(25): 2159-2167 (2013) - [j5]Weihua Geng, Robert Krasny:
A treecode-accelerated boundary integral Poisson-Boltzmann solver for electrostatics of solvated biomolecules. J. Comput. Phys. 247: 62-78 (2013) - 2011
- [j4]Robert Krasny, Lei Wang:
Fast Evaluation of Multiquadric RBF Sums by a Cartesian Treecode. SIAM J. Sci. Comput. 33(5): 2341-2355 (2011)
2000 – 2009
- 2009
- [j3]Peijun Li, Hans Johnston, Robert Krasny:
A Cartesian treecode for screened coulomb interactions. J. Comput. Phys. 228(10): 3858-3868 (2009) - 2004
- [j2]Andrew J. Christlieb, Robert Krasny, John P. Verboncoeur:
A treecode algorithm for simulating electron dynamics in a Penning-Malmberg trap. Comput. Phys. Commun. 164(1-3): 306-310 (2004) - [c3]Dongqing Liu, Zhong-Hui Duan, Robert Krasny, Jianping Zhu:
Parallel Implementation of the Treecode Ewald Method. IPDPS 2004 - 2003
- [c2]Zhong-Hui Duan, Robert Krasny:
A Treecode Algorithm for Computing Ewald Summation of Dipolar Systems. SAC 2003: 172-177 - 2001
- [j1]Zhong-Hui Duan, Robert Krasny:
An adaptive treecode for computing nonbonded potential energy in classical molecular systems. J. Comput. Chem. 22(2): 184-195 (2001)
1990 – 1999
- 1993
- [c1]David H. Bailey, Robert Krasny, Richard B. Pelz:
Multiple Precision, Multiple Processor Vortex Sheet Roll-Up Computation. PPSC 1993: 52-56
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-07-04 21:27 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:
