default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexander Strang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j9]Alexander Strang
, David Sewell, Alexander Kim, Kevin Alcedo, David Rosenbluth:
Principal trade-off analysis. Inf. Vis. 23(3): 258-271 (2024)- [j8]Zilai Si, Yucong Liu, Alexander Strang:
Path-Following Methods for Maximum a Posteriori Estimators in Bayesian Hierarchical Models: How Estimates Depend on Hyperparameters. SIAM J. Optim. 34(3): 2201-2230 (2024) - 2023
- [j7]Christopher Cebra, Alexander Strang:
Similarity Suppresses Cyclicity: Why Similar Competitors Form Hierarchies. SIAM J. Appl. Math. 83(5): 2027-2051 (2023) - [i4]Daniel Chen, Alexander G. Strang, Andrew W. Eckford, Peter J. Thomas:
Explicitly Solvable Continuous-time Inference for Partially Observed Markov Processes. CoRR abs/2301.00843 (2023) - [i3]Shishir Adhikari, Alkan Kabakçioglu, Alexander Strang, Deniz Yuret, Michael Hinczewski:
Machine learning in and out of equilibrium. CoRR abs/2306.03521 (2023) - 2022
- [j6]Shiv Agrawal, Hwanwoo Kim, Daniel Sanz-Alonso, Alexander Strang:
A Variational Inference Approach to Inverse Problems with Gamma Hyperpriors. SIAM/ASA J. Uncertain. Quantification 10(4): 1533-1559 (2022) - [j5]Alexander Strang, Karen C. Abbott, Peter J. Thomas:
The Network HHD: Quantifying Cyclic Competition in Trait-Performance Models of Tournaments. SIAM Rev. 64(2): 360-391 (2022) - [j4]Daniel Chen, Alexander G. Strang, Andrew W. Eckford, Peter J. Thomas:
Explicitly Solvable Continuous-Time Inference for Partially Observed Markov Processes. IEEE Trans. Signal Process. 70: 6232-6242 (2022) - [i2]Hwanwoo Kim, Daniel Sanz-Alonso, Alexander Strang:
Hierarchical Ensemble Kalman Methods with Sparsity-Promoting Generalized Gamma Hyperpriors. CoRR abs/2205.09322 (2022) - [i1]Alexander Strang, David Sewell, Alexander Kim, Kevin Alcedo, David Rosenbluth:
Principal Trade-off Analysis. CoRR abs/2206.07520 (2022) - 2020
- [j3]Alexander Strang:
Solutions to the Minimum Variance Problem Using Delaunay Triangulation. SIAM J. Discret. Math. 34(4): 2510-2531 (2020)
2010 – 2019
- 2018
- [j2]Alexander Strang, Oliver Haynes, Rigoberto Flórez, Darren A. Narayan:
Enumerating shortest paths and determining edge betweenness centrality in cartesian products of paths and cycles. Bull. ICA 83: 29-51 (2018) - [j1]Alexander Strang, Oliver Haynes, Nathan D. Cahill, Darren A. Narayan:
Generalized relationships between characteristic path length, efficiency, clustering coefficients, and density. Soc. Netw. Anal. Min. 8(1): 14 (2018)
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-20 20:28 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:
