scientific article

zbMath0477.65002MaRDI QIDQ3935355

Donald E. Knuth

Publication date: 1981

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

surveyspectral teststatistical testsEuclidean algorithmfloating-point arithmeticexercisesmultiple-precision arithmeticpolynomial arithmeticseminumerical algorithmsuniform random numberslinear congruence relationsradix conversion

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Probabilistic methods, stochastic differential equations (65Cxx) Error analysis and interval analysis (65Gxx)

Related Items

On the complexity of pattern matching for highly compressed two-dimensional texts., Lower bounds in spectral tests for vectors of nonsuccessive values produced by multiple recursive generator with some zero multipliers, Solving the \(k\)-cardinality assignment problem by transformation, A new test for randomness and its application to some cryptographic problems, On minimizing distance by the road less traveled, The lattice structure of nonlinear congruential pseudorandom numbers, A conference key distribution system based on cross-product, An improved binary algorithm for RSA, Computing Frobenius maps and factoring polynomials, Sieve algorithms for perfect power testing, A new efficient factorization algorithm for polynomials over small finite fields, High-accuracy numerical values in the Gauss-Kuzmin continued fraction problem, A general method for computer-assisted proofs of periodic solutions in delay differential problems, Parameterization of unstable manifolds for DDEs: formal series solutions and validated error bounds, Algorithm for error-free determination of the variance of all contiguous subsequences and fixed-length contiguous subsequences for a sequence of industrial measurement data, Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming, Rotation invariant patterns for a nonlinear Laplace-Beltrami equation: a Taylor-Chebyshev series approach, On a new class of pseudorandom numbers for simulation methods, Hardware implementation of a GFSR pseudo-random number generator, Testing nonlinear operators, A stochastic boundary forcing for dissipative particle dynamics, Accurate floating-point summation: a new approach, Rep-tiling Euclidean space, Discrepancy bounds for nonoverlapping pairs of quadratic congruential pseudorandom numbers, The shifted number system for fast linear algebra on integer matrices, Analysis of sliding window techniques for exponentiation, Primality testing of large numbers in Maple, Improvement of efficiency in generating random \(U(1)\) variables with Boltzmann distribution (von Mises distribution revisited), On a possible error of type II in statistical evaluation of pseudo-random number generators, Computing the number of points on an elliptic curve over a finite field: algorithmic aspects, Redundant integer representations and fast exponentiation, A remarkable \(q,t\)-Catalan sequence and \(q\)-Lagrange inversion, Variants for the Hough transform for line detection, Analytic methods in asymptotic enumeration, Quadratic congruential pseudorandom numbers: Distribution of triples, Optimal and nearly optimal algorithms for approximating polynomial zeros, Modeling and simulation of communication systems: An overview, Mutually symmetric and complementary triplets: differences in their use distinguish systematically between coding and non-coding genomic sequences, Overflow and underflow in multiplication and division, Chaotic motions in the restricted four body problem via Devaney's saddle-focus homoclinic tangle theorem, Solving the rectangular assignment problem and applications, Spectral test of the MIXMAX random number generators, An integrated Runge-Kutta root finding method for reliable collision detection in multibody systems, Lengths of words accepted by nondeterministic finite automata, On the subfield subcodes of Hermitian codes, Improved polynomial remainder sequences for Ore polynomials, A novel true random number generator based on mouse movement and a one-dimensional chaotic map, On the accuracy of statistical procedures in Microsoft Excel 97., Text compression using two-dimensional cellular automata, Analysis of the variable length nonzero window method for exponentiation, A numerical method to compute exactly the partition function with application to \(Z(n)\) theories in two dimensions., The Thue-Morse and Rudin-Shapiro sequences at primes in principal number fields, Correlation decay for an intermittent area-preserving map., Rounding errors in random number generators, Radix expansions and the uniform distribution, Multibasic and mixed hypergeometric Gosper-type algorithms, The production recipes approach to modeling technological innovation: An application to learning by doing, Automatic differentiation for Fourier series and the radii polynomial approach, Spatial periodic orbits in the equilateral circular restricted four-body problem: computer-assisted proofs of existence, Efficient dissection of bicomposite problems with cryptanalytic applications, A binary algorithm for solving n by n systems of integer equations, Pattern sequences in \(\langle q,r\rangle\)-numeration systems, The arithmetic geometry of \(\mathrm{AdS_2}\) and its continuum limit, Reciprocity formulas for Hall-Wilson-Zagier type Hardy-Berndt sums, Matrices in elimination theory, \(q\)-linear functions and algebraic independence., Optimal data compression algorithm, Shrinking generators and statistical leakage, Information delivery through broadcasting in satellite communication networks, A scheme and concept for limited inheritance of privileges in a user hierarchy, Difference equation approaches in evaluation of compound distributions, Sequences of numbers generated by addition in formal groups and new primality and factorization tests, Intuitionistic fuzzy multi-polygroups, Maximum-length sequences, cellular automata, and random numbers, Optimal characteristic polynomials for digital multistep pseudorandom numbers, A numerical study of one-dimensional cellular automata, Algorithms for sequential generation of combinatorial structures, Extraction and verification of programs by analysis of formal proofs, A database I/0 server with a learning expert system, Fast and efficient parallel evaluation of the zeros of a polynomial having only real zeros, An adaptation of a root finding method to searching ordered disk files revisited, Deterministic irreducibility testing of polynomials over large finite fields, The spatial Hill four-body problem. I: An exploration of basic invariant sets, A general result for selecting balanced unequal probability samples from a stream, The operator of inversion as an everywhere continuous nowhere differentiable function, Counting problems relating to a theorem of Dirichlet, Chaos-induced true randomness, Finite element approximation of invariant manifolds by the parameterization method, Euclid's proof of the infinitude of primes: distorted, clarified, made obsolete, and confirmed in modern mathematics, Random lattices, threshold phenomena and efficient reduction algorithms., Motif statistics., A \(p\times p\) bit fraction model of binary floating point division and extremal rounding cases., Guaranteeing the diversity of number generators, Semi-device-independent randomness certification with partially free random sources using \(4\rightarrow 1\) quantum random access code, Learning Poisson binomial distributions, Variance estimator for fractional diffusions with variance and drift depending on time, Fourier-Dedekind sums and an extension of Rademacher reciprocity, Computing rational forms of integer matrices, Arithmetic properties of polyadic series with periodic coefficients, Dynamic threshold secret reconstruction and its application to the threshold cryptography, Combinatorial cycles of a polynomial map over a commutative field, Recurrence relations based on minimization and maximization, On the structure of quadratic congruential sequences, Some distribution properties of 0,1-sequences, Factoring sparse multivariate polynomials, An application of factoring, Self-intersections of 1-dimensional random walks, Random sequence generation by cellular automata, The use of Chebyshev mixing to generate pseudo-random numbers, Application of the MuMATH(R) symbol manipulation system to chemically significant permutation groups, A multiple recursive nonlinear congruential pseudo random number generator, Generating quasi-random sequences from semi-random sources, Adventures in arithmetick, or: How to made good use of a Fourier transform, Rational functions with partial quotients of small degree in their continued fraction expansion, On expansion of algebraic functions in power and Puiseux series. I, Polynomial division and its computational complexity, Numerical evaluation of a multi-stream pseudo-random number generator, Algebraic complexity of computing polynomial zeros, Computer experiments for the analysis of extreme-value phenomena, Sequential and parallel complexity of approximate evaluation of polynomial zeros, Complexity of parallel matrix computations, Spectral properties of exact random solutions to Burgers' equation for modified Thomas initial conditions, Long range correlations in linear congruential generators, How to avoid logarithms in comparisons with uniform random variables, Uses and abuses of statistical simulation, The algebraic degree of geometric optimization problems, Statistical independence of nonlinear congruential pseudorandom numbers, A conditional likelihood ratio test for order restrictions in exponential families, A logarithmic Boolean time algorithm for parallel polynomial division, On expansion of algebraic functions in power and Puiseux series. II, A systolic algorithm for extended GCD computation, The lattice structure of pseudo-random vectors generated by matrix generators, On the relaxation time of Gauss' continued-fraction map. I: The Hilbert space approach (Koopmanism), Is the data encryption standard a group? (Results of cycling experiments on DES), Example of order and disorder: \(x_{n+1}=(Ax_ n+B)\,mod\,C\), A remark on long-range correlations in multiplicative pseudo random number generators, Computing the determinant and the characteristic polynomial of a matrix via solving linear systems of equations, Calculation of the probability of eventual ruin by Beekman's convolution series, A note on word chains and regular languages, An efficient parallel algorithm for random sampling, Parallel processing of random number generation for Monte Carlo turbulence simulation, An unpredictability approach to finite-state randomness, PASCAL programs for identification of Lie algebras. I: RADICAL - a program to calculate the radical and nil radical of parameter-free and parameter-dependent Lie algebras, PASCAL programs for identification of Lie algebras. III: Levi decomposition and canonical basis, Geometry theorem proving by decomposition of quasi-algebraic sets: An application of the Ritt-Wu principle, The generation of random numbers that are probably prime, The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented \(\lambda\) algorithms, A necessary condition for the rationality of the zeta function of a regular language, ACORN - A new method for generating sequences of uniformly distributed pseudo-random numbers, An operator net model for distributed systems, Several extensively tested multiple recursive random number generators, Qualitative and asymptotic performance of SNP density estimators, Dynamical recognizers: real-time language recognition by analog computers, Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication, The influence of computers in the development of number theory, The bit-operation complexity of approximate evaluation of matrix and polynomial products using modular arithmetic, Factoring polynomials with rational coefficients, Fast matrix multiplication without APA-algorithms, Fractal geometry derived from complex bases, Automatic average-case analysis of algorithms, Recent trends in random number and random vector generation, On the number of term orders, Computation of discrete logarithms in prime fields, On practical algorithms for accelerated matrix multiplication, Constrained integer approximation to planar line intersection, An interactive identification scheme based on discrete logarithms and factoring, On fast multiplication of polynomials over arbitrary algebras, Generating binary trees at random, A heuristic irreducibility test for univariate polynomials, Polynomial time algorithms for sentences over number fields, Fast average-case pattern matching by multiplexing sparse tables, A Gröbner basis technique for Padé approximation, Computing GCD's by normalized division, Quasi-random subsets of \(\mathbb{Z}_ n\), A universal statistical test for random bit generators, Shadowing and iterative interpolation for Čebyšev mixing transformations, Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs, The logarithmic distribution of leading digits and finitely additive measures, Numerical calculation of domains of analyticity for perturbation theories in the presence of small divisors, Using combinatorial optimization in model-based trimmed clustering with cardinality constraints, Properties and applications of the reciprocal logarithm numbers, Satisfiability of algebraic circuits over sets of natural numbers, Quasilinear cellular automata, On the arithmetic of phase locking: coupled neurons as a lattice on \(\mathbb{R}^{2}\), Relative merits of random number generators: Indirect approach, Formal modeling, performance estimation, and model checking of wireless sensor network algorithms in Real-Time Maude, Generating good pseudo-random numbers, Effective generation of subjectively random binary sequences, Approximability of minimum AND-circuits, High-performance hardware of the sliding-window method for parallel computation of modular exponentiations, Weighted random sampling with a reservoir, A carry-free algorithm for finding the greatest common divisor of two integers, Probabilistic encryption, Algebraic properties of cellular automata, Matrices and the structure of random number sequences, Solving algebraic problems with REDUCE, Some results on addition/subtraction chains, On the complexity of a pivot step of the revised simplex algorithm, Computing in general Abelian groups is hard, Quasi-gcd computations, A parallel search for good lattice points using LLL-spectral tests, Scalable generation of scale-free graphs, Black-box polynomial resultants, A simple approach for generating RSA keys, Improvements on the accelerated integer GCD algorithm, How to build a device that cannot be built, An optimal message routing algorithm for double-loop networks, Random permutations on distributed, external and hierarchical memory, Linear systolic multiplier/squarer for fast exponentiation, Generating uniform random vectors in \(\mathbb Z^k_p\): the general case, Parameterization of slow-stable manifolds and their invariant vector bundles: theory and numerical implementation, A Euclidean algorithm for normal bases, Scalable and systolic architecture for computing double exponentiation over \(\text{GF}(2^m)\), Mechanically proving termination using polynomial interpretations, Temporal correlations and device-independent randomness, The complexity of intersecting finite automata having few final states, Specification and analysis of the AER/NCA active network protocol suite in real-time Maude, Towards minimal addition chains using ant colony optimisation, Applying quick exponentiation for block upper triangular matrices, Automatic derivation and implementation of fast convolution algorithms, On Prouhet's solution to the equal powers problem, The independence of two randomness properties of sequences over finite fields, On the complexity of inverting integer and polynomial matrices, A geometric algorithm for winding number computation with complexity analysis, A rigorous version of R. P. Brent's model for the binary Euclidean algorithm, Some models of relative error in products, Factoring polynomials modulo special primes, The area-time complexity of the greatest common divisor problem: A lower bound, One class of planar rational involutions, Analysis of Euclidean algorithms for polynomials over finite fields, Some uses of microcomputers in number theory research, Factoring polynomials using fewer random bits, Renormalisation group, function iterations and computer algebra, Random number generation with the recursion \(X_ t=X_{t-3p}\oplus X_{t-3q}\), Probability to meet in the middle, Upper bounds for the Beyer ratios of linear congruential generators, Criteria for the assessment of random number generators, On the period length of congruential pseudorandom number sequences generated by inversions, A single-key access control scheme in information protection systems, Reconstruction of conditional expectations from product moments with applications, Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators, Dedekind-Carlitz polynomials as lattice-point enumerators in rational polyhedra, Distributional analysis of a generalization of the Pólya process, Linear relations between pattern sequences in a \(\langle q, r\rangle\)-numeration system, Practical algorithms for generating a random ordering of the elements of a weighted set, Primality test for numbers of the form \(A p^n + w_n\), A stochastic Galerkin approach to uncertainty quantification in poroelastic media, Almost universal forgery attacks on AES-based MAC's, A space-efficient fast prime number sieve, Variance reduction for Bernoulli response variables in simulation, The limit behavior of sequences generated by parallel linear congruential generators, On the stability of polynomial transformations between Taylor, Bernstein and Hermite forms, Qualitative probabilistic inference under varied entropy levels, Golden ratio versus pi as random sequence sources for Monte Carlo integration, Quadratic congruential pseudorandom numbers: Distribution of lagged pairs, Upper bounds in spectral test for multiple recursive random number generators with missing terms, On Gauss-Kuz'min statistics for finite continued fractions, Solutions to the multi-dimensional Prouhet-Tarry-Escott problem resulting from composition of balanced morphisms, Efficient sampling of random permutations, Local bifurcations of critical periods for cubic Liénard equations with cubic damping, Efficient and optimal exponentiation in finite fields, On multiplicatively independent bases in cyclotomic number fields, On the accuracy of statistical procedures in Microsoft Excel 2003, Feasibility problems for recurring tasks on one processor, BOTTOM-UP-HEAPSORT, and new variant of HEAPSORT beating, on an average, QUICKSORT (if \(n\) is not very small), Generating random vectors in \((\mathbb Z/ p \mathbb Z)^d\) via an affine random process, Polynomial evaluation over finite fields: new algorithms and complexity bounds, A multiprecise integer arithmetic package, Factoring: algorithms, computations, and computers, Permutation statistics and the \(q,t\)-Catalan sequence, On \(d\)-orthogonality of the Sheffer systems associated to a convolution semigroup, Topics in computational algebraic number theory, Parallel use of multiplicative congruential random number generators, Obtaining the quantum Fourier transform from the classical FFT with QR decomposition, Universal codes as a basis for time series testing, Point sets and sequences with small discrepancy, Using information theory approach to randomness testing, An improved parallel algorithm for integer GCD, Optimal word chains for the Thue-Morse word, Gaussian limiting distributions for the number of components in combinatorial structures, Fast random generation of binary, t-ary and other types of trees, A utility based evaluation of logico-probabilistic systems, An algorithm for implicit interpolation, Fast computation of continued fractions, Recurrence relations for rational cubic methods. II: The Chebyshev method, Rough multisets and information multisystems, The \(r\)-Stirling numbers, The serial test for pseudo-random numbers generated by the linear congruential method, On the values of the Dedekind sum, The distribution of continued fraction approximations, Factoring on a computer, The techniques of trilinear aggregating and the recent progress in the asymptotic acceleration of matrix operations, On the resolution of index form equations in biquadratic number fields. II, An improved algorithm for mixed-radix conversion of residue numbers, Formal solutions of differential equations, Efficient sorting during repetitive statistical computations: Algorithms and an application, On the discrepancy of quadratic congruential pseudorandom numbers, Efficient, perfect polynomial random number generators, Rigorous numerics for nonlinear operators with tridiagonal dominant linear part, Chaos, complex transients and noise: illustration with a Kaldor model., On shooting methods for the discrete Helmholtz equation with constant coefficients, Computability and complexity of ray tracing, A depth-first search routing algorithm for star graphs and its performance evaluation, Specified precision polynomial root isolation is in NC, Computing matrix-valued Nevanlinna-Pick interpolation, Uniform generation of forests of restricted height, Camera placement in integer lattices, A chained-matrices approach for parallel computation of continued fractions and its applications, A key-exchange protocol using real quadratic fields, Calculation of the Volterra kernels of nonlinear dynamic systems using an artificial neural network, Unification in partially commutative semigroups, Computation of domains of analyticity for some perturbative expansions of mechanics, Efficient computation of addition chains, Hashing lazy numbers, Several extensively tested random number generators, Decomposition with simulated division for efficiently generating random numbers, On the discrepancy of quadratic congruential pseudorandom numbers with power of two modulus, Factoring multivariate integral polynomials, Prime power graphs for groups of Lie type, An introduction to pseudo-linear algebra, VLSI architecture of a cellular automata machine, Equidistribution properties of quadratic congruential pseudorandom numbers, A universal GFSR random number generator for personal computers, A comparative study of some pseudorandom number generators, The quest for pi, A parallel Poisson generator using parallel prefix, Batch RSA, Feedback shift registers, 2-adic span, and combiners with memory, On the lattice structure of pseudo random numbers generated by the modified inversive congruential generator with modulus \(2^ \alpha\), On the structure of parallelized random number sources, Systematic searches for good multiple recursive random number generators, Algebraic and numerical techniques for the computation of matrix determinants, The ``clustered structure of the purines/pyrimidines distribution in DNA distinguishes systematically between coding and non-coding sequences, A new statement about the theorem determining the region of eigenvalues of stochastic matrices, Nonlinear and non-Gaussian state-space modeling with Monte Carlo simulations, Running programs backwards: The logical inversion of imperative computation, The three-fold nested random effects model, Phenomenlogy of nonlocal cellular automata, The adjustment function in ruin estimates under interest force, On the randomized error of polynomial methods for eigenvector and eigenvalue estimates, Linear fractional transformations of continued fractions with bounded partial quotients, Normal numbers and sources for BPP, An improved genetic algorithm for developing deterministic OTP key generator, A random number generator based on the combination of four LCGs, Phirsa: exploiting the computing power of vector instructions on Intel Xeon Phi for RSA, Theory of analogous force on number sets, On fuzzy bags and their application to flexible querying., Performance of Gauss implicit Runge-Kutta methods on separable Hamiltonian systems., A clustering procedure based on the comparison between the \(k\) nearest neighbors graph and the minimal spanning tree., Computation of the Iwasawa invariants of certain real abelian fields., Extending Stone duality to multisets and locally finite MV-algebras., Evaluation schemes in the ring of quaternionic polynomials, Sampling in space restricted settings, How many \(k\)-digit Fibonacci numbers do exist?, Dense polynomial multiplication with reduced array manipulation overhead, A parallel algorithm for exact solution of linear equations via congruence technique, Pseudorandom number generators for supercomputers and classical computers: A practical introduction, A randomness test for block ciphers, On the use of random walk models with spatially variable diffusivity, Approximating rings of integers in number fields, Uniform random number generation, Random number generators with long period and sound statistical properties, An algorithmic view of pseudochaos, Single precision computation of the sign of algebraic predicates, Runge-Kutta methods for quadratic ordinary differential equations, A probable prime test with high confidence, Good rotations, The maximum negative binomial distribution, An algebraic algorithm to isolate complex polynomial zeros using Sturm sequences, Computation in artificially evolved, non-uniform cellular automata, On perturbations of the Mandelbrot map, Approximating the bandwidth via volume respecting embeddings, A new efficient algorithm for computing Gröbner bases \((F_4)\), Finding the radical of matrix algebras using Fitting decompositions, On the degrees of irreducible factors of polynomials over a finite field, Recent developments in primality proving, Good random number generators are (not so) easy to find, Euler pseudoprime polynomials and strong pseudoprime polynomials, Integers with a small number of minimal addition chains, Fuzzy shadows, Computing the cumulative distribution function of the Kolmogorov-Smirnov statistic., Numerical experiments on billiards., Inverse method for identifying the underlying crack distribution in plates with random strengths, Simultaneous reduction of a lattice basis and its reciprocal basis, Symmetry stabilization for fast discrete monomial transforms and polynomial evaluation, A design of fast pipelined modular multiplier based on a diminished-radix algorithm, User impersonation in key certification schemes, Real computations with fake numbers, An algorithm to compute the number of points on elliptic curves of \(j\)-invariant 0 or 1728 over a finite field, FFT-like multiplication of linear differential operators, Fast algorithms for approximately counting mismatches, Enumerating \(k\)-way trees, Addition chains -- an erratic sequence, Output sensitive and dynamic constructions of higher order Voronoi diagrams and levels in arrangements, Bit-parallel random number generation for discrete uniform distributions, Finite and infinite pseudorandom binary words, Combinatorial, ergodic and arithmetic properties of the Tribonacci substitution, Worst-case analysis of Weber's GCD algorithm, An authentication-combined access control scheme using a one-way function, Hyperbolic automorphisms of tori and pseudo-random sequences, Combining random generators by group operation, Average number of local minima for three-dimensional integral lattices, A discrete logarithm-based approach to compute low-weight multiples of binary polynomials, Inversion in finite fields using logarithmic depth, Some applications of computerized symbolic manipulation in the analysis of chemical engineering systems, Diffusion and Einstein relation for a massive particle in a one- dimensional free gas: Numerical evidence, Some properties of the tukey g and h family of distributions, Stochastic investigations of pseudo-random number generators, Computing the structure of finite algebras, Certified dense linear system solving, Distribution asymptotique des autocorrélations d'un processus saisonnier non stationnaire, A second-order Monte Carlo method for the solution of the Ito stochastic differential equation, An application of computer algebra to algebraic topology, Who's being swindled?: a case for enlightened naivete, Using Random Error Correcting Codes in Near-Collision Attacks on Generic Hash-Functions, RSA and Elliptic Curve Least Significant Bit Security, Time-Memory Trade-Offs for Near-Collisions, Collision Attacks on Up to 5 Rounds of SHA-3 Using Generalized Internal Differentials, Critical behavior in the computational cost of satisfiability testing, Generating subsets of order statistics with applications to trimmed means and means of trimmings, A dissection solver with kernel detection for symmetric finite element matrices on shared memory computers, On the construction of short addition-subtraction chains and their applications, The rescaled VAR model with an application to mixed-frequency macroeconomic forecasting, Quasi-triangularization of matrix polynomials over arbitrary fields, Fast Point Multiplication on Elliptic Curves without Precomputation, A hitchhiker's guide to descriptional complexity through analytic combinatorics, An improved method for predicting truncated multiple recursive generators with unknown parameters, Online vector scheduling and generalized load balancing, Efficient multiple-precision integer division algorithm, Fast Parallel Computation of Hermite and Smith Forms of Polynomial Matrices, Use of trapdoor structures in cryptography, Using the theory of cyclotomy to factor cyclotomic polynomials over finite fields, On the choice of a multiplication algorithm for polynomials and polynomial matrices, Uncertainty principle guarantees genuine source of intrinsic randomness, On multiset group, Irregular Primes and Cyclotomic Invariants to Four Million, On pseudorandomness in families of sequences derived from the Legendre symbol, On Computing Factors of Cyclotomic Polynomials, Elliptic Curves and Primality Proving, Pseudorandom numbers and entropy conditions, EFFICIENT, ALMOST EXACT SIMULATION OF THE HESTON STOCHASTIC VOLATILITY MODEL, Some algorithms related to matrices with entries in a finite field, Fast algorithm for the multiplication of a row vector by a randomly selected matrixA, Properties of a randomization test for multifactor comparisons of groups, Unnamed Item, Stochastic ceteris paribus simulations, Algebraic methods for optimizing constant multiplications in linear systems, Efficient calculation of Stark-Heegner points via overconvergent modular symbols, Scale-distortion inequalities for mantissas of finite data sets, Partitions without small parts, Higher-dimensional Dedekind sums and their bounds arising from the discrete diagonal of the \(n\)-cube, Decidability of semigroup identities in soluble groups, Algebraic independence results related to \(\langle q,r\rangle\)-number systems, An Implementation of the Number Field Sieve, On Independence and Sensitivity of Statistical Randomness Tests, Integer Variable χ–Based Ate Pairing, Stickelberger ideals of conductor \(p\) and their application, RANDOM NUMBER GENERATION BY CELLULAR AUTOMATA WITH MEMORY, A Nonlinear Congruential Pseudorandom Number Generator with Power of Two Modulus, 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, Method for finding multiple roots of polynomials, A Rigorous Subexponential Algorithm For Computation of Class Groups, On the Computation of Unit Groups and Class Groups of Totally Real Quartic Fields, Factoring Multivariate Polynomials over Large Finite Fields, Double-Speed Barrett Moduli, The b-adic Diaphony as a Tool to Study Pseudo-randomness of Nets, Two efficient algorithms for the computation of ideal sums in quadratic orders, Asymptotic distribution for the birthday problem with multiple coincidences, via an embedding of the collision process, Mixed finite element method for the heat diffusion equation in a random medium, An extended characterization of fuzzy bags, Testing Stream Ciphers by Finding the Longest Substring of a Given Density, Random Order m-ary Exponentiation, Exponent Recoding and Regular Exponentiation Algorithms, On Modular Decomposition of Integers, Extended DSA, Mathematics of currency and exchange: arithmetic at the end of the thirteenth century, Optimal Random Sampling from Distributed Streams Revisited, HECC Goes Embedded: An Area-Efficient Implementation of HECC, Algebraic Numbers in Isabelle/HOL, Statistical mechanics of cellular automata, Shorter addition chain for smooth integers using decomposition method, Unnamed Item, Local Search Heuristics for the Multidimensional Assignment Problem, An experimental investigation of the normality of irrational algebraic numbers, Description of Generalized Continued Fractions by Finite Automata, Wavelet and discrete cosine transforms for inserting information into BMP images, The Serial Test for Congruential Pseudorandom Numbers Generated by Inversions, Random number generators for a pocket calculator, A random number generator for 16-bit microcomputers, Scheduling unit length jobs with parallel nested machine processing set restrictions, Counterexamples to the poset conjectures of Neggers, Stanley, and Stembridge, One-stroke polynomials over a ring of modulo $2^w$, Numerical evaluation of the Evans function by Magnus integration, Bad lattice points, Distribution properties of multiply-with-c arry random number generators, On the rapid computation of various polylogarithmic constants, Characterizations of some polynomial variance functions by \(d\)-pseudo-orthogonality, Asymptotic invariants, complexity of groups and related problems, A one-parameter quadratic-base version of the Baillie-PSW probable prime test, Design of Experiments in Simulation, Involutions, trace maps, and pseudorandom numbers, Average-case complexity of the Euclidean algorithm with a fixed polynomial over a finite field, Majoration de la norme des facteurs d'un polynôme : cas où toutes les racines du polynôme sont réelles, Unnamed Item, Randomness Tests: Theory and Practice, Efficient algorithms for Lempel-Ziv encoding, NUMERICAL INDICATION OF STRUCTURAL STABILITY IN DYNAMICAL SYSTEMS AND ITS APPLICATION TO CLINICAL STUDY, CLASSIFICATION AND SYMMETRIES OF A FAMILY OF CONTINUED FRACTIONS WITH BOUNDED PERIOD LENGTH, Exact site-percolation probability on the square lattice, The exhaustion of shared memory: Stochastic results, Unnamed Item, Master-field simulations of \(\mathrm{O}(a)\)-improved lattice QCD: algorithms, stability and exactness, Multi-party updatable delegated private set intersection, Unnamed Item, Engineering Practical Lempel-Ziv Tries, Fast Cauchy sum algorithms for polynomial zeros and matrix eigenvalues, Constructive proofs for localised radial solutions of semilinear elliptic systems on Rd, Is Logic Universal or Hierarchical?, Privacy-preserving multikey computing framework for encrypted data in the cloud, Numerical Computation of Transverse Homoclinic Orbits for Periodic Solutions of Delay Differential Equations, Orienteering with one endomorphism, Bias in the number of steps in the Euclidean algorithm and a conjecture of Ito on Dedekind sums, Ideal dynamic threshold multi-secret data sharing in smart environments for sustainable cities, Remarks on some misconceptions about unequal probability sampling without replacement, Calculation of Fibonacci Polynomials for GFSR Sequences with Low Discrepancies, Roundoff-Error-Free Basis Updates of LU Factorizations for the Efficient Validation of Optimality Certificates, On the computation complexity of the systems of finite abelian group elements, Directed Graphs from Exact Covering Systems, Finite field arithmetic in large characteristic for classical and post-quantum cryptography, An elementary algorithmic problem from an advanced standpoint, Reciprocity laws for Dedekind cotangent sums, A Chaotic Circuit for Producing Gaussian Random Numbers, The essence of ornaments, Endomorphisms of regular rooted trees induced by the action of polynomials on the ring ℤd of d-adic integers, Bifurcations of Critical Periods for a Class of Quintic Liénard Equation, Numerical Computation of Periodic Orbits and Isochrons for State-Dependent Delay Perturbation of an ODE in the Plane, The derivative of Minkowski's \(?(x)\) function, Algebraic complexities and algebraic curves over finite fields, Symbolic manipulation techniques for low order LFT-based parametric uncertainty modelling, A new empirical test for parallel pseudo-random number generators, The Design of Maple's Sum-of-Products and POLY Data Structures for Representing Mathematical Objects, Unnamed Item, A study of 64-bit multipliers for Lehmer pseudorandom number generators, Systolic implementation of real-valued discrete transforms via algebraic integer quantization, Design of a linear systolic array for computing modular multiplication and squaring in \(\text{GF}(2^m)\), On the Julia sets of a noise-perturbed Mandelbrot map, Fast convolutions meet Montgomery, Minimizing roundoff errors of prefix sums via dynamic construction of Huffman trees, A Multiset Version of Even-Odd Permutations Identity, Random Generators and Normal Numbers, On the reduction of a random basis, Some active attacks on fast server-aided secret computation protocols for modular exponentiation, Inference for conditioned Galton-Watson trees from their Harris path, Unnamed Item, Unnamed Item, Kolmogorov Complexity in Perspective Part I: Information Theory and Randomness, Random Ordering of Semiprimes, Balance Weighing: Variations on a Theme, Rapid multiplication modulo the sum and difference of highly composite numbers, Constructing hyperelliptic curves of genus 2 suitable for cryptography, Satoh's algorithm in characteristic 2, A test for multivariate structure, Efficient lattice assessment for LCG and GLP parameter searches, RVGEN: a tool for generation of random variates, A Search for Large Twin Prime Pairs, On random and adaptive parallel generation of combinatorial objects, covering grid points in a convex polygon with straight lines^∗, High-radix and bit recoding techniques for modular exponentiation, On relatively prime numbers and oil drops, Simple parallel algorithms for primality testing and integer factorization, Parallel implementation of the rsa public-key cryptosystem, The 25th and 26th Mersenne Primes, EXACT SOLUTION OF LINEAR EQUATIONS ON DISTRIBUTED-MEMORY MULTIPROCESSORS, An Expanded Set of Correlation Tests for Linear Congruential Random Number Generators, Algorithms in Algebraic Number Theory, Asymptotically Fast Factorization of Integers, Statistical properties of finite sequences with high Kolmogorov complexity, Iwasawa's Theorem and Integrals on Lie Groups, Where Are the Rational Squares?, Critical distances in pseudorandom sequences generated with composite moduli, On the autocorrelation structure of inversive congruential pseudorandom number sequences, On the period length of some special continued fractions, Experimental Evaluation of Euler Sums, High-Order Parameterization of Stable/Unstable Manifolds for Long Periodic Orbits of Maps, Periodicity and Transport from Round-Off Errors, Could, or should, the ancient Greeks have discovered the Lucas-Lehmer test?, Randomness of Low-Order Bits in Random Number Generators, On-line evaluation of powers using Euclid's algorithm, Linear Span analysis of a set of periodic sequence generators, Minimal weight k-SR representations, Unnamed Item, A multiple-precision division algorithm, Orbits and lattices for linear random number generators with composite moduli, Maximally equidistributed combined Tausworthe generators, On a nonlinear congruential pseudorandom number generator, Largest known twin primes, The serial test for a nonlinear pseudorandom number generator, A new algorithm for constructing large Carmichael numbers, Uncertainty analysis for some actinides under groundwater conditions, Some remarks on a probability limit theorem for continued fractions, THE JANUS TEST: A HIERARCHICAL ALGORITHM FOR COMPUTING DIRECTION AND DISTANCE VECTORS (EXTENDED VERSION)*, Integration error over very long time spans, Joint Hardware / Software Design of a Fast Stream Cipher, Tests based on sum-functions of spacings for uniform random numbers, Characterizing switch-setting problems^∗, Unnamed Item, Observations on the generation of permutations from random sequences, The distribution of estimators after model selection:large and small sample results, Statistical Independence of a New Class of Inversive Congruential Pseudorandom Numbers, Stream Ciphering Techniques Based on n-Tuples Juxtaposition Sequences, Distinct Degree Factorizations for Polynomials over a Finite Field, On the Use of Reducible Polynomials as Random Number Generators, Fibonacci hypercube, From uniform distributions to Benford's law, A natural lattice basis problem with applications, Subquadratic-time factoring of polynomials over finite fields, Remarks on the Schoof-Elkies-Atkin algorithm, Detecting perfect powers in essentially linear time, CAN ENDOGENOUS, NOISE-TRIGGERED EARLY AFTER-DEPOLARIZATIONS INITIATE REENTRY IN A MODIFIED LUO–RUDY VENTRICULAR VIRTUAL TISSUE?, On the Periods of Generalized Fibonacci Recurrences, Algorithmic Procedures, On the CRAY-System Random Number Generator, Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems, An elementary algorithm to evaluate trigonometric functions to high precision, Unnamed Item, The Move-to-Front Rule: A Case Study for two Perfect Sampling Algorithms, Classification of nilpotent lie algebras of dimension nine whose maximum abelian ideal is of dimension seven, Rabin-Miller Primality Test: Composite Numbers Which Pass It, Irregular Primes to One Million, Pseudorandom Vector Generation by the Multiple-Recursive Matrix Method, Irregularities in the Distribution of Irreducible Polynomials, Three new factors of Fermat numbers, Robustness of some non‐uniform random variate generators, USING LARGE ORDER STATISTICS OF RUNS FOR TRACKING A CHANGING BERNOULLI PROBABILITY, New frameworks for Montgomery’s modular multiplication method, Fast parallel algorithms for polynomial division over an arbitrary field of constants, Defects in parallel Monte Carlo and quasi-Monte Carlo integration using the leap-frog technique, Efficient Multiple-Precision Evaluation of Elementary Functions, On the Period Length of Pseudorandom Vector Sequences Generated by Matrix Generators, On the Number of Elliptic Pseudoprimes, The Probability That a Numerical Analysis Problem is Difficult, On markov chain monte carlo methods for nonlinear and non-gaussian state-space models, Variance reduction in the study of a test concerning the behrens-fisher problem, Rigorous Verification of Hopf Bifurcations via Desingularization and Continuation, Tables of linear congruential generators of different sizes and good lattice structure, Analysis of PSLQ, an integer relation finding algorithm, Extended GCD and Hermite Normal Form Algorithms via Lattice Basis Reduction, Improving the parallelized Pollard lambda search on anomalous binary curves, An Algorithm for Recognising the Exterior Square of a Multiset, Factorization Using the Quadratic Sieve Algorithm, On the Class of Erlang Mixtures with Risk Theoretic Applications, On the Computation of the Class Number of an Algebraic Number Field, A New Method for Producing Large Carmichael Numbers, Numerical Solution of Some Classical Differential-Difference Equations, Largest known twin primes and Sophie Germain primes, A fast algorithm for locating supplying center on a lattice, Speed-Up in Dynamic Programming, Computational Complexity of Fourier Transforms Over Finite Fields