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
Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
Asymptotically Fast Factorization of Integers
Matrices in elimination theory
Numerical evaluation of the Evans function by Magnus integration
Algebraic properties of cellular automata
Remarks on the Schoof-Elkies-Atkin algorithm
A stochastic boundary forcing for dissipative particle dynamics
Combinatorial, ergodic and arithmetic properties of the Tribonacci substitution
BOTTOM-UP-HEAPSORT, and new variant of HEAPSORT beating, on an average, QUICKSORT (if \(n\) is not very small)
Efficient algorithms for Lempel-Ziv encoding
Mutually symmetric and complementary triplets: differences in their use distinguish systematically between coding and non-coding genomic sequences
Specified precision polynomial root isolation is in NC
Learning Poisson binomial distributions
The independence of two randomness properties of sequences over finite fields
Arithmetic properties of polyadic series with periodic coefficients
Remarks on some misconceptions about unequal probability sampling without replacement
Approximating the bandwidth via volume respecting embeddings
Random sequence generation by cellular automata
Computing Frobenius maps and factoring polynomials
One class of planar rational involutions
On the rapid computation of various polylogarithmic constants
High-performance hardware of the sliding-window method for parallel computation of modular exponentiations
Algorithms for sequential generation of combinatorial structures
The distribution of continued fraction approximations
Extending Stone duality to multisets and locally finite MV-algebras.
Probability to meet in the middle
Feasibility problems for recurring tasks on one processor
Optimal and nearly optimal algorithms for approximating polynomial zeros
Fast computation of continued fractions
On expansion of algebraic functions in power and Puiseux series. II
Uses and abuses of statistical simulation
On fuzzy bags and their application to flexible querying.
Mechanically proving termination using polynomial interpretations
Inversion in finite fields using logarithmic depth
Critical distances in pseudorandom sequences generated with composite moduli
Approximating rings of integers in number fields
Multibasic and mixed hypergeometric Gosper-type algorithms
A natural lattice basis problem with applications
On the stability of polynomial transformations between Taylor, Bernstein and Hermite forms

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)