scientific article; zbMATH DE number 1052006

zbMATH Open0895.65001MaRDI QIDQ4349924FDOQ4349924

Donald E. Knuth

Publication date: 26 August 1997

Title of this publication is not available (Why is that?)

Recommendations

• scientific article
• scientific article; zbMATH DE number 3303655
• scientific article; zbMATH DE number 1178976
• scientific article; zbMATH DE number 3303654
• scientific article
• scientific article; zbMATH DE number 42035
• scientific article; zbMATH DE number 1458587
• The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.

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)

Cited In (only showing first 100 items - show all)

• Fast Point Decompression for Standard Elliptic Curves
• Small Complexity Gaps for Comparison-Based Sorting
• Algorithms for SU(n) boson realizations and D-functions
• Space-efficient B trees via load-balancing
• Synthesis of sorting algorithms using multisets in \textit{Theorema}
• Hopf algebra structure on packed square matrices.
• The quicksort process
• Improving the statistical quality of random number generators by applying a simple ratio transformation
• Colored operads, series on colored operads, and combinatorial generating systems
• Inversions in split trees and conditional Galton--Watson trees
• Sampling random directions within an elliptical cone
• Factorization patterns on nonlinear families of univariate polynomials over a finite field
• Masking Tables—An Underestimated Security Risk
• Error estimates for the summation of real numbers with application to floating-point summation
• Selected Implementation Issues in Computation of the Grünwald-Letnikov Fractional-Order Difference by Means of Embedded System
• An asymptotic distribution theory for Eulerian recurrences with applications
• Improved algorithm for maximizing service of carousel storage
• A semidefinite programming method for integer convex quadratic minimization
• Evaluation of circuits over nilpotent and polycyclic groups
• Leibniz complexity of Nash functions on differentiations
• Accurate evaluation of polynomials in Legendre basis
• A parametric error analysis of Goldschmidt's division algorithm
• Approximability issues of guarding a set of segments
• Performance-based routing
• A fast algorithm for quadratic resource allocation problems with nested constraints
• Classification of Finite Group Automorphisms with a Large Cycle
• Verified analysis of random binary tree structures
• Consolidation for compact constraints and Kendall tau LP decodable permutation codes
• Relaxations of associativity and preassociativity for variadic functions
• RSA, Dickson, LUC and Williams: a study on four polynomial-type public-key cryptosystems
• On the average complexity for the verification of compatible sequences
• The principles of informational genomics
• A note on a pseudo-random number generator for personal computers
• On the possible patterns of inputs for block sorting in the Burrows-Wheeler transformation
• Distinct fringe subtrees in random trees
• Encoding cardinality constraints using standard encoding of generalized selection networks preserves arc-consistency
• Static Network Reliability Estimation under the Marshall-Olkin Copula
• Reduced complexity evaluation of hypergeometric functions
• Concrete stream calculus: An extended study
• Exponential decay of correlations functions in MIXMAX generator of pseudorandom numbers
• Title not available (Why is that?)
• Encoding cardinality constraints using multiway merge selection networks
• Revisiting priority queues for image analysis
• Analyzing the Shuffling Side-Channel Countermeasure for Lattice-Based Signatures
• Internal structure of addition chains: well-ordering
• Type Fusion
• Process convergence for the complexity of radix selection on Markov sources
• High-precision arithmetic in mathematical physics
• Characterization algorithms for shift radix systems with finiteness property
• An optimal, purely functional implementation of the Garsia–Wachs algorithm
• Title not available (Why is that?)
• On the complexity and decidability of some problems involving shuffle
• Supernode Binary Search Trees
• A Recursive Local Polynomial Approximation Method Using Dirichlet Clouds and Radial Basis Functions
• Linear extensions and comparable pairs in partial orders
• Regenerative random permutations of integers
• The Ford-Johnson algorithm still unbeaten for less than 47 elements
• Authenticated key agreement in dynamic peer groups
• A tight analysis and near-optimal instances of the algorithm of Anderson and Woll
• 64-bit and 128-bit DX random number generators
• LTI approximation of nonlinear systems via signal distribution theory
• A fast algorithm for reversion of power series
• On relative errors of floating-point operations: Optimal bounds and applications
• Monte Carlo linear solvers with non-diagonal splitting
• The number of steps in the Robinson-Schensted algorithm
• Priority Queues and Sorting for Read-Only Data
• Saturation problems in the Ramsey theory of graphs, posets and point sets
• Point lattices and oscillating recurrence sequences^†
• Fast quantum modular exponentiation
• Digital semigroups
• Accelerated simulation of stochastic particle removal processes in particle-resolved aerosol models
• Hall sets, Lazard sets and comma-free codes
• On fairness in polling systems
• Range minimum queries in minimal space
• Low-cost addition-subtraction sequences for the final exponentiation in pairings
• Fast structured matrix computations: tensor rank and Cohn-Umans method
• Fast elliptic curve point multiplication based on binary and binary non-adjacent scalar form methods
• Optimal learning with a local parametric belief model
• The asymptotics of the geometric polynomials
• Parallel Fokker-Planck-DSMC algorithm for rarefied gas flow simulation in complex domains at all Knudsen numbers
• The height of a binary search tree: the limiting distribution perspective.
• A greedy algorithm for the two-level nested logit model
• An improvement of a cryptanalysis algorithm
• Probabilistic analyses of the plain multiple gcd algorithm
• Self-affine manifolds
• A heuristic approach for the generation of multivariate random samples with specified marginal distributions and correlation matrix
• Renewal theory in the analysis of tries and strings
• Quad-\(k\mathrm d\) trees: a general framework for \(k\mathrm d\) trees and quad trees
• Formulae and Asymptotics for Coefficients of Algebraic Functions
• Imbalance in random digital trees
• Bases of canonical number systems in quartic algebraic number fields
• A survey of some applications of finite fields
• A rigorous version of R. P. Brent's model for the binary Euclidean algorithm
• The dynamics of Pythagorean Triples
• Internal differential collision attacks on the reduced-round Grøstl-0 hash function
• The general two-level storage management problem: a reconsideration of the KTNS-rule
• Truncation of unitary operads
• Trees with exponentially growing costs
• Upper bounds for sorting integers on random access machines
• Computational arithmetic geometry. I: Sentences nearly in the polynomial hierarchy

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)