default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJoachim H. Ahrens
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1995
[j20]Joachim H. Ahrens:
A One-Table Method for Sampling from Continuous and Discrete Distributions. Computing 54(2): 127-146 (1995)
1980 – 1989
- 1989
- [j19]Joachim H. Ahrens:
How to avoid logarithms in comparisons with uniform random variables. Computing 41(1-2): 163-166 (1989) - [j18]Joachim H. Ahrens, Ulrich Dieter:
An alias method for sampling from the normal distribution. Computing 42(2-3): 159-170 (1989) - 1988
- [j17]Joachim H. Ahrens, Ulrich Dieter:
Efficient Table-Free Sampling Methods for the Exponential, Cauchy, and Normal Distributions. Commun. ACM 31(11): 1330-1337 (1988) - 1985
- [j16]Joachim H. Ahrens, Ulrich Dieter:
Sequential Random Sampling. ACM Trans. Math. Softw. 11(2): 157-169 (1985) - 1983
- [j15]Joachim H. Ahrens, K. D. Kohrt, Ulrich Dieter:
Algorithm 599: sampling from Gamma and Poisson distributions. ACM Trans. Math. Softw. 9(2): 255-257 (1983) - 1982
- [j14]Joachim H. Ahrens, Ulrich Dieter:
Generating Gamma Variates by a Modified Rejection Technique. Commun. ACM 25(1): 47-54 (1982) - [j13]Joachim H. Ahrens, Ulrich Dieter:
Computer Generation of Poisson Deviates from Modified Normal Distributions. ACM Trans. Math. Softw. 8(2): 163-179 (1982) - 1981
- [j12]Joachim H. Ahrens, K. D. Kohrt:
Computer methods for efficient sampling from largely arbitrary statistical distributions. Computing 26(1): 19-31 (1981) - [j11]Joachim H. Ahrens:
Paving the Chessboard. J. Comb. Theory A 31(3): 277-288 (1981) - [j10]Joachim H. Ahrens:
A conjecture of E. D. Bolker. J. Comb. Theory B 31(3): 1-8 (1981) - 1980
- [j9]Joachim H. Ahrens, Ulrich Dieter:
Sampling from binomial and poisson distributions: A method with bounded computation times. Computing 25(3): 193-208 (1980) - [j8]Joachim H. Ahrens, Gerd Ahrens:
Primal transportation and transshipment algorithms. Z. Oper. Research 24(1): 1-32 (1980)
1970 – 1979
- 1975
- [j7]Joachim H. Ahrens, Gerd Finke:
Merging and Sorting Applied to the Zero-One Knapsack Problem. Oper. Res. 23(6): 1099-1109 (1975) - [j6]Joachim H. Ahrens, Gerd Finke:
Degeneracy in fixed cost transportation problems. Math. Program. 8(1): 369-374 (1975) - 1974
- [j5]Joachim H. Ahrens, Ulrich Dieter:
Computer methods for sampling from gamma, beta, poisson and bionomial distributions. Computing 12(3): 223-246 (1974) - 1973
- [j4]Ulrich Dieter, Joachim H. Ahrens:
A combinatorial method for the generation of normally distributed random numbers. Computing 11(2): 137-146 (1973) - 1972
- [j3]Joachim H. Ahrens, Ulrich Dieter:
Computer Methods for Sampling from the Exponential and Normal Distributions. Commun. ACM 15(10): 873-882 (1972) - 1970
- [j2]Joachim H. Ahrens, Ulrich Dieter, Andreas Grube:
Pseudo-random numbers - A new proposal for the choice of multiplicators. Computing 6(1-2): 121-138 (1970)
1960 – 1969
- 1964
- [j1]Joachim H. Ahrens, Wolfgang Gaschütz:
Einige Bemerkungen zum Ernennungsproblem. Unternehmensforschung 8(3): 142-148 (1964)
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-06-10 21:23 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:
