default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJosef Leydold
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[j26]Marc Hellmuth, Josef Leydold, Peter F. Stadler
:
Convex cycle bases. Ars Math. Contemp. 7(1): 123-140 (2014)- [j25]Wolfgang Hörmann, Josef Leydold:
Generating generalized inverse Gaussian random variates. Stat. Comput. 24(4): 547-557 (2014) - 2013
- [j24]Carsten H. Botts, Wolfgang Hörmann, Josef Leydold:
Transformed density rejection with inflection points. Stat. Comput. 23(2): 251-260 (2013) - 2011
- [j23]Josef Leydold, Wolfgang Hörmann:
Generating generalized inverse Gaussian random variates by fast inversion. Comput. Stat. Data Anal. 55(1): 213-217 (2011) - 2010
- [j22]Halis Sak, Wolfgang Hörmann, Josef Leydold:
Efficient risk simulations for linear asset portfolios in the t-copula model. Eur. J. Oper. Res. 202(3): 802-809 (2010) - [j21]Gerhard Derflinger, Wolfgang Hörmann, Josef Leydold:
Random variate generation by numerical inversion when only the density is known. ACM Trans. Model. Comput. Simul. 20(4): 18:1-18:25 (2010)
2000 – 2009
- 2009
- [j20]Philipp-Jens Ostermeier, Marc Hellmuth, Josef Leydold, Konstantin Klemm, Peter F. Stadler:
A note on quasi-robust cycle bases. Ars Math. Contemp. 2(2): 231-240 (2009) - 2008
- [j19]Türker Bíyíkoglu, Josef Leydold:
Graphs with Given Degree Sequence and Maximal Spectral Radius. Electron. J. Comb. 15(1) (2008) - [c3]Halis Sak, Josef Leydold:
Better confidence intervals for importance sampling. WSC 2008: 2949 - 2007
- [j18]Türker Bíyíkoglu, Josef Leydold:
Faber-Krahn type inequalities for trees. J. Comb. Theory B 97(2): 159-174 (2007) - [j17]Wolfgang Hörmann, Josef Leydold, Gerhard Derflinger:
Inverse transformed density rejection for unbounded monotone densities. ACM Trans. Model. Comput. Simul. 17(4): 18 (2007) - 2006
- [c2]Josef Leydold, Wolfgang Hörmann:
Black-box algorithms for sampling from continuous distributions. WSC 2006: 129-136 - 2005
- [j16]Petra M. Gleiss, Josef Leydold, Peter F. Stadler:
Minimum path bases and relevant paths. Networks 46(3): 119-123 (2005) - 2004
- [j15]Günter Tirler, Peter Dalgaard, Wolfgang Hörmann, Josef Leydold:
An error in the Kinderman-Ramage method and how to fix it. Comput. Stat. Data Anal. 47(3): 433-440 (2004) - [j14]Franziska Berger, Christoph Flamm, Petra M. Gleiss, Josef Leydold, Peter F. Stadler:
Counterexamples in Chemical Ring Perception. J. Chem. Inf. Model. 44(2): 323-331 (2004) - [j13]Josef Leydold, Wolfgang Hörmann:
Smoothed Transformed Density Rejection. Monte Carlo Methods Appl. 10(3-4): 393-401 (2004) - 2003
- [j12]Petra M. Gleiss, Josef Leydold, Peter F. Stadler:
Circuit bases of strongly connected digraphs. Discuss. Math. Graph Theory 23(2): 241-260 (2003) - [j11]Josef Leydold, Gerhard Derflinger, Günter Tirler, Wolfgang Hörmann:
An automatic code generator for nonuniform random variate generation. Math. Comput. Simul. 62(3-6): 405-412 (2003) - [j10]Josef Leydold:
Short universal generators via generalized ratio-of-uniforms method. Math. Comput. 72(243): 1453-1471 (2003) - [j9]Wolfgang Hörmann, Josef Leydold:
Continuous random variate generation by fast numerical inversion. ACM Trans. Model. Comput. Simul. 13(4): 347-362 (2003) - 2002
- [j8]Josef Leydold:
The geometry of regular trees with the Faber?Krahn property. Discret. Math. 245(1-3): 155-172 (2002) - 2001
- [j7]Josef Leydold:
A simple universal generator for continuous and discrete univariate T-concave distributions. ACM Trans. Math. Softw. 27(1): 66-82 (2001) - 2000
- [j6]Petra M. Gleiss, Josef Leydold, Peter F. Stadler:
Interchangeability of Relevant Cycles in Graphs. Electron. J. Comb. 7 (2000) - [j5]Josef Leydold:
A Note on Transformed Density Rejection. Computing 65(2): 187-192 (2000) - [j4]Josef Leydold:
Automatic sampling with the ratio-of-uniforms method. ACM Trans. Math. Softw. 26(1): 78-98 (2000) - [c1]Wolfgang Hörmann, Josef Leydold:
Random-number and random-variate generation: automatic random variate generation for simulation input. WSC 2000: 675-682
1990 – 1999
- 1998
- [j3]Josef Leydold, Peter F. Stadler:
Minimal Cycle Bases of Outerplanar Graphs. Electron. J. Comb. 5 (1998) - [j2]Josef Leydold, Wolfgang Hörmann:
A sweep-plane algorithm for generating random tuples in simple polytopes. Math. Comput. 67(224): 1617-1635 (1998) - [j1]Josef Leydold:
A Rejection Technique for Sampling from log-Concave Multivariate Distributions. ACM Trans. Model. Comput. Simul. 8(3): 254-280 (1998)
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-06-10 20:26 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:
