scientific article; zbMATH DE number 1052006
surveyEuclidean algorithmformal power seriesstatistical testsfloating-point arithmeticspectral testrandom numbersexercisesrandom number generatorsmultiple-precision arithmeticpolynomial arithmeticcomputer programmingrandom arithmeticseminumerical algorithmslinear 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)
- scientific article; zbMATH DE number 3649960
- scientific article; zbMATH DE number 3303655
- scientific article; zbMATH DE number 1178976
- scientific article; zbMATH DE number 3303654
- scientific article; zbMATH DE number 48134
- scientific article; zbMATH DE number 42035
- scientific article; zbMATH DE number 1458587
- The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.
- Estimating steady-state distributions via simulation-generated histograms
- Minimal redundant digit expansions in the Gaussian integers
- Permanental bounds for nonnegative matrices via decomposition
- Sum-based weighted belief base merging: from commensurable to incommensurable framework
- Self-synchronizing stream ciphers and dynamical systems: state of the art and open issues
- Computing the throughput of probabilistic and replicated streaming applications
- Limit laws for the Randić index of random binary tree models
- Range minimum queries in minimal space
- Generalized multiset theory
- Accurate evaluation algorithm for bivariate polynomial in Bernstein-Bézier form
- The \textsc{Meat}-\textsc{axe} and \(f\)-cyclic matrices
- The expected profile of digital search trees
- Backward error analysis of the extended iterative refinement or improvement algorithm for solving ill conditioned linear system
- Relations between adjacency trees
- On chaotic and random sequences
- Recursive merge sort with erroneous comparisons
- Real algebraic numbers and polynomial systems of small degree
- Randomness of the square root of 2 and the giant leap. II
- Dynamical analysis of a class of Euclidean algorithms.
- The topological structure of fractal tilings generated by quadratic number systems
- Crystals and trees: quasi-Kashiwara operators, monoids of binary trees, and Robinson-Schensted-type correspondences
- Consistency of Markov chain quasi-Monte Carlo on continuous state spaces
- On computational efficiency for multi-precision zero-finding methods
- Skew spectra of graphs without even cycles
- Automorphism groups of finite groupoids.
- Exact, efficient, and complete arrangement computation for cubic curves
- Maximum versus minimum: two properties of the Fibonacci sequence
- Computing minimal polynomials of matrices
- Inversive pseudorandom numbers over Galois rings
- Accurate, validated and fast evaluation of elementary symmetric functions and its application
- Practical algorithms for generating a random ordering of the elements of a weighted set
- Accurate evaluation of a polynomial and its derivative in Bernstein form
- Numerical experiments in problems of asymptotic representation theory..
- Noncanonical number systems in the integers
- Preserving positivity in solutions of discretised stochastic differential equations
- Construction of weakly CUD sequences for MCMC sampling
- Hausdorff dimensions of perturbations of a conformal iterated function system via thermodynamic formalism
- Permutations with short monotone subsequences
- Fractal tiles associated with shift radix systems
- Portable random number generators.
- Nearly optimal refinement of real roots of a univariate polynomial
- Applications of an expressive statistical model checking approach to the analysis of genetic circuits
- An ultrafast cryptographically secure pseudorandom number generator
- Quantum mechanics and the principle of least radix economy
- Fast computation by block permanents of cumulative distribution functions of order statistics from several populations
- 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
- Accurate summation, dot product and polynomial evaluation in complex floating point arithmetic
- Bitonic sorters of minimal depth
- The additive congruential random number generator -- a special case of a multiple recursive generator
- 2D Lyndon words and applications
- Engineering parallel string sorting
- Algorithms for Propositional Model Counting
- Infimaximal Frames: A Technique for Making Lines Look Like Segments
- Combinatorics of periods in strings.
- Efficient data structures for sparse network representation
- 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
- Permutation and sampling with maximum length CA or pseudorandom number generation
- Quantifier elimination for a class of exponential polynomial formulas
- On \(\alpha \)-greedy expansions of numbers
- Space complexity of abelian groups
- Stack-sorting with consecutive-pattern-avoiding stacks
- Imbalance in random digital trees
- Regenerative random permutations of integers
- A fast algorithm for reversion of power series
- Upper bounds for sorting integers on random access machines
- Sampling exactly from the normal distribution
- A heuristic approach for the generation of multivariate random samples with specified marginal distributions and correlation matrix
- Digital semigroups
- Saturation problems in the Ramsey theory of graphs, posets and point sets
- Renewal theory in the analysis of tries and strings
- Linear extensions and comparable pairs in partial orders
- An improvement of a cryptanalysis algorithm
- A survey of some applications of finite fields
- A rigorous version of R. P. Brent's model for the binary Euclidean algorithm
- Bases of canonical number systems in quartic algebraic number fields
- Reynolds stress transport modelling for steady and unsteady channel flows with wall injection
- Truncation of unitary operads
- Quad-\(k\mathrm d\) trees: a general framework for \(k\mathrm d\) trees and quad trees
- Priority queues and sorting for read-only data
- Approximate \(k\)-closest-pairs in large high-dimensional data sets
- Low-cost addition-subtraction sequences for the final exponentiation in pairings
- Fractal-like matrices
- Optimal learning with a local parametric belief model
- On fairness in polling systems
- On relative errors of floating-point operations: optimal bounds and applications
- 64-bit and 128-bit DX random number generators
- The asymptotics of the geometric polynomials
- Formulae and asymptotics for coefficients of algebraic functions
- Monte Carlo linear solvers with non-diagonal splitting
- A greedy algorithm for the two-level nested logit model
- Point lattices and oscillating recurrence sequences†
- Probabilistic analyses of the plain multiple gcd algorithm
- LTI approximation of nonlinear systems via signal distribution theory
- Fast elliptic curve point multiplication based on binary and binary non-adjacent scalar form methods
- Supernode Binary Search Trees
- Self-affine manifolds
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 Q4349924)