The following pages link to (Q4349924):
Displaying 50 items.
- The generating function for total displacement (Q743648) (← links)
- Optimal learning with a local parametric belief model (Q746825) (← links)
- Renewal theory in the analysis of tries and strings (Q764315) (← links)
- Intervals of balanced binary trees in the Tamari lattice (Q764359) (← links)
- Truncation of unitary operads (Q783203) (← links)
- Upper bounds for sorting integers on random access machines (Q789897) (← links)
- Approximate \(k\)-closest-pairs in large high-dimensional data sets (Q814957) (← links)
- Fractal-like matrices (Q817032) (← links)
- Accelerating certain outputs of merging and sorting networks (Q837163) (← links)
- On the mean-field limit of bosons with Coulomb two-body interaction (Q842493) (← links)
- The Ford-Johnson algorithm still unbeaten for less than 47 elements (Q845913) (← links)
- Bounds for resultants of univariate and bivariate polynomials (Q848582) (← links)
- Algorithms for accurate, validated and fast polynomial evaluation (Q849175) (← links)
- On robustness in control and LTI identification: near-linearity and non-conic uncertainty (Q856504) (← links)
- LTI approximation of nonlinear systems via signal distribution theory (Q857127) (← links)
- Simulation of stochastic demand data streams for network revenue management problems (Q858607) (← links)
- The combination technique and some generalisations (Q860989) (← links)
- Permutations with short monotone subsequences (Q867911) (← links)
- Permutation and sampling with maximum length CA or pseudorandom number generation (Q870167) (← links)
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems (Q875422) (← links)
- The number of steps in the Robinson-Schensted algorithm (Q883619) (← links)
- On the maximum relative error when computing integer powers by iterated multiplications in floating-point arithmetic (Q891788) (← links)
- An improvement of a cryptanalysis algorithm (Q894480) (← links)
- Nearly optimal refinement of real roots of a univariate polynomial (Q898253) (← links)
- Probabilistic analyses of the plain multiple gcd algorithm (Q898274) (← links)
- Self-affine manifolds (Q904030) (← links)
- Computation of maximal local (un)stable manifold patches by the parameterization method (Q904186) (← links)
- Quad-\(k\mathrm d\) trees: a general framework for \(k\mathrm d\) trees and quad trees (Q906406) (← links)
- A survey of some applications of finite fields (Q908045) (← links)
- A rigorous version of R. P. Brent's model for the binary Euclidean algorithm (Q908058) (← links)
- Trees with exponentially growing costs (Q924721) (← links)
- The additive congruential random number generator -- a special case of a multiple recursive generator (Q929939) (← links)
- Extensions of Black-Scholes processes and Benford's law (Q939395) (← links)
- Estimating steady-state distributions via simulation-generated histograms (Q941527) (← links)
- M-CASH: A real-time resource reclaiming algorithm for multiprocessor platforms (Q944004) (← links)
- On computational efficiency for multi-precision zero-finding methods (Q945380) (← links)
- Recursive polynomial remainder sequence and its subresultants (Q947487) (← links)
- Improved random graph isomorphism (Q954962) (← links)
- An error in the Kinderman-Ramage method and how to fix it (Q957024) (← links)
- Invariants for parameterised Boolean equation systems (Q960855) (← links)
- Distributional analysis of swaps in quick select (Q964394) (← links)
- Quasi-Monte Carlo methods with applications in finance (Q964676) (← links)
- Obtainable sizes of topologies on finite sets (Q966058) (← links)
- The Nekrasov-Okounkov hook length formula: refinement, elementary proof, extension and applications (Q968254) (← links)
- Deletions in random binary search trees: a story of errors (Q972839) (← links)
- Monte Carlo linear solvers with non-diagonal splitting (Q974249) (← links)
- Width and mode of the profile for some random trees of logarithmic height (Q997955) (← links)
- Comparing the effectiveness of two kinds of continued fractions (Q1000063) (← links)
- Inversive pseudorandom numbers over Galois rings (Q1003598) (← links)
- Space complexity of abelian groups (Q1005925) (← links)