Publication:4349924

Publication date: 26 August 1997

survey; random number generators; spectral test; statistical tests; Euclidean algorithm; floating-point arithmetic; exercises; formal power series; random numbers; multiple-precision arithmetic; polynomial arithmetic; computer programming; random arithmetic; seminumerical algorithms; linear congruence relations; radix conversion

Mathematics Subject Classification ID

68W05: Nonnumerical algorithms

65-02: Research exposition (monographs, survey articles) pertaining to numerical analysis

68-02: Research exposition (monographs, survey articles) pertaining to computer science

65Cxx: Probabilistic methods, stochastic differential equations

65Gxx: Error analysis and interval analysis

Related Items

Minimal redundant digit expansions in the Gaussian integers, Distribution results for low-weight binary representations for pairs of integers, Authenticated key agreement in dynamic peer groups, A tight analysis and near-optimal instances of the algorithm of Anderson and Woll, On chaotic and random sequences, The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio, Upper bounds for sorting integers on random access machines, Approximate \(k\)-closest-pairs in large high-dimensional data sets, Fractal-like matrices, Accelerating certain outputs of merging and sorting networks, On the mean-field limit of bosons with Coulomb two-body interaction, On robustness in control and LTI identification: near-linearity and non-conic uncertainty, LTI approximation of nonlinear systems via signal distribution theory, Simulation of stochastic demand data streams for network revenue management problems, The combination technique and some generalisations, Permutations with short monotone subsequences, Permutation and sampling with maximum length CA or pseudorandom number generation, An efficient variable neighborhood search heuristic for very large scale vehicle routing problems, The number of steps in the Robinson-Schensted algorithm, Trees with exponentially growing costs, The additive congruential random number generator -- a special case of a multiple recursive generator, Extensions of Black-Scholes processes and Benford's law, Estimating steady-state distributions via simulation-generated histograms, M-CASH: A real-time resource reclaiming algorithm for multiprocessor platforms, On computational efficiency for multi-precision zero-finding methods, Recursive polynomial remainder sequence and its subresultants, Improved random graph isomorphism, An error in the Kinderman-Ramage method and how to fix it, Width and mode of the profile for some random trees of logarithmic height, Comparing the effectiveness of two kinds of continued fractions, Inversive pseudorandom numbers over Galois rings, Space complexity of abelian groups, Linear-size log-depth negation-limited inverter for \(k\)-tonic binary sequences, Optimal conclusive sets for comparator networks, Cryptographic properties of nonlinear pseudorandom number generators, Algorithmic aspects for power-efficient hardware/software partitioning, Noncanonical number systems in the integers, A new constrained edit distance between quotiented ordered trees, A parallel extended GCD algorithm, Limit laws for the Randić index of random binary tree models, Sampling streaming data with replacement, Imbalance in random digital trees, Subtraction-free almost Montgomery inverse algorithm, Discrete event simulation modelling of computer systems for performance evaluation, Reconciling the term structure of interest rates with the consumption-based ICAP model, Carry propagation in signed digit representations, Approximate testing with error relative to input size., Dynamical analysis of a class of Euclidean algorithms., Statistical properties and implementation of aperiodic pseudorandom number generators, Kazhdan-Lusztig cells and Robinson-Schensted correspondence., Random small Hamming weight products with applications to cryptography, Combinatorics of periods in strings., A modular reduction for GCD computation., A random number generator based on elliptic curve operations, Basic analytic combinatorics of directed lattice paths, Pseudorandom permutation, A parametric error analysis of Goldschmidt's division algorithm, Singularity analysis, Hadamard products, and tree recurrences, Permanental bounds for nonnegative matrices via decomposition, Euclidean algorithms are Gaussian, A heuristic approach for the generation of multivariate random samples with specified marginal distributions and correlation matrix, Precise numerical computation, Analytic urns, Generating random binary trees -- a survey, Reduced complexity evaluation of hypergeometric functions, Portable random number generators., The height of a binary search tree: the limiting distribution perspective., Additive symmetries: The non-negative case., Combined generators with components from different families, One-sided variations on binary search trees, Polynomial pseudo-random number generator via cyclic phase, Maximum versus minimum: two properties of the Fibonacci sequence, The cell probe complexity of succinct data structures, On the reducible quintic complete base polynomials, Real algebraic numbers and polynomial systems of small degree, On \(\alpha \)-greedy expansions of numbers, Improved algorithm for maximizing service of carousel storage, The topological structure of fractal tilings generated by quadratic number systems, Polynomial evaluation and interpolation on special sets of points, A survey on topological properties of tiles related to number systems, Approximate hotlink assignment, Maximally even sets and configurations: common threads in mathematics, physics, and music, Lower bounds for expected-case planar point location, On the complexity of real root isolation using continued fractions, Adaptive sorting: an information theoretic perspective, A note on a pseudo-random number generator for personal computers, Analysis of alternative digit sets for nonadjacent representations, The \textsc{Meat}-\textsc{axe} and \(f\)-cyclic matrices, On the coefficients that arise from Laplace's method, Exact, efficient, and complete arrangement computation for cubic curves, An improved computational algorithm for finding the factorial, Continued fractions for linear fractional transformations of power series, Line segment intersection testing, \(s\)-power series: an alternative to Poisson expansions for representing analytic functions, The general two-level storage management problem: a reconsideration of the KTNS-rule, There is no efficient reverse derivation mode for discrete derivatives, Bases of canonical number systems in quartic algebraic number fields, Single-factor coefficient bounds, On the theoretical properties of swap multimoves, Limit shapes for random square Young tableaux, DYNAMICAL CHARACTERISTICS OF DISCRETIZED CHAOTIC PERMUTATIONS, Infimaximal Frames: A Technique for Making Lines Look Like Segments, A HYBRID APPROACH FOR DETERMINANT SIGNS OF MODERATE-SIZED MATRICES, Left cells in type 𝐵_{𝑛} with unequal parameters, Speeding up the computations on an elliptic curve using addition-subtraction chains, LAYERED CELLULAR AUTOMATA FOR PSEUDORANDOM NUMBER GENERATION, HITS Can Converge Slowly, but Not Too Slowly, in Score and Rank, Efficient 15,360-bit RSA Using Woop-Optimised Montgomery Arithmetic, Reasoning Algebraically About P-Solvable Loops, Point lattices and oscillating recurrence sequences^†, Supernode Binary Search Trees, DOUBLE HASHING WITH MULTIPLE PASSBITS, Descending chains, the lilypond model, and mutual-nearest-neighbour matching, SOLVING DYNAMIC WILDLIFE RESOURCE OPTIMIZATION PROBLEMS USING REINFORCEMENT LEARNING, INCREMENTAL EVOLUTION OF CELLULAR AUTOMATA FOR RANDOM NUMBER GENERATION, Efficient non-malleable commitment schemes, \((1+i)\)-ary GCD computation in \(\mathbb Z[i\) as an analogue to the binary GCD algorithm.], Topological properties of two-dimensional number systems, Computational arithmetic geometry. I: Sentences nearly in the polynomial hierarchy, On canonical number systems, Unnamed Item, A STUDY ON THE RANDOMNESS OF THE DIGITS OF π, Reynolds stress transport modelling for steady and unsteady channel flows with wall injection, ON MULTI-LEVEL k-RANGES FOR RANGE SEARCH, ALGORITHMS FOR K-DISJOINT MAXIMUM SUBARRAYS, Unnamed Item, Algorithms for Propositional Model Counting, Generating Functions and the Solutions of Full History Recurrence Equations, Fast Point Decompression for Standard Elliptic Curves, Efficient data structures for sparse network representation, The dynamics of Pythagorean Triples, THE BENFORD-NEWCOMB DISTRIBUTION AND UNAMBIGUOUS CONTEXT-FREE LANGUAGES, Comparison of Point Sets and Sequences for Quasi-Monte Carlo and for Random Number Generation, Individual Displacements in Hashing with Coalesced Chains, GEOMETRIC RANDOM INNER PRODUCT TEST AND RANDOMNESS OF π, ANALYSIS OF COMPLEMENTS IN MULTI-EXPONENTIATION ALGORITHMS USING SIGNED DIGIT REPRESENTATIONS, On the Value of Multiple Read/Write Streams for Data Compression, Unnamed Item