scientific article; zbMATH DE number 3750146

Publication date 1981

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

Mathematics Subject Classification ID

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

Cited in

(only showing first 100 items - show all)

Relative merits of random number generators: Indirect approach
Formal modeling, performance estimation, and model checking of wireless sensor network algorithms in Real-Time Maude
Generating good pseudo-random numbers
Effective generation of subjectively random binary sequences
Approximability of minimum AND-circuits
High-performance hardware of the sliding-window method for parallel computation of modular exponentiations
Weighted random sampling with a reservoir
A carry-free algorithm for finding the greatest common divisor of two integers
Probabilistic encryption
Algebraic properties of cellular automata
Matrices and the structure of random number sequences
Solving algebraic problems with REDUCE
Some results on addition/subtraction chains
On the complexity of a pivot step of the revised simplex algorithm
Computing in general Abelian groups is hard
Quasi-gcd computations
Combinatorial cycles of a polynomial map over a commutative field
Recurrence relations based on minimization and maximization
On the structure of quadratic congruential sequences
Some distribution properties of 0,1-sequences
Factoring sparse multivariate polynomials
An application of factoring
Self-intersections of 1-dimensional random walks
Random sequence generation by cellular automata
The use of Chebyshev mixing to generate pseudo-random numbers
Application of the MuMATH(R) symbol manipulation system to chemically significant permutation groups
A multiple recursive nonlinear congruential pseudo random number generator
Generating quasi-random sequences from semi-random sources
Adventures in arithmetick, or: How to made good use of a Fourier transform
Rational functions with partial quotients of small degree in their continued fraction expansion
On expansion of algebraic functions in power and Puiseux series. I
Polynomial division and its computational complexity
Numerical evaluation of a multi-stream pseudo-random number generator
Algebraic complexity of computing polynomial zeros
Computer experiments for the analysis of extreme-value phenomena
Sequential and parallel complexity of approximate evaluation of polynomial zeros
Complexity of parallel matrix computations
Spectral properties of exact random solutions to Burgers' equation for modified Thomas initial conditions
Long range correlations in linear congruential generators
How to avoid logarithms in comparisons with uniform random variables
Uses and abuses of statistical simulation
The algebraic degree of geometric optimization problems
Statistical independence of nonlinear congruential pseudorandom numbers
Using information theory approach to randomness testing
A conditional likelihood ratio test for order restrictions in exponential families
A logarithmic Boolean time algorithm for parallel polynomial division
On expansion of algebraic functions in power and Puiseux series. II
A systolic algorithm for extended GCD computation
The lattice structure of pseudo-random vectors generated by matrix generators
On the relaxation time of Gauss' continued-fraction map. I: The Hilbert space approach (Koopmanism)
Is the data encryption standard a group? (Results of cycling experiments on DES)
Example of order and disorder: \(x_{n+1}=(Ax_ n+B)\,mod\,C\)
A remark on long-range correlations in multiplicative pseudo random number generators
Computing the determinant and the characteristic polynomial of a matrix via solving linear systems of equations
Calculation of the probability of eventual ruin by Beekman's convolution series
A note on word chains and regular languages
An efficient parallel algorithm for random sampling
Parallel processing of random number generation for Monte Carlo turbulence simulation
An unpredictability approach to finite-state randomness
PASCAL programs for identification of Lie algebras. I: RADICAL - a program to calculate the radical and nil radical of parameter-free and parameter-dependent Lie algebras
PASCAL programs for identification of Lie algebras. III: Levi decomposition and canonical basis
Geometry theorem proving by decomposition of quasi-algebraic sets: An application of the Ritt-Wu principle
The generation of random numbers that are probably prime
The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented algorithms
A necessary condition for the rationality of the zeta function of a regular language
ACORN - A new method for generating sequences of uniformly distributed pseudo-random numbers
An operator net model for distributed systems
Several extensively tested multiple recursive random number generators
Qualitative and asymptotic performance of SNP density estimators
Dynamical recognizers: real-time language recognition by analog computers
Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication
The influence of computers in the development of number theory
The bit-operation complexity of approximate evaluation of matrix and polynomial products using modular arithmetic
Factoring polynomials with rational coefficients
Fast matrix multiplication without APA-algorithms
Fractal geometry derived from complex bases
Automatic average-case analysis of algorithms
Recent trends in random number and random vector generation
On the number of term orders
Computation of discrete logarithms in prime fields
On practical algorithms for accelerated matrix multiplication
Constrained integer approximation to planar line intersection
An interactive identification scheme based on discrete logarithms and factoring
On fast multiplication of polynomials over arbitrary algebras
Generating binary trees at random
A heuristic irreducibility test for univariate polynomials
Polynomial time algorithms for sentences over number fields
Fast average-case pattern matching by multiplexing sparse tables
A Gröbner basis technique for Padé approximation
Computing GCD's by normalized division
Quasi-random subsets of \(\mathbb{Z}_ n\)
A universal statistical test for random bit generators
Shadowing and iterative interpolation for Čebyšev mixing transformations
Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs
The logarithmic distribution of leading digits and finitely additive measures
Numerical calculation of domains of analyticity for perturbation theories in the presence of small divisors
How many \(k\)-digit Fibonacci numbers do exist?
Dense polynomial multiplication with reduced array manipulation overhead
A parallel algorithm for exact solution of linear equations via congruence technique
Pseudorandom number generators for supercomputers and classical computers: A practical introduction

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3935355)