The following pages link to Josef Leydold (Q228049):
Displaying 46 items.
- (Q69168) (redirect page) (← links)
- (Q452559) (redirect page) (← links)
- Generating generalized inverse Gaussian random variates by fast inversion (Q452560) (← links)
- (Q589103) (redirect page) (← links)
- Transformed density rejection with inflection points (Q746271) (← links)
- Faber-Krahn type inequalities for trees (Q864896) (← links)
- Generating generalized inverse Gaussian random variates (Q892803) (← links)
- An error in the Kinderman-Ramage method and how to fix it (Q957024) (← links)
- Algebraic connectivity and degree sequences of trees (Q959888) (← links)
- Semiregular trees with minimal Laplacian spectral radius (Q962121) (← links)
- Graphs with given degree sequence and maximal spectral radius (Q1010854) (← links)
- Efficient risk simulations for linear asset portfolios in the \(t\)-copula model (Q1041011) (← links)
- The geometry of regular trees with the Faber-Krahn property (Q1348120) (← links)
- (Q1355454) (redirect page) (← links)
- A Faber-Krahn-type inequality for regular trees (Q1355455) (← links)
- Minimal cycle bases of outerplanar graphs (Q1381672) (← links)
- A note on transformed density rejection (Q1592540) (← links)
- An automatic code generator for nonuniform random variate generation (Q1873045) (← links)
- Graph Laplacians, nodal domains, and hyperplane arrangements (Q1886532) (← links)
- On the number of nodal domains of spherical harmonics (Q1913468) (← links)
- Interchangeability of relevant cycles in graphs (Q1972676) (← links)
- Graphs of given order and size and minimum algebraic connectivity (Q2427902) (← links)
- Laplacian eigenvectors of graphs. Perron-Frobenius and Faber-Krahn type theorems (Q2642409) (← links)
- (Q2856761) (← links)
- BETTER CONFIDENCE INTERVALS FOR IMPORTANCE SAMPLING (Q3067164) (← links)
- Convex cycle bases (Q3191452) (← links)
- Minimum path bases and relevant paths (Q3367052) (← links)
- Largest eigenvalues of the discrete p-Laplacian of trees with degree sequences (Q3394467) (← links)
- Efficient Numerical Inversion for Financial Simulations (Q3405443) (← links)
- A note on quasi-robust cycle bases (Q3552336) (← links)
- A sweep-plane algorithm for generating random tuples in simple polytopes (Q4210961) (← links)
- Automatic sampling with the ratio-of-uniforms method (Q4406300) (← links)
- (Q4435446) (← links)
- A rejection technique for sampling from log-concave multivariate distributions (Q4510530) (← links)
- (Q4549513) (← links)
- Continuous random variate generation by fast numerical inversion (Q4564839) (← links)
- Inverse transformed density rejection for unbounded monotone densities (Q4565392) (← links)
- Random variate generation by numerical inversion when only the density is known (Q4635155) (← links)
- Smoothed Transformed Density Rejection * (Q4655063) (← links)
- Short universal generators via generalized ratio-of-uniforms method (Q4806398) (← links)
- Circuit bases of strongly connected digraphs (Q4823306) (← links)
- (Q4934384) (← links)
- A simple universal generator for continuous and discrete univariate T-concave distributions (Q5460991) (← links)
- (Q5469422) (← links)
- Discrete nodal domain theorems (Q5954844) (← links)
- Efficient sampling from the PKBD distribution (Q6184874) (← links)
