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
Applying quick exponentiation for block upper triangular matrices
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
Rigorous numerics for nonlinear operators with tridiagonal dominant linear part
A universal statistical test for random bit generators
Constructing hyperelliptic curves of genus 2 suitable for cryptography
The Probability That a Numerical Analysis Problem is Difficult
A new algorithm for constructing large Carmichael numbers
Some remarks on a probability limit theorem for continued fractions
Extended GCD and Hermite Normal Form Algorithms via Lattice Basis Reduction
The complexity of intersecting finite automata having few final states
Title not available (Why is that?)
Scalable generation of scale-free graphs
Quadratic congruential pseudorandom numbers: Distribution of lagged pairs
A new test for randomness and its application to some cryptographic problems
Analysis of PSLQ, an integer relation finding algorithm
Statistical Independence of a New Class of Inversive Congruential Pseudorandom Numbers
Weighted random sampling with a reservoir
Polynomial evaluation over finite fields: new algorithms and complexity bounds
Tables of linear congruential generators of different sizes and good lattice structure
Computability and complexity of ray tracing
Factoring polynomials with rational coefficients
On fast multiplication of polynomials over arbitrary algebras
Phenomenlogy of nonlocal cellular automata
Black-box polynomial resultants
A simple approach for generating RSA keys
Gaussian limiting distributions for the number of components in combinatorial structures
HECC Goes Embedded: An Area-Efficient Implementation of HECC
Improvements on the accelerated integer GCD algorithm
How to build a device that cannot be built
A new efficient algorithm for computing Gröbner bases \((F_4)\)
Recurrence relations for rational cubic methods. II: The Chebyshev method
An optimal message routing algorithm for double-loop networks
Random permutations on distributed, external and hierarchical memory
Linear systolic multiplier/squarer for fast exponentiation
The \(r\)-Stirling numbers
FFT-like multiplication of linear differential operators
Random number generation with the recursion \(X_ t=X_{t-3p}\oplus X_{t-3q}\)
Fast random generation of binary, t-ary and other types of trees
Feedback shift registers, 2-adic span, and combiners with memory
Quasi-gcd computations
Distributional analysis of a generalization of the Pólya process

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)