scientific article; zbMATH DE number 3750146
From MaRDI portal
Publication:3935355
surveyEuclidean algorithmstatistical testsfloating-point arithmeticspectral testexercisesmultiple-precision arithmeticpolynomial arithmeticseminumerical algorithmsuniform random numberslinear congruence relationsradix conversion
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)- Analytic methods in asymptotic enumeration
- The influence of computers in the development of number theory
- Relative merits of random number generators: Indirect approach
- Efficient sampling of random permutations
- Combinatorial cycles of a polynomial map over a commutative field
- Observations on the generation of permutations from random sequences
- Irregular Primes and Cyclotomic Invariants to Four Million
- The spatial Hill four-body problem. I: An exploration of basic invariant sets
- RANDOM NUMBER GENERATION BY CELLULAR AUTOMATA WITH MEMORY
- Upper bounds for the Beyer ratios of linear congruential generators
- Golden ratio versus pi as random sequence sources for Monte Carlo integration
- A single-key access control scheme in information protection systems
- Long range correlations in linear congruential generators
- A Search for Large Twin Prime Pairs
- A carry-free algorithm for finding the greatest common divisor of two integers
- A numerical study of one-dimensional cellular automata
- The distribution of estimators after model selection:large and small sample results
- The limit behavior of sequences generated by parallel linear congruential generators
- A rigorous version of R. P. Brent's model for the binary Euclidean algorithm
- A multiple recursive nonlinear congruential pseudo random number generator
- Some models of relative error in products
- The area-time complexity of the greatest common divisor problem: A lower bound
- On Gauss-Kuz'min statistics for finite continued fractions
- Some uses of microcomputers in number theory research
- Renormalisation group, function iterations and computer algebra
- Stickelberger ideals of conductor \(p\) and their application
- Solving the \(k\)-cardinality assignment problem by transformation
- Design of a linear systolic array for computing modular multiplication and squaring in \(\text{GF}(2^m)\)
- An algorithmic view of pseudochaos
- Dynamical recognizers: real-time language recognition by analog computers
- High-accuracy numerical values in the Gauss-Kuzmin continued fraction problem
- Fractal geometry derived from complex bases
- Correlation decay for an intermittent area-preserving map.
- A random number generator based on the combination of four LCGs
- Batch RSA
- 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
- Partitions without small parts
- A conditional likelihood ratio test for order restrictions in exponential families
- Bias in the number of steps in the Euclidean algorithm and a conjecture of Ito on Dedekind sums
- Satoh's algorithm in characteristic 2
- Effective generation of subjectively random binary sequences
- Algebraic complexity of computing polynomial zeros
- On the degrees of irreducible factors of polynomials over a finite field
- Difference equation approaches in evaluation of compound distributions
- Analysis of Euclidean algorithms for polynomials over finite fields
- A numerical method to compute exactly the partition function with application to \(Z(n)\) theories in two dimensions.
- High-radix and bit recoding techniques for modular exponentiation
- A test for multivariate structure
- Distribution properties of multiply-with-c arry random number generators
- Quasi-random subsets of \(\mathbb{Z}_ n\)
- A clustering procedure based on the comparison between the \(k\) nearest neighbors graph and the minimal spanning tree.
- On the autocorrelation structure of inversive congruential pseudorandom number sequences
- Calculation of the Volterra kernels of nonlinear dynamic systems using an artificial neural network
- Shrinking generators and statistical leakage
- A one-parameter quadratic-base version of the Baillie-PSW probable prime test
- On the reduction of a random basis
- Quasilinear cellular automata
- Polynomial time algorithms for sentences over number fields
- Computing rational forms of integer matrices
- An efficient parallel algorithm for random sampling
- Factoring polynomials with rational coefficients
- On the Computation of Unit Groups and Class Groups of Totally Real Quartic Fields
- Scalable generation of scale-free graphs
- Qualitative and asymptotic performance of SNP density estimators
- A new test for randomness and its application to some cryptographic problems
- Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs
- On fast multiplication of polynomials over arbitrary algebras
- Efficient calculation of Stark-Heegner points via overconvergent modular symbols
- How to build a device that cannot be built
- A study of 64-bit multipliers for Lehmer pseudorandom number generators
- On markov chain monte carlo methods for nonlinear and non-gaussian state-space models
- Weighted random sampling with a reservoir
- Fast random generation of binary, t-ary and other types of trees
- Polynomial evaluation over finite fields: new algorithms and complexity bounds
- Using combinatorial optimization in model-based trimmed clustering with cardinality constraints
- Black-box polynomial resultants
- A simple approach for generating RSA keys
- Phenomenlogy of nonlocal cellular automata
- Constructing hyperelliptic curves of genus 2 suitable for cryptography
- Probabilistic encryption
- The Probability That a Numerical Analysis Problem is Difficult
- Extended GCD and Hermite Normal Form Algorithms via Lattice Basis Reduction
- Automatic differentiation for Fourier series and the radii polynomial approach
- Upper bounds in spectral test for multiple recursive random number generators with missing terms
- Variants for the Hough transform for line detection
- Sequences of numbers generated by addition in formal groups and new primality and factorization tests
- Integer Variable χ–Based Ate Pairing
- Motif statistics.
- Generating good pseudo-random numbers
- FFT-like multiplication of linear differential operators
- Generating binary trees at random
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- Feedback shift registers, 2-adic span, and combiners with memory
- The algebraic degree of geometric optimization problems
- Gaussian limiting distributions for the number of components in combinatorial structures
- Analysis of PSLQ, an integer relation finding algorithm
- Optimal Random Sampling from Distributed Streams Revisited
- On the use of random walk models with spatially variable diffusivity
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)