scientific article; zbMATH DE number 3750146
zbMATH Open0477.65002MaRDI QIDQ3935355FDOQ3935355
Authors: Donald E. Knuth
Publication date: 1981
Title of this publication is not available (Why is that?)
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)
- On the resolution of index form equations in biquadratic number fields. II
- On the discrepancy of quadratic congruential pseudorandom numbers
- The adjustment function in ruin estimates under interest force
- An interactive identification scheme based on discrete logarithms and factoring
- Factoring polynomials using fewer random bits
- The rescaled VAR model with an application to mixed-frequency macroeconomic forecasting
- Reciprocity laws for Dedekind cotangent sums
- On the discrepancy of quadratic congruential pseudorandom numbers with power of two modulus
- Several extensively tested random number generators
- Equidistribution properties of quadratic congruential pseudorandom numbers
- Generating uniform random vectors in \(\mathbb Z^k_p\): the general case
- Fuzzy shadows
- Permutation statistics and the \(q,t\)-Catalan sequence
- Integration error over very long time spans
- Discrepancy bounds for nonoverlapping pairs of quadratic congruential pseudorandom numbers
- A Euclidean algorithm for normal bases
- Scalable and systolic architecture for computing double exponentiation over \(\text{GF}(2^m)\)
- Obtaining the quantum Fourier transform from the classical FFT with QR decomposition
- Simultaneous reduction of a lattice basis and its reciprocal basis
- Criteria for the assessment of random number generators
- On the randomized error of polynomial methods for eigenvector and eigenvalue estimates
- A remark on long-range correlations in multiplicative pseudo random number generators
- Parallel processing of random number generation for Monte Carlo turbulence simulation
- Numerical Computation of Transverse Homoclinic Orbits for Periodic Solutions of Delay Differential Equations
- Specification and analysis of the AER/NCA active network protocol suite in real-time Maude
- Satisfiability of algebraic circuits over sets of natural numbers
- Good random number generators are (not so) easy to find
- On the structure of parallelized random number sources
- A \(p\times p\) bit fraction model of binary floating point division and extremal rounding cases.
- Critical behavior in the computational cost of satisfiability testing
- Random number generators with long period and sound statistical properties
- A Nonlinear Congruential Pseudorandom Number Generator with Power of Two Modulus
- Chaos-induced true randomness
- Random lattices, threshold phenomena and efficient reduction algorithms.
- Rough multisets and information multisystems
- Decidability of semigroup identities in soluble groups
- Balance weighing: variations on a theme
- The Serial Test for Congruential Pseudorandom Numbers Generated by Inversions
- On the relaxation time of Gauss' continued-fraction map. I: The Hilbert space approach (Koopmanism)
- A necessary condition for the rationality of the zeta function of a regular language
- Bad lattice points
- An extended characterization of fuzzy bags
- Redundant integer representations and fast exponentiation
- Efficient lattice assessment for LCG and GLP parameter searches
- The arithmetic geometry of \(\mathrm{AdS_2}\) and its continuum limit
- Preuves de terminaison de systèmes de réécriture fondées sur les interprétations polynomiales. Une méthode basée sur le théorème de Sturm
- The serial test for pseudo-random numbers generated by the linear congruential method
- On the values of the Dedekind sum
- On the Periods of Generalized Fibonacci Recurrences
- The exhaustion of shared memory: Stochastic results
- An improved algorithm for mixed-radix conversion of residue numbers
- Efficient sorting during repetitive statistical computations: Algorithms and an application
- Efficient, perfect polynomial random number generators
- Fast matrix multiplication without APA-algorithms
- On the period length of congruential pseudorandom number sequences generated by inversions
- A space-efficient fast prime number sieve
- On the arithmetic of phase locking: coupled neurons as a lattice on \(\mathbb{R}^{2}\)
- Computing in general Abelian groups is hard
- A parallel search for good lattice points using LLL-spectral tests
- Statistical independence of nonlinear congruential pseudorandom numbers
- Variance reduction for Bernoulli response variables in simulation
- Computing the number of points on an elliptic curve over a finite field: algorithmic aspects
- An algorithm for implicit interpolation
- 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
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)