scientific article; zbMATH DE number 3750146

zbMATH Open0477.65002MaRDI QIDQ3935355FDOQ3935355

Publication date: 1981

Title of this publication is not available (Why is that?)

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

Mathematics Subject Classification ID

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

Cited In (only showing first 100 items - show all)

Efficient sampling of random permutations
Calculation of the Volterra kernels of nonlinear dynamic systems using an artificial neural network
The distribution of estimators after model selection:large and small sample results
A Search for Large Twin Prime Pairs
Difference equation approaches in evaluation of compound distributions
Combinatorial cycles of a polynomial map over a commutative field
High-accuracy numerical values in the Gauss-Kuzmin continued fraction problem
High-radix and bit recoding techniques for modular exponentiation
Quasilinear cellular automata
Bias in the number of steps in the Euclidean algorithm and a conjecture of Ito on Dedekind sums
Relative merits of random number generators: Indirect approach
Shrinking generators and statistical leakage
Stickelberger ideals of conductor \(p\) and their application
Batch RSA
On the autocorrelation structure of inversive congruential pseudorandom number sequences
Design of a linear systolic array for computing modular multiplication and squaring in \(\text{GF}(2^m)\)
On the reduction of a random basis
Irregular Primes and Cyclotomic Invariants to Four Million
Long range correlations in linear congruential generators
A numerical study of one-dimensional cellular automata
A clustering procedure based on the comparison between the \(k\) nearest neighbors graph and the minimal spanning tree.
Effective generation of subjectively random binary sequences
Analytic methods in asymptotic enumeration
Dynamical recognizers: real-time language recognition by analog computers
Correlation decay for an intermittent area-preserving map.
A random number generator based on the combination of four LCGs
Quasi-random subsets of \(\mathbb{Z}_ n\)
A one-parameter quadratic-base version of the Baillie-PSW probable prime test
Analysis of Euclidean algorithms for polynomials over finite fields
A test for multivariate structure
A numerical method to compute exactly the partition function with application to \(Z(n)\) theories in two dimensions.
An algorithmic view of pseudochaos
Fractal geometry derived from complex bases
Computing rational forms of integer matrices
A rigorous version of R. P. Brent's model for the binary Euclidean algorithm
Some models of relative error in products
The area-time complexity of the greatest common divisor problem: A lower bound
Some uses of microcomputers in number theory research
Renormalisation group, function iterations and computer algebra
A conditional likelihood ratio test for order restrictions in exponential families
Observations on the generation of permutations from random sequences
A carry-free algorithm for finding the greatest common divisor of two integers
Algebraic complexity of computing polynomial zeros
The influence of computers in the development of number theory
The spatial Hill four-body problem. I: An exploration of basic invariant sets
Upper bounds for the Beyer ratios of linear congruential generators
A single-key access control scheme in information protection systems
A multiple recursive nonlinear congruential pseudo random number generator
Partitions without small parts
A note on word chains and regular languages
Geometry theorem proving by decomposition of quasi-algebraic sets: An application of the Ritt-Wu principle
The lattice structure of pseudo-random vectors generated by matrix generators
Polynomial time algorithms for sentences over number fields
Golden ratio versus pi as random sequence sources for Monte Carlo integration
On the degrees of irreducible factors of polynomials over a finite field
RANDOM NUMBER GENERATION BY CELLULAR AUTOMATA WITH MEMORY
Satoh's algorithm in characteristic 2
Distribution properties of multiply-with-c arry random number generators
The limit behavior of sequences generated by parallel linear congruential generators
On Gauss-Kuz'min statistics for finite continued fractions
Solving the \(k\)-cardinality assignment problem by transformation
Numerical Solution of Some Classical Differential-Difference Equations
Some results on commutators in multigroup
Text compression using two-dimensional cellular automata
Speed-Up in Dynamic Programming
Counterexamples to the poset conjectures of Neggers, Stanley, and Stembridge
A new statement about the theorem determining the region of eigenvalues of stochastic matrices
Guaranteeing the diversity of number generators
Analysis of sliding window techniques for exponentiation
A second-order Monte Carlo method for the solution of the Ito stochastic differential equation
The ``clustered structure of the purines/pyrimidines distribution in DNA distinguishes systematically between coding and non-coding sequences
Local search heuristics for the multidimensional assignment problem
A multiprecise integer arithmetic package
Factoring: algorithms, computations, and computers
Camera placement in integer lattices
On the Computation of the Class Number of an Algebraic Number Field
Factoring on a computer
Sieve algorithms for perfect power testing
Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication
On practical algorithms for accelerated matrix multiplication
On \(d\)-orthogonality of the Sheffer systems associated to a convolution semigroup
On the complexity of inverting integer and polynomial matrices
Pattern sequences in \(\langle q,r\rangle\)-numeration systems
A comparative study of some pseudorandom number generators
Topics in computational algebraic number theory
Dedekind-Carlitz polynomials as lattice-point enumerators in rational polyhedra
Algebraic independence results related to \(\langle q,r\rangle\)-number systems
A new efficient factorization algorithm for polynomials over small finite fields
Optimal word chains for the Thue-Morse word
On a new class of pseudorandom numbers for simulation methods
Pseudorandom Vector Generation by the Multiple-Recursive Matrix Method
On pseudorandomness in families of sequences derived from the Legendre symbol
Testing Stream Ciphers by Finding the Longest Substring of a Given Density
Automatic derivation and implementation of fast convolution algorithms
Using the theory of cyclotomy to factor cyclotomic polynomials over finite fields
The techniques of trilinear aggregating and the recent progress in the asymptotic acceleration of matrix operations
Matrices and the structure of random number sequences
Linear fractional transformations of continued fractions with bounded partial quotients
Sequential and parallel complexity of approximate evaluation of polynomial zeros
From uniform distributions to Benford's law

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)