scientific article; zbMATH DE number 1052006

MaRDI QIDQ4349924zbMATH OpenFDO

Authors Donald E. Knuth

Publication date 26 August 1997

zbMATH Keywords

surveyEuclidean algorithmformal power seriesstatistical testsfloating-point arithmeticspectral testrandom numbersexercisesrandom number generatorsmultiple-precision arithmeticpolynomial arithmeticcomputer programmingrandom arithmeticseminumerical algorithmslinear congruence relationsradix conversion

Mathematics Subject Classification ID

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)

Recommendations

• 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.

Cited in

(only showing first 100 items - show all)

• Chi-square simulation of the CIR process and the Heston model
• Dumont-Thomas complement numeration systems for \(\mathbb{Z}\)
• Pop-stack sorting and its image: permutations with overlapping runs
• Individual Displacements in Hashing with Coalesced Chains
• Distribution results for low-weight binary representations for pairs of integers
• Efficient non-malleable commitment schemes
• Fibonacci BSTs: a new balancing method for binary search trees
• On compressing permutations and adaptive sorting
• An error in the Kinderman-Ramage method and how to fix it
• HITS Can Converge Slowly, but Not Too Slowly, in Score and Rank
• Random numbers for parallel computers: requirements and methods, with emphasis on gpus
• Notes on protected nodes in digital search trees
• Formulae and asymptotics for coefficients of algebraic functions
• Improved random graph isomorphism
• Rigorous numerics for analytic solutions of differential equations: the radii polynomial approach
• Reasoning Algebraically About P-Solvable Loops
• Extremal estimates of the Wiener index for weakly connected directed graphs
• Asymptotics of the overflow in urn models
• A simple proof for the upper bound of the computational complexity of three monomials in three variables
• Fast Point Decompression for Standard Elliptic Curves
• Fast computation by block permanents of cumulative distribution functions of order statistics from several populations
• scientific article; zbMATH DE number 7310285 (Why is no real title available?)
• Dropping plates
• On the expected cost of partial match queries in random quad-K-d trees
• Parallel-batch scheduling with rejection: structural properties and approximation algorithms
• QPlus: computer package for coding theory research and education
• Least resolved trees for two-colored best match graphs
• The vectorial kernel method for walks with longer steps
• Piecewise linear approximation with minimum number of linear segments and minimum error: a fast approach to tighten and warm start the hierarchical mixed Integer formulation
• Randomized low-rank approximation methods for projection-based model order reduction of large nonlinear dynamical problems
• Isomorphism check in fractional factorial designs via letter interaction pattern matrix
• Computing a longest common subsequence that is almost increasing on sequences having no repeated elements
• Small Complexity Gaps for Comparison-Based Sorting
• Combinatorics of balanced carries
• Optimal dislocation with persistent errors in subquadratic time
• Some issues related to double rounding
• Linear extensions and comparable pairs in partial orders
• Supernode Binary Search Trees
• Classification via two-way comparisons
• Sorting and ranking of self-delimiting numbers with applications to outerplanar graph isomorphism
• Redundant \(\tau \)-adic expansions. II: Non-optimality and chaotic behaviour
• An ultrafast cryptographically secure pseudorandom number generator
• Bitonic sorters of minimal depth
• Error Analysis of ZFP Compression for Floating-Point Data
• A HYBRID APPROACH FOR DETERMINANT SIGNS OF MODERATE-SIZED MATRICES
• Invariants for parameterised Boolean equation systems
• Obtainable sizes of topologies on finite sets
• Precise numerical computation
• Combinatorics of periods in strings.
• Probability of Repeating Patterns in Simultaneous Neural Data
• Approximate testing with error relative to input size.
• Multilevel static analysis for improving program quality
• Projective Cutting-Planes for Robust Linear Programming and Cutting Stock Problems
• Permanental bounds for nonnegative matrices via decomposition
• Sampling streaming data with replacement
• A representation on the labeled rooted forests
• Asymptotic distribution of two-protected nodes in random binary search trees
• Space-efficient B trees via load-balancing
• Efficient data structures for sparse network representation
• Line segment intersection testing
• There is no efficient reverse derivation mode for discrete derivatives
• On geometrically defined extensions of the Temperley-Lieb category in the Brauer category
• Synthesis of sorting algorithms using multisets in \textit{Theorema}
• Scenario Grouping and Decomposition Algorithms for Chance-Constrained Programs
• Arithmetic of finite precision
• Modeling and simulation in engineering
• Space complexity of abelian groups
• Some new binomial sums related to the Catalan triangle
• Explicit numerical computation of normal forms for Poincaré maps
• Evaluation of permanents in rings and semirings
• Numeration and discrete dynamical systems
• Spectrum and entropy of C-systems MIXMAX random number generator
• A search for short-period Tausworthe generators over Fb with application to Markov chain quasi-Monte Carlo
• Generalized multiset theory
• Differentiability of the Minkowski function . II
• GEOMETRIC RANDOM INNER PRODUCT TEST AND RANDOMNESS OF π
• Randomization-based interval estimation in randomized clinical trials
• Randomness of the square root of 2 and the giant leap. II
• Hardness of token swapping on trees
• Deletions in random binary search trees: a story of errors
• Multiset neurons
• Quantum algorithm for learning secret strings and its experimental demonstration
• Revisiting oblivious top-k selection with applications to secure k-NN classification
• Randomness measures related to subset occurrence
• Hopf algebra structure on packed square matrices.
• Static network reliability estimation under the Marshall-Olkin copula
• Separating OR, SUM, and XOR circuits
• The quicksort process
• A verified implementation of the Berlekamp-Zassenhaus factorization algorithm
• Chronological rank in biological evolution
• Old and new results on alphabetic codes
• An accurate algorithm for evaluating rational functions
• Improving the statistical quality of random number generators by applying a simple ratio transformation
• Colored operads, series on colored operads, and combinatorial generating systems
• The effect of deletions on different insertion disciplines for hash tables
• Consistency of Markov chain quasi-Monte Carlo on continuous state spaces
• Discrete event simulation modelling of computer systems for performance evaluation
• Regenerative random permutations of integers
• The sets of flattened partitions with forbidden patterns
• Dual-pivot quicksort: optimality, analysis and zeros of associated lattice paths

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)