default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlfred Müller
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Carole Bernard
, Alfred Müller, Marco Oesting:
Lp-norm spherical copulas. J. Multivar. Anal. 201: 105262 (2024)- 2022
- [j13]Alfred Müller, Marco Scarsini, Ilia Tsetlin, Robert L. Winkler:
Technical Note - Ranking Distributions When Only Means and Variances Are Known. Oper. Res. 70(5): 2851-2859 (2022)
2010 – 2019
- 2018
- [c2]Rafael Psiuk, Alfred Müller, Maximilian Singh, Tobias Dräger, Hartmut Brauer, Hannes Töpfer, Jörn Thielecke:
Simultaneous 2D Localization of Multiple Standard Passive LF-RFID Transponders. RFID-TA 2018: 1-6 - 2017
- [j12]Alfred Müller, Marco Scarsini, Ilia Tsetlin, Robert L. Winkler:
Between First- and Second-Order Stochastic Dominance. Manag. Sci. 63(9): 2933-2947 (2017) - [c1]Rafael Psiuk, Alfred Müller, Tobias Dräger, Ibrahim Ibrahim, Hartmut Brauer, Hannes Töpfer, Albert Heuberger:
Simultaneous 2D localization of multiple coils in an LF magnetic field using orthogonal codes. IEEE SENSORS 2017: 1-3 - 2012
- [j11]Alfred Müller, Marco Scarsini:
Fear of loss, inframodularity, and transfers. J. Econ. Theory 147(4): 1490-1500 (2012)
2000 – 2009
- 2008
- [j10]Nicole Bäuerle, Anja Blatter, Alfred Müller:
Dependence properties and comparison results for Lévy processes. Math. Methods Oper. Res. 67(1): 161-186 (2008) - 2006
- [j9]Alfred Müller, Marco Scarsini:
Stochastic Order Relations and Lattices of Probability Measures. SIAM J. Optim. 16(4): 1024-1043 (2006) - 2003
- [j8]Alfred Müller, Marco Scarsini:
Sensitivity analysis of a sequential decision problem with learning. Math. Methods Oper. Res. 57(2): 321-327 (2003) - [j7]Alfred Müller:
On the interplay between variability and negative dependence for bivariate distributions. Oper. Res. Lett. 31(2): 90-94 (2003) - 2002
- [j6]Alfred Müller, Marco Scarsini, Moshe Shaked:
The Newsvendor Game Has a Nonempty Core. Games Econ. Behav. 38(1): 118-126 (2002) - 2001
- [j5]Alfred Müller, Marco Scarsini:
Stochastic Comparison of Random Vectors with a Common Copula. Math. Oper. Res. 26(4): 723-740 (2001) - 2000
- [j4]Alfred Müller:
Expected utility maximization of optimal stopping problems. Eur. J. Oper. Res. 122(1): 101-114 (2000) - [j3]Alfred Müller:
On the waiting times in queues with dependency between interarrival and service times. Oper. Res. Lett. 26(1): 43-47 (2000)
1990 – 1999
- 1997
- [j2]Alfred Müller:
How Does the Value Function of a Markov Decision Process Depend on the Transition Probabilities? Math. Oper. Res. 22(4): 872-885 (1997) - 1996
- [j1]Alfred Müller:
Optimal selection from distributions with unknown parameters: Robustness of Bayesian models. Math. Methods Oper. Res. 44(3): 371-386 (1996)
1980 – 1989
- 1984
- [b1]Alfred Müller:
Numerische Lösung von Minimierungsaufgaben und ihre Anwendung auf Strafmethoden. Technische Hochschule Ilmenau, Germany, 1984
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-08-05 20: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:
