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)

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
Rigorous Verification of Hopf Bifurcations via Desingularization and Continuation
An optimal message routing algorithm for double-loop networks
Random permutations on distributed, external and hierarchical memory
Linear systolic multiplier/squarer for fast exponentiation
On the Class of Erlang Mixtures with Risk Theoretic Applications
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
Point sets and sequences with small discrepancy
Automatic differentiation for Fourier series and the radii polynomial approach
Motif statistics.
Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
A remarkable \(q,t\)-Catalan sequence and \(q\)-Lagrange inversion
Quadratic congruential pseudorandom numbers: Distribution of triples
The quest for pi
Nonlinear and non-Gaussian state-space modeling with Monte Carlo simulations
Generating quasi-random sequences from semi-random sources
An efficient parallel algorithm for random sampling
Qualitative and asymptotic performance of SNP density estimators
Upper bounds in spectral test for multiple recursive random number generators with missing terms
Sequences of numbers generated by addition in formal groups and new primality and factorization tests
Generating binary trees at random
RVGEN: a tool for generation of random variates
An algebraic algorithm to isolate complex polynomial zeros using Sturm sequences
A geometric algorithm for winding number computation with complexity analysis
Properties and applications of the reciprocal logarithm numbers
Is the data encryption standard a group? (Results of cycling experiments on DES)
The algebraic degree of geometric optimization problems
Calculation of the probability of eventual ruin by Beekman's convolution series
Factoring polynomials modulo special primes
Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs
Approximability of minimum AND-circuits
Parallel use of multiplicative congruential random number generators
Fast algorithms for approximately counting mismatches
Factoring sparse multivariate polynomials
A study of 64-bit multipliers for Lehmer pseudorandom number generators
The Design of Maple's Sum-of-Products and POLY Data Structures for Representing Mathematical Objects
Local bifurcations of critical periods for cubic Liénard equations with cubic damping
On markov chain monte carlo methods for nonlinear and non-gaussian state-space models
Generating good pseudo-random numbers
Systematic searches for good multiple recursive random number generators
Numerical calculation of domains of analyticity for perturbation theories in the presence of small divisors
Optimal Random Sampling from Distributed Streams Revisited
On the Computation of Unit Groups and Class Groups of Totally Real Quartic Fields
Variants for the Hough transform for line detection
On the use of random walk models with spatially variable diffusivity
Uniform random number generation
PASCAL programs for identification of Lie algebras. III: Levi decomposition and canonical basis
The production recipes approach to modeling technological innovation: An application to learning by doing
Using information theory approach to randomness testing
Using combinatorial optimization in model-based trimmed clustering with cardinality constraints
Statistical mechanics of cellular automata
Computational Complexity of Fourier Transforms Over Finite Fields
Probabilistic encryption
Integer Variable χ–Based Ate Pairing
Efficient calculation of Stark-Heegner points via overconvergent modular symbols
Experimental Evaluation of Euler Sums
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

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)