scientific article

Publication date: 1981

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

survey spectral test statistical tests Euclidean algorithm floating-point arithmetic exercises multiple-precision arithmetic polynomial arithmetic seminumerical algorithms uniform random numbers linear congruence relations radix conversion

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Probabilistic methods, stochastic differential equations (65Cxx) Error analysis and interval analysis (65Gxx)

Related Items (only showing first 100 items - show all)

A parallel search for good lattice points using LLL-spectral tests ⋮ Scalable generation of scale-free graphs ⋮ Black-box polynomial resultants ⋮ A simple approach for generating RSA keys ⋮ Improvements on the accelerated integer GCD algorithm ⋮ How to build a device that cannot be built ⋮ An optimal message routing algorithm for double-loop networks ⋮ Random permutations on distributed, external and hierarchical memory ⋮ Linear systolic multiplier/squarer for fast exponentiation ⋮ Generating uniform random vectors in \(\mathbb Z^k_p\): the general case ⋮ Parameterization of slow-stable manifolds and their invariant vector bundles: theory and numerical implementation ⋮ A Euclidean algorithm for normal bases ⋮ Scalable and systolic architecture for computing double exponentiation over \(\text{GF}(2^m)\) ⋮ Mechanically proving termination using polynomial interpretations ⋮ Temporal correlations and device-independent randomness ⋮ The complexity of intersecting finite automata having few final states ⋮ Specification and analysis of the AER/NCA active network protocol suite in real-time Maude ⋮ Towards minimal addition chains using ant colony optimisation ⋮ Applying quick exponentiation for block upper triangular matrices ⋮ Automatic derivation and implementation of fast convolution algorithms ⋮ On Prouhet's solution to the equal powers problem ⋮ The independence of two randomness properties of sequences over finite fields ⋮ On the complexity of inverting integer and polynomial matrices ⋮ A geometric algorithm for winding number computation with complexity analysis ⋮ A rigorous version of R. P. Brent's model for the binary Euclidean algorithm ⋮ Some models of relative error in products ⋮ Factoring polynomials modulo special primes ⋮ The area-time complexity of the greatest common divisor problem: A lower bound ⋮ One class of planar rational involutions ⋮ Analysis of Euclidean algorithms for polynomials over finite fields ⋮ Some uses of microcomputers in number theory research ⋮ Factoring polynomials using fewer random bits ⋮ Renormalisation group, function iterations and computer algebra ⋮ Random number generation with the recursion \(X_ t=X_{t-3p}\oplus X_{t-3q}\) ⋮ Probability to meet in the middle ⋮ Upper bounds for the Beyer ratios of linear congruential generators ⋮ Criteria for the assessment of random number generators ⋮ On the period length of congruential pseudorandom number sequences generated by inversions ⋮ A single-key access control scheme in information protection systems ⋮ Reconstruction of conditional expectations from product moments with applications ⋮ Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators ⋮ Dedekind-Carlitz polynomials as lattice-point enumerators in rational polyhedra ⋮ Distributional analysis of a generalization of the Pólya process ⋮ Linear relations between pattern sequences in a \(\langle q, r\rangle\)-numeration system ⋮ Practical algorithms for generating a random ordering of the elements of a weighted set ⋮ Primality test for numbers of the form \(A p^n + w_n\) ⋮ A stochastic Galerkin approach to uncertainty quantification in poroelastic media ⋮ Almost universal forgery attacks on AES-based MAC's ⋮ A space-efficient fast prime number sieve ⋮ Variance reduction for Bernoulli response variables in simulation ⋮ The limit behavior of sequences generated by parallel linear congruential generators ⋮ On the stability of polynomial transformations between Taylor, Bernstein and Hermite forms ⋮ Qualitative probabilistic inference under varied entropy levels ⋮ Golden ratio versus pi as random sequence sources for Monte Carlo integration ⋮ Quadratic congruential pseudorandom numbers: Distribution of lagged pairs ⋮ Upper bounds in spectral test for multiple recursive random number generators with missing terms ⋮ On Gauss-Kuz'min statistics for finite continued fractions ⋮ Solutions to the multi-dimensional Prouhet-Tarry-Escott problem resulting from composition of balanced morphisms ⋮ Efficient sampling of random permutations ⋮ Local bifurcations of critical periods for cubic Liénard equations with cubic damping ⋮ Efficient and optimal exponentiation in finite fields ⋮ On multiplicatively independent bases in cyclotomic number fields ⋮ On the accuracy of statistical procedures in Microsoft Excel 2003 ⋮ Feasibility problems for recurring tasks on one processor ⋮ BOTTOM-UP-HEAPSORT, and new variant of HEAPSORT beating, on an average, QUICKSORT (if \(n\) is not very small) ⋮ Generating random vectors in \((\mathbb Z/ p \mathbb Z)^d\) via an affine random process ⋮ Polynomial evaluation over finite fields: new algorithms and complexity bounds ⋮ A multiprecise integer arithmetic package ⋮ Factoring: algorithms, computations, and computers ⋮ Permutation statistics and the \(q,t\)-Catalan sequence ⋮ On \(d\)-orthogonality of the Sheffer systems associated to a convolution semigroup ⋮ Topics in computational algebraic number theory ⋮ Parallel use of multiplicative congruential random number generators ⋮ Obtaining the quantum Fourier transform from the classical FFT with QR decomposition ⋮ Universal codes as a basis for time series testing ⋮ Point sets and sequences with small discrepancy ⋮ Using information theory approach to randomness testing ⋮ An improved parallel algorithm for integer GCD ⋮ Optimal word chains for the Thue-Morse word ⋮ Gaussian limiting distributions for the number of components in combinatorial structures ⋮ Fast random generation of binary, t-ary and other types of trees ⋮ A utility based evaluation of logico-probabilistic systems ⋮ An algorithm for implicit interpolation ⋮ Fast computation of continued fractions ⋮ Recurrence relations for rational cubic methods. II: The Chebyshev method ⋮ Rough multisets and information multisystems ⋮ The \(r\)-Stirling numbers ⋮ The serial test for pseudo-random numbers generated by the linear congruential method ⋮ On the values of the Dedekind sum ⋮ The distribution of continued fraction approximations ⋮ Factoring on a computer ⋮ The techniques of trilinear aggregating and the recent progress in the asymptotic acceleration of matrix operations ⋮ On the resolution of index form equations in biquadratic number fields. II ⋮ An improved algorithm for mixed-radix conversion of residue numbers ⋮ Formal solutions of differential equations ⋮ Efficient sorting during repetitive statistical computations: Algorithms and an application ⋮ On the discrepancy of quadratic congruential pseudorandom numbers ⋮ Efficient, perfect polynomial random number generators ⋮ Rigorous numerics for nonlinear operators with tridiagonal dominant linear part ⋮ Chaos, complex transients and noise: illustration with a Kaldor model.

This page was built for publication: