scientific article; zbMATH DE number 1052006
From MaRDI portal
Publication:4349924
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.
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)
Cited In (only showing first 100 items - show all)
- 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
- Algorithms for propositional model counting
- Rationality Problem for Algebraic Tori
- Scheduling with compressible and stochastic release dates
- Scheduling modular projects on a bottleneck resource
- Keyed hash function based on a chaotic map
- Polynomial evaluation and interpolation on special sets of points
- Computing mixed volume and all mixed cells in quermassintegral time
- Floating-point arithmetic on the test bench. How are verified numerical solutions calculated?
- Integer complexity: representing numbers of bounded defect
- Signed enumeration of upper-right corners in path shuffles
- Computation of maximal local (un)stable manifold patches by the parameterization method
- Carry propagation in signed digit representations
- On the variety of shapes in digital trees
- Statistical properties and implementation of aperiodic pseudorandom number generators
- Algorithm 960
- \(s\)-power series: an alternative to Poisson expansions for representing analytic functions
- Topological properties of two-dimensional number systems
- Singularity analysis, Hadamard products, and tree recurrences
- Analytic urns
- M-CASH: A real-time resource reclaiming algorithm for multiprocessor platforms
- The dual optimizer for the growth-optimal portfolio under transaction costs
- Combinatorics of non-ambiguous trees
- Normal numbers and pseudorandom generators
- Uniform point sets and the collision test
- Kazhdan-Lusztig cells and Robinson-Schensted correspondence.
- Limit theorems for patterns in phylogenetic trees
- A simple measure of conditional dependence
- Generating Functions and the Solutions of Full History Recurrence Equations
- Accurate quotient-difference algorithm: error analysis, improvements and applications
- Citius altius fortius: lessons learned from the theorem prover Waldmeister
- On the construction of a new generalization of Runge-Kutta methods
- Random numbers for parallel computers: requirements and methods, with emphasis on gpus
- An ultrafast cryptographically secure pseudorandom number generator
- Bitonic sorters of minimal depth
- Efficient data structures for sparse network representation
- Combinatorics of periods in strings.
- Permanental bounds for nonnegative matrices via decomposition
- Space complexity of abelian groups
- Generalized multiset theory
- Randomness of the square root of 2 and the giant leap. II
- Self-synchronizing stream ciphers and dynamical systems: state of the art and open issues
- Consistency of Markov chain quasi-Monte Carlo on continuous state spaces
- Hausdorff dimensions of perturbations of a conformal iterated function system via thermodynamic formalism
- On \(\alpha \)-greedy expansions of numbers
- Crystals and trees: quasi-Kashiwara operators, monoids of binary trees, and Robinson-Schensted-type correspondences
- The expected profile of digital search trees
- Relations between adjacency trees
- Exact, efficient, and complete arrangement computation for cubic curves
- Accurate evaluation of a polynomial and its derivative in Bernstein form
- Minimal redundant digit expansions in the Gaussian integers
- Backward error analysis of the extended iterative refinement or improvement algorithm for solving ill conditioned linear system
- Quantum mechanics and the principle of least radix economy
- Range minimum queries in minimal space
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)
