scientific article; zbMATH DE number 1052006

Publication date: 26 August 1997

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

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

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 (only showing first 100 items - show all)

Separating OR, SUM, and XOR circuits ⋮ An accurate updating formula to calculate sample variance from weighted successive differences ⋮ Faster algorithms for single machine scheduling with release dates and rejection ⋮ Improved error bounds for floating-point products and Horner's scheme ⋮ On the definition of unit roundoff ⋮ Maximum likelihood analysis of the Ford-Fulkerson method on special graphs ⋮ Batcher's odd-even exchange revisited: a generating functions approach ⋮ A fast algorithm for computing large Fibonacci numbers ⋮ Measurement of preferences with self-explicated approaches: a classification and merge of trade-off- and non-trade-off-based evaluation types ⋮ Fast projection onto the simplex and the \(l_1\) ball ⋮ On the linear complexity profile of some sequences derived from elliptic curves ⋮ Even faster integer multiplication ⋮ On the tree search problem with non-uniform costs ⋮ Perfect necklaces ⋮ Finding the best portable congruential random number generators ⋮ An obstruction to solvability of the reach control problem using affine feedback ⋮ On the hardness of bribery variants in voting with CP-nets ⋮ Genetic algorithms for condition-based maintenance optimization under uncertainty ⋮ Stowage planning for container ships: a heuristic algorithm to reduce the number of shifts ⋮ Minimum edge blocker dominating set problem ⋮ Floating-point arithmetic on the test bench. How are verified numerical solutions calculated? ⋮ Scheduling with compressible and stochastic release dates ⋮ Integer complexity: representing numbers of bounded defect ⋮ Signed enumeration of upper-right corners in path shuffles ⋮ Sharp error bounds for complex floating-point inversion ⋮ Merging almost sorted sequences yields a 24-sorter ⋮ Reconstructing binary matrices with timetabling constraints ⋮ Improved algorithm for the isogeny problem for ordinary elliptic curves ⋮ Distribution results for low-weight binary representations for pairs of integers ⋮ Straight-line programs: a practical test (extended abstract) ⋮ Controlled random tests ⋮ Complexity of computation in finite fields ⋮ Eulerian quasisymmetric functions ⋮ Running time of the treapsort algorithm ⋮ Fractal tiles associated with shift radix systems ⋮ Accurate evaluation of a polynomial and its derivative in Bernstein form ⋮ Fibonacci BSTs: a new balancing method for binary search trees ⋮ On compressing permutations and adaptive sorting ⋮ Optimality of the width-\(w\) non-adjacent form: general characterisation and the case of imaginary quadratic bases ⋮ Automorphism groups of finite groupoids. ⋮ Computing a longest common subsequence that is almost increasing on sequences having no repeated elements ⋮ Scheduling modular projects on a bottleneck resource ⋮ Combinatorics of non-ambiguous trees ⋮ Combinatorics of balanced carries ⋮ Some new binomial sums related to the Catalan triangle ⋮ Evaluation of permanents in rings and semirings ⋮ Numeration and discrete dynamical systems ⋮ Eulerian quasisymmetric functions for the type B Coxeter group and other wreath product groups ⋮ Weighted Flow Algorithms (WFA) for stochastic particle coagulation ⋮ String matching with alphabet sampling ⋮ Parallel modular exponentiation using load balancing without precomputation ⋮ Redundant \(\tau \)-adic expansions. II: Non-optimality and chaotic behaviour ⋮ Notes on protected nodes in digital search trees ⋮ Pseudorandom number generators based on random covers for finite groups ⋮ Efficient computer search of large-order multiple recursive pseudo-random number generators ⋮ Development of a Stokes flow solver robust to large viscosity jumps using a Schur complement approach with mixed precision arithmetic ⋮ Keyed hash function based on a chaotic map ⋮ The strongest model of computation obeying 0-1 Principles ⋮ Decoding permutation arrays with ternary vectors ⋮ Distributed algorithmic mechanism design for scheduling on unrelated machines ⋮ On the expected longest length probe sequence for hashing with separate chaining ⋮ A linear time and space algorithm for detecting path intersection in \(\mathbb Z^d\) ⋮ The enumeration of prudent polygons by area and its unusual asymptotics ⋮ Average best \(m\)-term approximation ⋮ Recursive merge sort with erroneous comparisons ⋮ Accurate evaluation algorithm for bivariate polynomial in Bernstein-Bézier form ⋮ High-precision computation: mathematical physics and dynamics ⋮ Chains-into-bins processes ⋮ Sum-based weighted belief base merging: from commensurable to incommensurable framework ⋮ Computing the throughput of probabilistic and replicated streaming applications ⋮ Quantifier elimination for a class of exponential polynomial formulas ⋮ On the parameterized complexity of vertex cover and edge cover with connectivity constraints ⋮ A low-memory algorithm for finding short product representations in finite groups. ⋮ Practical algorithms for generating a random ordering of the elements of a weighted set ⋮ Accurate, validated and fast evaluation of elementary symmetric functions and its application ⋮ Applications of an expressive statistical model checking approach to the analysis of genetic circuits ⋮ Tighter bounds for the sum of irreducible LCP values ⋮ Shortcutting directed and undirected networks with a degree constraint ⋮ The \(p\lambda n\) fractal decomposition: nontrivial partitions of conserved physical quantities ⋮ 2D Lyndon words and applications ⋮ Engineering parallel string sorting ⋮ Accurate polynomial root-finding methods for symmetric tridiagonal matrix eigenproblems ⋮ Bitonic sorters of minimal depth ⋮ Isomorphism check in fractional factorial designs via letter interaction pattern matrix ⋮ Consistency of Markov chain quasi-Monte Carlo on continuous state spaces ⋮ The expected profile of digital search trees ⋮ Authenticated key agreement in dynamic peer groups ⋮ Relations between adjacency trees ⋮ A tight analysis and near-optimal instances of the algorithm of Anderson and Woll ⋮ Accurate evaluation of a polynomial in Chebyshev form ⋮ On chaotic and random sequences ⋮ Minimal redundant digit expansions in the Gaussian integers ⋮ About randomised distributed graph colouring and graph partition algorithms ⋮ Preserving positivity in solutions of discretised stochastic differential equations ⋮ Asymptotic distribution of two-protected nodes in random binary search trees ⋮ Accurate summation, dot product and polynomial evaluation in complex floating point arithmetic ⋮ Accelerated simulation of stochastic particle removal processes in particle-resolved aerosol models ⋮ A simple measure of conditional dependence ⋮ The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio ⋮ Low-cost addition-subtraction sequences for the final exponentiation in pairings

This page was built for publication: