default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid F. Anderson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i5]David F. Anderson, Aidan S. Howells:
Parametric Sensitivity Analysis for Models of Reaction Networks within Interacting Compartments. CoRR abs/2408.09208 (2024)- 2022
- [j21]David F. Anderson
, Tung D. Nguyen:
Prevalence of deficiency-zero reaction networks in an Erdös-Rényi framework. J. Appl. Probab. 59(2): 384-398 (2022) - [j20]David F. Anderson, Kurt W. Ehlert:
Conditional Monte Carlo for Reaction Networks. SIAM J. Sci. Comput. 44(2): 993- (2022) - 2020
- [j19]David F. Anderson, Daniele Cappelletti, Jinsu Kim:
Stochastically modeled weakly reversible reaction networks with a single linkage class. J. Appl. Probab. 57(3): 792-810 (2020) - [j18]David F. Anderson, Chaojie Yuan:
Variance of Finite Difference Methods for Reaction Networks with Non-Lipschitz Rate Functions. SIAM J. Numer. Anal. 58(6): 3125-3143 (2020) - [j17]Daniele Cappelletti, Andrés Ortiz-Muñoz, David F. Anderson, Erik Winfree:
Stochastic chemical reaction networks for robustly approximating arbitrary probability distributions. Theor. Comput. Sci. 801: 64-95 (2020) - [i4]David F. Anderson, Abhishek Deshpande, Badal Joshi:
On reaction network implementations of neural networks. CoRR abs/2010.13290 (2020)
2010 – 2019
- 2019
- [j16]David F. Anderson, Desmond J. Higham, Saul C. Leite, Ruth J. Williams:
On Constrained Langevin Equations and (Bio)Chemical Reaction Networks. Multiscale Model. Simul. 17(1): 1-30 (2019) - [i3]David F. Anderson, Kurt W. Ehlert:
Conditional Monte Carlo for Reaction Networks. CoRR abs/1906.05353 (2019) - [i2]David F. Anderson, Chaojie Yuan:
Variance of finite difference methods for reaction networks with non-Lipschitz rate functions. CoRR abs/1908.06880 (2019) - 2018
- [j15]David F. Anderson, Desmond J. Higham, Yu Sun:
Computational Complexity Analysis for Monte Carlo Approximations of Classically Scaled Population Processes. Multiscale Model. Simul. 16(3): 1206-1226 (2018) - [j14]David F. Anderson, Jinsu Kim:
Some Network Conditions for Positive Recurrence of Stochastically Modeled Reaction Networks. SIAM J. Appl. Math. 78(5): 2692-2713 (2018) - [i1]Daniele Cappelletti, Andrés Ortiz-Muñoz, David F. Anderson, Erik Winfree:
Stochastic Chemical Reaction Networks for Robustly Approximating Arbitrary Probability Distributions. CoRR abs/1810.02854 (2018) - 2017
- [j13]David F. Anderson, Daniele Cappelletti, Thomas G. Kurtz:
Finite Time Distributions of Stochastically Modeled Chemical Systems with Absolute Concentration Robustness. SIAM J. Appl. Dyn. Syst. 16(3): 1309-1339 (2017) - 2016
- [j12]David F. Anderson, Gyu Whan Chang:
Graded integral domains whose nonzero homogeneous ideals are invertible. Int. J. Algebra Comput. 26(7): 1361-1368 (2016) - [j11]David F. Anderson, Desmond J. Higham, Yu Sun:
Multilevel Monte Carlo for Stochastic Differential Equations with Small Noise. SIAM J. Numer. Anal. 54(2): 505-529 (2016) - 2015
- [j10]David F. Anderson, Bard Ermentrout, Peter J. Thomas:
Stochastic representations of ion channel kinetics and exact stochastic simulation of neuronal dynamics. J. Comput. Neurosci. 38(1): 67-82 (2015) - 2014
- [j9]David F. Anderson, Desmond J. Higham, Yu Sun:
Complexity of Multilevel Monte Carlo Tau-Leaping. SIAM J. Numer. Anal. 52(6): 3106-3127 (2014) - 2012
- [j8]David F. Anderson, Scott T. Chapman:
On Bounding Measures of primeness in integral Domains. Int. J. Algebra Comput. 22(5) (2012) - [j7]David F. Anderson, Desmond J. Higham:
Multilevel Monte Carlo for Continuous Time Markov Chains, with Applications in Biochemical Kinetics. Multiscale Model. Simul. 10(1): 146-179 (2012) - [j6]David F. Anderson, Masanori Koyama:
Weak Error Analysis of Numerical Methods for Stochastic Models of Population Processes. Multiscale Model. Simul. 10(4): 1493-1524 (2012) - [j5]David F. Anderson:
An Efficient Finite Difference Method for Parameter Sensitivities of Continuous Time Markov Chains. SIAM J. Numer. Anal. 50(5): 2237-2258 (2012) - 2011
- [j4]David F. Anderson:
A Proof of the Global Attractor Conjecture in the Single Linkage Class Case. SIAM J. Appl. Math. 71(4): 1487-1508 (2011) - 2010
- [j3]David F. Anderson, Anne Shiu:
The Dynamics of Weakly Reversible Population Processes near Facets. SIAM J. Appl. Math. 70(6): 1840-1858 (2010)
2000 – 2009
- 2008
- [j2]David F. Anderson:
Global Asymptotic Stability for a Class of Nonlinear Chemical Equations. SIAM J. Appl. Math. 68(5): 1464-1476 (2008) - 2002
- [j1]Jose F. Silverio, Y. Ming Ng, David F. Anderson:
Hierarchical indexing data structure method for verifying the functionality of the STI-to-PCI bridge chips of the IBM eServer z900. IBM J. Res. Dev. 46(4-5): 617-630 (2002)
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-09-30 00:07 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:
