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)
- Numerical Solution of Some Classical Differential-Difference Equations
- Some results on commutators in multigroup
- Text compression using two-dimensional cellular automata
- Speed-Up in Dynamic Programming
- Counterexamples to the poset conjectures of Neggers, Stanley, and Stembridge
- A new statement about the theorem determining the region of eigenvalues of stochastic matrices
- Guaranteeing the diversity of number generators
- Analysis of sliding window techniques for exponentiation
- A second-order Monte Carlo method for the solution of the Ito stochastic differential equation
- The ``clustered structure of the purines/pyrimidines distribution in DNA distinguishes systematically between coding and non-coding sequences
- Local search heuristics for the multidimensional assignment problem
- A multiprecise integer arithmetic package
- Factoring: algorithms, computations, and computers
- Camera placement in integer lattices
- On the Computation of the Class Number of an Algebraic Number Field
- Factoring on a computer
- Sieve algorithms for perfect power testing
- Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication
- On practical algorithms for accelerated matrix multiplication
- On \(d\)-orthogonality of the Sheffer systems associated to a convolution semigroup
- On the complexity of inverting integer and polynomial matrices
- Pattern sequences in \(\langle q,r\rangle\)-numeration systems
- A comparative study of some pseudorandom number generators
- Topics in computational algebraic number theory
- Dedekind-Carlitz polynomials as lattice-point enumerators in rational polyhedra
- Algebraic independence results related to \(\langle q,r\rangle\)-number systems
- A new efficient factorization algorithm for polynomials over small finite fields
- Optimal word chains for the Thue-Morse word
- On a new class of pseudorandom numbers for simulation methods
- Pseudorandom Vector Generation by the Multiple-Recursive Matrix Method
- On pseudorandomness in families of sequences derived from the Legendre symbol
- Testing Stream Ciphers by Finding the Longest Substring of a Given Density
- Automatic derivation and implementation of fast convolution algorithms
- Using the theory of cyclotomy to factor cyclotomic polynomials over finite fields
- The techniques of trilinear aggregating and the recent progress in the asymptotic acceleration of matrix operations
- Matrices and the structure of random number sequences
- Linear fractional transformations of continued fractions with bounded partial quotients
- Sequential and parallel complexity of approximate evaluation of polynomial zeros
- From uniform distributions to Benford's law
- Chaos, complex transients and noise: illustration with a Kaldor model.
- Fast Parallel Computation of Hermite and Smith Forms of Polynomial Matrices
- Towards minimal addition chains using ant colony optimisation
- Several extensively tested multiple recursive random number generators
- Extraction and verification of programs by analysis of formal proofs
- Fibonacci hypercube
- The Move-to-Front Rule: A Case Study for two Perfect Sampling Algorithms
- Stochastic investigations of pseudo-random number generators
- Decomposition with simulated division for efficiently generating random numbers
- Detecting perfect powers in essentially linear time
- ACORN - A new method for generating sequences of uniformly distributed pseudo-random numbers
- A heuristic irreducibility test for univariate polynomials
- On the Period Length of Pseudorandom Vector Sequences Generated by Matrix Generators
- Kolmogorov complexity in perspective. I: Information theory and randomness
- Irregular Primes to One Million
- Algorithmic Procedures
- Characterizations of some polynomial variance functions by \(d\)-pseudo-orthogonality
- Recent trends in random number and random vector generation
- Distinct Degree Factorizations for Polynomials over a Finite Field
- Almost universal forgery attacks on AES-based MAC's
- Exact site-percolation probability on the square lattice
- Title not available (Why is that?)
- Title not available (Why is that?)
- Linear relations between pattern sequences in a \(\langle q, r\rangle\)-numeration system
- Qualitative probabilistic inference under varied entropy levels
- A Rigorous Subexponential Algorithm For Computation of Class Groups
- Integers with a small number of minimal addition chains
- Addition chains -- an erratic sequence
- Efficient computation of addition chains
- VLSI architecture of a cellular automata machine
- Efficient and optimal exponentiation in finite fields
- A utility based evaluation of logico-probabilistic systems
- A stochastic Galerkin approach to uncertainty quantification in poroelastic media
- A space-efficient fast prime number sieve
- Solutions to the multi-dimensional Prouhet-Tarry-Escott problem resulting from composition of balanced morphisms
- On multiplicatively independent bases in cyclotomic number fields
- Fast and efficient parallel evaluation of the zeros of a polynomial having only real zeros
- Polynomial division and its computational complexity
- Complexity of parallel matrix computations
- Computing the determinant and the characteristic polynomial of a matrix via solving linear systems of equations
- Automatic average-case analysis of algorithms
- Real computations with fake numbers
- Maximally equidistributed combined Tausworthe generators
- 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
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)