scientific article; zbMATH DE number 1052006

zbMATH Open0895.65001MaRDI QIDQ4349924FDOQ4349924

Authors: Donald E. Knuth 

Publication date: 26 August 1997

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

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.

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)

• Supernode Binary Search Trees
• 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
• Monte Carlo linear solvers with non-diagonal splitting
• The number of steps in the Robinson-Schensted algorithm
• 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
• Stable-matching Voronoi diagrams: combinatorial complexity and algorithms
• On fairness in polling systems
• 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
• 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
• Priority queues and sorting for read-only data
• Internal differential collision attacks on the reduced-round Grøstl-0 hash function
• A recursive local polynomial approximation method using Dirichlet clouds and radial basis functions
• The general two-level storage management problem: a reconsideration of the KTNS-rule
• Truncation of unitary operads
• On relative errors of floating-point operations: optimal bounds and applications
• Trees with exponentially growing costs
• Upper bounds for sorting integers on random access machines
• Computational arithmetic geometry. I: Sentences nearly in the polynomial hierarchy
• Reynolds stress transport modelling for steady and unsteady channel flows with wall injection
• Approximate \(k\)-closest-pairs in large high-dimensional data sets
• Fractal-like matrices
• Sampling exactly from the normal distribution
• Formulae and asymptotics for coefficients of algebraic functions
• Reasoning Algebraically About P-Solvable Loops
• Rigorous numerics for analytic solutions of differential equations: the radii polynomial approach
• Improved random graph isomorphism
• Spectrum and entropy of C-systems MIXMAX random number generator
• The sets of flattened partitions with forbidden patterns
• Speeding up the computations on an elliptic curve using addition-subtraction chains
• Separating OR, SUM, and XOR circuits
• 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
• On the mean-field limit of bosons with Coulomb two-body interaction
• An accurate updating formula to calculate sample variance from weighted successive differences
• Faster algorithms for single machine scheduling with release dates and rejection
• The combination technique and some generalisations
• Improved error bounds for floating-point products and Horner's scheme
• On the definition of unit roundoff
• The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.
• An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
• Digit systems over commutative rings
• Eulerian quasisymmetric functions
• Distributional analysis of swaps in quick select
• Extensions of smoothing via taut strings
• Maximum likelihood analysis of the Ford-Fulkerson method on special graphs
• Batcher's odd-even exchange revisited: a generating functions approach
• The Nekrasov-Okounkov hook length formula: refinement, elementary proof, extension and applications
• Parallel stochastic gradient algorithms for large-scale matrix completion
• 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
• On the maximum relative error when computing integer powers by iterated multiplications in floating-point arithmetic
• 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
• Efficient computer search of large-order multiple recursive pseudo-random number generators
• 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
• Minimum edge blocker dominating set problem
• Stowage planning for container ships: a heuristic algorithm to reduce the number of shifts
• Bounds for resultants of univariate and bivariate polynomials
• Simulation of stochastic demand data streams for network revenue management problems
• DYNAMICAL CHARACTERISTICS OF DISCRETIZED CHAOTIC PERMUTATIONS
• Extensions of Black-Scholes processes and Benford's law
• Left cells in type 𝐵_{𝑛} with unequal parameters
• Optimal conclusive sets for comparator networks
• Basic analytic combinatorics of directed lattice paths
• Intervals of balanced binary trees in the Tamari lattice

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)