default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMark A. Stalzer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2019
[j5]Wenqing Xu
, Mark A. Stalzer:
Deriving compact laws based on algebraic formulation of a data set. J. Comput. Sci. 36 (2019)- 2014
- [j4]Andrew Lucas, Mark A. Stalzer, John Feo:
Parallel Implementation of Fast Randomized Algorithms for Low Rank Matrix Decomposition. Parallel Process. Lett. 24(1) (2014) - 2011
- [j3]Sean Mauch, Mark A. Stalzer:
Efficient Formulations for Exact Stochastic Simulation of Chemical Systems. IEEE ACM Trans. Comput. Biol. Bioinform. 8(1): 27-35 (2011) - 1995
- [j2]Mark A. Stalzer:
A Parallel Fast Multiple Method for the Helmholtz Equation. Parallel Process. Lett. 5: 263-274 (1995) - 1993
- [j1]Lisa Hamilton, Mark A. Stalzer, R. Steven Turley, John L. Visher, Stephen M. Wandzura:
FastScatTM: An Object-Oriented Program for Fast Scattering Computation. Sci. Program. 2(4): 171-178 (1993)
Conference and Workshop Papers
- 2019
- [c5]John Backes, Sam Bayless, Byron Cook, Catherine Dodge, Andrew Gacek, Alan J. Hu, Temesghen Kahsai, Bill Kocik, Evgenii Kotelnikov, Jure Kukovec, Sean McLaughlin, Jason Reed, Neha Rungta, John Sizemore, Mark A. Stalzer, Preethi Srinivasan, Pavle Subotic, Carsten Varming, Blake Whaley:
Reachability Analysis for AWS-Based Networks. CAV (2) 2019: 231-241 - 1999
- [c4]Mark A. Stalzer:
A Scalable Multilevel Helmholtz FMM for the Origin 2000. PP 1999 - [c3]John J. Ottusch, Mark A. Stalzer, John L. Visher, Stephen M. Wandzura:
Scalable Electromagnetic Scattering Calculations on the SGI Origin 2000. SC 1999: 54 - 1997
- [c2]Vladimir Rokhlin, Mark A. Stalzer:
Scalability of the Fast Multipole Method for the Helmholtz Equation. PP 1997 - 1995
- [c1]Mark A. Stalzer:
Parallelizing the Fast Multipole Method for the Helmholtz Equation. PP 1995: 325-330
Informal and Other Publications
- 2017
- [i6]Wenqing Xu, Mark A. Stalzer:
Deriving Compact Laws Based on Algebraic Formulation of a Data Set. CoRR abs/1706.05123 (2017) - [i5]Mark A. Stalzer:
On the enumeration of sentences by compactness. CoRR abs/1706.06975 (2017) - [i4]Mark A. Stalzer, Chao Ju:
TheoSea: Marching Theory to Light. CoRR abs/1708.04927 (2017) - [i3]Lawrence Stewart, Mark A. Stalzer:
Bayesian Optimization for Parameter Tuning of the XOR Neural Network. CoRR abs/1709.07842 (2017) - 2015
- [i2]Mark A. Stalzer, Chris Mentzel:
A Preliminary Review of Influential Works in Data-Driven Discovery. CoRR abs/1503.08776 (2015) - 2012
- [i1]Andrew Lucas, Mark A. Stalzer, John Feo:
Parallel implementation of a fast randomized algorithm for the decomposition of low rank matrices. CoRR abs/1205.3830 (2012)
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 22:21 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:
